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 non-closed leaf of a codimension-one foliation meets a closed transversal
Statement
Assume (The countable-choice principle used in the foliation pair). Let be a smooth cooriented codimension-one foliation of a smooth manifold , and let be a leaf that is not a closed subset of . There is a smooth embedded circle transverse to that meets .
The circle need not lie in every prescribed open neighborhood of ; the localization claim is false. The stronger finite-compact-barrier version needed in compact ambient manifolds is constructed directly in the global closedness lemma.
Facts & Assumptions
Given: The smooth foliation, coorientation and nonclosed leaf of the statement.
Foliation boxes have plaques at fixed transverse coordinates, and transverse coordinates change only as functions of the old transverse coordinate (Regular foliation atlases).
Points on a leaf can be joined by finite plaque chains and hence by compact leafwise paths (Leaves of a regular foliation).
Coorientation consistently orders transversals and makes plaque transports increasing (Transversely oriented codimension-one foliations).
Proof
Choose and a product box centered at . Infinitely many distinct plaques of meet smaller boxes about ; otherwise their finitely many transverse levels could not accumulate at the level of without including its plaque. Thus a short vertical segment meets twice. Join two such intersections by a compact embedded leafwise arc using F2 and removal of loops. Its intersections with are finite: they are closed in the compact arc and locally isolated by foliation boxes. Taking consecutive intersections along this arc gives a subarc whose interior misses . Orient it from its higher endpoint to its lower endpoint.
Cover this compact arc by finitely many foliation boxes. Compose their plaque transports to obtain a thin foliated strip with central arc coordinate and positive transverse coordinate ; the transverse direction is consistent by F3. On this strip tilt the arc from to with strictly positive derivative in . Choose small enough that its final endpoint is still below its initial endpoint on . Close it by the positive vertical segment between those endpoints. The central arc meets only at its endpoints, so a sufficiently thin strip and sufficiently small endpoint modifications make the closed curve embedded. It crosses where , and every segment is positively transverse. Smooth the two corners inside product boxes. Convexity of the positive transverse tangent half-space preserves transversality, and a sufficiently small modification preserves embedding and the interior crossing of .
The resulting curve is the required smooth embedded transverse circle meeting . The construction uses finitely many boxes, one compact arc and finitely many shrinkings. It makes no arbitrary-neighborhood localization assertion.
Localization counterexample
On , with angle in radians modulo , take the smooth foliation tangent to . The leaf is nonclosed and accumulates on . On the circle-valued function is a first integral. For , the open set contains all of , and lifts on to a real-valued smooth submersion. Along a closed transverse curve in , the derivative of this real-valued first integral would be continuous and nowhere zero, hence have a constant sign, which is impossible for a periodic real function. Thus contains no closed transverse curve at all. Removing the localization clause preserves the actual source theorem and the global finite-barrier proof route.
Depends on
- Regular foliation atlases
- Leaves of a regular foliation
- Embedded leaves need not be closed and leaves need not be embedded
- Smooth embeddings
- Embedded submanifolds and slice charts
- Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right
- The countable-choice principle used in the foliation pair
- Transversely oriented codimension-one foliations
Used by
Dependency tree · two levels
27 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
- Danny Calegari, Foliations and the Geometry of 3-Manifolds (Oxford Mathematical Monographs; complete author-hosted PDF) (standard reference, not scraped)
- Tomasz Mrowka, MIT 18.965 Differential Topology, lecture notes (complete PDF) (standard reference, not scraped)