Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedSession-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.

[ST]BD=[S]CD[T]BC[S\circ T]_{\mathcal B}^{\mathcal D}=[S]_{\mathcal C}^{\mathcal D}[T]_{\mathcal B}^{\mathcal C}

Statement

Let T:UVT:U\to V and S:VWS:V\to W be linear, with ordered bases B\mathcal B of UU, C\mathcal C of VV, and D\mathcal D of WW. Then

[ST]BD=[S]CD[T]BC.[S\circ T]_{\mathcal B}^{\mathcal D}=[S]_{\mathcal C}^{\mathcal D}[T]_{\mathcal B}^{\mathcal C}.

Facts & Assumptions

Given: The composable linear maps and ordered bases in the Statement, and a vector uUu\in U.

[L1]

A composite of linear maps is linear (Identity maps and composites of linear maps are linear).

[L2]

Coordinate action gives [R(x)]Y=[R]XY[x]X[R(x)]_{\mathcal Y}=[R]_{\mathcal X}^{\mathcal Y}[x]_{\mathcal X} ([T(v)]C=[T]BC[v]B[T(v)]_{\mathcal C}=[T]_{\mathcal B}^{\mathcal C}[v]_{\mathcal B}).

[L3]

Matrix multiplication is associative whenever the shapes are compatible (Matrix multiplication is associative, unital, distributive, and compatible with scalar multiplication).

Proof

technique · direct
1.1

Apply [L2] to TT and then to SS: [S(T(u))]D=[S]CD[T(u)]C=[S]CD[T]BC[u]B[S(T(u))]_{\mathcal D}=[S]_{\mathcal C}^{\mathcal D}[T(u)]_{\mathcal C}=[S]_{\mathcal C}^{\mathcal D}[T]_{\mathcal B}^{\mathcal C}[u]_{\mathcal B}.

givenL1L2
2.1

Associativity from [L3] rewrites step 1.1 as [S(T(u))]D=([S]CD[T]BC)[u]B[S(T(u))]_{\mathcal D}=([S]_{\mathcal C}^{\mathcal D}[T]_{\mathcal B}^{\mathcal C})[u]_{\mathcal B} for every uu.

step 1.1L2L3
3.1

Evaluating at each vector of B\mathcal B makes [u]B[u]_{\mathcal B} a standard coordinate column, so the columns of [ST]BD[S\circ T]_{\mathcal B}^{\mathcal D} equal those of the displayed product. Therefore the matrices are equal.

step 2.1L1L2L3

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 33 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