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

Trefoil, mirror, and unknot bracket calculations

Example

Assume the Axiom of Choice. Let A be an indeterminate. Let D+ be the positive trefoil diagram, defined as the closure of the two-strand braid σ13, where σ1 is the anticlockwise geometric half twist with the left label passing below and the right label above the midpoint, and both strands are oriented in the braid direction. Let D− be its mirror image, and let U be the crossing-free one-component unknot diagram. 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 oriented ambient 3-space. At each crossing use the local source chart whose over-strand runs southwest to northeast; the A-smoothing joins the left endpoints and right endpoints with weight A, and the B-smoothing joins the top endpoints and bottom endpoints with weight A−1. Transport these labels by orientation-preserving changes of local coordinates. For a diagram D, let C(D) be its finite crossing set. Each state is a map S:C(D)→{A,B}; let a(S) and b(S) count the smoothing types and ∣S∣ count its circles. Define ⟨D⟩=∑S:C(D)→{A,B}Aa(S)−b(S)(−A2−A−2)∣S∣−1 and fD(A)=(−A3)−wr⁡(D)⟨D⟩, where writhe is the sum of determinant crossing signs, computed as sgn⁡det⁡P(vover,vunder) after fixing a unit viewing normal n and using the induced orientation of P above. With t=A−4 and Jones polynomial VD(t)=fD(t−1/4), the values are VD+(t)=t+t3−t4,VD−(t)=t−1+t−3−t−4,VU(t)=1.

Verification

Given: AC and the closure D+=σ13^ with its three positive crossings.

[F1] The algorithm enumerates every smoothing state once and adds Aa(S)−b(S)δ∣S∣−1, with δ=−A2−A−2 (Kauffman bracket state sum).

[F2] In the declared chart, a positive braid crossing has operator C1=AI+A−1e1, with I the two through strands and e1 the top-cap, bottom-cup diagram (Hecke–bracket trace dictionary and local descent).

[F3] The Temperley–Lieb closure trace assigns δc(D) to a basis diagram, where c(D) counts circles after joining corresponding top and bottom endpoints. The closure of I has two circles, and the closure of e1 has one (Unnormalized diagram closure and partial trace).

[F5] Each positive Artin half twist has crossing sign +1; mirroring swaps over and under and negates the determinant sign (Oriented crossing signs, diagram writhe, and blackboard framing, The elementary geometric half twist, its support disc, and its opposite).

[F6] The normalized bracket of every nonempty oriented link equals the library Jones specialization after t=A−4 (The bracket state sum matches the library Jones specialization).

[F7] The closure of the identity one-strand braid is the crossing-free one-component unknot (The closure of a geometric braid).

1.1F1F2F3F4construct

For a state with k B-smoothings, the smoothed braid is the closure of a stack with k copies of e1 and 3−k identity layers, because each A-smoothing is I by [F2]. If k=0, the identity closure has two circles by [F3]. If k≥1, the first e1 connects the two closing arcs into one circle; each additional e1 contributes one removed loop by e12=δe1 in [F4]. Thus the state has k circles. There are (3k) states with k B-smoothings, each with weight A3−2kδ∣S∣−1. The complete state table is kstatescirclestotal contribution012A3δ1313A2323A−1δ313A−3δ2 Each term follows from [F1] and the circle counts in [F3–F4].

2.1F1F5F6step 1.1algebra

Substituting δ=−A2−A−2 into the table gives ⟨D+⟩=A3δ+3A+3A−1δ+A−3δ2=(−A5−A)+3A+(−3A−3A−3)+(A+2A−3+A−7)=A−7−A−3−A5. The braid has three positive crossings, so [F5] gives wr⁡(D+)=3. Therefore fD+(A)=(−A3)−3(A−7−A−3−A5)=A−4+A−12−A−16=t+t3−t4. By [F6], this is the library Jones value.

3.1F1F5F6F7step 2.1algebra∎

Mirroring keeps the projection and swaps over and under. To return the over-strand to the source chart's southwest-to-northeast position, rotate the local chart through a positive quarter-turn; this exchanges the top/bottom and left/right pairings. Thus the A- and B-smoothings interchange, so state-by-state ⟨D−⟩(A)=⟨D+⟩(A−1). The determinant sign changes sign when the over and under tangent vectors are exchanged, hence wr⁡(D−)=−3 by [F5]. It follows directly that fD−(A)=fD+(A−1)=t−1+t−3−t−4, and [F6] identifies this with VD−(t). By [F7], the crossing-free one-circle diagram has one state with one circle and writhe 0, so its raw bracket is 1 and [F6] gives VU(t)=1.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

46 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