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

Bridge and unknotting numbers of the trefoil

Example

Assume the Axiom of Countable Choice. Let T be the standard right-handed trefoil represented by the closure of the two-strand braid with three positive crossings. In its standard oriented three-crossing projection, label the under-arcs a,b,c so that the crossing triples (o,t,s) of over-arc, target under-arc and source under-arc are (b,c,a), (c,a,b) and (a,b,c), where source and target are determined by the positive in-plane normal to the oriented over-strand. Define bridge number as the minimum number of local maxima over Morse representatives in the fixed standard height on S3, and unknotting number as the minimum number of crossing changes needed to turn a regular diagram of a representative into the fixed standard unknot diagram. Then b(T)=2 and u(T)=1.

Example references

Facts & Assumptions

Given: ACω and the stated oriented three-crossing trefoil diagram.

[A1]

The Axiom of Countable Choice, written ACω. The Axiom of Countable Choice (ACω)

[F1]

Bridge number is the minimum number of local maxima in a Morse representative for the fixed standard height. Bridge number and unknotting number of an oriented knot

[F2]

Unknotting number is the minimum number of crossing changes from a regular diagram of the knot to a diagram of the fixed standard unknot. A regular diagram records its transverse double points, strand orientations and over/under data. Bridge number and unknotting number of an oriented knot, Regular oriented link diagrams

[F3]

A valid finite planar code gives one positive-meridian generator per under-arc and one crossing conjugacy relator per crossing; the crossing-free one-component code has one generator and no relators, and the resulting presentation maps isomorphically to the knot group. Finite planar codes for oriented knot diagrams, Wirtinger presentation from a finite diagram code, Correctness of the Wirtinger presentation

[F4]

At every oriented crossing, if s and t are the source and target under-sides determined by the positive in-plane normal of the over-strand, then mt=mo−1msmo. Local meridian conjugacy at a Wirtinger crossing

[F6]

Every oriented Reidemeister move on a regular diagram is realized by an ambient isotopy; in particular, oriented Reidemeister-II cancellation and Reidemeister-I curl deletion preserve the represented knot. Oriented Reidemeister moves, Each oriented Reidemeister move is realized by an ambient isotopy

[F7]

Under ACω, a knot has bridge number one if and only if it is ambient isotopic to the fixed standard unknot. Bridge number one characterizes the unknot

[F8]

A group presentation ⟨a,b∣r⟩ is the free group on a,b modulo the normal closure of r. Group presentation by generators and relations

[F9]

Fundamental-group multiplication is associative and each loop class has the inverse represented by the reversed loop. Loop classes form the group π1(X,x0) under concatenation

[F10]

A continuous real-valued function on a nonempty compact metric space attains a maximum. A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value

[F11]

The standard unit circle is the unit Euclidean sphere in R2 with its induced Euclidean metric. Euclidean spheres and closed balls as subspaces of Rn

Proof

Given: The standard trefoil diagram and ACω.

1.1F3F4F9givenconstruct

Apply [F4] to the three stated crossing triples, and rearrange using the group laws in [F9]. The resulting relations are a=bcb−1, b=cac−1 and c=aba−1.

1.2A1F1F5givenconstructalgebra

Write z1=x1+ix2 and z2=x3+ix4 on the unit sphere S3⊂C2, so the fixed height is h=Im⁡z2. The curve γ(t)=2−1/2(e2it,e3it), 0≤t<2π, lies on the standard torus ∣z1∣=∣z2∣=2−1/2. If two parameter values give the same point, then both e2i(t−s) and e3i(t−s) equal 1, whence ei(t−s)=1; its derivative is nowhere zero, so it is an embedded circle. As arg⁡z1 makes one turn, arg⁡z2 advances by 3π, so the two points in each z1-meridian disk exchange by three positive half-twists; following the single closed component for two turns gives exactly the closure of the stated two-strand braid. Let Q=2−1/2(111−1) and Us=Qdiag⁡(1,eiπs)Q∗ for 0≤s≤1. Each Us is unitary and hence preserves the norm and has positive real determinant ∣det⁡CUs∣2=1; U0=I and U1(z1,z2)=(z2,z1). Thus [F5] makes this path an orientation-preserving ambient isotopy carrying γ to γ~(t)=2−1/2(e3it,e2it). On γ~, h=2−1/2sin⁡(2t) has derivative h′(t)=2cos⁡(2t) and second derivative h′′(t)=−22sin⁡(2t). Its critical parameters are π/4,3π/4,5π/4,7π/4; the second derivative is negative at π/4,5π/4 and positive at the other two. Hence it is a Morse representative with exactly two maxima and [F1] gives b(T)≤2.

1.3A1F2F6givenconstruct

Switch the middle crossing of the braid diagram. Its braid word becomes σ1σ1−1σ1. The adjacent inverse crossings cancel by Reidemeister II, and the remaining one-crossing closure is a Reidemeister-I curl, which deletes to the standard unknot. Thus one crossing change suffices and u(T)≤1.

2.1F3F8F9step 1.1algebra

Substitute c=aba−1 into a=bcb−1 to obtain a=baba−1b−1, which after right multiplication by ba is aba=bab. Conversely, under this relation, cac−1=aba−1aab−1a−1=abab−1a−1=babb−1a−1=b, so the second crossing relation follows. Eliminating c therefore gives the trefoil group presentation ⟨a,b∣aba=bab⟩.

3.1F8step 2.1algebra

The assignments a↦(12) and b↦(23) respect aba=bab, since both sides map to (13). The two transpositions generate S3, so this presentation surjects onto the nonabelian group S3 and is itself nonabelian.

4.1F3F5step 3.1algebra

The crossing-free code of the standard unknot has one generator and no relators by [F3], so its group is cyclic and therefore abelian. By [F5], ambient isotopy to the unknot would give an isomorphism of this group with the nonabelian group from step 3.1. Thus T is nontrivial.

5.1A1F1F7F10F11F12step 4.1step 1.2algebra

A Morse representative is parametrized by the standard unit circle S1={(x,y):x2+y2=1} from [F11]. This set is nonempty, bounded because x2+y2=1, and closed as the inverse image of {1} under the continuous polynomial (x,y)↦x2+y2; [F12] makes it compact in its Euclidean metric. The height restricted to the circle is continuous, so [F10] gives a global, and therefore local, maximum; thus b(T)≥1. By [F7] and step 4.1, b(T)≠1; step 1.2 gives b(T)≤2. Therefore b(T)=2.

6.1A1F2F6step 4.1step 1.3algebra∎

A sequence with zero crossing changes would leave the represented knot type unchanged by [F6], so it cannot carry the nontrivial knot from step 4.1 to the standard unknot. Hence u(T)≥1; step 1.3 gives the reverse inequality and u(T)=1.

Diagram

The drawing is the closure of the two-strand braid σ13: there are three positive half-twists in the braid region, and the two exterior arcs close the top and bottom endpoints. Switching the middle crossing changes its braid word to σ1σ1−1σ1. The drawing is a planar projection; the two-maximum representative used in step 1.2 is constructed separately on the standard torus in S3⊂C2.

abc

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

102 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