Alec Kriebel

A credited finiteness deduction for restricted boundary-twist factorizations

A surface can admit many ways to express a twist near its boundary as a sequence of positive twists along interior curves. This note gives a credited deduction that, for a fixed genus and the intersection restriction below, only finitely many such ordered factorizations remain after changing all curves by the same boundary-fixing homeomorphism.

Read the paper

Open the original PDF · Download the PDF · Zenodo record and DOI · BibTeX

The unchanged PDF is printed “Version 1.0 preparation candidate, 14 October 2026 UTC.” Its pending-review wording belongs to that archived edition. The record lists version 1.0 and publication on 14 October; the deposit was created on 17 October 2026 UTC.

The result and its conventions

Fix an integer g ≥ 1 and an oriented compact connected surface Sg,1 with one boundary circle δ. Maps preserve orientation and fix the boundary pointwise; isotopies fix it pointwise too. Each factor is a positive Dehn twist about an unoriented interior simple closed curve that is not null-homotopic. Repeated curve classes are permitted and count repeatedly toward the length.

tc₁ ··· tcₙ = tδ, with i(cj, ck) ≤ 1 for every pair j, k.

Here i denotes geometric intersection: the minimum number of crossings in the two isotopy classes. The target is one positive boundary twist. Boundary-parallel curves are allowed. Two ordered words are identified only by simultaneous conjugation, meaning that one mapping class is applied to every curve in the sequence.

There are finitely many such simultaneous-conjugacy classes. Consequently, the possible lengths have a finite maximum M(g), and some admissible word attains it:

4g(2g + 1) ≤ M(g) < ∞, with M(1) = 12 and M(2) = 40.

A peripheral, or boundary-parallel, factor appears only in the singleton factorization tδ. Every other admissible word uses only nonseparating curves. The values 12 and 40 are deductions from prior work with this convention bridge stated.

This gives a negative answer to the separately printed restricted arbitrary-length clause attributed to Smith in Wajnryb’s chapter of Farb’s Problems on Mapping Class Groups and Related Topics (printed page 126, PDF page 133). The preceding unrestricted question and the surrounding classification questions have different scopes.

Why finiteness follows

The argument combines two finite structures. First, the distinct curve classes in a factorization form its support. The intersection restriction bounds support size by 22g(3g − 2) + 1: curves in the same mod-two homology class must be disjoint, and a disjoint nonperipheral collection has at most 3g − 2 members. Marked ribbon graphs, together with the topology of their complements and the distinguished boundary, then give only finitely many possible support orbits. This counts distinct curves; it does not bound how often a curve can repeat.

Second, for any fixed finite curve alphabet, only finitely many positive words can have the prescribed product. Positive essential twists on the bordered surface cannot form a nonempty identity product. Inserting letters into a shorter word produces a product of conjugated positive letters, so two different words with the same value cannot be related by subsequence. Higman’s finite-alphabet lemma then rules out an infinite collection of equal-value words. The note also derives this finite-alphabet conclusion from Cossu–Tringali’s factorization theory, using a normal ambient positive cone and nonempty atomic expansions. The target need not be central in that group lemma; centrality of tδ is used when transporting words between surface supports.

The classical even-chain relation (ta₁ ··· ta₂g)4g+2 = tδ supplies length 4g(2g + 1), so the finite set of lengths is nonempty. Positivity excludes peripheral factors beyond the singleton. A separating factor would be disjoint from all the supporting curves; capping the boundary and applying Smith’s invariant-essential-curve obstruction rules it out. Only after this exclusion does the nonseparating length convention of Baykur–Monden–Van Horn-Morris apply to the low-genus upper bounds.

Scope and credit

This is a credited deduction and exposition. Cossu–Tringali, Corollary 4.13 of their final v3 preprint, supplies the generic finite-alphabet corollary. The support methods build on Juvan–Malnič–Mohar and Malestein–Rivin–Theran. The marked disconnected bordered-surface construction adapts Cahn–Fanoni–Petri’s ribbon/complement method. Honda–Kazez–Matić, Smith, the classical chain relation, Higman, and Baykur–Monden–Van Horn-Morris supply the other credited inputs. No new generic method or first-discovery claim is made.

Exact M(g) for g ≥ 3, explicit numerical upper formulas, an effective exhaustive-enumeration stopping criterion, extremizers, and Hurwitz, positive Artin, T-move or A5/D6 classifications remain unresolved in this work. The higher-genus unrestricted infinite-length results do not impose the pairwise intersection restriction. Fixed genus, positivity, non-null-homotopic curves, one boundary twist and pointwise boundary fixing are substantive hypotheses.

The note does not certify historical novelty, exact application priority or worldwide current-open status. Its cited preprint versions are identified in the manuscript; a complete journal-body read of Higman’s article or Smith’s journal edition was unavailable in its bounded source audit. The finite-alphabet exposition is self-contained, and the external geometric and gauge-theoretic inputs remain credited premises.

Original manuscript abstract

Fix an oriented compact surface of genus g≥1 with one boundary circle, and fix that boundary pointwise in both maps and isotopies. Ordered positive factorizations of its single boundary twist, along non-null-homotopic simple closed curves with pairwise geometric intersection at most one, have finitely many simultaneous-conjugacy classes. Repetitions are permitted. Their lengths therefore have a finite attained maximum M(g), with 4g(2g+1)≤ M(g); credited low-genus deductions give M(1)=12 and M(2)=40. This is a credited finiteness deduction and exposition: the finite-alphabet group lemma is a verified corollary of Cossu–Tringali's factorization theory, and the support and embedding mechanisms are prior curve-system and ribbon-surface methods, with the marked bordered adaptation supplied here. It answers negatively the separately stated restricted arbitrary-length clause attributed to Smith in Wajnryb's chapter. Exact M(g) for g≥3, explicit upper formulas, a stopping criterion, extremizers and finer classifications remain unresolved in this work. Historical novelty and exact priority are not certified.

Original files and citation

The original files are available here and from Zenodo, in the record’s order:

  1. preprint.pdf (84,937 bytes) · Zenodo original PDF
  2. verification_kit.zip (18,251,309 bytes) · Zenodo original ZIP

Kriebel, Alec. A credited finiteness deduction for restricted boundary-twist factorizations. Version 1.0, 14 October 2026. doi:10.5281/zenodo.23430927. Download BibTeX.

The authored note and authored verification-kit materials, including authored code, use Creative Commons Attribution 4.0 International. Retained historical records and third-party bibliographic material keep their original attribution and rights.

Status and collaboration

Extensive AI assistance was used in mathematical and source checking, writing, code and package preparation. The preprint has undergone internal AI-assisted proof review. It is unrefereed, has no external human peer review and is not formally certified. Finite computational controls support error detection; the universal theorem rests on the written argument and its credited mathematical inputs.

Independent verification, substantive mathematical extensions and journal work would be useful contributions. Collaboration and any authorship would reflect actual scholarly contributions.