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.

Common plaque lifted caps admit nested source-disk inclusions

Statement

For recurrent caps with simple universal-cover boundaries and a common interior plaque patch, one can choose an increasing sequence of source-disk inclusions whose projected cap maps agree on the included disks, even if the projected caps are immersed.

Facts & Assumptions

Given: Recurrent caps with simple universal-cover boundaries and a common interior plaque patch supplied by An infinite cap-center trajectory has recurrent common plaque-interior patches, with the fixed-neighbourhood avoidance of Simple lifted caps avoid the original essential loop and a fixed intrinsic neighbourhood.

[F1]

The in-pair item An infinite cap-center trajectory has recurrent common plaque-interior patches gives one common plaque patch in a leaf B whose lifts lie in the interiors of all sufficiently late caps; the in-pair item Simple lifted caps avoid the original essential loop and a fixed intrinsic neighbourhood gives the avoidance of the original loop γ; the in-pair item The canonical Jordan cap bundle develops coherently over every positive band supplies the lifted Jordan disk regions and their diffeomorphic disk parametrizations.

[F2]

The sibling-pair item lem-finite-chart-surface-normal-forms-supply-jordan-disks-and-torsion-free-groups supplies the Jordan disk in the leaf universal cover and the compact separation of disjoint compact sets in the metric ambient manifold.

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

Fix a late cap Cn and a later cap Cm from the recurrent family. The projected image of Cn is compact and disjoint from the original loop γ by the avoidance clause of [F1], so the two compact sets image⁡(Cn) and γ(S1) have positive distance by [F2]; uniform convergence γt(s)→γ therefore implies that every sufficiently late boundary γt(sm) avoids the entire projected image of Cn. Base both lifted caps in the universal cover of B at the same point of their common interior plaque patch.

2.1F1step 1.1

The Jordan disk regions Δn and Δm overlap at that common point, and ∂Δm is disjoint from Δn because its projection avoids the image of Cn. Any path in the connected disk Δn from the common interior point to another point cannot exit Δm without crossing ∂Δm, so Δn⊆int⁡Δm. The disk parametrizations into Δn and Δm are diffeomorphisms by [F1], so their inverses compose to a C2 embedding hn,m:D→int⁡D on the actual reference C² disk region D of the development satisfying Cn=Cm∘hn,m as projected maps.

3.1F1F2F3step 2.1∎

Fix the recurrence sequence once. At each stage take the least later index whose boundary avoids the preceding compact cap image; step 1.1 guarantees such an index. This is a deterministic recursion on natural numbers, requiring no dependent choice, and produces the required increasing sequence of source-disk inclusions whose projected cap maps agree on the included disks. This is nesting of source disks in one based universal cover, not a claim that the ambient projected images are embedded disks, and the maps hn,m are exactly the base gluing maps needed by the immersed paired-sweep seam lemma.

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