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.

T[T]BCT\mapsto[T]_{\mathcal B}^{\mathcal C} is a vector-space isomorphism L(V,W)Mm×n(F)\mathcal L(V,W)\cong M_{m\times n}(F)

Statement

Let V,WV,W be finite-dimensional vector spaces over FF, with ordered bases B=(bj)j<n\mathcal B=(b_j)_{j<n} and C=(ci)i<m\mathcal C=(c_i)_{i<m}. The map

Φ:L(V,W)Mm×n(F),Φ(T)=[T]BC,\Phi:\mathcal L(V,W)\to M_{m\times n}(F),\qquad \Phi(T)=[T]_{\mathcal B}^{\mathcal C},

is a vector-space isomorphism.

Facts & Assumptions

Given: The finite-dimensional spaces and ordered bases in the Statement.

[L1]

L(V,W)\mathcal L(V,W) is a vector space under pointwise operations (L(V,W)\mathcal L(V,W) is a vector space over the common scalar field).

[L3]

A linear isomorphism is a linear map with a two-sided linear inverse (Invertible linear maps, linear isomorphisms, and inverse linear maps).

Proof

technique · direct
1.1

For every basis vector bjb_j, coordinate uniqueness in [L2] gives [(S+T)(bj)]C=[S(bj)]C+[T(bj)]C[(S+T)(b_j)]_{\mathcal C}=[S(b_j)]_{\mathcal C}+[T(b_j)]_{\mathcal C} and [(λT)(bj)]C=λ[T(bj)]C[(\lambda T)(b_j)]_{\mathcal C}=\lambda[T(b_j)]_{\mathcal C}, so Φ\Phi is linear column by column.

givenL1L2
2.1

If Φ(S)=Φ(T)\Phi(S)=\Phi(T), then [L2] gives S(bj)=T(bj)S(b_j)=T(b_j) for every jj; linearity and the unique expansion of every vector in B\mathcal B give S=TS=T, so Φ\Phi is injective.

step 1.1L1L2
3.1

Given A=(aij)Mm×n(F)A=(a_{ij})\in M_{m\times n}(F), prescribe T(bj):=i<maijciT(b_j):=\sum_{i<m}a_{ij}c_i and, for the unique expansion v=j<nxjbjv=\sum_{j<n}x_jb_j from [L2], define T(v):=j<nxjT(bj)T(v):=\sum_{j<n}x_jT(b_j). This is well defined and linear, and the jj-th matrix column is the jj-th column of AA; hence Φ(T)=A\Phi(T)=A. Together with steps 1.1 and 2.1, Φ\Phi is a linear bijection. Its set-theoretic inverse is linear: if A=Φ(S)A=\Phi(S) and B=Φ(T)B=\Phi(T), then injectivity and linearity give Φ1(A+B)=S+T\Phi^{-1}(A+B)=S+T and Φ1(λA)=λS\Phi^{-1}(\lambda A)=\lambda S. Thus Φ\Phi is a linear isomorphism by [L3].

step 1.1step 2.1L1L2L3
4.1

If n=0n=0, then VV is the zero space and both sides contain only their zero element; if m=0m=0, then WW and Mm×n(F)M_{m\times n}(F) are zero spaces and the only map is the zero map. Thus the construction also proves the isomorphism in every zero-dimensional case.

step 3.1L1L2L3

Depends on

Used by

Dependency tree · next 3 levels

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