Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedprecheck pass
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 finite dual of the primitive polynomial Hopf algebra

Example

Let k be algebraically closed and let A=k[x] have the primitive Hopf structure Δ(x)=1⊗x+x⊗1, ε(x)=0, S(x)=−x. For a∈k, define δa,r(f) to be the coefficient of (x−a)r in f(x). Then

A∘=⨁a∈kspan⁡k{δa,r:r≥0},Δ∘δa,r=∑i+j=rδa,i⊗δa,j,δa,r∗δb,s=(r+sr)δa+b,r+s,S∘δa,r=(−1)rδ−a,r.

The unit is δ0,0, and ε∘(δa,r)=1 if r=0, 0 otherwise.

Verification

Given: An algebraically closed field k, the polynomial algebra A=k[x], and its primitive Hopf structure from the planned HH-4 construction.

[F1] An algebraically closed field: every nonconstant polynomial has a root in the field: every nonconstant polynomial over k has a root in k.

[F2] Division by a monic polynomial over a commutative ring: division by a monic polynomial gives a unique remainder of smaller degree; in particular k[x]/((x−a)m) has basis 1,(x−a),…,(x−a)m−1.

[F3] Chinese remainder theorem for pairwise comaximal ideals: for finitely many pairwise comaximal ideals, the quotient by their product is the product of the corresponding quotient algebras.

[F4] The finite dual of an associative algebra: a functional is in A∘ if it vanishes on a finite-codimensional two-sided ideal.

[F5] The finite dual is a coalgebra and descends through bialgebras and Hopf algebras: the finite dual has coproduct mA∗, counit f↦f(1), convolution product induced by ΔA, and antipode f↦f∘SA.

[F6] Group algebras, finite-group function algebras, and polynomial Hopf algebras: k[x] has Δ(x)=x⊗1+1⊗x, ε(x)=0, and S(x)=−x in every characteristic.

[F7] Multivariate polynomial and Laurent rings over commutative rings, domains and fraction fields: the polynomial algebra over a field is free on its monomial basis 1,x,x2,….

1.1givenF2F4F6F7choose

Every finite-codimensional ideal I⊴k[x] is nonzero, since [F7] gives the infinite linearly independent family 1,x,x2,…. Choose a nonzero element of I of least degree and scale it to a monic polynomial p. Dividing any f∈I by p, the remainder is in I and has smaller degree, so it is zero; hence I=(p). If I=k[x], a functional vanishing on it is zero, which is the empty sum in the claimed direct sum.

1.2givenF5F6algebra

The primitive coproduct sends a polynomial p(x) to p(X+Y) in k[X,Y]. Writing X=a+u, Y=b+v, the value of (δa,r∗δb,s)(p) is the coefficient of urvs in p(a+b+u+v). Expanding p(a+b+z)=∑nδa+b,n(p)zn, that coefficient is (r+sr)δa+b,r+s(p); hence δa,r∗δb,s=(r+sr)δa+b,r+s, with binomial coefficients interpreted in k.

2.1step 1.1givenF1algebra

For a proper cofinite ideal, p has positive degree. Repeatedly applying [F1] and dividing by x−a whenever a is a root factors p, up to a nonzero scalar, as ∏a∈E(x−a)ma for a finite set E⊂k of distinct roots and positive integers ma. If a≠b, then u=(x−a)/(b−a) and v=−(x−b)/(b−a) satisfy u+v=1, with u∈(x−a) and v∈(x−b). Expanding 1=(u+v)m+n−1 shows (x−a)m+(x−b)n=k[x], since every term contains either at least m factors u or at least n factors v. Thus the powers for distinct roots are pairwise comaximal.

3.1step 2.1givenF2F3F4algebra

By [F3], k[x]/(p) is isomorphic to ∏a∈Ek[x]/((x−a)ma). In each factor [F2] gives the basis 1,(x−a),…,(x−a)ma−1, whose dual basis consists of the coefficient functionals δa,0,…,δa,ma−1. Pulling these functionals back to k[x] expresses any f vanishing on (p) as a finite sum of δa,r. Conversely, δa,r vanishes on the cofinite ideal ((x−a)r+1), so it is in A∘. The local dual bases in the CRT product are independent, so the sum over distinct a is direct.

4.1givenstep 3.1F5algebra

For f,g∈k[x], expand f=∑iδa,i(f)(x−a)i and g=∑jδa,j(g)(x−a)j. The coefficient of (x−a)r in fg is ∑i+j=rδa,i(f)δa,j(g); by [F5], this gives Δ∘δa,r=∑i+j=rδa,i⊗δa,j.

4.2step 3.1F5F6algebra

Since 1∈k[x] has coefficient 1 at degree 0 about every a and zero at higher degrees, ε∘(δa,r)=δa,r(1) is 1 for r=0 and 0 otherwise. The convolution unit is εA, evaluation at 0, namely δ0,0. Finally, for p(x), the coefficient of (x−a)r in p(−x) is (−1)rδ−a,r(p), so S∘δa,r=(−1)rδ−a,r.

5.1step 1.1step 2.1step 3.1step 1.2step 4.1step 4.2F5∎

Steps 1.1, 2.1, and 3.1 identify the finite dual as the stated direct sum, while steps 1.2, 4.1, and 4.2 compute the convolution product, coproduct, unit, counit, and antipode. Together with the finite-dual structure of [F5], these establish all the displayed formulas.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

51 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