Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedPipeline-generatedjudge pass (gpt-6-luna)
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.

Holonomic phase residuals control distance to the consistent phase manifold

Statement

Fix a compact regular configuration chart from Regular holonomic phase space and constrained dynamics and a compact momentum set. Use the Euclidean norm on R2d for phase-state differences. Each point of its consistent phase set has a neighborhood Uj with a smooth retraction Πj:Uj→M such that Πj is the identity on Uj∩M and ∥Πj(q,p)−(q,p)∥≤Cj(∥c(q)∥2+∥J(q)M−1p∥2). A finite number of these neighborhoods cover the compact phase set, so one constant works for all of them. In particular, residuals of sizes O(h4) and O(h3) admit a consistent restoration at distance O(h3), uniformly on the chart.

Facts & Assumptions

Given: A compact regular chart, compact momentum set, and the smooth full-row-rank constraint data in the Statement.

[F1]

Regular holonomic phase space and constrained dynamics: Qreg={q∈Q:rank⁡J(q)=m}, A=JM−1JT is uniformly invertible on the compact chart, and (q,p)∈M means q∈Qreg and JM−1p=0.

[F2]

The parametrized implicit function theorem with Ck regularity: an invertible square derivative block gives a unique local Ck graph for a Ck zero-set equation; since c is smooth, its local graph is smooth.

[F3]

The chain rule for total derivatives: D(g∘f)(a)=Dg(f(a))∘Df(a): derivatives of a composite are obtained by composing the derivatives.

Proof

1.1F1F2algebra

At a point of the compact regular chart K⊂Qreg, permute coordinates as q=(x,y) so Dyc is an invertible m×m block. Apply [F2] for each finite regularity order; uniqueness makes these graphs agree locally, so the graph y=ψ(x) is smooth. Write ϕ(x)=(x,ψ(x)) and T(x)=Dϕ(x). Since J(ϕ(x))T(x)=0 and both kernels have dimension d−m, im⁡T=ker⁡J.

2.1F3F4step 1.1algebra

After shrinking to a convex coordinate neighborhood, B(x)=Dyc(x,ψ(x)) remains invertible and ∥B(x)−1(Dyc(x,y)−B(x))∥≤12. Set Rx(y)=c(x,y)−B(x)(y−ψ(x)). Then Rx(ψ(x))=0 and the derivative of B(x)−1Rx has norm at most 12. The mean-value inequality [F4] gives ∥B(x)−1Rx(y)∥≤12∥y−ψ(x)∥. Since B−1c=(y−ψ)+B−1Rx(y), it follows that ∥q−ϕ(x)∥=∥y−ψ(x)∥≤2∥B(x)−1∥ ∥c(q)∥. Compactness makes the constant uniform on a finite chart cover.

2.2F1step 1.1algebra

For qˉ=ϕ(x), put G=TTMT and define pˉ=MTG−1TTp. Positive definiteness of M and injectivity of T make G invertible; its smooth entries and positive determinant give a smooth inverse by G−1=adj⁡(G)/det⁡G. Then J(qˉ)M−1pˉ=0 and TT(p−pˉ)=0. Since ker⁡TT and im⁡J(qˉ)T both have dimension m and the latter is contained in the former, p−pˉ=J(qˉ)Tη for a unique η.

3.1F1F3step 2.1step 2.2algebra∎

The identity J(qˉ)M−1(p−pˉ)=A(qˉ)η and [F1] imply ∥p−pˉ∥≤C∥A(qˉ)−1∥(∥J(q)M−1p∥+∥J(qˉ)−J(q)∥ ∥M−1p∥). The momentum set is bounded and J is locally Lipschitz, so step 2.1 bounds the right side by C(∥J(q)M−1p∥+∥c(q)∥). Thus Π(q,p)=(qˉ,pˉ) has the asserted distance bound and lies in M. If (q,p)∈M, then qˉ=q and the formula for pˉ returns p, so Π is the identity there. By [F3] the coordinate formula is smooth, and it is the identity on the consistent phase set in this neighborhood. Shrink the finitely many neighborhoods so their closures lie in an open regular set; continuity keeps A−1 and the required derivatives uniformly bounded there. A finite subcover gives finitely many such local retractions and a uniform constant.

Depends on

Used by

Dependency tree · two levels

16 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