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.

Tensor products of modules over a bialgebra without an antipode

Example

Let H=k[t] over a field k, with

Δ(t)=t⊗t,ε(t)=1,

extended linearly by Δ(∑nantn)=∑nantn⊗tn and ε(∑nantn)=∑nan. This is a bialgebra but not a Hopf algebra. The one-dimensional modules V=W=k on which t acts by zero have a tensor product module with the diagonal action; hence the tensor product construction does not require an antipode.

The statement that this bialgebra has no antipode means no antipode exists for the specified coproduct and counit. It does not say that no module structure can ever be put on an underlying dual vector space; in this example the t=0 module has a one-dimensional dual with t acting by zero.

Facts & Assumptions

Given: A field k, the polynomial ring k[t] with coefficientwise addition and convolution multiplication, the displayed maps Δ,ε, and the modules V=W=k where t acts by zero.

[F1]

The polynomial ring over a commutative ring as finitely supported coefficient sequences with convolution: k[t] consists of finite coefficient sums ∑nantn, with convolution multiplication and unit the constant polynomial 1.

[F2]
[F3]

The module category of a bialgebra and its tensor action: for modules V,W, h(v⊗w)=∑h(1)v⊗h(2)w is the proposed tensor action.

[F4]

Bialgebra module tensor actions and their coherence: when H is a bialgebra, that formula makes V⊗W a left H-module.

[F5]

Field: a field satisfies 0k≠1k.

[F6]

Linear functionals and the algebraic dual V∗=L(V,F): V∗ is the vector space of all linear functionals V→k.

Verification

Given: The data and conventions in Facts & Assumptions.

1.1givenF1F2algebra

The maps Δ and ε are well-defined linear maps because every polynomial has a finite coefficient expansion [F1]. On monomials, Δ(tmtn)=tm+n⊗tm+n=Δ(tm)Δ(tn) and ε(tmtn)=1=ε(tm)ε(tn); the formulas also preserve 1. Bilinearity extends multiplicativity to all polynomials.

1.2givenF1F5algebra

If an antipode S existed, its left convolution identity at t would give S(t)t=ε(t)1=1. Every polynomial multiplied by t has constant coefficient zero, while 1 has nonzero constant coefficient by [F5]. This is impossible, so the bialgebra is not Hopf.

2.1givenF1step 1.1algebra

For each monomial tn, (Δ⊗id)Δ(tn)=tn⊗tn⊗tn=(id⊗Δ)Δ(tn) and (ε⊗id)Δ(tn)=tn=(id⊗ε)Δ(tn). Since monomials span k[t], these identities hold for all polynomials; together with step 1.1 they prove that H is a bialgebra.

3.1F1F3F4step 1.1step 2.1

The actions p(t)⋅c:=p(0)c make V=W=k unital left H-modules because evaluation at zero is a unital algebra map. On 1⊗1∈V⊗W, t acts by Δ(t)=t⊗t, hence by 0⊗0=0. The theorem [F4] makes the diagonal formula a module action on all of V⊗W; it uses only the bialgebra structure proved in steps 1.1 and 2.1.

4.1F1F3F5F6step 1.1step 3.1algebra∎

Thus the tensor module exists without an antipode. To check the example's claim about the underlying dual vector space, take e=1∈V=k and e∗(c)=c, which spans V∗ by [F6]. Define p(t)⋅e∗=p(0)e∗. For p(t)=∑nantn and q(t)=∑nbntn, the constant coefficient of pq is a0b0=p(0)q(0), and 1(0)=1; hence this is a unital H-module action. It is not a left-dual object in H-Mod: t acts by zero on e∗⊗e under the diagonal action, so evaluation sends t⋅(e∗⊗e) to 0, while t⋅ev⁡(e∗⊗e)=t⋅1=ε(t)1=1. Since 0≠1 by [F5], evaluation is not H-linear.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

22 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.