Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generated
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.

Reducing-move peaks can be lowered to the four-band case

Statement

Assume AC. Consider a finite reducing sequence with height-zero endpoints and strictly positive interior diagrams. An empty reducing portion needs no replacement. Every nonempty such portion may be replaced by a path of strictly smaller maximum height, or reduced to irreducible interior peaks supported by at most four bands of parallel Seifert circles, arranged as in Figures 7 and 8 of the source. The replacement may include finite height-zero ordinary Markov exchange portions; its remaining reducing content is split at height-zero diagrams.

Facts & Assumptions

Given: AC, a finite sequence whose endpoints have height zero, whose interior diagrams have strictly positive height, and whose consecutive diagrams are related by a reducing move or its inverse. For a nonempty reducing portion let H be its maximum height; the empty portion requires no replacement.

[F1]

The height is a nonnegative integer, a reducing move lowers it by exactly one, its inverse raises it by one, and a height-zero diagram can be put in closed-braid form by sphere isotopy and a choice of planar chart (A reducing move lowers the height by one, Coherence of Seifert circles and the height of a diagram, A height-zero diagram represents a closed braid).

[F2]

A reducing move is realized by a reducing arc lying in a defect region and joining an incoherent pair of Seifert circles; a local maximum (a peak) of the sequence is a triple Y(r),Y^,Y(s) of consecutive diagrams with two reducing arcs αr,αs of Y^, which may be assumed transverse and meeting minimally (Defect regions, reducing arcs and the Yamada-Vogel reducing move).

[F3]

Two disjoint reducing arcs whose moves involve three or four distinct Seifert circles commute: the moves may be performed in either order with the same result. If the two arcs involve the same two Seifert circles, the moves form a non-commuting pair, and after one is performed the other is no longer a reducing move (Defect regions, reducing arcs and the Yamada-Vogel reducing move).

[F4]

A region of the Seifert picture with at least three exposed Seifert circles is a defect region, and therefore supports a reducing arc (A positive-height diagram has a defect region).

[F5]

Type I moves and braid-like II and III moves can be replaced by height-zero braid isotopies or Markov moves together with reducing content. Between height-zero portions, split the reducing content into sequences whose intermediate diagrams have positive height and whose endpoints have height zero (Braid-like moves can be moved to height zero).

[F6]

If P,Q∈Bn−1 and t=σn−1, PtQt−1 and Pt−1Qt differ by an explicit finite sequence of ordinary signed Markov moves and conjugations (Ordinary exchange moves are Markov sequences, Markov conjugation and stabilization moves).

[F7]

The fixed real base configuration is symmetric; positive generators are the anticlockwise geometric half twists. The geometric product runs its rightmost factor first. The Artin map to geometric braids is choice-free and surjective and, under AC, an isomorphism (Geometric braids in the disc with setwise endpoints, The elementary geometric half twist, its support disc, and its opposite, Stacking of geometric braids is a well-defined associative operation on isotopy classes, The Artin presentation surjects onto the geometric braid group, The Artin presentation is complete for geometric braids).

Proof

technique · direct
1.1F1F2algebra

Intersection numbers of the two arcs at a peak. Let Y(r),Y^,Y(s) be a peak with arcs αr,αs, assumed transverse and meeting minimally, and let n=∣αr∩αs∣. If n≥2, then smoothing out one or more of the intersection points produces a reducing arc αr′ with the same endpoints as αr that is disjoint from αr and meets αs in fewer than n points; inserting r′ at the peak replaces it by the two peaks Y(r),Y^,Y(r′) and Y(r′),Y^,Y(s), both of the same height h(Y^). Repeating this finitely many times we may assume that the two arcs of every peak meet in at most one point, the maximum height being unchanged because insertion only replaces one peak by two peaks of equal height.

1.2F1F2F6F7construct

Height-one peaks with their actual crossing choices. Exactly one pair C1,C2 is incoherent, and all other e=n−2 circles are coherent with both and with each other. In a chart where C1,C2 bound their common annulus, their orientations are opposite. An additional circle cannot lie in either end disk: coherence with that end circle and with the other would impose opposite orientation requirements. It also cannot be essential in the common annulus, since its two neighbouring annuli would likewise impose opposite requirements. Thus its bounded disk lies in the common annulus and misses C1,C2. Coherence with either fixes its orientation, so two such additional circles cannot be side by side: they would have equal planar orientations and be incoherent. Consequently the additional circles form one coherent nested band, possibly empty. This proves the inside/outside-band description used by the survey's height-one lemma, printed p.24, without a connectedness assumption. Cut its outside region along the two disjoint reducing arcs. On each side the signed crossing strips involve the coherent band and one of C1,C2 only: a strip cannot join the incoherent pair. Reading the two sides gives arbitrary boxes P,Q on the core e strands and one selected strand each. After either reduction choose the cut before the P side in the frame where the two selected single-circle ports are the first two inner ports and the coherent e-band is outside them. Thus n=e+2, both arbitrary contexts act on the last n−1 ports, and the two new crossings are σ1 and its inverse. The physical records are Pσ1Qσ1−1 and Pσ1−1Qσ1. To put their supports in [F6], use an actual old-strand conjugation. The distinct paths eπiuqj, 0≤u≤1, form a geometric braid δ because the base configuration in [F7] is symmetric. For any braid path γ, the square eπiuγ(t) has the same δ along its two endpoint edges and gives Rπ(γ)=δγδ−1 in the rightmost-first convention. It sends the positive ith half twist to the positive (n−i)th, since the disk rotation preserves orientation. By the surjection and completeness in [F7], an Artin word for δ therefore satisfies δσiδ−1=σn−i. Hence its old-strand conjugation takes the two last-supported boxes to first-n−1-supported boxes and σ1 to t=σn−1. Rename these conjugated contexts P,Q. The two resulting records are exactly PtQt−1 and Pt−1Qt, with signs retained. If the other reducing arc starts on the Q side, its record is QtϵPt−ϵ, cyclically conjugate to Pt−ϵQtϵ. These formulas retain every original signed strip in its whole core-plus-one box, rather than fixing the peak's given crossing choices. Isotopic arcs bounding an empty strip give the same pair of records with one context empty. If records are taken chronologically, reverse them for the rightmost-first product: the two actual records are cyclically conjugate to rev⁡(P)t−1rev⁡(Q)t and rev⁡(P)trev⁡(Q)t−1, so [F6] applies in reverse direction with the same supports. Therefore the height-one peak is replaced at height zero by conjugations and, when the choices differ, the ordinary exchange sequence [F6]. At e=0, P=Q=1 and both records are 1, so no strand change is needed. This is the source's equivalence of the resulting diagrams, not literal equality or an appeal to the later four-band or Markov theorem.

