Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04
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.

Finite-dimensional vector spaces are rigid

Statement

For any field k, every finite-dimensional k-vector space is rigid in the monoidal category Vectk.

Facts & Assumptions

Given: A finite-dimensional k-vector space V.

[L1]

The category Vectk is monoidal under k (Modules over a commutative ring form a monoidal category).

[L2]

If (v1,,vn) is a basis of V, then the dual family (v1,,vn) is a basis of V and satisfies vi(vj)=δij (The dual family of a finite basis is a basis of the dual space, with the same dimension).

Proof

technique · direct
1.1

By [L3], choose a basis (v1,,vn) of V. Let (v1,,vn) be the dual basis from [L2], and define ev:VVk,fvf(v), coev:kVV,1i=1nvivi.

givenL2L3construct
2.1

For each basis vector vj, the first zig-zag sends vj to i=1nvi(vj)vi=i=1nδijvi=vj. By linearity it is the identity on V.

step 1.1L2algebra
2.2

For each dual basis vector vj, the second zig-zag sends vj to i=1nvj(vi)vi=i=1nδjivi=vj. By linearity it is the identity on V.

step 1.1L2algebra
3.1

Thus V is a left dual of V. The same formulas, read in the mirrored order, make V a right dual of V as well, so V is rigid. Since V was arbitrary and [L1] supplies the monoidal structure, every finite-dimensional object of Vectk is rigid.

step 2.1step 2.2L1

Depends on

Used by

Dependency tree · two levels

29 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