Alphabeta Math
TheoremStatement: 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.

Nondegeneracy is equivalent to a nonvanishing top wedge

Statement

Let M have dimension 2n and let ω be a smooth two-form. Then ω is pointwise nondegenerate if and only if the top-degree form ωn is nowhere zero.

Facts & Assumptions

Given: A smooth 2n-manifold M and ω∈Ω2(M).

[F1]

Wedge products of differential forms are defined pointwise. The wedge product of differential forms.

[F3]

Pointwise nondegeneracy is the linear clause in the definition of a symplectic form. Symplectic form and symplectic manifold.

Proof

technique · direct
1.1F1F2

Fix p∈M. If ωp is nondegenerate, [F2] supplies a basis e1,…,en,f1,…,fn with ωp=∑iei∧fi. Hence ωpn=n!e1∧f1∧⋯∧en∧fn≠0.

1.2F1algebra

Conversely, if 0≠v lies in the radical of ωp, then the graded contraction rule gives ιv(ωpn)=n(ιvωp)∧ωpn−1=0. A nonzero top covector has nonzero contraction by every nonzero vector: extend v to a basis and evaluate on the remaining basis vectors. Therefore ωpn=0.

2.1F3step 1.1step 1.2∎

Steps 1.1--1.2 prove the equivalence at every p, which is exactly [F3]. For n=0, ω0=1 and the zero tangent space is nondegenerate, so the same conclusion holds. Closedness is irrelevant to this pointwise equivalence.

Depends on

Used by

Dependency tree · two levels

11 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