Alphabeta Math
PropositionStatement: AI-adaptedProof: AI-adaptedPipeline-generatedaudited 2026-09-10
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.

Explicit de rham mayer vietoris connecting class

Statement

Under countable choice, let δ be the Mayer–Vietoris connecting homomorphism obtained from the short exact cochain sequence in F3 by reindexing Cn=C−n and using the connector convention in F4. For a closed k-form ω on U∩V, δ[ω]=[η], where η∣U=d(−ρVω) and η∣V=d(ρUω), with products smoothly extended by zero as in the lift construction. This class is independent of partition, lift and representative.

Facts & Assumptions

Given: Assume countable choice. A closed overlap form ω and the partition lift (α,β)=(−ρVω,ρUω).

[F1]

Mayer vietoris sequence in de rham cohomology: Under countable choice the de Rham Mayer–Vietoris sequence is exact: ⋯→Hk(M)→r∗Hk(U)⊕Hk(V)→s∗Hk(U∩V)→δHk+1(M)→⋯, beginning with 0→H0(M). Its proof obtains this δ by applying the long exact sequence theorem to the short exact de Rham cochain sequence in F3, with no additional differential sign.

[F2]

The de rham mayer vietoris difference map is surjective: Assume countable choice. The difference map s:Ωk(U)⊕Ωk(V)→Ωk(U∩V) is surjective in every degree.

[F3]

Short exact mayer vietoris sequence of de rham complexes: Under countable choice, 0→Ω∙(M)→rΩ∙(U)⊕Ω∙(V)→sΩ∙(U∩V)→0 is short exact as a sequence of real cochain complexes, with s(α,β)=β−α.

[F4]

Elementwise formula for the connecting map in module categories: Let R be a ring and let 0→A∙→iB∙→pC∙→0 be a short exact sequence of chain complexes of left R-modules. If [c]∈Hn(C) is represented by a cycle c∈Cn, choose a lift b∈Bn with pn(b)=c, and let a∈An−1 be the unique element satisfying in−1(a)=dnB(b). Then ∂n([c])=[a]∈Hn−1(A). This class is independent of the chosen lift b and of the chosen cycle representative c.

Proof

technique · direct
1.1F2F3given

On the overlap, dβ−dα=d(β−α)=dω=0. Thus the two smooth forms dα,dβ glue to η. On each open dη=d2α or d2β, hence is zero. The graded product rule also gives η∣U∩V=dρU∧ω=−dρV∧ω, fixing the sign.

2.1F1F3F4step 1.1∎

Reindex the short exact sequence F3 as chain complexes with Cn=C−n. By F1 its connecting homomorphism is the displayed δ, with no added sign. The lift (α,β) in degree −k has differential rη in degree −k−1, so F4 gives δ[ω]=[η] in Hk+1(M). Its independence of lift and cycle representative applies over the ring R; any other partition supplies another lift, so partition independence follows too.

Source locator

Lee, Theorem 17.20, pp.449–450, and its full proof pp.462–463. This page reverses Lee’s difference convention consistently: s(α,β)=β−α.

Depends on

Used by

Dependency tree · two levels

13 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