Alphabeta Math
ExampleConstruction: AI-adaptedVerification: 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 isotopy for area forms on a compact surface

Example

Assume ACω. Let ω0,ω1 be positive area forms on a nonempty compact connected oriented surface Σ without boundary. If Σω0=Σω1, then they are related by a Moser isotopy.

Facts & Assumptions

Given: The surface and two forms in the statement.

[F1]

Integration is an isomorphism on top compactly supported de Rham cohomology of a connected oriented boundaryless manifold. Integration is an isomorphism on top compactly supported de Rham cohomology.

[F2]

A cohomologous symplectic path on compact M is trivialized by an isotopy. Moser stability theorem.

Verification

technique · direct
1.1

Compactness makes both top forms compactly supported. Their difference has integral zero, so [F1] makes it exact and therefore [ω0]=[ω1].

F1given
2.1

Relative to any fixed positive area form, write ωi=fiμ with fi>0. Then ωt=(1t)ω0+tω1=((1t)f0+tf1)μ stays positive and hence symplectic, and step 1.1 makes its class constant.

step 1.1givenalgebra
3.1

Apply [F2] to obtain ϕtωt=ω0; in particular ϕ1ω1=ω0. The connected nonempty hypothesis is exactly what [F1] uses.

F2step 1.1step 2.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

22 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