PropositionStatement: 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.

A graph of a one-form is Lagrangian exactly when the form is closed

Statement

Assume ${A C}_{ω}$ . For $α \in Ω^{1} (Q)$ , its graph $s_{α} (Q) \subset (T^{*} Q, - d λ)$ is Lagrangian if and only if $d α = 0$ .

Facts & Assumptions

Given: ${A C}_{ω}$ , a smooth $n$ -manifold $Q$ , and $α \in Ω^{1} (Q)$ .

[A1]

${A C}_{ω}$ is countable choice. The Axiom of Countable Choice ( ${A C}_{ω}$ ).

[F1]

The canonical form on $T^{*} Q$ is $ω_{c a n} = - d λ$ . The canonical cotangent two-form is symplectic.

[F2]

A submanifold is Lagrangian when its tangent spaces are Lagrangian. Isotropic, coisotropic, symplectic, and Lagrangian submanifolds.

[F3]

An isotropic half-dimensional subspace is Lagrangian. Equivalent characterizations of Lagrangian subspaces.

[F4]

Exterior differentiation commutes with pullback. The exterior derivative commutes with pullback.

Proof

technique · direct

1.1

Since $π \circ s_{α} = {id}_{Q}$ , the tautological formula gives $s_{α}^{*} λ = α$ . Therefore [F1] and [F4] give $s_{α}^{*} ω_{c a n} = - d α$ .

F1F4algebra

2.1

The graph section is an embedding and its image has dimension $n$ , half of $\dim T^{*} Q = 2 n$ . By [F2]--[F3], it is Lagrangian exactly when the pulled-back symplectic form vanishes. Step 1.1 says this occurs exactly when $d α = 0$ , proving both directions, including $n = 0$ .

A1F2F3step 1.1∎

Depends on

Used by

Graphs of exact and closed one-forms as Lagrangians Example

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

Eckhard Meinrenken, Symplectic Geometry (standard reference, not scraped)