Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedPipeline-generatedjudge pass (gpt-6-luna)
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.

Inverse compression for positive resolvents

Statement

Let H,K be finite-dimensional complex inner-product spaces, let T:K→K be positive definite, and let V:H→K satisfy V∗V=IH. For every s≥0,

V∗(T+sIK)−1V⪰(V∗TV+sIH)−1,

where A⪰B means that A−B is non-negative. If H={0}, both sides are the unique endomorphism of H.

Facts & Assumptions

Given: The spaces H,K, the positive definite operator T, the isometry V, and s≥0 in the Statement.

[F1]

Real and complex inner-product spaces and their induced length: the inner product is linear in its first argument, conjugate-linear in its second, and positive definite.

[F3]

Non-negative and positive operators: positive definiteness means self-adjointness and strictly positive quadratic form on nonzero vectors.

[F5]

Every linear map between finite-dimensional inner product spaces has a unique adjoint: every linear map between finite-dimensional inner-product spaces has a unique linear adjoint, including zero-dimensional spaces.

Proof

1.1givenF5F1F2F3algebra

All adjoints of the finite-dimensional linear maps used below exist uniquely by [F5]. Let C be positive definite on a finite-dimensional space and y any vector. The operator C is injective by [F3], hence invertible in finite dimension; put z0=C−1y. Expanding with [F1]–[F2] gives 2Re⁡⟨y,z⟩−⟨Cz,z⟩=⟨C−1y,y⟩−⟨C(z−z0),z−z0⟩. The last term is nonnegative by [F3] and vanishes at z=z0, so ⟨C−1y,y⟩=max⁡z{2Re⁡⟨y,z⟩−⟨Cz,z⟩}.

2.1givenF2F3F4step 1.1algebra∎

If H={0} the assertion is immediate. Otherwise fix x∈H, put C=T+sIK and y=Vx. By [F2] and V∗V=IH, V∗CV=V∗TV+sIH, which is positive definite. Restrict the maximum in step 1.1 to z=Vw; the isometry identity gives ⟨Vx,Vw⟩=⟨x,w⟩ and ⟨CVw,Vw⟩=⟨(V∗TV+sIH)w,w⟩. Hence ⟨(T+sIK)−1Vx,Vx⟩≥⟨(V∗TV+sIH)−1x,x⟩. This holds for every x, so the self-adjoint operator difference is non-negative by [F4], proving the order inequality.

Depends on

Used by

Dependency tree · two levels

16 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