Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 2026-08-29
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.

On ΛnV, the induced map ΛnT is multiplication by det⁡T

Statement

Let T:V→V be an endomorphism of a finite-dimensional vector space of dimension n≥1. Then ΛnV is one-dimensional with basis e1∧⋯∧en for any ordered basis (e1,…,en), and

ΛnT=det⁡(T)⋅id⁡ΛnV.

For n=0, Λ0T=id⁡F=det⁡(T)⋅id⁡F by convention.

Facts & Assumptions

Given: An endomorphism T of an n-dimensional vector space V, n≥1, and an ordered basis B=(e1,…,en).

[L1]

The matrix of ΛnT in the top wedge basis has the single entry det⁡A[n],[n]=det⁡A (In basis-wedge coordinates, the matrix of ΛkT is the signed matrix of k-minors).

Proof

technique · direct
1.1L1

By [L1] with k=n, the wedge basis of ΛnV is the single vector e1∧⋯∧en, so ΛnV is one-dimensional and the matrix of ΛnT is the 1×1 matrix with entry det⁡A.

1.2L2

By [L2], that entry is det⁡(T).

2.1step 1.1step 1.2

Hence ΛnT(e1∧⋯∧en)=det⁡(T) (e1∧⋯∧en), and one-dimensionality makes ΛnT=det⁡(T)⋅id⁡.

3.1

For every decomposable top wedge v1∧⋯∧vn, one has v1∧⋯∧vn=c(e1∧⋯∧en) for a unique scalar c by step 1.1, so step 2.1 gives

ΛnT(v1∧⋯∧vn)=c ΛnT(e1∧⋯∧en)=det⁡(T) (v1∧⋯∧vn).

[step 1.1, step 2.1, algebra]

4.1step 2.1step 3.1∎

Steps 2.1 and 3.1 establish the claimed scalar action in positive dimension, and the conventions cover n=0.

Depends on

Used by

Dependency tree · two levels

7 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