Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedjudge pass (gpt-6.1-sol)
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 exterior square of the permutation FI-module has character polynomial (X12)−X2

Example

Let V=M(1) be the permutation FI-module of The permutation FI-module has character polynomial X1, so VS is the free k-module on S and V(f) is the linear extension of f, and define WS:=Λ2VS with W(f):=Λ2V(f) (The kth exterior power as the tensor-power quotient by repeated-vector relations, The induced map ΛkT on exterior powers). Then W is an FI-module (The category FI and FI-modules over a commutative ring) with Wn≅Λ2(kn) as an Sn-module, and its character is the character polynomial

(X12)−X2

of weighted degree 2 (Character polynomials in the cycle counts Xi): for every n≥0 and every σ∈Sn the trace of σ on Wn equals (X1(σ)2)−X2(σ), where X1(σ) is the number of fixed points and X2(σ) the number of 2-cycles (Support, fixed points, disjoint cycles, cycle length, disjoint-cycle decompositions, and cycle type). No choice principle is used.

The displayed integer-valued expression is first evaluated on the integer cycle counts and then mapped to k by Z→k. This convention also covers positive characteristic; rational polynomial coefficients are not reduced individually when their denominators vanish in k.

Facts & Assumptions

Given: A field k; the permutation FI-module V with VS=k(S) and basis {es:s∈S}; and WS=Λ2VS with W(f)=Λ2V(f).

[F1]

V is an FI-module: V(idS)=id and V(g∘f)=V(g)V(f); V≅M(1) and Vn≅kn is the permutation representation of Sn (The category FI and FI-modules over a commutative ring, The permutation FI-module has character polynomial X1).

[F2]

For a linear map T ⁣:V→W, the exterior square Λ2T is induced by T⊗T on V⊗V and satisfies Λ2(g∘f)=Λ2(g)∘Λ2(f) and Λ2(id)=id; Λ2 is the quotient of V⊗2 by the span of the tensors v⊗v (The induced map ΛkT on exterior powers, The kth exterior power as the tensor-power quotient by repeated-vector relations).

[F3]

If F is a finite free R-module with ordered basis e1,…,er, the wedges ei∧ej with i<j form an R-basis of the degree-two part ⋀2F of the exterior algebra, which is the same quotient as Λ2F (Exterior Algebra Of A Finite Free Module, Exterior Algebra Basis Monomials, The kth exterior power as the tensor-power quotient by repeated-vector relations).

[F4]

X1(σ) is the number c1(σ) of fixed points of σ and, more generally, Xr(σ)=cr(σ) is the number of r-element orbits; a partition of {i,j} into orbits of σ is either two 1-cycles or one 2-cycle (Character polynomials in the cycle counts Xi, Support, fixed points, disjoint cycles, cycle length, disjoint-cycle decompositions, and cycle type).

[F5]

For a square matrix, the trace is the sum of the diagonal entries (The trace tr⁡(A) as the sum of the diagonal entries); the polynomial (X12)−X2∈Q[X1,X2] has weighted degree 2.

Verification

technique · direct
1.1F1F2

W is a functor: W(idS)=Λ2(idVS)=idWS and W(g∘f)=Λ2(V(g)V(f))=Λ2V(g)∘Λ2V(f)=W(g)W(f), using that V satisfies the functor axioms [F1] and that Λ2 preserves identities and composites [F2]; hence W is an FI-module with values WS=Λ2VS, and for S=[n] this is Wn=Λ2(kn) with the action induced by the permutation action of Sn on kn.

1.2F3F4givenalgebra

Fix n and σ∈Sn. By [F3], applied to the free module Vn with basis e0,…,en−1, the elements ei∧ej with i<j form a k-basis of Wn; and σ⋅(ei∧ej)=eσ(i)∧eσ(j). Hence the diagonal entry of the matrix of σ at the basis element ei∧ej is the coefficient of ei∧ej in eσ(i)∧eσ(j), which can be nonzero only when {σ(i),σ(j)}={i,j}. In that case σ restricts to a bijection of the two-element set {i,j}: it is either the identity, giving coefficient +1, or the transposition ( i j ), giving ej∧ei=−ei∧ej and coefficient −1. There is no other possibility, so the diagonal entry is +1 exactly for the unordered pairs of distinct fixed points of σ, is −1 exactly for the 2-cycles of σ, and is 0 otherwise.

2.1F4F5step 1.2

By [F5] the trace of σ on Wn is the sum of the diagonal entries computed in step 1.2, namely the number (X1(σ)2) of unordered pairs of distinct fixed points minus the number X2(σ) of 2-cycles: tr⁡(σ;Wn)=(X1(σ)2)−X2(σ). For n=0 and n=1 the module Wn is 0 and both sides are 0, since then X1(σ)≤1. This holds for every n, and (X12)−X2 is a character polynomial of weighted degree 2, so the trace function of W is given by that character polynomial.

3.1step 1.1step 1.2step 2.1∎

Steps 1.1, 1.2 and 2.1 show that W=Λ2V is an FI-module with Wn≅Λ2(kn) whose character is the weighted-degree-two character polynomial (X12)−X2.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

37 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