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

The trivial one-braid and the grading normalization

Example

Assume AC, inherited from the comparison theorem used to identify the grading dictionary. Let σ∗ be the trivial braid on one strand: m=1 and the reduced ring of The reduced type-A polynomial ring and Soergel bimodules for the HHH construction is R=Q (there are no differences), so the generator complex of Khovanov's generator complexes for the HHH construction is the unit complex F(σ∗)=R=Q concentrated in cohomological degree 0. Hence HHH0,0,0(σ∗)=Q,HHHc,h,p(σ∗)=0 otherwise, and the one-strand class sits in tridegree (h,p,c)=(0,0,0). On the Khovanov-Rozansky side the reduced homology of the unknot is one-dimensional (The reduced Khovanov-Rozansky homology), and its class sits in the raw tridegree (k,l,j)=(−1,1,0) of The Khovanov-Rozansky complex and trigraded braid homology before the correction. Therefore the global correction (k,l)↦(k+1,l−1) of The Koszul-Hochschild comparison respects crossing differentials and trigradings sends this class to (0,0,0), and the dictionary k=−h, l=p−h, j=c maps (0,0,0) to (0,0,0); both theories have their one-strand generator in tridegree (0,0,0), exactly as the source records. This fixes the global constant in the trigrading dictionary and is the base case of the comparison of HHH is isomorphic to reduced Khovanov-Rozansky homology.

Caveats: the correction is a one-time global shift of the Khovanov-Rozansky trigrading, not a per-diagram normalization; the raw first bigrading −1 comes from the universal (a,0) row; after the correction it is k=−h=0; the unreduced theory keeps the trivial Q[x]-tower and is not one-dimensional, so the identification is made in the reduced theory.

Facts & Assumptions

Given: the trivial one-strand braid σ∗, the reduced ring R=Q, the unit complex F(σ∗)=Q, and the reductions and dictionary of the cited items.

[L1]

For m=1 the reduced ring is R=Q with no simple reflections, and the generator complex of the trivial braid is the unit complex R concentrated in cohomological degree 0 (The reduced type-A polynomial ring and Soergel bimodules for the HHH construction, Khovanov's generator complexes for the HHH construction).

[L2]

In Hochschild degree h, the termwise Hochschild complex of a coefficient complex concentrated in cohomological degree 0 is the single graded vector space HHh(R,M); the Hochschild chain complex has C0(R,M)=M and Ch(R,M)=M⊗QR⊗Qh with the alternating boundary, and HH0(R,M) is the coinvariant quotient M/⟨rm−mr⟩ (The termwise Hochschild complex of a Rouquier complex and the groups HHH, Hochschild chains and Hochschild homology with coefficients).

[L3]

The reduced Khovanov-Rozansky homology is the construct of the reduced label ring with the coefficient a retained; in its raw trigrading the one-strand class of the reduced unknot sits in tridegree (−1,1,0), whose image under the global correction (1,−1,0) is the class (0,0,0); the unreduced theory is H(D)≅H‾(D)⊗QQ[x] with the trivial variable x (The reduced Khovanov-Rozansky homology).

[L4]

The comparison identifies HHH with the reduced theory by k=−h, l=p−h, j=c after the global correction (k,l)↦(k+1,l−1), and the correction is fixed by the one-strand normalizations (The Koszul-Hochschild comparison respects crossing differentials and trigradings, HHH is isomorphic to reduced Khovanov-Rozansky homology).

Verification

technique · direct
1.1L1L2givenalgebra

Compute HHH(σ∗). By [L1] the complex F(σ∗) is Q in cohomological degree 0; by [L2] the termwise complex in Hochschild degree 0 is the single space HH0(Q,Q)=Q/⟨rm−mr⟩=Q, because Q is commutative, and the space Q has internal degree 0. For h≥1 the Hochschild chain groups are Ch(Q,Q)=Q and the alternating boundary acts on the one-dimensional space as the sum ∑i=0h(−1)i, which is 1 in characteristic zero for h even and 0 for h odd; hence each boundary is either zero or an isomorphism and HHh(Q,Q)=0 for all h≥1. Thus the termwise complex is Q in cohomological degree 0 and internal degree 0, so HHH(σ∗)=Q in (h,p,c)=(0,0,0).

2.1L3L4step 1.1algebra

The Khovanov-Rozansky side and the correction. By [L3] the reduced unknot class of the one-strand diagram sits in the raw tridegree (−1,1,0). The global correction (k,l)↦(k+1,l−1) moves it to (k+1,l−1,j)=(0,0,0), and the dictionary of [L4] maps the HHH class (h,p,c)=(0,0,0) to (k,l,j)=(0,0,0): indeed k=−h=0, l=p−h=0 and j=c=0. Thus the two one-strand classes agree in the corrected trigrading.

3.1L3L4step 2.1algebra∎

Fix the global constant. The dictionary is determined up to the global shift that carries the one-strand class of one theory to the class of the other; step 2.1 computes that shift to be exactly the correction (k,l)↦(k+1,l−1) used in the dictionary, so no further constant is available: any other correction would move the class (0,0,0) away from itself and contradict the identification of the two one-dimensional classes. Caveat: the unreduced theory keeps the tower Q[x]{−1,1} and is not one-dimensional, so the normalization is a statement about the reduced theories.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

33 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