Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)
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.

Khovanov Frobenius algebra and cube of resolutions

Definition

Let D be a nonempty finite regular oriented link diagram in an oriented 3-sphere, with finite crossing set C(D). Fix a unit viewing normal n and orient the projection plane P so (u,v) is positive exactly when (n,u,v) is positive in the ambient 3-space. At a crossing c, define its sign as the sign of det⁡P(vover,vunder), where the two nonzero projected tangent vectors follow the oriented over- and under-strands. Let n+ and n− be the numbers of positive and negative crossings.

Set A=Z[X]/(X2), with deg⁡(1)=1 and deg⁡(X)=−1. Its unit, multiplication, counit, and comultiplication are

η(1)=1,m(1⊗1)=1,m(1⊗X)=m(X⊗1)=X,m(X⊗X)=0, ϵ(1)=0,ϵ(X)=1,Δ(1)=1⊗X+X⊗1,Δ(X)=X⊗X.

Thus m and Δ have quantum degree −1, while η and ϵ have degree +1.

Choose a total order c1<⋯<cn on C(D). A resolution state is a function v:C(D)→{0,1}; at v(c)=0 use the A-smoothing and at v(c)=1 use the B-smoothing from the Kauffman source chart. Write ∣v∣=∑cv(c), let Dv be the crossingless resolution, and let k(v) be its number of circles. Assign the state module A⊗k(v). For an edge v→v+ej changing crossing cj from 0 to 1, use m if the local smoothing merges two circles and Δ if it splits one circle, tensored with the identity on all other factors, and multiply this map by (−1)∑i<jv(ci). The resulting direct sum has cohomological degree i(v)=∣v∣−n− and the generator with circle labels 1 or X has quantum degree j(v)=∣v∣+n+−2n−+∑circle labels adeg⁡(a). This defines the normalized integral Khovanov cube and its candidate degree-zero cochain differential; the assertion that the differential squares to zero is a separate lemma.

The Frobenius identity that controls a merge-split face is represented by the two equal composites below. The diagram records the maps only; the proof verifies the equality on the basis {1,X}⊗2 and does not rely on the drawing.

A¬AAA¬A¬AA¬Am¢¬id¢id¬m

Facts & Assumptions

Given: A nonempty finite regular oriented diagram D, a total order of its crossing set, and the operations displayed in the Definition.

Proof

1.1givenalgebra

The quotient by the monic polynomial X2 is the free abelian group with basis 1,X. The displayed multiplication is the quotient-ring multiplication, so it is associative, commutative, and has unit 1. On this basis, ϵ and Δ satisfy both counit identities; explicitly, (ϵ⊗id)Δ(1)=1, (id⊗ϵ)Δ(1)=1, and the same composites send X to X.

1.2givenalgebra

Cocommutativity follows by swapping tensor factors in the two displayed values of Δ. For coassociativity, both (Δ⊗id)Δ(1) and (id⊗Δ)Δ(1) equal 1⊗X⊗X+X⊗1⊗X+X⊗X⊗1, and both composites send X to X⊗X⊗X. Hence (A,m,η,Δ,ϵ) is a commutative Frobenius algebra once the Frobenius compatibility is checked.

2.1givenstep 1.1step 1.2algebra∎

On the ordered basis 1⊗1,1⊗X,X⊗1,X⊗X of A⊗A, each of (m⊗id)(id⊗Δ), Δm, and (id⊗m)(Δ⊗id) has respective outputs 1⊗X+X⊗1, X⊗X, X⊗X, and 0. Thus the Frobenius identities hold. The degree shifts in the Definition give each edge map total quantum degree 0; the quotient-ring construction and all checks are choice-free.

Depends on

Used by

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