Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generated
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.

Smooth singular mayer vietoris sequence

Statement

For an ordered two-open cover M=UV of a smooth manifold, possibly with boundary, smooth singular cohomology has a natural Mayer–Vietoris sequence Hk(M;R)Hk(U;R)Hk(V;R)Hk(UV;R)ΔHk+1(M;R). The maps before the connector are restriction and VU difference; the connector is positive lift-differential, with the small-complex cohomology identified by the actual inclusion. Naturality holds for smooth maps preserving the ordered cover. Negative groups vanish and the sequence begins with 0H0(M;R).

Facts & Assumptions

Given: The ordered open cover. Write C=C(M;R), and A for its cover-small subcomplex.

[F1]

The ordinary two-open dual sequence is proved by gluing functions on the simplex bases and zero extension (Short exact two open singular cochain mayer vietoris sequence).

[F2]

Smooth chains form a subcomplex and smooth cochains are its real dual (Smooth singular chain and cochain complexes).

[F3]

Subdivision S and its homotopy T preserve smooth chains and do not enlarge simplex images (Barycentric subdivision and prism preserve smooth singular chains).

[F4]

The ordinary small-chain inverse is constructed from least subdivision depths and the identity 1S=T+T (The cover-small inclusion is a chain homotopy equivalence).

[F5]

Every finite chain becomes cover-small after sufficiently many subdivisions (Finite chains eventually become cover-small).

[F6]

Short exact cochain sequences give long exact cohomology sequences (The long exact sequence in cohomology).

Proof

1.1

For a smooth simplex σ, let a(σ) be the least nonnegative integer such that Sa(σ)σ is small; [F5] supplies existence. Set m=0 on vertices and recursively m(σ)=max({a(σ)}{m(σδj)}j). Each maximum is finite, faces have smaller dimension, and [F3] ensures all face and subdivision chains remain smooth. A small simplex has m=0, by induction on its faces.

givenF2F3F5
2.1

Define Dq=i=0q1TSi, so 1Sq=Dq+Dq by telescoping [F4]. Set Dσ=Dm(σ)σ and R=1DD, extending on the supplied smooth basis. Then R=R. On a simplex, Rσ=Sm(σ)σ+Dm(σ)σDσ. For each face τ, its correction is the signed sum i=m(τ)m(σ)1TSiτ; every term is smooth and small because Sm(τ)τ is small and S,T preserve that property. Thus R lands in A.

F2F3F4step 1.1algebra
3.1

With I:AC and r=R:CA, the identities are 1Ir=D+D and rI=1, since D vanishes on small simplices and their faces. Dualizing these actual equations gives θ=H(I):Hk(M)Hk(HomR(A,R)): the cochain homotopy is precomposition with Dk1. This proves the needed equivalence within smooth chains, independently of any smooth/continuous comparison theorem.

F2step 1.1step 2.1algebra
4.1

The smooth bases for U and V, viewed in M, have intersection precisely the smooth overlap basis. To check the corestriction clause, restrict any extension of an overlap-valued simplex to the open inverse image of UV, which contains its simplex. Thus the argument [F1] applies to these bases: restrictions inject the small dual into the pair of cochains, agreeing pairs glue uniquely by priority-U values, and (EUη,0) maps to η under VU difference. Signed face restrictions make both arrows cochain maps. Apply [F6] to this explicitly exact smooth row and identify its first cohomology through θ from step 3.1. This proves the sequence and initial injection.

F1F2F6step 3.1
5.1

For clarity, lift an overlap cocycle c to a pair e; its differential equals a(d) for a unique small cocycle d. The connector is θ1[d]. Changing the lift by a(t) changes d by δt; changing c by δc0 and adding the differential of a lift of c0 leaves d unchanged. For a smooth ordered-cover map, postcomposition preserves each small smooth basis and commutes with inclusions and signed arrows. The image of e is a lift of the image of c, proving connector naturality, and the natural inclusion square transports it through θ.

F1F2step 3.1step 4.1algebra
6.1

Negative degrees have zero terms; at degree zero all vertices are small, m=D=0, and no negative primitive exists. Empty opens and overlap give zero terms; when U=V=M the row is diagonal then difference, with connector zero by the lift (0,c). This includes one-point and empty manifolds. Degenerate simplices have the same face recursion; no quotient discards them. Least integers, finite maxima and prescribed zero values give all constructions without AC, including boundary targets.

F1F2step 1.1step 2.1step 3.1step 4.1step 5.1

Depends on

Used by

Dependency tree · two levels

25 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