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.
Statement
Let and be linear, with ordered bases of , of , and of . Then
Facts & Assumptions
Given: The composable linear maps and ordered bases in the Statement, and a vector .
A composite of linear maps is linear (Identity maps and composites of linear maps are linear).
Matrix multiplication is associative whenever the shapes are compatible (Matrix multiplication is associative, unital, distributive, and compatible with scalar multiplication).
Proof
Apply [L2] to and then to : .
Associativity from [L3] rewrites step 1.1 as for every .
Evaluating at each vector of makes a standard coordinate column, so the columns of equal those of the displayed product. Therefore the matrices are equal.
Depends on
- Identity maps and composites of linear maps are linear
- $[T(v)]_{\mathcal C}=[T]_{\mathcal B}^{\mathcal C}[v]_{\mathcal B}$
- $T\mapsto[T]_{\mathcal B}^{\mathcal C}$ is a vector-space isomorphism $\mathcal L(V,W)\cong M_{m\times n}(F)$
- Matrix multiplication is associative, unital, distributive, and compatible with scalar multiplication
Used by
- End_F(V) is a ring and matrix representation is a ring isomorphism End_F(V)≅ Mₙ(F) Corollary
- Chosen bases exhibit Mat_F as equivalent to finite-dimensional vector spaces Example
- The quarter-turn (x,y)↦(-y,x) on ℝ² has matrix beginpmatrix0&-11&0 endpmatrix and square -I₂ Example
- [T]_mathcal B'^mathcal C'=P_mathcal C'←mathcal C[T]_mathcal B^mathcal CP_mathcal B←mathcal B' Theorem
- [v]_mathcal C=P_mathcal C←mathcal B[v]_mathcal B and P_mathcal B←mathcal C=P_mathcal C←mathcal B⁻¹ Theorem
- A square matrix is invertible exactly when its multiplication map is a linear isomorphism; matrices preserve inverses of linear isomorphisms Theorem
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
- S. Axler, Linear Algebra Done Right, 4th ed., §3C, Definition 3.43 and Theorem 3.81 (standard reference, not scraped)
- S. Schiavone, MIT 18.700 Day 9, Theorem 35 (standard reference, not scraped)