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 , , be open, and let be a nowhere-zero one-form, with the horizontal paths of A nonsingular Pfaff one-form and its horizontal paths. Assume that every point has a neighborhood with and nowhere-zero satisfying . For every , its horizontal reachability class in is contained in a countable union of compact subsets of with empty interior. Consequently every nonempty open contains a point not horizontally reachable from by any horizontal path in . In particular, if , that point is not reachable by a path contained in . No global first integral or choice axiom is assumed.
Facts & Assumptions
Given: The open Euclidean domain, nowhere-zero form, two-sided finite-piece horizontal paths, and local first integrals in the Statement.
A nonsingular Pfaff one-form and its horizontal paths: a horizontal path is piecewise , with finitely many pieces, and its tangent lies in ; constant paths, reversal and finite concatenation are admissible.
Local flows by a contraction argument and Variational equations and commuting local flows: vector fields have unique local flows, available for both time signs, with inverse flow and differentiable dependence.
The chain rule for total derivatives: and The mean value theorem, as the case of Cauchy's: for continuous on with and differentiable on there is with : composition derivatives obey the chain rule, and a real differentiable function with zero derivative on an interval is constant.
Local graph form at a nonsingular derivative minor: a zero equation with a specified invertible solved-coordinate minor has a local graph. The batch-4 draft carrier and its proof have been inspected; deductions using it remain conditional on that supplier's final acceptance.
A subset of 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.
is countably infinite and Both and are dense in , and every nonempty open subset of is uncountable: the rational reals admit an enumeration and are dense, without a choice hypothesis. Fix an enumeration of them. Encode each length- flow word by its finite string in the finite alphabet of fields, and each rational closed box in by the indices of its endpoints in . For each , only finitely many word-box codes have plus the sum of those indices at most ; 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 . Coordinatewise density and a sufficiently small positive rational radius give such a ball whose closed ball lies in any prescribed nonempty open set.
Heine-Borel in : with the Euclidean metric a subset of is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line, The image of a compact metric space under a continuous map is compact, and so is the image of any compact subset and A compact subset of a metric space is closed and bounded: a closed bounded parameter box is compact; its continuous image is compact and closed in the Euclidean ambient space. These suppliers are choice-free.
and for with the Euclidean metric are complete, componentwise from the Cauchy criterion in : every Euclidean Cauchy sequence converges, coordinatewise from real completeness.
The recursion theorem and The well-ordering principle: a recursively prescribed least natural-number index defines a sequence without arbitrary selections.
Proof
Use the local first integrals in the Statement. Write in the fixed Euclidean coordinates and set and . These globally defined vector fields are horizontal and span at each point, since their matrix is the orthogonal projection onto that kernel. On every neighborhood supplied by the hypothesis, has nonzero derivative, and each -flow preserves as long as its trajectory remains there, by [F3]. Its derivative therefore preserves horizontal tangent vectors there: differentiating gives for horizontal . 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 dependence on durations and initial points wherever the finite composition is defined.
Fix and a neighborhood with as in the hypothesis. Since , apply [L1] to with ambient dimension and target dimension ; after choosing the solved coordinate, its zero set is a local graph plaque through , parameterized by its free coordinates. Let be projection to those free coordinates. Choose of the fields that form a basis of , and for near let be the endpoint at of the successive local flows of these fields for durations . Shrink the open duration domain so all flow segments stay in . Step 1.1 shows that each flow preserves , so ; moreover has the chosen basis as its columns. The differential is therefore an invertible matrix, because is an isomorphism from the tangent space of the graph plaque to its free-coordinate space. Choose an open neighborhood of and shrink so that the target-augmented map , , is defined. It satisfies and its solved block is invertible. Apply [L1] with ambient dimension and target dimension , permuting inputs to so is free and is solved. For every near this gives with ; uniqueness of the graph plaque then says the endpoints fill a relative neighborhood of in . Each is reachable by a finite word of horizontal flows inside . Conversely, a horizontal path preserves the local 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 lies in its finite-word orbit; the reverse inclusion follows because every word is a horizontal concatenation.
For a fixed finite word of length , write for its endpoint map from , 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 , continuity puts the endpoint image in a neighborhood with the first integral from the hypothesis; hence . On a small convex parameter ball, [F3] makes constant. Coordinatewise density in [F5] supplies a closed box with rational endpoints containing in its interior and contained in that ball. Its image under is compact by [F6], lies in one level of , and has empty interior in : a nonempty open subset of that image would make constant on an open set, contradicting . Thus the image is a closed nowhere-dense subset of . 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 for the empty word. This sequence of closed nowhere-dense sets covers , since every duration tuple admits the small box just constructed. No countable atlas or choice of first integrals is needed for the enumeration.
Let be any nonempty open subset of . By [F5], choose an initial rational open ball with . Recursively, for each , choose the first rational ball in the fixed enumeration such that and . Such a ball exists: is closed with empty interior, so is a nonempty open set, which contains a rational ball with closed ball inside it and arbitrarily small radius by [F5]. For , the later centers lie in , so ; hence is Cauchy. By [F7] it has a limit , and each tail of the sequence lies in the closed ball , so for every . These closed balls lie in and satisfy , so . Each selection is the least natural-number index satisfying explicit conditions, so it uses no choice axiom. Since the cover , step 2.1 shows is not horizontally reachable from even by a path in , and therefore not by one in . This proves the asserted conclusion for every nonempty open , using no global first integral or choice axiom.
Depends on
A nonsingular Pfaff one-form and its horizontal paths
Local flows by a contraction argument
Variational equations and commuting local flows
Local graph form at a nonsingular derivative minor
The chain rule for total derivatives:
The mean value theorem, as the case of Cauchy's: for continuous on with and differentiable on there is with
A subset of is connected if and only if it is order-convex, that is, an interval
is countably infinite
Both and are dense in , and every nonempty open subset of is uncountable
Heine-Borel in : with the Euclidean metric a subset of is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line
The image of a compact metric space under a continuous map is compact, and so is the image of any compact subset
A compact subset of a metric space is closed and bounded
and for with the Euclidean metric are complete, componentwise from the Cauchy criterion in
The recursion theorem
The well-ordering principle