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 recurrent Pi-side leaf identifies a distinct accessibility boundary class

Statement

Assume Countable Choice ACω. Let F be a C² cooriented codimension-one foliation of a closed oriented three-manifold M. Once the original Π supporting leaf L is compact and has no closed transversal, and one recurrent cap leaf B meets the normal base transversal at positive parameters t_n↓0, L lies in the ambient boundary of one distinct mutual-positive-accessibility class.

Facts & Assumptions

Given: A C2 cooriented codimension-one foliation F of a closed oriented three-manifold M, a compact original Π supporting leaf L with no closed transversal, and one recurrent cap leaf B meeting the normal base transversal at positive parameters tn↓0.

[F1]

Under ACω, for the given C2 cooriented codimension-one foliation of a closed oriented three-manifold, Compact leaves near a compact reference leaf are one-sheeted collar graphs supplies the compact-leaf collar and the finite-generator nearby-leaf graph lemma, and A noncompact leaf of a compact C2 foliation meets a positive closed transversal supplies a positive closed transversal through every intrinsically noncompact leaf.

[F2]

The in-pair item An infinite cap-center trajectory has recurrent common plaque-interior patches supplies the recurrent common plaque patch, so the recurrent cap leaf B meets infinitely many positive base parameters tn↓0; the in-pair item A paired immersed cap sweep excludes a positive closed transversal supplies the exclusion of positive closed transversals for the reduced leaves.

[F3]

The foliation component of a leaf is its mutual positive transverse accessibility class, a saturated subset defined through the preorder ⪰F (Foliation components as mutual positive transverse-accessibility classes), and a nonzero Π class is a nonidentity element of the limitwise-nullhomotopy subgroup, hence an essential class in the ordinary leaf fundamental group (Limitwise-nullhomotopy predicate descends to a normal subgroup).

[F4]

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.1F1F2given

Let B be the single recurrent leaf in [F2], containing the base transversal points xn at parameters tn>0 with tn↓0. These points converge in M to x∈L. In a sufficiently small transverse collar from [F1] no positive basepoint is on the embedded compact leaf L, so B≠L. If B were intrinsically compact, its inclusion would have compact image, closed in the Hausdorff manifold M. The limit x would then belong to B, forcing B=L because leaves partition M, a contradiction. Therefore this recurrent leaf B is intrinsically noncompact. No null-displacement assertion for all other nearby leaves is needed.

2.1F1F4givenstep 1.1

The given ambient foliation and [F4] meet the C2, coorientation, closed-three-manifold and countable-choice hypotheses of the noncompact-leaf transversal clause of [F1]. Since B is intrinsically noncompact by step 1.1, that clause gives a positive closed transversal through B, hence a genuine positive return. The specified points xn∈B tend to L by step 1.1.

3.1F3step 2.1

Let S be the mutual-positive-accessibility class of B. It is saturated by [F3]. It is open: the closed transversal of step 2.1 gives a strict positive return from B to itself, finite box transport and small endpoint perturbations of its crossing give strict positive paths from B to every leaf through a small neighbourhood of a crossing and back from each such leaf to B by starting and ending the loop on opposite sides of the perturbed crossing, and transporting these open crossing neighbourhoods along any finite leafwise path gives openness at every point of every leaf in S, a second leaf in S being handled by concatenating its strict paths to and from B with the same perturbed return; no formal reflexive relation is substituted for a strict positive return.

4.1F3givenstep 3.1

S is disjoint from L: if L belonged to S, the strict paths L→B and B→L between distinct leaves would produce a positive closed transversal meeting L after finite plaque-path endpoint alignment and positive corner smoothing, contradicting the no-transversal hypothesis on L. On the other hand the basepoints of the recurrent cap boundaries lie in B⊆S and converge to the original basepoint x∈L, so x∈S‾.

5.1F2F3F4step 4.1∎

The closure of a saturated set is saturated: in a box its leafwise plaque projection preserves membership of nearby saturation, and a finite chain of such boxes along a leaf carries any accumulation at one point to accumulation at every other point. Hence L⊆S‾ by the basepoint convergence of step 4.1, and since S is open and disjoint from L, we get L⊆∂MS: an actual distinct mutual-accessibility component boundary, using neither an ordinary complement component nor an unsupplied full closure-manifold classification. The construction uses one collar, finitely many crossings and paths, hence only the standing countable choice from [F4].

Depends on

Used by

Dependency tree · two levels

37 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