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

Torus links as closures of two-strand braids

Example

For m∈Z let σ1m∈B2 (The braid group by Artin presentation), and let σ1m^ be its oriented closure (The closure of a geometric braid). Then σ1m^ is the (2,m) torus link: it has gcd⁡(2,m) components, namely two components when m is even and one component when m is odd. In the small cases the closure is the standard picture of the (2,m) torus link: for m=0 it is the two-component unlink, for m=±1 it is the unknot, and for m=±3 it is the trefoil, the two signs giving the two mirror images. Here the unknot is the closure of the trivial one-strand braid, the two-component unlink is the closure of the trivial two-strand braid, and the trefoil is the closure of σ1±3; those closures are the definitions used for these three links on this page.

Facts & Assumptions

Given: An integer m and the finite word σ1m in B2; no choice axiom is assumed.

[F1]

The fixed closure map is φ([(x,t)])=(1−∣x∣2e2πit,x); permutation cycles give its components. Finite words have explicit smooth endpoint-flat models, and the trivial two-braid bounds the specified disjoint latitude-cap disks (The closure of a geometric braid).

[F2]

For B2 the fixed basepoints are q1=−r,q2=r, r=1/12, and a signed elementary half twist rotates them through the corresponding signed half turn; its permutation is (1 2) (The elementary geometric half twist, its support disc, and its opposite, The braid group by Artin presentation).

[F3]

A smooth Euclidean map with nonzero Jacobian determinant has a smooth local inverse, without any choice assumption (Choice-free smooth inverse function theorem in Euclidean space).

Verification

1.1F1F2construct

The literal word model and component count. Write R=1−r2. The finite signed half-turn word has disk strands ±reiΘ(t), where Θ is smooth, Θ(0)=0, Θ(1)=mπ and all positive-order endpoint derivatives vanish. Take Θ=0 at m=0; concatenating the finitely many flattened half-turn angles gives such a Θ for every other m. The two points stay distinct. Its literal smooth closure has z=Re2πit, w=±reiΘ(t) by [F1]. The endpoint permutation is (1 2)m, so there is one component when m is odd and two when m is even, including m=0. This is gcd⁡(2,m), with the positive gcd convention for negative m.

2.1F1F2step 1.1construct

An explicit ambient isotopy to the uniform torus model. Set Δ(t)=mπt−Θ(t). Its values at both ends are zero, its first derivatives at both ends are mπ, and all higher endpoint derivatives agree; hence it is a smooth function on the page circle. Choose a fixed smooth radial cutoff χ(∣x∣2) equal to one near r2 and zero near ∣x∣=1. On V use Hs([(x,t)])=[(eisχ(∣x∣2)Δ(t)x,t)]. Its inverse rotates by the negative angle, since ∣x∣ is unchanged. It is a smooth isotopy, and through the explicit φ it extends by identity across the axis because the cutoff is zero near the disk boundary. It preserves orientation as a smooth path of diffeomorphisms starting at identity. At s=1 the curve is exactly z=Re2πit, w=±reimπt. For odd m, concatenate its two strands with parameter u∈R/2Z; this gives z=Re2πiu, w=reimπu, with winding pair (2,m) after parameter u/2. For even m, each strand is a circle with winding pair (1,m/2) and the two are disjoint. These are the standard torus curves T(2,m), including the stated component count. No generic continuous-braid smoothing theorem or Markov-preservation assumption is used.

3.1F1F3step 2.1construct

The two one-crossing oriented unknots without Choice. For m=ϵ=±1, use the chart of S3∖{w=0} with θ=arg⁡w and ξ=ze−2ϵiθ. Its inverse is (ξ,θ)↦(ξe2ϵiθ,1−∣ξ∣2eiθ), so it is explicitly Dξ∘×S1. The curve from step 2.1 has ξ=R constant. Move this disk point along the real segment from R to 0 by finitely many small cutoff translations Fs(x)=x+sη(x)v, with compact support in Dξ∘ and ∥Dη∥∞∣v∣<1. A fixed smooth bump and a sufficiently fine finite subdivision suffice because that compact segment has positive distance 1−R from the boundary. The inverse is the unique limit of xk+1=y−sη(xk)v, starting at x0=y: successive differences are bounded by a geometric sequence with ratio at most ∥Dη∥∞∣v∣<1, so the explicit sequence converges and its fixed point is unique. The Jacobian has determinant 1+sDη⋅v>0; [F3] makes the already constructed inverse smooth locally and hence globally. Each map is identity outside its compact interior support, so gives a disk diffeomorphism. Compose these finitely many disk-map families with the same parameter s; the finite smooth composition starts at identity and at s=1 sends R to 0. Its product with the unchanged θ extends by identity across {w=0}, since ∣ξ∣→1 there. This ambient isotopy takes the curve to (0,eiθ). The explicit unitary rotation (z,w)↦(cos⁡a z+sin⁡a w,−sin⁡a z+cos⁡a w), 0≤a≤π/2, then takes it to the trivial one-braid circle (eiθ,0). For ϵ=1 its orientation is already the positive page orientation. For ϵ=−1 reverse that circle's negative angular orientation using (z,w)↦(z‾,w‾); this map is the endpoint of the explicit π rotation in the real plane of the two imaginary coordinates, an orientation-preserving path in SO(4). Thus both signs give the oriented unknot. Every construction is explicit or a finite selection; no countable choice is used.

4.1F1F2step 1.1step 2.1step 3.1∎

The unlink, trefoils and conclusion. At m=0 step 1.1 is the literal trivial two-braid closure, whose explicit disjoint spanning disks are [F1]. At m=±3, step 2.1 gives the standard (2,±3) torus knots, the trefoils named in the Statement. The map (z,w)↦(z,w‾) changes m to −m and reverses the ambient orientation, so the two are mirrors. Steps 1.1-3.1 give the component formula and both one-crossing unknots, and the coordinate curves verify T(2,m) for every integer m.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

28 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