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.

If k>dim⁡V, then ΛkV=0

Statement

If V is finite-dimensional with dim⁡V=n and k>n, then ΛkV=0.

Facts & Assumptions

Given: A finite-dimensional vector space V with dim⁡V=n and a degree k>n.

[L1]
[L3]

In a finite-dimensional vector space, a decomposable wedge is nonzero exactly when its vectors are linearly independent (In a finite-dimensional vector space, a decomposable wedge is nonzero exactly when its vectors are linearly independent).

[L4]

The exterior power ΛkV is the quotient of V⊗k generated by decomposable wedges v1∧⋯∧vk (The kth exterior power as the tensor-power quotient by repeated-vector relations).

Proof

technique · direct
1.1L1L2algebra

If some k-tuple (v1,…,vk) in V were linearly independent, then its image set would be a linearly independent subset of V with k elements. That contradicts [L1] and [L2] because k>n. So every k-tuple in V is linearly dependent.

2.1L3step 1.1

By [L3], step 1.1 forces every decomposable wedge v1∧⋯∧vk to vanish.

3.1L4step 2.1

By [L4], every element of ΛkV is a linear combination of decomposable wedges, so step 2.1 forces every element of ΛkV to be zero.

4.1step 3.1∎

Hence ΛkV=0 whenever k>n.

Depends on

Used by

Dependency tree · two levels

23 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