Resolvent comparison for Hermitian block matrices and Kelmans transformations

A Kelmans transformation increases or preserves the largest eigenvalue of a symmetric nonnegative matrix. We determine when this comparison holds for Hermitian block extensions with a fixed coupling and an arbitrary common complementary block. An orthogonal change of basis and Schur complementation give an exact formula for the compressed resolvent difference as a difference of two rank-one matrices. This formula characterizes admissible coupling subspaces by proportionality of projected resolvent vectors. Polynomial coefficient kernels describe all such subspaces, and cyclic subspaces give dimension bounds and a maximum-dimension result for a two-block family. We also prove a general block comparison theorem and give monotonicity and equality criteria for nonnegative rank-one couplings. Applications concern graph joins, complex attachments, and Hermitian adjacency matrices.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-03
DOI
https://doi.org/10.48550/arxiv.2611.04688
Primary Topic
Matrix Theory and Algorithms
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

Resolvent comparison for Hermitian block matrices and Kelmans transformations

Xianhao Meng, Zhiyuan Zhang, Zhijun Xu
arXiv (Cornell University)
Matrix Theory and Algorithms
preprint

Resolvent comparison for Hermitian block matrices and Kelmans transformations

Xianhao Meng, Zhiyuan Zhang, Zhijun Xu
preprint en

Abstract

A Kelmans transformation increases or preserves the largest eigenvalue of a symmetric nonnegative matrix. We determine when this comparison holds for Hermitian block extensions with a fixed coupling and an arbitrary common complementary block. An orthogonal change of basis and Schur complementation give an exact formula for the compressed resolvent difference as a difference of two rank-one matrices. This formula characterizes admissible coupling subspaces by proportionality of projected resolvent vectors. Polynomial coefficient kernels describe all such subspaces, and cyclic subspaces give dimension bounds and a maximum-dimension result for a two-block family. We also prove a general block comparison theorem and give monotonicity and equality criteria for nonnegative rank-one couplings. Applications concern graph joins, complex attachments, and Hermitian adjacency matrices.

arXiv (Cornell University)
Matrix Theory and Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon