Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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 algebra of a two-object discrete groupoid is weak Hopf

Statement

Let H=Ce0⊕Ce1 with eiej=δijei, unit 1=e0+e1, coproduct Δ(ei)=ei⊗ei, counit ε(ei)=1, and antipode S(ei)=ei. Then H is a weak Hopf algebra with Ht=Hs=H and Δ(1)=e0⊗e0+e1⊗e1≠1⊗1. For any left H-modules V,W, give V the right Ht-action v◃x=εs′(x)v and let Ht act on W by restriction. Here V⊗HtW is the quotient of V⊗kW by the span of (v◃x)⊗w−v⊗xw. The induced diagonal action is ei⋅[v⊗w]=[eiv⊗eiw], and this relative tensor product is naturally isomorphic as a left H-module to e0V⊗e0W ⊕ e1V⊗e1W=Δ(1)(V⊗W). The counit is not multiplicative, so this weak Hopf algebra is not an ordinary bialgebra.

Diagram

The underlying discrete groupoid has two objects and only their identity arrows; no arrow connects the two objects.

01id0id1

Facts & Assumptions

Given: The algebra H=Ce0⊕Ce1, the structure maps in the Statement, and unital left H-modules V,W.

[F1]

Weak bialgebras, weak Hopf algebras, and counital maps: the weak unit, weak counit, and weak antipode identities, and the formulas for εt, εs, and εs′.

[F2]
[F3]

Module homomorphism and isomorphism, kernel, image and cokernel: an H-linear map preserves addition and the left H-action.

[F4]

Bialgebras and bialgebra maps: an ordinary bialgebra has multiplicative counit ε.

Verification

1.1givenF1algebra

Multiplication is associative and unital. The coproduct is coassociative, and (ε⊗id)Δ(ei)=ei=(id⊗ε)Δ(ei). Also Δ(ei)Δ(ej)=δijei⊗ei=Δ(eiej), so Δ is multiplicative.

2.1givenF1step 1.1algebra

Put E=Δ(1)=∑iei⊗ei. Both iterated coproducts of E equal ∑iei⊗ei⊗ei, and (E⊗1)(1⊗E)=(1⊗E)(E⊗1)=∑iei⊗ei⊗ei by orthogonality. For basis triples ei,ej,ek, each weak-counit product equals 1 exactly when i=j=k and is 0 otherwise; trilinearity proves both weak-counit identities. The counital-map formulas give εt(ei)=ei=εs(ei). Finally, S(ei)=ei gives eiS(ei)=εt(ei), S(ei)ei=εs(ei), and S(ei)eiS(ei)=S(ei). Thus all weak Hopf axioms hold by linearity.

3.1F1F4step 2.1algebra

The counital formulas also give εs′(ei)=∑jejε(ejei)=ei, hence Ht=Hs=H. Since E has no off-diagonal terms whereas 1⊗1 has them, Δ(1)≠1⊗1. Moreover ε(e0e1)=0 but ε(e0)ε(e1)=1, so the structure is not an ordinary bialgebra.

4.1F1F2step 3.1algebra

Orthogonal idempotents summing to 1 give direct sums V=e0V⊕e1V and W=e0W⊕e1W by the left module axioms. On each elementary summand eiV⊗ejW, E acts as multiplication by δij, so its image is (e0V⊗e0W)⊕(e1V⊗e1W). Also v◃ei=eiv. The balancing relation for x=ei kills eiV⊗ejW when i≠j, while for i=j the left and right actions agree. For vi=eiv and wj=ejw, the relation for x=a0e0+a1e1 is (ai−aj)vi⊗wj. It vanishes when i=j; when i≠j, choosing x=ei generates the whole summand eiV⊗ejW. Thus the relation subspace is exactly the sum of the two off-diagonal summands.

5.1F1F3step 4.1algebra∎

The quotient and image are both the direct sum of the diagonal summands by step 4.1, and the quotient map and its inverse are the identity on each such summand. On each diagonal summand ejV⊗ejW, both the image and quotient actions of ei are multiplication by δij; hence the isomorphism is H-linear. If f:V→V′ and g:W→W′ are H-linear, then [F3] gives f(eiv)=eif(v) and g(eiw)=eig(w), so f⊗g preserves each diagonal summand and the isomorphism is natural in V,W.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

12 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