Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04
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.

Related complete vector fields have intertwined flows

Statement

Let F:MN be smooth. If complete vector fields X on M and Y on N are F-related, then for every tR,

FΦtX=ΦtYF.

Facts & Assumptions

Given: A smooth map F:MN, complete vector fields X and Y, and their global flows ΦX,ΦY.

[L1]

F-relatedness is equivalent to the intertwining identity on smooth functions (F-relatedness is equivalent to the derivation intertwining law).

[L2]

Complete vector fields have global flows (A vector field is complete if and only if its flow is global).

Proof

technique · direct
1.1

By [L2], the flows ΦX and ΦY are defined for all real times. Fix pM and define α(t):=F(ΦtX(p)),β(t):=ΦtY(F(p)).

L2given
2.1

The curve β is a Y-integral curve through F(p) by definition of the flow. For α, the chain rule encoded in [L1] shows that for every smooth function f on N, ddtf(α(t))=X(fF)(ΦtX(p))=Yf(α(t)), so α is also a Y-integral curve through F(p).

L1step 1.1
3.1

The two curves α and β solve the same global initial-value problem for Y, so uniqueness gives α(t)=β(t) for every t. This is exactly F(ΦtX(p))=ΦtY(F(p)).

step 2.1
4.1

Therefore related complete vector fields have intertwined flows.

step 3.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

13 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