Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedverified 2026-09-23 (gpt-6-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.

A2 coinvariant algebra and basic invariants

Example

Let S3 act by permuting coordinates on V={(x,y,z)∈C3:x+y+z=0}, the A2 reflection plane. Put e2=xy+xz+yz and e3=xyz restricted to V. Then C[V]S3=C[e2,e3],deg⁡e2=2,deg⁡e3=3. The coinvariant algebra has basis 1,x,y,x2,xy,x2y, Hilbert series 1+2t+2t2+t3, and dimension 6.

Facts & Assumptions

Given: The displayed permutation action and restricted elementary symmetric polynomials.

[F2]

Invariants, the positive invariant ideal, and Reynolds averaging use the conventions of Finite linear invariant and coinvariant polynomial algebras.

Verification

1.1given

Each transposition fixes a line in V and has eigenvalue −1 on the vector that subtracts its two exchanged coordinates. These transpositions generate S3. The action is faithful: a permutation fixing all coordinate differences fixes their labels and hence is identity. Eliminate z=−x−y to identify its polynomial algebra with C[x,y] and obtain e2=−(x2+xy+y2) and e3=−xy(x+y).

2.1F2step 1.1

We verify generation directly. Any invariant polynomial on the plane has a polynomial lift to C[x,y,z]; average its six permuted lifts. By F2 its restriction is unchanged and the resulting lift is symmetric. A symmetric homogeneous polynomial in three variables is a polynomial in e1=x+y+z,e2,e3: use lexicographic order x>y>z on its finitely many monomials of fixed total degree. A leading exponent triple (a,b,c) satisfies a≥b≥c, because swapping an out-of-order pair would produce a larger monomial with the same coefficient. The polynomial e1a−be2b−ce3c has leading monomial xaybzc with coefficient one. Subtract its required multiple and repeat; lexicographic order strictly decreases within a finite set. Sum over the finitely many homogeneous parts. Restricting e1=0 proves invariant generation by e2,e3.

3.1step 1.1step 2.1

These generators are algebraically independent without an appeal to a degree table. Their Jacobian determinant in (x,y) is (2x+y)(x+2y)(x−y), a nonzero polynomial. If a nonzero relation of least positive total degree H(e2,e3)=0 existed, differentiating it twice, once in each coordinate, and multiplying by the adjugate Jacobian matrix would give that determinant times each evaluated partial derivative of H is zero. The polynomial ring is a domain, so both evaluated derivatives vanish. In characteristic zero some partial derivative of a nonconstant H is nonzero and has lower degree, a contradiction; a nonzero constant cannot be a relation. Thus the stated invariant polynomial algebra has basic degrees two and three.

4.1F2step 2.1step 3.1

By 2.1 and 3.1, the positive invariant ideal in F2 generates (e2,e3) in C[x,y]. Put a=y2+xy+x2 and b=xy(x+y). The identity xa−b=x3 gives (a,b)=(a,x3). First quotient by x3: with A=C[x]/(x3), the remaining quotient is A[y]/(y2+xy+x2). Division by this monic polynomial in y has unique remainder u+vy with u,v∈A. Existence follows by canceling the highest power of y; uniqueness follows because a nonzero multiple of a monic degree-two polynomial has degree at least two, even over A. The unique representatives of elements of A have degrees at most two in x. Hence 1,x,x2,y,xy,x2y are independent and spanning, proving the asserted basis and Hilbert series by their degrees 0,1,2,1,2,3.

5.1step 4.1∎

The quotient dimension is therefore 6=∣S3∣, and the degree product is 2⋅3=6. The degree-zero class is nonzero, the top class x2y is nonzero by unique remainder, and all degrees above three vanish. This is an explicit calculation on the nonzero two-dimensional plane; there is no limiting parameter or choice assumption.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

2 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