2.1F2F4step 1.1algebra

Peaks whose arcs meet once. Now let ∣αr∩αs∣=1. If some reducing arc αt is disjoint from both αr and αs, then inserting t at the peak replaces it by two peaks, each carrying a disjoint pair of arcs. Suppose no third arc of the defect region supporting αr and αs is disjoint from both; then the region has the single arrangement exhibited in the source (survey, printed pp. 21-22) and the two arcs act on four distinct Seifert circles. Consider the region R outside the circles of the defect region and the signed arcs joining them. If R contains a Seifert circle, then some region of the picture has three exposed Seifert circles, hence is a defect region by [F4], and it supports a reducing arc disjoint from both αr and αs, a contradiction. If R contains no Seifert circle, then it contains no signed arc between its four exposed circles either, and a pair of diagonally opposed circles can be joined by a reducing arc inside R, again disjoint from both. Hence in every case a third disjoint arc exists, insertion is possible, and the peak may be replaced by two peaks with disjoint pairs of arcs; the height is unchanged.

3.1F1F2F3step 2.1algebra

Commuting pairs, insertions and peaks of height one. Let a peak have disjoint arcs αr,αs. If their moves involve three or four distinct Seifert circles they form a commuting pair: performing the two reducing moves in either order gives the same diagram Y′ with h(Y′)=h(Y^)−2, so the peak is replaced by the valley Y(r),Y′,Y(s) and is removed, and any new peaks created in this replacement lie at levels strictly below h(Y^). If the arcs involve the same two Seifert circles, the pair is non-commuting; call the peak irreducible if in addition no reducing arc disjoint from both is available that involves a Seifert circle other than those two. If such an arc αt exists, insertion at the peak replaces it by two peaks whose pairs of arcs involve at least three circles, hence are commuting pairs, and each is removed by a valley, so the peak is replaced by content of strictly smaller height. The height-one case is verified separately; its two diagrams need not be literally equal. Summarizing: after finitely many replacements, either the maximum height of the sequence strictly decreases, or every remaining peak is irreducible.

4.1F2F3step 3.1algebra

Irreducible peaks have at most four bands. Let Y(r),Y^,Y(s) be an irreducible peak of height at least two, let C1,C2 be its two Seifert circles, and for i=1,2 let Di be the disk bounded by Ci that contains neither αr nor αs. The complement of D1∪D2∪αr∪αs in the sphere has two components; by irreducibility neither component contains a defect region, since such a region would support a reducing arc disjoint from αr,αs and involving a further circle. Hence the Seifert circles in either component, if any, form a band of mutually coherent parallel circles oriented oppositely to C1 and C2, and the same argument applied inside D1 and D2 shows that each Di contains no defect region either, so Ci is the outer circle of a band. Therefore the diagram consists of at most four bands of parallel Seifert circles, joined by braids on the sums of the band multiplicities, with bands of multiplicity zero allowed, exactly the configuration classified by the source (survey, printed pp. 23-24; Traczyk's Figures 7 and 9).

5.1F1F5step 1.1step 1.2step 2.1step 3.1step 4.1∎

Conclusion on the source's reducing portions. If the reducing portion is empty, nothing is required. Otherwise its height-zero endpoints force each maximal positive height to occur at interior peaks. The finite arc-intersection insertions, commuting valleys and height-one exchange comparisons of the preceding steps either remove all peaks at the current maximum height or leave only irreducible peaks of the four-band shape classified in step 4.1. Height-zero exchange portions are ordinary Markov paths by step 1.2; split the remaining reducing content at their height-zero diagrams, as in [F5]. Thus the maximum height decreases when no irreducible peak remains, and otherwise the stated special configuration is reached. All replacement paths retain the original endpoints and the given first reducing choices. AC is inherited from the coherence/reducing and geometric-completeness suppliers.

Depends on

Used by

Dependency tree · two levels

58 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