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 fixed cap product glues by unique transverse flow roots
Statement
Assume Countable Choice (The countable-choice principle used in the foliation pair). Let be a codimension-one regular foliation of a manifold , let be a compact disk, let be a map into one leaf , and let be a fixed smooth vector field, positively transverse to , on a neighbourhood of the compact image , with flow . Suppose the cap continuation is finite and holonomy-trivial: finitely many flat foliation boxes cover , a finite cell subdivision of carries each closed cell into one box, and plaque continuation of a fixed positively oriented transversal through along -paths is independent of the path near , with endpoint .
Then there are a uniform open interval about and a jointly map with , such that every slice lies in a single leaf, every track is positively transverse to , and Moreover, if is a collar region carrying a trace with for a section and if each point of is obtained by projecting along the short -orbit segment of used in the construction, then pointwise on .
Facts & Assumptions
Given: A codimension-one foliation , a compact disk with a cap , a fixed smooth positively transverse field near , and a finite holonomy-trivial cap continuation with transported transversals as in the statement.
For a field on an open set of the maximal flow is jointly , its time slices are local diffeomorphisms, and at a regular point the flow box is (C¹ Euclidean maximal flows, variational dependence and the finite C² upgrade).
If is near , and , then there is a unique local root with ; the same inverse-function argument gives a root depending jointly on additional parameters (C² inverses and scalar return roots).
Every finite plaque transport between local transversals of a foliation atlas is a local diffeomorphism germ (C² plaque transport and finite transverse fences preserve C² regularity).
The holonomy germ of a leafwise path is independent of the foliation chart chain (The holonomy germ is independent of the foliation chart chain).
The standing hypothesis is Countable Choice (The countable-choice principle used in the foliation pair).
Proof
Use the fixed smooth field supplied in the statement. Choose finitely many smaller foliation boxes covering , with compact cores and larger boxes still inside the domain of . Sign their transverse coordinates so on the larger boxes. No foliation-coordinate field is asserted to be smooth, and is not replaced.
The transported transversals. Use the supplied positively oriented transversal at and a finite subdivision of into closed cells each mapped by into one box of the cover. Along the tree of cells, plaque continuation of defines for every cell a map on , for some interval about , with ; this uses the finite holonomy-trivial continuation hypothesis. Path independence of the germ away from the basepoint is [F5], and the regularity of each finite transport is [F4], so the assignment is in on each cell and the assigned pieces agree on overlaps. A finite intersection of the finitely many domains of definition gives one uniform interval on which all these transports are defined.
In smooth ambient charts, [F2] supplies the local flow of ; uniqueness glues the finitely many formulas near the compact image . Shrink one common time interval so these flow segments stay in the relevant larger boxes. The flow is jointly , and is strictly increasing on each such short segment. Completeness is unnecessary.
Reduction of the root equation to one cell. Fix a cell contained in a box with transverse coordinate , and put , where is jointly on . Since maps into one plaque of , the value is constant on , and ; since is transported along a positive transverse direction, on . Finally , because is positively transverse.
At the root equation has value zero and . Apply [F3] there, with as parameters, and cover each compact cell by finitely many of the resulting parameter neighborhoods. Shrink the common t-interval and the flow-time bound so every root remains in the short segment where . Uniqueness then pastes these local root functions into one jointly function on an open neighborhood of each cell times one interval . Take the finite intersection of all such intervals.
On an overlap use a common smaller box around . The continuation data assign the same local plaque there, not just the same global leaf: transition of the transverse coordinate sends the label in one chart to the label in the other. For variable x in this overlap the central plaque label is fixed, so the equality of transverse transition germs holds on one neighborhood in x and one short interval in t; finite compact covers of the cell faces give a common interval. Both root points lie on the same short V-segment in this box and have this identical plaque label. Strict monotonicity in step 2.1 therefore gives equal flow times. Since the formulas hold on open cell neighborhoods, [F4] pastes jointly on .
Properties of . Clearly and because and the root is unique; hence . For fixed all points lie in the single leaf containing , since they lie in the leaf containing and each is obtained from by plaque continuation; hence every slice lies in one leaf, and is tangent to . For the -direction, differentiating gives , so is a positive multiple of the positively transverse field ; hence every track is positively transverse and .
Exact collar factorization. Let and with be as in the statement, and suppose each is obtained by projecting along the short -orbit segment of used in the construction, so that for some in the same short flow-time domain. Then lies in the leaf containing , and on the -orbit of the equation is satisfied at ; by uniqueness of the root in step 4.1, and therefore pointwise on .
The construction used finitely many boxes, finitely many cells, finitely many bumps and finitely many local roots, so it makes only finitely many choices; the root and flow theorems of [F2] and [F3] are choice-free, and the standing hypothesis [F6] is not used beyond the pair's interface. This proves the statement.
Depends on
- The countable-choice principle used in the foliation pair
- The holonomy germ is independent of the foliation chart chain
- C² inverses and scalar return roots
- C² plaque transport and finite transverse fences preserve C² regularity
- A manifold bump for a compact set inside an open set
- C¹ Euclidean maximal flows, variational dependence and the finite C² upgrade
Used by
- A closed null fence word has an essential lower endpoint Lemma
- A first saddle lobe admits a collar-fixed center-saddle cancellation Lemma
- A fixed leafwise cap gives a joint transverse product with exact collar data Lemma
- A null simple center frontier supplies the exact cancellation scalar Lemma
- The canonical Jordan cap bundle develops coherently over every positive band Lemma
Dependency tree · two levels
39 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
- Mark Brittenham, Foliations and the Topology of 3-manifolds, class 11 (standard reference, not scraped)
- S. P. Novikov, The Topology of Foliations (complete English translation) (standard reference, not scraped)