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.
An involutive local frame can be reduced to one field plus commuting transverse fields
Statement
Let be an involutive rank- distribution on , and let be a local frame near with . Then, after shrinking the neighborhood, there exist local sections such that
- is a local frame of , and
- each is tangent to the flow-box slices for , and
- for .
Facts & Assumptions
Given: An involutive rank- distribution and a local frame near with .
Shrink to a flow-box neighborhood for .
Proof
By the flow-box theorem there are local coordinates [given] centered at in which . Shrinking if necessary, write and define Then each is tangent to , has no -component, and still form a local frame of .
Because is involutive, each bracket is tangent to [given] . It also has no -component, since and has none. Therefore there are smooth functions such that For each fixed transverse coordinate, solve the matrix ODE where . After shrinking again, the solution matrix is smooth and invertible.
For , set . Because [given] the are invertible linear combinations of , the fields form a local frame of . Using the Leibniz rule for brackets with function coefficients and the differential equation for , one gets Hence each commutes with .
Therefore, after shrinking the neighborhood, there is a local frame [given] of with for all .
Depends on
Used by
Dependency tree · two levels
18 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
- Will J. Merry, Differential Geometry (standard reference, not scraped)