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.

$\dim_{F} M_{m \times n} (F) = m n$ and $\dim_{F} L (V, W) = (\dim_{F} V) (\dim_{F} W)$ for finite-dimensional $V, W$

Statement

For a field $F$ and naturals $m, n$ , $\dim_{F} M_{m \times n} (F) = m n$ . Consequently, for finite-dimensional $F$ -vector spaces $V, W$ ,

$\dim_{F} L (V, W) = (\dim_{F} V) (\dim_{F} W) .$

Facts & Assumptions

Given: A field $F$ , naturals $m, n$ , and finite-dimensional spaces $V, W$ with $\dim_{F} V = n$ and $\dim_{F} W = m$ .

[L1]

The matrix units $E_{i j}$ have one entry equal to $1$ and all other entries equal to $0$ (Matrix units $E_{i j}$ and the Kronecker delta).

[L2]

A Cartesian product of finite sets has cardinality equal to the product of their cardinalities (The product rule: $∣ A \times B ∣ = ∣ A ∣ ∣ B ∣$ , and $∣ \prod_{i < m} A_{i} ∣ = \prod_{i < m} ∣ A_{i} ∣$ ).

[L3]

Relative to ordered bases, matrix representation is a vector-space isomorphism $L (V, W) ≅ M_{m \times n} (F)$ ( $T \mapsto [T]_{B}^{C}$ is a vector-space isomorphism $L (V, W) ≅ M_{m \times n} (F)$ ).

Proof

technique · direct

1.1

Every matrix $A = (a_{i j})$ has the expansion $A = \sum_{(i, j) \in m \times n} a_{i j} E_{i j}$ , and a linear relation among the $E_{i j}$ has each coefficient zero when its corresponding entry is read. Thus the matrix units form a basis.

givenL1

2.1

By [L2], the index set $m \times n$ has cardinality $m n$ , so this basis has $m n$ elements; if either dimension is zero, it is the empty basis of the zero matrix space. Hence $\dim_{F} M_{m \times n} (F) = m n$ .

step 1.1L1L2

3.1

The isomorphism in [L3] transports a basis and preserves dimension; substituting $n = \dim_{F} V$ and $m = \dim_{F} W$ gives the second formula.

step 2.1L3∎

Depends on

Used by

A family of diagonalisable endomorphisms of a finite-dimensional space is simultaneously diagonalisable if and only if its members commute pairwise Theorem

Dependency tree · two levels

30 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

S. Axler, Linear Algebra Done Right, 4th ed., §3C, Dimension of matrix spaces (standard reference, not scraped)
S. Schiavone, MIT 18.700 Day 9, Corollary 27 (standard reference, not scraped)

dim⁡FMm×n(F)=mndimF​Mm×n​(F)=mn and dim⁡FL(V,W)=(dim⁡FV)(dim⁡FW)dimF​L(V,W)=(dimF​V)(dimF​W) for finite-dimensional V,WV,W