Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
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.

Double coalgebra, multiplicativity, and antipode

Statement

For the associative algebra D(H) of Double crossing laws and associativity, define

ΔD(fh)=∑(f1h1)⊗(f2h2),εD(fh)=f(1H)εH(h).

These maps make D(H) a bialgebra. The inverse crossing, in normal order, is

fh=∑f1(h1)f3(S(h3))h2f2.

Moreover,

SD(fh):=S(h)(f∘S−1)

is an antipode. Thus D(H) is a Hopf algebra with the stated normal-order formulas.

Facts & Assumptions

Given: A finite-dimensional Hopf algebra H over a field with bijective antipode S, and the associative candidate algebra D(H) with the crossing from Finite Drinfeld double: convention and candidate multiplication and Double crossing laws and associativity. Prove that the displayed structural maps make it a Hopf algebra.

[F1]

Bialgebras and bialgebra maps: the coproduct is coassociative, its counit satisfies both counit equations, and both maps preserve the bialgebra multiplication and unit.

[F2]

Finite tensor duality and basis-independent coevaluation: finite-dimensional tensor duality identifies H∗⊗H∗ with (H⊗H)∗ and evaluations separate tensors.

[F3]

The dual of a finite-dimensional Hopf algebra is a Hopf algebra: H∗ has the transposed Hopf structure, with coproduct dual to multiplication, convolution product, and antipode f↦f∘S.

[F4]

Uniqueness and anti-multiplicativity and anti-comultiplicativity of the antipode: the antipode is anti-multiplicative and anti-comultiplicative, and its counit identity is ε∘S=ε.

[F5]

Finite Hopf algebras have one-dimensional integral spaces and bijective antipode: the antipode of a nonzero finite-dimensional Hopf algebra is bijective.

[F6]

Hopf algebras and antipodes: S satisfies both antipode contractions ∑S(h1)h2=ε(h)1H=∑h1S(h2).

[L1]

Finite Drinfeld double: convention and candidate multiplication: D(H)=H∗op⊗H in normal order, with χ(h⊗f)=∑f1(S(h1))f3(h3)f2⊗h2.

[L2]

Double crossing laws and associativity: the candidate product is associative and its crossing obeys both multiplication distributive laws.

[A1]

H is finite-dimensional and S is bijective, as stated in Finite Drinfeld double: convention and candidate multiplication. Also H≠0: its counit is a unital algebra map, so εH(1H)=1k; consequently the nonzero hypothesis of [F5] is satisfied.

Proof

1.1givenF2F3L1algebra

The dual coproduct is coassociative because for all x,y,z∈H, both iterated coproducts of f evaluate to f((xy)z)=f(x(yz)), and its counit is f↦f(1H); these are also the dual coalgebra maps in [F3]. The tensor coalgebra formula for ΔD is therefore coassociative with counit εD.

1.2A1F1F3F4F5F6L1algebra

By [F3], the dual Hopf algebra has antipode S∗(f)=f∘S. Since S is bijective, S∗ is bijective with inverse fˉ=f∘S−1. The same coproduct makes the opposite product a bialgebra: Δ(f⊙g)=Δ(g∗f)=Δ(g)Δ(f)=∑(g1∗f1)⊗(g2∗f2)=∑(f1⊙g1)⊗(f2⊙g2). The opposite unit is still εH, and Δ(εH)=εH⊗εH because εH(xy)=εH(x)εH(y); its counit f↦f(1H) is multiplicative for ⊙ since (f⊙g)(1H)=(g∗f)(1H)=g(1H)f(1H)=f(1H)g(1H) using ΔH(1H)=1H⊗1H. Pairing the two proposed antipode products with x∈H gives ∑(fˉ1⊙f2)(x)=f(S−1(x2)x1)=ε(x)f(1H) and ∑(f1⊙fˉ2)(x)=f(x2S−1(x1))=ε(x)f(1H), using the inverse antipode identities obtained by applying S−1 to the equations in [F6] and reversing products by [F4]. Thus fˉ is the antipode of H∗op. The tensor coalgebra restricts to these Hopf structures on the two embedded factors.

1.3F2F6L1L2construct

