Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: Literature-sourcedPipeline-generated
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 ACω (The countable-choice principle used in the foliation pair). Let L=S1 and consider the product foliation of M=S1×R by the circles Lt=S1×{t}. Each leaf is compact and has trivial holonomy: a local transversal is a vertical interval {u}×(t0−ε,t0+ε) and the holonomy of any leafwise loop is the identity. For every leaf Lt0 and every δ>0 the open set Uδ=S1×(t0−δ,t0+δ) is a saturated neighbourhood of Lt0 foliated-diffeomorphic to the product S1×(−δ,δ) with the product foliation, so the conclusion of Trivial holonomy gives a product foliated neighbourhood is realised exactly. The same computation with L=T2 gives compact leaves with infinite fundamental group and trivial holonomy, showing that trivial holonomy does not require finiteness of π1.

Verification

Given: The product foliation of M=S1×R by the circles S1×{t}, a leaf Lt0, and δ>0.

[F1] The product S1×R carries the product smooth structure and the product foliation by the slices S1×{t}, whose leaves are the maximal connected integral manifolds of the kernel of dt (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 S1×{t0} can be taken to be the vertical interval {u}×(t0−ε,t0+ε), 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 L×D, whose leaves are compact and diffeomorphic to L (Trivial holonomy gives a product foliated neighbourhood).

[F4] The fundamental group of the two-dimensional torus is Z2, hence infinite (π1(T2)≅Z×Z, The two-dimensional torus T2=(R/Z)2).

Proof technique: direct verification.

1.1F1F2

(Leaves and their holonomy.) The slices S1×{t} are the maximal connected integral manifolds of the kernel of dt, hence the leaves of the product foliation [F1]. A leafwise loop lies inside a single slice Lt, and following it transports the vertical transversal {u}×(t−ε,t+ε) 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].

1.2F1F3

(Product neighbourhoods.) Fix t0 and δ>0. The set Uδ=S1×(t0−δ,t0+δ) is open, contains Lt0, and is a union of slices, hence saturated; the translation (u,t)↦(u,t−t0) is a foliated diffeomorphism onto S1×(−δ,δ) 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].

2.1F3F4step 1.1∎

(The torus variant.) Replacing S1 by T2 in the same argument gives the product foliation of T2×R: the slices are compact leaves with trivial holonomy by the same computation, while their fundamental group is Z2, which is infinite [F4]. Hence trivial holonomy does not require finiteness of π1, and the same direct product calculation applies to every nonempty connected closed smooth fibre L, independently of its fundamental group.

Depends on

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