Alphabeta Math
LemmaStatement: Literature-sourcedProof: Literature-sourcedprecheck pass
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.

Rescaling the defining form changes the Godbillon-Vey form by an exact form

Statement

Assume Countable Choice ACω. Let F be a transversely oriented codimension-one foliation with defining form ω and dω=η∧ω. For ω′=efω with f∈C∞(M) one has dω′=η′∧ω′ with η′=η+df, and η′∧dη′=η∧dη+d(f dη); in particular [η′∧dη′]=[η∧dη] in HdR3(M;R). The same conclusion holds for any nowhere-vanishing smooth multiple ω′=gω, since on each connected component g is ef or −ef.

Facts & Assumptions

Given: A transversely oriented codimension-one foliation with defining form ω and dω=η∧ω, and a smooth function f with ω′=efω.

[F1]

With dω=η∧ω one has dη∧ω=0 and η∧dη is closed. (The Godbillon-Vey form eta wedge d eta is closed).

[F2]

For homogeneous smooth forms α,β of degrees p,q one has d(α∧β)=dα∧β+(−1)pα∧dβ. (The exterior derivative is a graded derivation).

[F3]

For every differential form ω, d(dω)=0. (The exterior derivative squares to zero).

Proof

technique · direct
1.1F2given

Compute dω′=d(efω)=efdf∧ω+efdω=ef(df∧ω+η∧ω)=(η+df)∧ω′ by [F2], so η′=η+df is admissible for ω′.

2.1F1F2F3step 1.1

Then dη′=dη+d(df)=dη by [F3], so η′∧dη′=(η+df)∧dη=η∧dη+d(f dη) because d(f dη)=df∧dη by [F2]; the difference is exact and η∧dη is closed by [F1], so the two forms define the same class in HdR3(M;R).

3.1step 2.1∎

For a general nowhere-vanishing smooth multiple ω′=gω the same computation applies on each connected component with g=±ef: the sign choice leaves dω=η∧ω and the form η∧dη unchanged, so the class is independent of the rescaling; no choice principle is used.

Depends on

Used by

Dependency tree · two levels

19 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