Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pending
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

The finite positive square root preserves operator order

Statement

If A,B are nonnegative endomorphisms of a nonzero finite-dimensional complex inner-product space and A⪯B, then their nonnegative square roots satisfy A1/2⪯B1/2.

Facts & Assumptions

Given: Nonnegative A,B on a nonzero finite-dimensional complex inner-product space with A⪯B.

[F1]

Non-negative and positive operators: A⪯B means B−A is nonnegative, and positive definite operators have positive quadratic form on nonzero vectors.

[F3]

A non-negative operator has a unique non-negative square root: the nonnegative square root is defined spectrally with eigenvalues λ.

[F4]

Continuity and derivatives of positive-base real powers and The second fundamental theorem: if G is differentiable on [a,b] with G′=f and f is integrable, then ∫abf=G(b)−G(a): the positive powers s1/2 and s−1/2 have their ordinary derivatives, and a continuous derivative integrates to its endpoint difference on each compact positive interval.

[F6]

Monotone change of variable for Riemann-integrable functions: a differentiable monotone change of variable transforms a Riemann integral by its derivative.

[F7]

The adjoint T∗:W→V is characterised by ⟨Tv,w⟩W=⟨v,T∗w⟩V and Adjoints satisfy (S+T)∗=S∗+T∗, (λT)∗=λ‾T∗, (ST)∗=T∗S∗, and T∗∗=T: adjoints satisfy the inner-product identity and reverse products, so a congruence by a self-adjoint endomorphism is self-adjoint and preserves nonnegativity by its quadratic-form calculation.

[F8]

If f≤g on [a,b] and both are integrable then ∫abf≤∫abg; and m(b−a)≤∫abf≤M(b−a): pointwise inequalities between integrable functions on a compact interval imply the same inequality for their integrals.

[F9]

A monotone sequence converges if and only if it is bounded: every bounded monotone sequence of real numbers converges.

[F10]

A continuous function on [a,b] is Riemann integrable, by Heine-Cantor and Riemann's criterion: a continuous real function on a compact interval is Riemann integrable.

Proof

1.1F1F2F3F7givenalgebra

First suppose P,Q are positive definite and P⪯Q. By [F2], their eigenvalues are strictly positive: applying the positive quadratic form to an eigenvector gives λ∥v∥2>0. Define P−1/2 spectrally by replacing each eigenvalue λ with λ−1/2, and set P−1:=(P−1/2)2; multiplication in the eigenbasis shows these are the inverse square root and inverse of P. Put C:=P−1/2QP−1/2. By the adjoint product rule in [F7], C is self-adjoint, and [F7] gives ⟨v,Cv⟩=⟨P−1/2v,QP−1/2v⟩>0 for v≠0, so C is positive definite. Also C−I=P−1/2(Q−P)P−1/2⪰0 by the same quadratic-form identity and [F1]. Hence every eigenvalue μ of C is at least one by [F2]; define C−1 spectrally by reciprocating its positive eigenvalues, giving C−1⪯I. Since Q=P1/2CP1/2, multiplying this factorization by P−1/2C−1P−1/2 on either side gives the identity, so Q−1=P−1/2C−1P−1/2. Congruence of C−1⪯I by P−1/2 now yields Q−1⪯P−1.

2.1F1step 1.1algebra

For t>0 and nonzero v, ⟨v,(A+tI)v⟩≥t∥v∥2>0, and likewise for B, so A+tI and B+tI are positive definite and ordered. Step 1.1 gives (A+tI)−1⪰(B+tI)−1. Multiplying the order by t and subtracting from I yields A(A+tI)−1=I−t(A+tI)−1⪯I−t(B+tI)−1=B(B+tI)−1.

3.1F2F3F4F5F6F8F9F10step 2.1algebra∎

Set f(s)=s−1/2/(1+s) for s>0. It is continuous, hence integrable on every compact interval in its domain by [F10]. For 0<s≤1, f(s)≤s−1/2; for s≥1, f(s)≤s−3/2. For each integer k≥1, the sequence ak=∫1/k1f(s) ds is nondecreasing by positivity and additivity, and is bounded above by ∫1/k1s−1/2ds=2(1−k−1/2)≤2. For k>1 this evaluation follows from the primitive 2s, whose derivative is s−1/2 by [F4], and the fundamental theorem in [F4]; for k=1 both sides are zero by the equal-endpoint convention in [F5]. The sequence bk=∫1kf(s) ds is likewise nondecreasing and bounded above by ∫1ks−3/2ds=2(1−k−1/2)≤2, using the primitive −2s−1/2 and [F4] when k>1, and [F5] when k=1. Both sequences therefore converge by [F9]. By additivity [F5], ck:=∫1/kkf(s) ds=ak+bk converges to a finite c. For every k≥2, monotonicity [F8] and f(s)≥1/(32) on [1,2] give ck≥∫12f(s) ds≥1/(32), so c>0. For each fixed λ>0, define ck,λ:=∫1/(kλ)k/λf(s) ds. If m≥2 is fixed and k is large enough that 1/(kλ)≤1/m and k/λ≥m, additivity and monotonicity of the integral with the two displayed tail bounds give cm≤ck,λ=cm+∫1/(kλ)1/mf(s) ds+∫mk/λf(s) ds≤cm+2(m−1/2−(kλ)−1/2)+2(m−1/2−(λ/k)1/2)≤cm+4m. Since cm→c and 4/m→0, this proves ck,λ→c for each fixed λ>0. Now [F6] with t=λs in the coefficient integral over the fixed interval [1/k,k] gives ∫1/kkt−1/2λλ+t dt=λ ck,λ⟶cλ; for λ=0 the coefficient is identically zero. For a nonnegative X, let Pλ be its spectral projection at eigenvalue λ and define Jk(X):=∑λ∈spec⁡(X)(∫1/kkt−1/2λλ+t dt)Pλ. The coefficient depends only on λ, so this definition is independent of choices of eigenvectors within eigenspaces. The coefficient convergence and finite spectral sum imply ⟨v,Jk(X)v⟩→c⟨v,X1/2v⟩ for every vector v. For k≥2, this quadratic form is also the integral of the continuous scalar function t↦⟨v,t−1/2X(X+tI)−1v⟩ on [1/k,k], as follows from the finite spectral sum. By step 2.1 these functions for X=A and X=B are pointwise ordered; [F8] therefore gives ⟨v,Jk(A)v⟩≤⟨v,Jk(B)v⟩. Taking limits and using c>0 yields ⟨v,A1/2v⟩≤⟨v,B1/2v⟩ for every v, which is A1/2⪯B1/2.

Depends on

Used by

Dependency tree · two levels

68 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources