Alphabeta Math
LemmaStatement: Literature-sourcedProof: 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.

Balancing and the Hopf-link character identity

Statement

Let C be the spherical ribbon fusion category of Modular ribbon fusion category and Hopf-link data. For simple labels i,j,

sij=(θiθj)−1∑kNijkθkdk,

and, for simple labels x,i,j,

sxisxj=dx∑kNijksxk.

Also sij=sji, si∗j∗=sij, si0=di, and di∗=di. Consequently hx(i)=sxi/dx extends linearly to a unital ring character of the fusion ring.

Facts & Assumptions

Given: A complex finite semisimple rigid braided tensor category with simple unit, ribbon twist θ, spherical pivotal trace, and simple labels x,i,j.

[F1]

The spherical pivotal comparison is jX=uXθX, and di=tr⁡j(1i), sij=tr⁡j(cj,ici,j) (Modular ribbon fusion category and Hopf-link data, A braided rigid category has a Drinfeld morphism).

[F2]

Balancing is θX⊗Y=(θX⊗θY)cY,XcX,Y; the ribbon condition is compatible with duals (Twist and ribbon structure).

[F3]

The two hexagons expand the double braiding on X⊗(Y⊗Z) as (cY,X⊗1Z)(1Y⊗cZ,XcX,Z)(cX,Y⊗1Z) (Braiding).

[F4]

The trace is additive on finite direct sums, cyclic, and its tensor trace is multiplicative here because the category is complex linear and End⁡(1)=C (The categorical trace of a morphism into the double dual, Basic properties of the categorical trace).

[F5]

For a simple x, End⁡(x)=C and dx≠0 (Fusion and multifusion categories, Simple ribbon fusion dimensions are nonzero).

[F6]

The fusion multiplicities are Nijk=dim⁡CHom⁡(k,i⊗j) (Fusion rules).

[F7]

Duals reverse tensor products, the braiding exchanges their two factors, and the ribbon dual-compatibility is θi∗=θi on simple labels (Rigid object and rigid monoidal category, Braided monoidal category, Twist and ribbon structure).

Proof

Given: The data in the Statement.

1.1F1F2F4F6givenalgebra

By balancing [F2], cj,ici,j=(θi−1⊗θj−1)θi⊗j. Taking the pivotal trace and using additivity [F4], decompose i⊗j≅⨁kk⊕Nijk. Schur's lemma makes θi,θj,θk scalars on simples, so the trace is (θiθj)−1∑kNijkθkdk, proving the balancing formula.

1.2F1F4F5givenconstruct

Define the partial trace of f:X⊗Z→X⊗Z over Z by PZ(f)=(1X⊗ev⁡Z∨)(1X⊗jZ⊗1Z∨)(f⊗1Z∨)(1X⊗coev⁡Z). Substitution of the tensor coevaluation and evaluation into the trace formula shows tr⁡j(PZ(f))=tr⁡j(f). For f=cZ,XcX,Z and simple X, Schur's lemma gives PZ(f)=α1X; hence αdX=sXZ. Since dX≠0 by [F5], PZ(f)=(sXZ/dX)1X.

2.1F1F3F4F5F6step 1.2algebra

Apply the hexagon expansion [F3] to cY⊗Z,XcX,Y⊗Z and take the partial trace over the final Z factor. Step 1.2 replaces the middle double braiding by (sXZ/dX)1X; the remaining composite is that scalar times cY,XcX,Y. Taking the trace over the remaining factors therefore gives dX−1sXZsXY. On the other hand, decompose Y⊗Z into simples before taking its trace; additivity gives ∑kNYZksXk. Equating these two evaluations and multiplying by dX yields sXYsXZ=dX∑kNYZksXk.

3.1F1F5F6step 2.1algebra

Divide step 2.1 by dX2, which is nonzero by [F5]. The result is hX(Y)hX(Z)=∑kNYZkhX(k), and hX(0)=sX0/dX=1 because the double braiding with the unit is the identity. Thus hX is a unital fusion-ring character. Relabeling Y=i,Z=j gives the stated identity.

4.1F1F2F4F6F7step 1.1algebra∎

The double braiding of a label with the unit is the identity, so si0=di. The endomorphisms cj,ici,j and ci,jcj,i are conjugate via the isomorphism ci,j; cyclicity in [F4] therefore gives sij=sji. To compare dual labels, apply step 1.1 to (i∗,j∗) and reindex the summation by k=ℓ∗. By [F7], Ni∗j∗ℓ∗=Nijℓ and θℓ∗=θℓ; by sphericality in [F1], dℓ∗=dℓ. The balancing sum and its scalar denominator are consequently unchanged, proving si∗j∗=sij and di∗=di.

Diagram convention

The following commutative trace diagram records only the order of evaluation: closing the Z strand first and then the X strand equals the single pivotal trace on X⊗Z. The proof above verifies this by substituting the coevaluation and evaluation composites; the diagram is not a proof premise.

\operatorname{End}(X\otimes Z) \arrow[r, "\operatorname{ptr}_Z"] \arrow[dr, "\operatorname{tr}_{X\otimes Z}"'] & \operatorname{End}(X) \arrow[d, "\operatorname{tr}_X"] \\
& \operatorname{End}(\mathbf 1)

Depends on

Used by

Dependency tree · two levels

25 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