Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedprecheck pass
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.

A primitive pi torus collar has contracting longitude and exhausting plane caps

Statement

On the original Π torus, choose its primitive Π meridian β and a complementary longitude λ. Its one-sided longitude holonomy can be chosen strictly contracting. The collar longitude annuli grow the actual meridian caps, and their iterates exhaust each nearby leaf as a plane with limit set exactly the original torus. The limit set means ambient limits of sequences escaping every intrinsic compact subset of the leaf, equivalently the intersection of closures of tails of a cofinal compact exhaustion.

Facts & Assumptions

Given: The original Π torus leaf L of the present foliation with its primitive Π meridian β and a complementary longitude λ, and the one-sided longitude holonomy H on a common small transversal.

[F1]

The in-pair item A nonzero pi class on a torus has a primitive embedded pi root gives the primitive embedded Π meridian β with identity one-sided holonomy and the embedded fence annulus with embedded disks bounded by each positive boundary; the in-pair item The canonical Jordan cap bundle develops coherently over every positive band supplies the coherent regular cap development from the reference fibre.

[F2]

The in-pair item Compact leaves near a compact reference leaf are one-sheeted collar graphs supplies the finite-generator graph lemma: a compact nearby leaf through a sufficiently small base parameter of a compact leaf is a one-sheeted collar graph, preserving essential transported loops; the sibling-pair item lem-finite-chart-surface-normal-forms-supply-jordan-disks-and-torsion-free-groups supplies the surface-Jordan disk and the complement of a torus in the oriented surface, and The two-dimensional torus T2=(R/Z)2 fixes the torus model.

[F3]

The standing assumption is Countable Choice ACω as recorded for this pair (The countable-choice principle used in the foliation pair).

Proof

technique · direct
1.1F1F2givenconstruct

The meridian β has identity one-sided holonomy by [F1]. Suppose H(t)=t at a sufficiently small positive t. Both generators β,λ then fix t. Construct the nearby graph directly: cut L along these generators, continue the plaque through t along a finite tree of paths to a finite chart cover of the cut polygon, and shrink the base interval once so the finitely many transports and overlap homotopies are defined. Each overlap difference is a word in the two generators; holonomy invariance identifies its transverse transport with that word, which fixes t. Thus the local plaque sections agree, including across the polygon edges. They give a compact C2 graph over L, contained in the leaf through t. Its inclusion is locally open in that intrinsic leaf and its image is intrinsically compact, hence closed; connectedness makes the graph the whole leaf. Collar projection would make its transported meridian essential, contradicting the nullness supplied by [F1]. This existence argument is separate from [F2]'s assertion about leaves already known compact. Hence H has no positive fixed point on one small connected interval. Replacing λ by its inverse if necessary gives 0<H(t)<t; its iterates decrease to zero, since any positive limit would be a fixed point.

1.2F1F2

Finite plaque transport over a cut fundamental polygon of the torus gives the actual collar suspension: β identifies the meridian edges without transverse change and λ identifies the longitude edges by H; the construction uses finitely many compact chart relations, all valid after one common shrink. For each t the longitude circuit thickened by the meridian coordinate gives an embedded leafwise annulus At from βt to βH(t), whose base projection travels once over the complementary torus annulus. Two disjoint embedded null circles in a nonspherical oriented leaf joined by an annulus have nested Jordan disks whose difference is that annulus: otherwise the two disks and the annulus would form an open-and-closed sphere leaf.

2.1F1F2step 1.2

The nesting direction is locally constant in t by compact cap transport and the disjointness of the boundary circles. It cannot be shrinking: if the disk of βH(t) lay inside the disk of βt, iteration would place every βHn(t) inside the compact disk of βt, but these circles approach the original torus, which is disjoint from that disk, contradicting the positive ambient distance between the two compact sets. Hence the disk relation is DH(t)=Dt∪At for every small t.

3.1F1F2F3step 2.1∎

The union of the increasing disks DHn(t) is the entire nearby leaf: given any point of that leaf, join it to a point of Dt by a compact intrinsic path; its ambient image is compact and disjoint from the original compact torus, hence has positive distance from it, while the late boundary circles βHn(t) lie arbitrarily close to the torus and avoid that path, so the path cannot leave the late disk and its endpoint belongs to the union. An increasing union of disks with each compactly inside the next is a plane: choose successive disk and annulus homeomorphisms to concentric disks of radii n and glue them, the exact differences AHn(t) providing the annuli. These annuli lie in collar heights tending uniformly to zero, so they have no limit points away from the original torus, while every point of the torus is approached because their meridian and longitude base projections cover the whole torus; the compact initial disk contributes no intrinsic end-limit points. Thus the leaf limit set is exactly the original torus. The limit-set convention is independent of the chosen exhaustion: any intrinsic compact subset is contained in a sufficiently late disk because the disks form an increasing open cover and compactness selects finitely many whose maximum contains it; intersecting closed exhaustion tails and the escaping-sequence definition agree in the compact metric ambient space by choosing one point from each shrinking rational neighbourhood and tail, using the standing countable choice of [F3].

Depends on

Used by

Dependency tree · two levels

48 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