Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-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.

A finite calculation separating convolution from composition

Example

Let H=kC3 with basis 1,g,g2 and g3=1. Define linear maps f,q:H→H by f(1)=0, f(g)=1, f(g2)=0 and q(1)=g, q(g)=q(g2)=0. Then f∗q=0 for convolution, but f∘q≠0 for composition. Also the antipode sends g to g2, whereas the composition inverse of idH is idH itself.

Facts & Assumptions

Given: A field k, the cyclic group C3={1,g,g2}, and the maps specified in the Example.

[F1]

Convolution is (f∗q)(h)=m(f⊗q)Δ(h), whereas composition is ordinary function composition (Convolution of linear maps is associative and unital).

[F2]

In a group algebra, Δ(g)=g⊗g and the antipode is S(g)=g−1 (Group algebras, finite-group function algebras, and polynomial Hopf algebras).

[F3]

The antipode is defined as the convolution inverse of the identity map (Hopf algebras and antipodes).

Verification

technique · direct
1.1givenF1F2construct

The maps are defined on all three basis elements of H, so they extend uniquely linearly to H. For each basis element r∈{1,g,g2}, [F2] gives Δ(r)=r⊗r, hence (f∗q)(r)=f(r)q(r). The products for r=1,g,g2 are respectively 0⋅g=0, 1⋅0=0, and 0⋅0=0, so f∗q is the zero linear map.

1.2F2F3algebra

By [F2], S(g)=g−1=g2≠g=idH(g), so S≠idH. The only compositional inverse of idH is itself: if T∘idH=idH, then T=idH. Yet [F3] and the Hopf structure make S the two-sided convolution inverse of idH. The inverse operation in the Hopf definition is therefore convolution, not composition.

2.1step 1.1algebra

By definition of composition, (f∘q)(1)=f(q(1))=f(g)=1, which is nonzero in the basis of H. Thus f∘q is not the zero map and differs from f∗q in step 1.1.

3.1step 1.1step 1.2step 2.1∎

Steps 1.1, 1.2, and 2.1 give an explicit pair of maps with different convolution and composition products and a Hopf antipode that is not a composition inverse of the identity.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

17 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