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.

A finite matrix within unit distance of the identity is invertible

Statement

If n≥1, X∈Cn×n, and ∥X∥2<1, then I+X is invertible.

Facts & Assumptions

Given: n≥1, a complex matrix X∈Cn×n, and q=∥X∥2<1.

[F1]

The operator norm is submultiplicative and satisfies ||T^*T|| = ||T||^2: ∥YZ∥2≤∥Y∥2∥Z∥2 for compatible matrices.

[F2]

The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||: ∥M∥2=max⁡∥v∥2=1∥Mv∥2.

Proof

1.1givenF1algebra

By induction using [F1], ∥Xk∥2≤qk for every k≥0. For N≥0, set SN=∑k=0N(−X)k. If M>N, the geometric sum bound gives ∥SM−SN∥2≤∑k=N+1Mqk≤qN+1/(1−q), so (SN) is Cauchy.

2.1step 1.1F2algebra

For each entry, ∣(SM−SN)ij∣≤∥(SM−SN)ej∥2≤∥SM−SN∥2 by [F2]; hence every entry converges to a finite limit. Let S be the matrix of those limits. For any matrix Y and unit vector x, put c=max⁡ij∣Yij∣ and aj=∣xj∣. Then ∣(Yx)i∣≤c∑jaj. The identity n∑jaj2−(∑jaj)2=∑j<k(aj−ak)2≥0 gives ∑jaj≤n, so each coordinate of Yx has magnitude at most cn. Summing the n coordinate squares gives ∥Yx∥2≤nc, and [F2] gives ∥Y∥2≤nmax⁡ij∣Yij∣. Entrywise convergence of SN to S now implies ∥SN−S∥2→0.

3.1step 1.1step 2.1F1algebra∎

Finite multiplication gives (I+X)SN=SN(I+X)=I−(−X)N+1. By step 1.1, ∥XN+1∥2≤qN+1→0. Submultiplicativity [F1] makes multiplication by I+X continuous, so taking limits using step 2.1 yields (I+X)S=S(I+X)=I. Hence S is a two-sided inverse.

Depends on

Used by

Dependency tree · two levels

5 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