Alphabeta Math
CounterexampleConstruction: 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.

A quasi-bialgebra need not be quasi-Hopf

Statement refuted

Every quasi-bialgebra has a quasi-antipode.

Construction

Let M={1,e} be the monoid with e2=e, 1e=e1=e, and e≠1. In the monoid algebra H=C[M], set Δ(m)=m⊗m, ε(m)=1 for m∈M, and Φ=1⊗1⊗1.

Facts & Assumptions

Given: The two-element monoid algebra and structure maps in the Construction.

[F1]

Quasi-bialgebras, quasi-antipodes, and quasi-Hopf algebras: a quasi-antipode (S,α,β) satisfies the two convolution identities and, when Φ=1, the normalization equations give βα=1=αβ.

[F2]

Bialgebras and bialgebra maps: a bialgebra has a coassociative coproduct, counit, and multiplicative unital structure maps.

[F3]

Hopf algebras and antipodes: an ordinary Hopf antipode is a two-sided convolution inverse of the identity.

Counterexample

1.1givenF1F2algebra

The monoid laws make multiplication associative and unital. On basis elements, Δ(mn)=mn⊗mn=(m⊗m)(n⊗n), Δ(1)=1⊗1, ε(mn)=1=ε(m)ε(n), and coassociativity and the counit equations hold. Thus H is a bialgebra and, with Φ=1, a quasi-bialgebra.

2.1givenF1F2F3step 1.1algebraconstruct

Suppose (S,α,β) is a quasi-antipode. With Φ=1, its normalization equations give βα=1=αβ, so α−1=β. Define S′(h)=α−1S(h)α. The quasi-antipode equations imply ∑S′(h(1))h(2)=ε(h)1 and ∑h(1)S′(h(2))=ε(h)1; thus S′ is an ordinary Hopf antipode of the bialgebra in step 1.1.

3.1F1F3step 1.1step 2.1algebra∎

The basis element e is group-like: Δ(e)=e⊗e and ε(e)=1. The antipode equations in [F3] would make e invertible, since S′(e)e=1=eS′(e). But an invertible idempotent is 1 (multiply e2=e by e−1), contradicting e≠1. Hence no quasi-antipode exists, refuting the statement.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

8 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