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.

An infinite cap-center trajectory has recurrent common plaque-interior patches

Statement

Suppose the cap family has an infinite negative-transverse center trajectory q(s), synchronized parameters t(s)↓0, and the preceding fixed-neighborhood avoidance. Then after adjusting recurrence times there is one leaf B and one fixed plaque patch in B whose lifts lie in the interiors of all sufficiently late caps.

Facts & Assumptions

Given: A cap family with an infinite negative-transverse center trajectory q(s), synchronized parameters t(s)↓0, and the fixed-neighbourhood avoidance of Simple lifted caps avoid the original essential loop and a fixed intrinsic neighbourhood.

[F1]

The in-pair item Simple lifted caps avoid the original essential loop and a fixed intrinsic neighbourhood provides a fixed intrinsic neighbourhood S′ of the original loop γ in its leaf that every late cap projection avoids; the in-pair item The canonical Jordan cap bundle develops coherently over every positive band supplies the coherent cap development with the lifted Jordan disks and their centered based coverpoints.

[F2]

A C2 Euclidean field has C2 flow boxes with uniform nonzero transverse derivative bound on a compact box (C¹ Euclidean maximal flows, variational dependence and the finite C² upgrade), and a C2 scalar equation with nonzero derivative has a unique local C2 root, which makes the small-time adjustment below continuous and monotone (C² inverses and scalar return roots).

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

Compactness of the ambient manifold and countable choice give an accumulation point z of the sequence q(s) as s→∞. Choose a small box around z in which the transverse derivative of the fixed negative flow has a uniform nonzero bound. If q(sn)→z, adjust each sn by a time tending to 0 so that the adjusted point lies on the central plaque through z: solve the strictly monotone transverse-coordinate equation by the intermediate value theorem [F2]. The infinite trajectory permits both small time directions once sn is large, and the adjusted points all lie in the same leaf B by construction.

2.1F1step 1.1

The accumulation point z cannot lie on γ. Otherwise choose the box inside the intrinsic neighbourhood S′ of the original leaf provided by the avoidance hypothesis; the same small-time adjustment places q(sn) on its central original-leaf plaque inside S′, contradicting that q(sn) is in the interior of a cap. Hence z∉γ(S1), and a fixed smaller box about z has closure disjoint from γ.

3.1F1F2F3step 2.1∎

Every late boundary γt(sn) avoids that smaller box by uniform convergence to γ, and each adjusted cap-centre is interior to its Jordan lifted disk by [F1]. In the lifted central plaque rectangle containing that centre, membership in the disk interior cannot change along a path without crossing the disk boundary; since the entire projected rectangle is boundary-free and connected, it lies inside the lifted disk. Shrinking to a fixed smaller rectangle around z and taking n sufficiently large gives one common intrinsic plaque patch in B whose lifts lie in the interiors of all sufficiently late caps. The argument concerns actual central-plaque hits, rather than replacing ambient convergence by an assertion that the convergent points already share a leaf, and it uses one box, one rectangle and the cited flow and root facts, hence only the standing countable choice from [F3].

Depends on

Used by

Dependency tree · two levels

30 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