Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)
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.

Horizontal orbits under local first integrals have empty interior

Statement

Let U⊆Rn+1, n≥1, be open, and let ω be a nowhere-zero C2 one-form, with the horizontal paths of A nonsingular Pfaff one-form and its horizontal paths. Assume that every point has a neighborhood W with S∈C2(W) and nowhere-zero μ∈C1(W) satisfying dS=μω. For every q∈U, its horizontal reachability class in U is contained in a countable union of compact subsets of U with empty interior. Consequently every nonempty open V⊆U contains a point not horizontally reachable from q by any horizontal path in U. In particular, if q∈V, that point is not reachable by a path contained in V. No global first integral or choice axiom is assumed.

Facts & Assumptions

Given: The open Euclidean domain, nowhere-zero C2 form, two-sided finite-piece horizontal paths, and local first integrals in the Statement.

[F1]

A nonsingular Pfaff one-form and its horizontal paths: a horizontal path is piecewise C1, with finitely many pieces, and its tangent lies in ker⁡ω; constant paths, reversal and finite concatenation are admissible.

[F2]

Local flows by a contraction argument and Variational equations and commuting local flows: C2 vector fields have unique local C2 flows, available for both time signs, with inverse flow and differentiable dependence.

[L1]

Local graph form at a nonsingular derivative minor: a C1 zero equation with a specified invertible solved-coordinate minor has a local C1 graph. The batch-4 draft carrier and its proof have been inspected; deductions using it remain conditional on that supplier's final acceptance.

[F4]

A subset of R is connected if and only if it is order-convex, that is, an interval: every interval is connected; it cannot be partitioned into two nonempty relatively open sets.

[F5]

Q is countably infinite and Both Q and R∖Q are dense in R, and every nonempty open subset of R is uncountable: the rational reals admit an enumeration and are dense, without a choice hypothesis. Fix an enumeration (rk)k∈N of them. Encode each length-m flow word by its finite string in the finite alphabet of fields, and each rational closed box in Rm by the 2m indices of its endpoints in (rk). For each N, only finitely many word-box codes have m plus the sum of those indices at most N; ordering these finite levels and then lexicographically enumerates all pairs. The same coding by dimension, center-coordinate indices, and radius index enumerates rational balls in Rn+1. Coordinatewise density and a sufficiently small positive rational radius give such a ball whose closed ball lies in any prescribed nonempty open set.

[F7]

R and Rn for n≥1 with the Euclidean metric are complete, componentwise from the Cauchy criterion in R: every Euclidean Cauchy sequence converges, coordinatewise from real completeness.

[F8]

The recursion theorem and The well-ordering principle: a recursively prescribed least natural-number index defines a sequence without arbitrary selections.

Proof

technique · direct
1.1F1F2F3F6givenconstruct

Use the local first integrals in the Statement. Write ω=∑j=1n+1ωjdxj in the fixed Euclidean coordinates and set w=(ω1,…,ωn+1) and Zj=ej−(ωj/∣w∣2)w. These globally defined C2 vector fields are horizontal and span ker⁡ω at each point, since their matrix is the orthogonal projection onto that kernel. On every neighborhood supplied by the hypothesis, dS=μω has nonzero derivative, and each Zj-flow preserves S as long as its trajectory remains there, by [F3]. Its derivative therefore preserves horizontal tangent vectors there: differentiating S(ϕjt(x))=S(x) gives dSϕjt(x)Dϕjt(x)v=dSxv=0 for horizontal v. The compact image of any finite flow trajectory has a finite subcover by such neighborhoods; a sufficiently fine finite subdivision of its compact time interval puts each subtrajectory in one of them. This follows directly from compactness: otherwise shrinking subintervals failing the subdivision would have a limiting time whose neighborhood contains them. Composing the local derivative identities obtains preservation over the full duration. Local flow uniqueness makes these continuations consistent, and [F2] gives C2 dependence on durations and initial points wherever the finite composition is defined.

2.1F1F2F3F4L1step 1.1algebra

