Keyboard shortcuts

Press ← or → to navigate between chapters

Press ? to show this help

Press Esc to hide this help

Metadata
bibkey: czerwinska2026radial
authors: M. M. Czerwińska; J. A. Franco; A. Merino
year: 2026
title: "Towards a Characterization of Matrix Monotonicity via Radial Convexity"
doi: 10.48550/arXiv.2610.17393
url: https://arxiv.org/abs/2610.17393
claim: "Let f : (0, ∞) → R. Then f is radially convex of order n (with respect to the Frobenius norm) if and only if f is matrix monotone of degree n."
strata_touched:
  - D5/S3/Quantum/Matrix/RadialConvexity
  - D5/S3/Quantum/Matrix/CzerwinskaFrancoMerinoCounterexample
license: citation-only
triage: anchor

Locator

Author text: https://arxiv.org/abs/2610.17393.

DOI: https://doi.org/10.48550/arXiv.2610.17393.

M. M. Czerwińska, J. A. Franco and A. Merino, Towards a Characterization of Matrix Monotonicity via Radial Convexity, arXiv:2610.17393v1, Definitions 1.1 and 2.15, §2 functional calculus, and §4, Conjecture 4.10.

Conjecture and definitions

Conjecture 4.10 reads:

Let f : (0, ∞) → R. Then f is radially convex of order n (with respect to the Frobenius norm) if and only if f is matrix monotone of degree n.

arXiv:2610.17393v1, §4, directly after Conjecture 4.10, verbatim:

By Proposition 3.9, matrix monotonicity of degree n implies radial convexity of order n. Thus, it remains to prove the converse implication. The next theorem establishes the conjecture for n = 2.

arXiv:2610.17393v1, §1, verbatim:

In degree 3, we show that radial convexity already provides the principal minor conditions required for matrix monotonicity, leaving the sign of the determinant of the Loewner matrix as the remaining obstruction.

For positive definite complex Hermitian matrices, means that is positive semidefinite. Radial convexity requires, for every in that cone,

Matrix monotonicity permits either a uniformly increasing or a uniformly decreasing Loewner direction. The functional calculus is spectral calculus; extending the real scalar function away from does not affect its values on the positive cone. The companion definitions use Mathlib’s continuous functional calculus and the Euclidean norm of all entries as the Frobenius norm.

Repository-derived construction

Set and

The order-preserving Cayley map takes the positive cone into . In these coordinates,

For in the Cayley interval and , each endpoint admits a factorization

The lower factor is . The upper factor is . These formulas allow singular .

In dimension three let , and let be their elementary symmetric functions. With , set

At every spectral node,

The bounds , give squared coefficient sums at most and . Spectral interpolation proves these matrix identities even when eigenvalues coincide. Consequently the two mixed weighted quadratic forms are bounded by times the sum of the three unmixed forms.

Since , the endpoint factorizations imply

Here . Trace cyclicity makes self-adjoint for the Frobenius pairing. Along each ordered segment, differentiating the squared endpoint distance therefore has the required sign. The real mean-value monotonicity theorem yields both radial inequalities over the entire Cayley interval, and the Cayley map transports them to the entire positive cone.

Exact finite obstruction

Let

Both matrices are positive definite, and for . Exact inversion gives

Thus this same ordered pair excludes both possible monotonicity directions. The certificate uses explicit rational inverse tables; no approximate eigenvalue computation is needed.

Scope

The paper’s Proposition 3.9 supplies the forward implication from matrix monotonicity to radial convexity. Its Theorem 4.11 treats the differentiable order-two converse. Those literature results are contextual and are not reproved by the companion counterexample.

Direct sums of the finite certificate establish failure of matrix monotonicity in every degree at least three. This observation alone does not establish radial convexity in those larger dimensions: the three-node estimate is dimension dependent. Failure of the equivalence in every order at least three and a characterization of radial convexity require further arguments.

ASSUMED-UNVERIFIED

The supplied preregistration identifies issue #19013 and arXiv:2610.17393v1 as the source. No additional online literature search or worldwide priority claim is established by this offline implementation. The higher-dimensional direct-sum observation is not a theorem in the companion Lean modules.