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.
The product foliation near a compact leaf with trivial holonomy
Example
Assume Countable Choice (The countable-choice principle used in the foliation pair). Let and consider the product foliation of by the circles . Each leaf is compact and has trivial holonomy: a local transversal is a vertical interval and the holonomy of any leafwise loop is the identity. For every leaf and every the open set is a saturated neighbourhood of foliated-diffeomorphic to the product with the product foliation, so the conclusion of Trivial holonomy gives a product foliated neighbourhood is realised exactly. The same computation with gives compact leaves with infinite fundamental group and trivial holonomy, showing that trivial holonomy does not require finiteness of .
Verification
Given: The product foliation of by the circles , a leaf , and .
[F1] The product carries the product smooth structure and the product foliation by the slices , whose leaves are the maximal connected integral manifolds of the kernel of (Products of smooth manifolds have a canonical product smooth structure, Regular foliation atlases).
[F2] A local transversal to the product foliation at a point of can be taken to be the vertical interval , and the plaque transport in product coordinates is the identity (Local transversals to a regular foliation).
[F3] Trivial holonomy on a compact leaf gives a fundamental system of product foliated neighbourhoods , whose leaves are compact and diffeomorphic to (Trivial holonomy gives a product foliated neighbourhood).
[F4] The fundamental group of the two-dimensional torus is , hence infinite (, The two-dimensional torus ).
Proof technique: direct verification.
(Leaves and their holonomy.) The slices are the maximal connected integral manifolds of the kernel of , hence the leaves of the product foliation [F1]. A leafwise loop lies inside a single slice , and following it transports the vertical transversal by the identity in product coordinates, since the second coordinate is constant along the slices; hence the holonomy representation of every leaf is trivial [F2].
(Product neighbourhoods.) Fix and . The set is open, contains , and is a union of slices, hence saturated; the translation is a foliated diffeomorphism onto with the product foliation, and these neighbourhoods for shrinking form a fundamental system. This is exactly the conclusion of the product corollary for a compact leaf of trivial holonomy [F3].
(The torus variant.) Replacing by in the same argument gives the product foliation of : the slices are compact leaves with trivial holonomy by the same computation, while their fundamental group is , which is infinite [F4]. Hence trivial holonomy does not require finiteness of , and the same direct product calculation applies to every nonempty connected closed smooth fibre , independently of its fundamental group.
Depends on
- Trivial holonomy gives a product foliated neighbourhood
- Local Reeb stability for compact leaves with finite holonomy
- Regular foliation atlases
- The two-dimensional torus $T^2=(\mathbb R/\mathbb Z)^2$
- Euclidean spheres and closed balls as subspaces of $\mathbb{R}^n$
- Products of smooth manifolds have a canonical product smooth structure
- Local transversals to a regular foliation
- $\pi_1(T^2)\cong\mathbb Z\times\mathbb Z$
- The countable-choice principle used in the foliation pair
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
44 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
- Leiden NCG seminar, Noncommutative Geometry of Foliations (2023 seminar notes; complete PDF) (standard reference, not scraped)
- Danny Calegari, Foliations and the Geometry of 3-Manifolds (Oxford Mathematical Monographs; complete author-hosted PDF) (standard reference, not scraped)