Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: 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.

The pointed Z/2 semion metric group

Statement

For G=Z/2={0,1} define

ω(a,b,c)=(−1)abc,r(a,b)=iab,q(0)=1,q(1)=i,

where group elements are represented by bits. These data give a pointed ribbon category with nondegenerate bicharacter b and modular Hopf-link matrix.

Facts & Assumptions

Given: The finite group G=Z/2 and the scalar functions in the Statement.

[F1]

The pentagon and two hexagon equations and twist compatibility for an abelian 3-cocycle are those of Pointed ribbon categories from abelian 3-cocycles.

[F2]

The pointed modularity criterion is rad⁡(b)={0} (A pointed metric-group category is modular exactly when its radical is trivial).

[F3]

The Drinfeld map is the evaluation–braiding–coevaluation composite and satisfies dX,Y(uX⊗uY)=uX⊗YcY,XcX,Y (A braided rigid category has a Drinfeld morphism). Thus balancing makes j=uq monoidal.

Proof

Given: The data in the Statement.

1.1F1givenalgebra

Normalization holds because every exponent vanishes if any argument is 0. For bits, b+c in the cocycle equations is reduced modulo 2. The pentagon signs have exponents abc+a(b+c)d+bcd=acd+bcd+abc+abd(mod2), so its two sides agree. For the first hexagon, the ratio of the r-terms is i−2abc=(−1)abc, which is exactly the ratio of the ω-terms. For the second hexagon, the ratio of the r-terms is again i−2abc=(−1)abc, equal to ω(a,b,c)ω(c,a,b)ω(a,c,b)−1=(−1)abc. The twist equation is trivial if either bit is zero; at (1,1) its right side is r(1,1)2q(1)2=i2i2=1=q(0). Also q(−g)=q(g). Thus all specified cocycle and twist identities hold.

2.1F1F3step 1.1constructalgebra

Supply the dual and pivotal data required by [F1]. The left dual of g is g; its evaluation scalar is 1, and its coevaluation scalar is ω(g,g,g)−1=(−1)g. Both snake composites are one, since the associator contributes the same sign. Formula [F3], with reassociation from g⊗(g⊗g) to (g⊗g)⊗g, gives u0=1 and u1=(−1)(−1)i=i. Put jg=ugq(g), so j0=1 and j1=−1, and extend by direct sums. The tensor identity in [F3] and the balancing identity checked in step 1.1 prove monoidality of j, including all associators and double-dual comparisons. Its pivotal trace on a simple is the scalar ev⁡g∨(jg⊗1)coev⁡g=(−1)g(−1)g=1. The dual grade is the same, so the left and right simple traces agree; additivity gives sphericality on all finite direct sums. The induced twist u−1j is exactly q. Thus the full dimension-one pointed ribbon input, rather than just its scalar cocycle, has been constructed.

3.1F2step 1.1step 2.1algebra∎

The double-braiding values are b(0,g)=b(g,0)=1 and b(1,1)=i2=−1. Hence s=(111−1). The only nonzero element 1 is not in the radical because b(1,1)=−1≠1, so rad⁡(b)={0}. By [F2] the category is modular; directly, det⁡(s)=−2 and D2=2.

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