Fix q∈U and a neighborhood W with dS=μω as in the hypothesis. Since dSq=μ(q)ωq≠0, apply [L1] to x↦S(x)−S(q) with ambient dimension n+1 and target dimension 1; after choosing the solved coordinate, its zero set is a local C1 graph plaque P through q, parameterized by its n free coordinates. Let π be projection to those free coordinates. Choose n of the fields Zj that form a basis of ker⁡ωq=ker⁡dSq, and for s=(s1,…,sn) near 0 let E(s) be the endpoint at q of the successive local flows of these fields for durations s1,…,sn. Shrink the open duration domain D⊆Rn so all flow segments stay in W. Step 1.1 shows that each flow preserves S, so E(D)⊆P; moreover DE(0) has the chosen basis as its columns. The differential D(π∘E)(0) is therefore an invertible n×n matrix, because Dπq is an isomorphism from the tangent space of the graph plaque to its free-coordinate space. Choose an open neighborhood Y⊆Rn of y0=π(q) and shrink D so that the target-augmented map H:D×Y→Rn, H(s,y):=π(E(s))−y, is defined. It satisfies H(0,y0)=0 and its solved block DsH(0,y0)=D(π∘E)(0) is invertible. Apply [L1] with ambient dimension 2n and target dimension n<2n, permuting inputs to (y,s) so y is free and s is solved. For every y near y0 this gives s(y) with π(E(s(y)))=y; uniqueness of the graph plaque then says the endpoints E(s(y)) fill a relative neighborhood of q in P. Each is reachable by a finite word of horizontal flows inside W. Conversely, a horizontal path preserves the local S on each short subarc in a first-integral neighborhood by [F3]. Thus near each parameter value its image lies in the relative plaque neighborhood just shown to be reachable by such a finite word. The finite-word orbits are equivalence classes by flow reversal and concatenation, so their preimages along the path are relatively open in its interval domain. By [F4], connectedness of that interval forces one class. Hence every point horizontally reachable from q lies in its finite-word orbit; the reverse inclusion follows because every word is a horizontal concatenation.

3.1F1F2F3F5F6step 1.1step 2.1construct

For a fixed finite word α of length m≥1, write Fα:Oα⊆Rm→U for its endpoint map from q, on the open set of admissible duration tuples. Each duration derivative is a field vector transported by the later flows and is horizontal by step 1.1. Near any s∈Oα, continuity puts the endpoint image in a neighborhood with the first integral S from the hypothesis; hence D(S∘Fα)=0. On a small convex parameter ball, [F3] makes S∘Fα constant. Coordinatewise density in [F5] supplies a closed box with rational endpoints containing s in its interior and contained in that ball. Its image under Fα is compact by [F6], lies in one level of S, and has empty interior in U: a nonempty open subset of that image would make S constant on an open set, contradicting dS=μω≠0. Thus the image is a closed nowhere-dense subset of U. Enumerate the finite-word/rational-box pairs by the finite-level coding in [F5]; for an admissible box whose compact image has empty interior record that image, and otherwise record the empty set. Include the singleton {q} for the empty word. This sequence (Kj) of closed nowhere-dense sets covers O(q), since every duration tuple admits the small box just constructed. No countable atlas or choice of first integrals is needed for the enumeration.

4.1givenF5F7F8step 2.1step 3.1constructalgebra∎

Let V be any nonempty open subset of U. By [F5], choose an initial rational open ball B−1 with B−1‾⊂V. Recursively, for each j≥0, choose the first rational ball Bj=B(cj,rj) in the fixed enumeration such that Bj‾⊂Bj−1∖Kj and 0<rj<2−j. Such a ball exists: Kj is closed with empty interior, so Bj−1∖Kj is a nonempty open set, which contains a rational ball with closed ball inside it and arbitrarily small radius by [F5]. For k>j, the later centers lie in Bj, so ∣ck−cj∣<rj<2−j; hence (cj) is Cauchy. By [F7] it has a limit p, and each tail of the sequence lies in the closed ball Bj‾, so p∈Bj‾ for every j. These closed balls lie in V and satisfy Bj‾∩Kj=∅, so p∈V∖⋃jKj. Each selection is the least natural-number index satisfying explicit conditions, so it uses no choice axiom. Since the Kj cover O(q), step 2.1 shows p is not horizontally reachable from q even by a path in U, and therefore not by one in V. This proves the asserted conclusion for every nonempty open V, using no global first integral or choice axiom.

Depends on

Dependency tree · 2 levels

Sources