Define ψ:H∗⊗H→H⊗H∗ by ψ(f⊗h)=∑f1(h1)f3(S(h3))h2⊗f2. Pairing the dual factor of χψ(f⊗h) with x gives ∑f(h1S(h2)xh4S(h5))h3=f(x)h, by the two contractions h1S(h2)=ε(h)1 and h4S(h5)=ε(h)1. Pairing the dual factor of ψχ(h⊗f) with x gives ∑f(S(h1)h2xS(h4)h5)h3=f(x)h by the other two antipode contractions. Finite dual separation [F2] proves ψ=χ−1; equivalently, the inverse crossing relation is fh=∑f1(h1)f3(S(h3))h2f2.

2.1F1F2F3F6L1step 1.2algebra

The coproduct is multiplicative on each embedded factor by step 1.2 and the bialgebra equations [F1]. For the mixed crossing, applying ⟨−,x⟩⊗id⁡H⊗⟨−,y⟩⊗id⁡H to ΔD(hf) and expanding hf gives ∑f(S(h1)xyh4)h2⊗h3. Applying the same evaluation to ΔD(h)ΔD(f)=∑(h1f1)⊗(h2f2) and expanding both crossings gives ∑f(S(h1)xh3S(h4)yh6)h2⊗h5. The antipode identity [F6] contracts the adjacent factors h3S(h4), leaving ∑f(S(h1)xyh4)h2⊗h3, the same tensor. By [F2], finite dual evaluations separate tensors, so ΔD(hf)=ΔD(h)ΔD(f).

2.2F4step 1.2step 1.3L1L2algebra

The map SD(fh)=S(h)fˉ reverses products on each embedded factor. Applying the inverse crossing of step 1.3 to fˉ⊗S(h), and using the anti-multiplicative and anti-comultiplicative identities [F4] together with fˉ=f∘S−1, gives fˉS(h)=∑f1(S(h1))f3(h3)S(h2)fˉ2. This is exactly the reversal of the defining crossing hf=∑f1(S(h1))f3(h3)f2h2. Hence SD reverses the mixed relation and is an anti-algebra map on the crossed product.

3.1step 1.2step 2.1L1L2algebra

For simple normal tensors fh and gk, the product is f(hg)k by [L2]. The defining tensor coalgebra formula gives ΔD(f(hg)k)=ΔD(f)ΔD(hg)ΔD(k), because each displayed term is in normal order. The mixed calculation of step 2.1 gives ΔD(hg)=ΔD(h)ΔD(g), and the factor restrictions of step 1.2 give the remaining products. Hence ΔD((fh)(gk))=ΔD(fh)ΔD(gk); linearity proves multiplicativity on all of D(H).

4.1F1F3F4F6step 1.2step 3.1L1L2algebra

Applying εD to the crossing gives ∑f1(S(h1))f2(1H)f3(h3)εH(h2)=∑f(S(h1)h3)εH(h2)=f(1H)εH(h): the dual coproduct combines the first three evaluations, and applying id⁡⊗ε⊗id⁡ to Δ(2)(h) gives Δ(h) before the antipode contraction [F6]. Thus the counit is multiplicative on the crossing and on both factors; the normal-product calculation of step 3.1 makes it multiplicative on all products. Also ΔD(1D)=1D⊗1D, since ΔH∗(εH)=εH⊗εH and ΔH(1H)=1H⊗1H, and εD(1D)=1. Therefore D(H) is a bialgebra.

5.1F6step 1.2step 2.2L1algebra∎

For ΔD(fh)=∑f1h1⊗f2h2, the left antipode contraction is ∑S(h1)(fˉ1⊙f2)h2. By step 1.2 the dual factor contracts to f(1H)εH, and the remaining S(h1)h2 contracts to εH(h)1D by [F6]. The right contraction is ∑f1h1S(h2)fˉ2; first contract h1S(h2) by [F6] and then use the other dual antipode identity of step 1.2. Both sides equal f(1H)εH(h)1D=εD(fh)1D. Thus SD is an antipode.

Remarks

The formula uses S−1 only after bijectivity is established by the HH-8 supplier. The dual Hopf supplier verifies the ordinary transposed coproduct first; the opposite multiplication is handled explicitly here. These draft suppliers have been inspected for the stated hypotheses and conventions, but their inspection is not an independent approval.

Depends on

Used by

Cited to discharge well-definedness by Finite Drinfeld double: convention and candidate multiplication.

Dependency tree · two levels

30 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