Alphabeta Math
LemmaStatement: AI-adaptedProof: 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.

A fixed cap product glues by unique transverse flow roots

Statement

Assume Countable Choice ACω (The countable-choice principle used in the foliation pair). Let F be a C2 codimension-one regular foliation of a manifold M, let W be a compact disk, let B:W→L be a C2 map into one leaf L, and let V be a fixed smooth vector field, positively transverse to F, on a neighbourhood of the compact image B(W), with flow Φ. Suppose the cap continuation is finite and holonomy-trivial: finitely many flat foliation boxes cover B(W), a finite cell subdivision of W carries each closed cell into one box, and plaque continuation of a fixed positively oriented C2 transversal τ through B(x∗) along B-paths is independent of the path near t=0, with endpoint Tx(t).

Then there are a uniform open interval J=(−r,r) about 0 and a jointly C2 map P:W×J→M with P(x,0)=B(x), such that every slice P(⋅,t) lies in a single leaf, every track P(x,⋅) is positively transverse to F, and dP−1(TF)=TW=ker⁡(dt). Moreover, if C⊆W is a collar region carrying a C2 trace fC with fC(x)=Tx(tC(x)) for a section tC:C→J and if each point of fC is obtained by projecting along the short V-orbit segment of B(x) used in the construction, then P(x,tC(x))=fC(x) pointwise on C.

Facts & Assumptions

Given: A C2 codimension-one foliation F, a compact disk W with a C2 cap B:W→L, a fixed smooth positively transverse field V near B(W), and a finite holonomy-trivial cap continuation with transported transversals Tx(t) as in the statement.

[F2]

For a C2 field on an open set of Rn the maximal flow is jointly C2, its time slices are local C2 diffeomorphisms, and at a regular point the flow box is C2 (C¹ Euclidean maximal flows, variational dependence and the finite C² upgrade).

[F3]

If g(s,t) is C2 near (s0,t0), g(s0,t0)=0 and gt(s0,t0)≠0, then there is a unique local C2 root t=T(s) with T′=−gs/gt; the same inverse-function argument gives a C2 root depending jointly on additional C2 parameters (C² inverses and scalar return roots).

[F4]

Every finite plaque transport between C2 local transversals of a C2 foliation atlas is a C2 local diffeomorphism germ (C² plaque transport and finite transverse fences preserve C² regularity).

[F5]

The holonomy germ of a leafwise path is independent of the foliation chart chain (The holonomy germ is independent of the foliation chart chain).

[F6]

The standing hypothesis is Countable Choice ACω (The countable-choice principle used in the foliation pair).

Proof

technique · direct
1.1given

Use the fixed smooth field V supplied in the statement. Choose finitely many smaller foliation boxes covering B(W), with compact cores and larger boxes still inside the domain of V. Sign their transverse coordinates so dzj(V)>0 on the larger boxes. No foliation-coordinate field is asserted to be smooth, and V is not replaced.

1.2givenF4F5

The transported transversals. Use the supplied positively oriented C2 transversal τ at B(x∗) and a finite subdivision of W into closed cells each mapped by B into one box of the cover. Along the tree of cells, plaque continuation of τ defines for every cell c a C2 map (x,t)↦Tx(t) on c×J0, for some interval J0 about 0, with Tx(0)=B(x); 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 C2 in (x,t) on each cell and the assigned pieces agree on overlaps. A finite intersection of the finitely many domains of definition gives one uniform interval J0=(−δ0,δ0) on which all these transports are defined.

2.1F2step 1.1

In smooth ambient charts, [F2] supplies the local flow of V; uniqueness glues the finitely many formulas near the compact image B(W). Shrink one common time interval so these flow segments stay in the relevant larger boxes. The flow is jointly C2, and s↦zj(Φs(B(x))) is strictly increasing on each such short segment. Completeness is unnecessary.

3.1step 2.1step 1.2given

Reduction of the root equation to one cell. Fix a cell c contained in a box U with transverse coordinate z, and put G(s,x,t):=z(Φs(B(x)))−ζ(x,t), where ζ(x,t):=z(Tx(t)) is jointly C2 on c×J0. Since B maps c into one plaque of U, the value z(B(x)) is constant on c, and ζ(x,0)=z(B(x)); since Tx(t) is transported along a positive transverse direction, ∂tζ>0 on c×J0. Finally ∂sG(0,x,t)=dz(V)(B(x))>0, because V is positively transverse.

4.1F3step 2.1step 3.1

At (s,x,t)=(0,x,0) the root equation has value zero and ∂sG>0. Apply [F3] there, with x,t 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 ∂sG>0. Uniqueness then pastes these local root functions into one jointly C2 function sc(x,t) on an open neighborhood of each cell times one interval J. Take the finite intersection of all such intervals.

5.1givenF4step 2.1step 1.2step 4.1

On an overlap use a common smaller box around B(x). 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 P(x,t)=Φsc(x,t)(B(x)) jointly C2 on W×J.

6.1step 5.1given

Properties of P. Clearly P(x,0)=Φsc(x,0)(B(x)) and sc(x,0)=0 because G(0,x,0)=z(B(x))−ζ(x,0)=0 and the root is unique; hence P(x,0)=B(x). For fixed t all points P(x,t) lie in the single leaf Lt containing τ(t), since they lie in the leaf containing Tx(t) and each Tx(t) is obtained from τ(t) by plaque continuation; hence every slice lies in one leaf, and ∂xP is tangent to F. For the t-direction, differentiating G(sc(x,t),x,t)=0 gives ∂tsc=−∂tG/∂sG=∂tζ/∂sG>0, so ∂tP=∂tsc⋅V(Φsc(B(x))) is a positive multiple of the positively transverse field V; hence every track is positively transverse and dP−1(TF)=TW=ker⁡(dt).

6.2step 4.1step 5.1

Exact collar factorization. Let C⊆W and fC(x)=Tx(tC(x)) with tC(C)⊆J be as in the statement, and suppose each fC(x) is obtained by projecting along the short V-orbit segment of B(x) used in the construction, so that fC(x)=Φσ(x)(B(x)) for some σ(x) in the same short flow-time domain. Then fC(x) lies in the leaf containing Tx(tC(x)), and on the V-orbit of B(x) the equation z(Φs(B(x)))=ζ(x,tC(x)) is satisfied at s=σ(x); by uniqueness of the root in step 4.1, σ(x)=s(x,tC(x)) and therefore P(x,tC(x))=Φs(x,tC(x))(B(x))=fC(x) pointwise on C.

7.1step 6.1step 6.2F6∎

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

Used by

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