Alphabeta Math
PropositionStatement: AI-adaptedProof: AI-generatedSession-authored (Fable 5 assisted)precheck passaudited 2026-08-11
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.

For a field, the ring-matrix operations, invertibility and similarity agree exactly with the established field-matrix interface

Statement

Let FF be a field. Viewing FF as a commutative ring, the ring-valued matrix set, addition, multiplication, identity, transpose, invertibility, inverse and similarity defined here are exactly the corresponding established field-matrix notions.

Facts & Assumptions

Given: A field FF regarded as a commutative ring.

[L1]

A ring-valued m×nm\times n matrix is a function m×nFm\times n\to F (Finite rectangular matrices over a commutative ring, their entries, rows and columns).

[L2]

Ring-matrix operations, products, identities and transpose use the entrywise finite-sum formulas (Entrywise ring-matrix operations, rectangular matrix products, identity matrices and transpose).

[L4]
[L5]

Field-matrix transpose interchanges the same entries (The transpose ATA^{\mathsf T} of a matrix).

[L7]

Ring-matrix invertibility and similarity are defined by AB=BA=IAB=BA=I and B=P1APB=P^{-1}AP (Invertible square matrices and similarity over a commutative ring).

[L8]

Field-matrix invertibility uses the same two-sided inverse equations (Invertible matrices and the general linear group GLn(F)\operatorname{GL}_n(F)).

[L9]

Field-matrix similarity uses the same conjugation equation (Similar matrices: B=P1APB=P^{-1}AP for an invertible PP).

Proof

technique · direct
1.1

By [L1], [L3] and [L6], both matrix carriers are the same function set. The formulas in [L2], [L4] and [L5] agree entry for entry, including empty sums and zero-sized shapes.

L1L2L3L4L5L6
2.1

Since the products and identities agree, the two-sided inverse equations in [L7] and [L8] select the same matrices and the same unique inverses; then the conjugation formulas in [L7] and [L9] select the same similar pairs.

step 1.1L7L8L9

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 60 results over 19 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