Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-14
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.

Moser pullback differentiation equation

Statement

Assume ACω. If ϕt=Φt,0 is the evolution of a smooth time-dependent vector field Xt and ωt is a smooth family of forms, then

ddt(ϕtωt)=ϕt(ω˙t+LXtωt).

If the ωt are closed two-forms and σt is a smooth family of one-forms satisfying ω˙t=dσt, then any solution of ιXtωt=σt satisfies ddt(ϕtωt)=0. When ωt is nondegenerate, that contraction equation has a unique smooth solution Xt.

Facts & Assumptions

Given: ACω, a smooth family ωt, a smooth family σt when the second assertion is used, and a local evolution ϕt generated by Xt.

[F1]

Differentiation along a time-dependent evolution gives the displayed pullback derivative. The supplier's definition of such fields assumes ACω. Differentiation of a pulled-back form along a time-dependent flow.

[F2]

Cartan's formula is LXη=d(ιXη)+ιXdη. Cartan's magic formula.

Proof

technique · direct
1.1

The first formula is [F1] with initial time zero. If dωt=0, [F2] turns its parenthesis into dσt+d(ιXtωt). Thus the Moser equation ιXtωt=σt makes the derivative zero.

F1F2givenalgebra
2.1

For nondegenerate ωt, the smooth bundle map ωt:TMTM is invertible, so the unique solution is Xt=(ωt)1σt. Matrix inversion in local coordinates proves joint smoothness in (t,p).

step 1.1givenalgebra

Depends on

Used by

Dependency tree · two levels

17 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