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.

Divisibility by a nowhere-vanishing one-form

Statement

Assume Countable Choice ACω. Let M be a smooth manifold, with boundary allowed, and let ω be a nowhere-vanishing smooth 1-form on M. (i) If α∈Ω1(M) satisfies α∧ω=0, then there is a unique f∈C∞(M) with α=fω. (ii) If θ∈Ω2(M) satisfies θ∧ω=0, then there is β∈Ω1(M) with θ=β∧ω.

Facts & Assumptions

Given: A smooth manifold M with a nowhere-vanishing smooth one-form ω, a one-form α with α∧ω=0, and a two-form θ with θ∧ω=0.

[F1]

The graded vector space Ω∗(M) with the wedge product is an associative graded-commutative algebra. (Differential forms form a graded commutative algebra).

[F2]

If (fi) are smooth functions on the members of an open cover and (ϕi) is a smooth partition of unity subordinate to that cover, then F(p)=∑iϕi(p)fi(p) is a smooth function on M. (Smooth locally defined functions can be glued by a partition of unity).

[F3]

Under ACω, every smooth-manifold open cover admits a subordinate smooth partition of unity (Smooth partitions of unity exist on manifolds, Smooth partitions of unity exist on manifolds with boundary).

Proof

technique · direct
1.1givenalgebra

Fix p∈M and choose v∈TpM with ωp(v)≠0, which exists because ω is nowhere vanishing; evaluating the two-form α∧ω on a pair (u,v) and using its definition for a one-form times a one-form gives 0=(α∧ω)(u,v)=αp(u)ωp(v)−αp(v)ωp(u) for every u, so αp(u)=(αp(v)/ωp(v))ωp(u); the quotient f(p):=αp(v)/ωp(v) is independent of the choice of v because it equals the value of the unique scalar with αp=f(p)ωp, and such a scalar is unique as ωp≠0.

2.1F1step 1.1

To see that f is smooth, fix a chart domain U with coordinates x1,…,xm and write ω=∑iωi dxi, α=∑jaj dxj with smooth coefficient functions; by [F1] the wedge product expands as α∧ω=∑j<k(ajωk−akωj) dxj∧dxk, and the dxj∧dxk are linearly independent over the coefficient functions, so ajωk=akωj on U; shrinking about any point at which some ωi≠0, one gets aj=aiωj/ωi for all j, hence α=(ai/ωi)ω there with smooth quotient ai/ωi; comparing with step 1.1 shows f=ai/ωi on that smaller domain, and since smoothness is local f is smooth on all of M, giving (i).

2.2F1step 1.1

For (ii), fix a chart domain U with coordinates as above and write θ=∑i<jcij dxi∧dxj with cji:=−cij; by [F1] the wedge θ∧ω has coefficient cijωk−cikωj+cjkωi on dxi∧dxj∧dxk for each triple i<j<k, so θ∧ω=0 gives those three-term identities; shrinking to a domain on which a fixed coefficient ωi0 is nowhere zero, define bi:=cii0/ωi0 for i≠i0 and bi0:=0, and let β=∑ibi dxi; substituting these definitions into the three-term identities in each of the three index orders, and using cij=−cji, gives cij=biωj−bjωi for every pair {i,j}, hence θ=β∧ω on U with smooth β.

3.1F2F3step 2.2

Cover M by such chart domains U with local solutions βU, and use [F3] to obtain a smooth partition of unity (ϕU) subordinate to the cover; for overlapping domains, (βU−βV)∧ω=0, so by (i) there is a smooth function fUV with βU−βV=fUVω on the overlap, and the local forms ϕUβU, extended by zero, satisfy ∑UϕUβU∧ω=∑UϕUθ=θ; thus β:=∑UϕUβU is a globally defined smooth one-form by [F2] with θ=β∧ω, which is (ii).

4.1F3step 1.1step 2.1step 3.1∎

Part (i) follows from steps 1.1 and 2.1, and part (ii) from step 3.1. Countable choice is used for the subordinate partition in [F3]; the local coefficients are explicit formulas in each chart.

Depends on

Used by

Dependency tree · two levels

34 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