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 detT

Statement

Let T:VV be an endomorphism of a finite-dimensional vector space of dimension n1. Then ΛnV is one-dimensional with basis e1en for any ordered basis (e1,,en), and

ΛnT=det(T)idΛnV.

For n=0, Λ0T=idF=det(T)idF by convention.

Facts & Assumptions

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

[L1]

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

Proof

technique · direct
1.1

By [L1] with k=n, the wedge basis of ΛnV is the single vector e1en, so ΛnV is one-dimensional and the matrix of ΛnT is the 1×1 matrix with entry detA.

L1
1.2

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

L2
2.1

Hence ΛnT(e1en)=det(T)(e1en), and one-dimensionality makes ΛnT=det(T)id.

step 1.1step 1.2
3.1

For every decomposable top wedge v1vn, one has v1vn=c(e1en) for a unique scalar c by step 1.1, so step 2.1 gives

ΛnT(v1vn)=cΛnT(e1en)=det(T)(v1vn).

[step 1.1, step 2.1, algebra]

4.1

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

step 2.1step 3.1

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