Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-5.6-terra)audited 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.

The kth exterior power as the tensor-power quotient by repeated-vector relations

Definition

Let V be a vector space over a field F and let k≥0. The k-fold tensor power is V⊗0=F, V⊗1=V, and for k≥2 the iterated tensor product of k copies of V under any parenthesization. By Finite iterated tensor products represent multilinear maps independently of parenthesization every parenthesization represents the k-linear maps out of Vk, and different parenthesizations are joined by the unique isomorphism preserving pure tensors, so V⊗k is determined up to that isomorphism.

Let Wk⊆V⊗k be the subspace spanned by all pure tensors v1⊗⋯⊗vk for which vi=vj for some pair 1≤i<j≤k (so W0=W1=0). The kth exterior power of V is the quotient vector space

ΛkV:=V⊗k/Wk,

and the basic wedge map is

∧:Vk⟶ΛkV,(v1,…,vk)⟼v1⊗⋯⊗vk+Wk.

Remarks

The construction never divides by k!, so ΛkV is defined in every characteristic. Its relation to the Alternating k-linear maps maps is the universal property of Exterior powers represent alternating multilinear maps and are unique up to unique isomorphism; the convention fixed here is that a repeated entry makes the wedge zero.

Depends on

Used by

Dependency tree · two levels

6 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