Alphabeta Math
TheoremStatement: Literature-sourcedProof: 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.

Novikov's Reeb component theorem

Statement

Assume Countable Choice ACω. Let F be a C2 transversely oriented codimension-one foliation of a closed oriented 3-manifold M. If either (a) some leaf L of F has non-injective inclusion-induced homomorphism π1(L)→π1(M), or (b) some closed transversal γ:S1→M is null-homotopic in M, then F contains a Reeb component (Reeb components of a codimension-one foliation). Equivalently, a Reebless C2 transversely oriented foliation of a closed oriented 3-manifold has all leaves π1-injective and all closed transversals essential (cor-reebless-leaves-are-pi-one-injective-under-novikov-hypotheses).

Facts & Assumptions

Given: A C2 transversely oriented codimension-one foliation F of a closed oriented three-manifold M, and either alternative (a) or (b) of the statement.

[F1]

A compressible leaf, that is one whose inclusion-induced homomorphism π1(L)→π1(M) is not injective, yields a vanishing cycle (A compressible leaf yields a vanishing cycle, The homomorphism on fundamental groups induced by a pointed continuous map, Vanishing cycles of a codimension-one foliation).

[F2]

A closed transversal that is null-homotopic in M yields a vanishing cycle (A null-homotopic closed transversal yields a vanishing cycle).

[F3]

A vanishing cycle produces a compact leaf L1 which bounds a Reeb component: there is a compact saturated submanifold R diffeomorphic to D2×S1 with ∂R=L1, every interior leaf a plane, foliated-homeomorphic to the standard Reeb component (A nonzero limitwise-nullhomotopy class yields a compact boundary leaf, The compact leaf produced by a vanishing cycle bounds a Reeb component, Reeb components of a codimension-one foliation).

[F4]

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.1F1F2given

In branch (a) [F1] supplies a vanishing cycle from the non-injective leaf inclusion; in branch (b) [F2] supplies a vanishing cycle from the null-homotopic closed transversal. The two branches are independent and cover the two hypotheses of the theorem.

2.1F3step 1.1

Either vanishing cycle, together with its leafwise family and characteristic structure, satisfies the hypotheses of the compact-leaf-and-Reeb-component result [F3]: applying A nonzero limitwise-nullhomotopy class yields a compact boundary leaf produces a compact boundary leaf L1, and applying The compact leaf produced by a vanishing cycle bounds a Reeb component produces a compact saturated solid torus R with ∂R=L1 whose foliation is foliated-homeomorphic to the standard Reeb model, so R is a Reeb component of F in the sense of the definition.

3.1F3F4step 2.1∎

Therefore both alternatives (a) and (b) force the existence of a Reeb component; equivalently, a Reebless C2 transversely oriented foliation of a closed oriented three-manifold has all leaf inclusions π1-injective and all closed transversals essential, the equivalence being the contrapositive of the two alternatives. The extra Π-side limit-set clause of the Reeb-component construction is unnecessary for this existence conclusion, and the proof consumes only the two branch suppliers, one vanishing-cycle chain and the standing countable choice from [F4].

Depends on

Used by

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