Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck 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.

The rank of a matrix equals the rank of the linear map x↦Ax

Statement

For A∈Mm×n(F), the matrix rank of A equals the rank of the linear map LA:Fn→Fm defined by LA(x)=Ax.

Facts & Assumptions

Given: A matrix A∈Mm×n(F) and its associated linear map LA.

[L1]

Matrix rank is row rank, which equals column rank (Row space, column space, nullspace, row rank, column rank and matrix rank).

[L3]

The rank of a linear map is the dimension of its image (Rank and nullity of a linear map with finite-dimensional domain).

[L4]

Matrix multiplication is given entrywise by (Ax)i=∑j<naijxj (Rectangular matrix multiplication and the identity matrix In, including zero-sized shapes).

[L5]

Matrix multiplication distributes over addition and is compatible with scalar multiplication (Matrix multiplication is associative, unital, distributive, and compatible with scalar multiplication).

Proof

technique · direct
1.1

Fact [L5] shows that LA(x)=Ax is linear. By [L4], every value Ax is a linear combination of the columns of A, with coefficients xj, and every such combination is Ax for that coefficient column. Hence im⁡LA=Col⁡(A).

L4L5algebra
2.1

Taking dimensions and using [L1]–[L3] gives rank⁡LA=dim⁡Col⁡(A)=rank⁡A.

step 1.1L1L2L3∎

Depends on

Used by

Dependency tree · two levels

21 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources