Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-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.

Polar correction of a near-unitary matrix

Statement

Let U be unitary on a nonzero finite-dimensional complex inner-product space and let M be an endomorphism with ∥M−U∥≤ε≤1/8. Then M is invertible and its polar unitary Q=M(M∗M)−1/2 satisfies ∥Q−U∥≤2ε. The inverse square root is defined by the positive spectral square root. When M has effectively computable entries in fixed dimension, the inverse square root also has an effective matrix approximation: expand (I+X)−1/2 at X=M∗M−I, whose norm is less than 1/2, and truncate the absolutely convergent binomial series.

Facts & Assumptions

Given: A finite-dimensional space, a unitary U, and ∥M−U∥≤ε≤1/8.

Proof

1.1givenF2algebra

For every vector v, ∥Mv∥≥∥Uv∥−∥(M−U)v∥≥(1−ε)∥v∥. Thus M is injective and hence bijective in finite equal dimension. The eigenvalues of M∗M are σj2, where each singular value obeys 1−ε≤σj≤1+ε by the triangle inequality and [F2].

2.1F1step 1.1algebra∎

By [F1], define (M∗M)−1/2 by applying the positive scalar inverse-square-root to its positive eigenvalues. Then Q∗Q=I, so Q is unitary; moreover the singular-value decomposition, obtained by diagonalizing M∗M, gives ∥Q−M∥=max⁡j∣1−σj∣≤ε. Consequently ∥Q−U∥≤∥Q−M∥+∥M−U∥≤2ε. Finally, X=M∗M−I has norm at most 2ε+ε2≤17/64<1/2; the binomial series for (I+X)−1/2 converges absolutely in operator norm, and its geometric tail bound gives effective truncations from effective entries of M.

Depends on

Used by

Dependency tree · two levels

9 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