Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16
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.

Formally, (IxA)1=n0Anxn over every commutative coefficient ring

Statement

Let R be a commutative ring, let pN, and let AMp(R). In the matrix ring Mp(Rx),

(IpxA)1=n0Anxn.

The matrix series is defined entrywise. The identity is formal, including p=0, and uses no norm, convergence, or spectral-radius hypothesis.

Facts & Assumptions

Given: A commutative ring R, a size pN, and a matrix AMp(R).

[L1]

Formal series are coefficient functions with Cauchy product [xn](fg)=i=0n[xi]f[xni]g (Formal power series over a commutative ring and the coefficient-extraction functional [xn]).

[L2]

Cauchy multiplication makes Rx a commutative ring containing R[x] (Cauchy multiplication makes Rx a commutative ring containing R[x] as the finitely supported subring).

[L3]

Matrix products use finite row-column sums and Ip is the identity matrix (Entrywise ring-matrix operations, rectangular matrix products, identity matrices and transpose).

[L4]

Matrix multiplication is associative and distributive, including zero-sized shapes (Matrix arithmetic over a commutative ring is associative, unital and distributive, and transpose reverses products).

Proof

technique · direct
1.1

Define S=n0Anxn entrywise. The constant coefficient of (IpxA)S is Ip, and for every n1 its coefficient is AnAAn1=0.

givenL1L2L3L4
1.2

The same coefficient calculation on the other side gives the constant coefficient Ip and positive coefficient AnAn1A=0 for S(IpxA).

givenL1L2L3L4
2.1

Coefficient extensionality makes both products equal to Ip, so S is the two-sided inverse of IpxA. For p=0 all matrices are the unique empty matrix and the same identity holds.

step 1.1step 1.2L1

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 30 results over 11 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources