Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-13
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.

Integration is an isomorphism on top compactly supported de Rham cohomology

Statement

Let Mn be a nonempty connected oriented smooth manifold without boundary. With the finite-localization integral, the map IntM:Hcn(M)R, [ω]Mω, is an isomorphism. More explicitly, a compactly supported top form has integral zero if and only if it is the derivative of a compactly supported (n1)-form. For n=0 this means that the zero form has the zero negative-degree primitive. The theorem holds in ZF, without a choice axiom.

Facts & Assumptions

[F1]

Compactly supported top cohomology propagates across overlapping oriented coordinate balls supplies normalized bump top forms, compact primitives for zero-integral forms supported in a ball, and equality of normalized ambient classes across an overlap.

[F2]

Integration descends to compactly supported top de Rham cohomology supplies the well-defined linear map and vanishing on compact exact forms.

[F3]

Finite chart localization gives choice-free integration and compact Stokes gives the finite-localization integral using connected coordinate domains.

[F5]

Compactly supported de Rham cohomology gives the compact-support quotient, its linear operations and zero negative degrees.

[F6]

A chart bump at a point with prescribed support gives a smooth function equal to one at a specified point and supported in any prescribed open neighborhood.

[F7]

The standard smooth step function gives a smooth s:R[0,1] equal to zero on (,0] and to one on [1,).

Proof

Given: A manifold as stated. A ball below means a coordinate ball as in [F1].

1.1

Choose one ball U0 and one normalized compact bump ν0 in it, possible by nonemptiness and [F1]. Let A be the union of all balls reachable from U0 by a finite sequence of coordinate balls with consecutive nonempty overlaps, allowing a sequence of length zero. It is an open set containing U0. If xA, take any coordinate ball V about x. If V met A, it would meet a ball at the end of some finite chain; adjoining V would put VA, contradicting xA. Thus VMA, and the complement is open. By [F4] and A, A=M. This defines the set of all finite chains and proves their existence when needed, without choosing a chain at every point.

F1F4given
1.2

Let ωΩcn(M) and put K=suppω. For every pK, restrict a chart about p to a coordinate ball U whose closed coordinate ball lies inside the original chart. The latter closure is compact by [F8]. Apply [F6] inside U and consider the set of all resulting pairs (U,b) with b(p)=1 for some pK. Their opens {b>1/2} cover K, so [F8] retains finitely many b1,,bm supported in coordinate balls U1,,Um. Each support is compact: it is closed, lies in the corresponding compact closed coordinate ball, and [F8] applies. Put B=ibi, θ=s(4B1) using [F7], and define χi=θbi/B where B>0 and zero where B=0. This is smooth because θ=0 on the neighborhood B1/4 of the possible zero denominator. Each χi has compact support in Ui, and iχi=1 wherever B>1/2, a neighborhood of K. Thus ω=i=1mωi with ωi=χiω compactly supported inside the ball Ui. If K is empty, take the empty sum. All integrals below are the finite-localization integrals of [F3]. Set ci=Mωi. Choose one normalized bump νi inside each of these finitely many balls using [F1]. The form ωiciνi has integral zero by [F2] and has compact support inside Ui by [F5]. By [F1], it is dηi for an ambient compact primitive. Hence [ωi]=ci[νi].

F1F2F3F5F6F7F8given
2.1

For each of the finitely many Ui, step 1.1 supplies a finite overlap chain from U0 to Ui: choose a point in Ui, use its membership in A, and append Ui to the chain containing that point. Choose normalized bumps in the finitely many intermediate balls by [F1]. Consecutive normalized classes agree by [F1], so transitivity along the finite chain gives [νi]=[ν0]. This also holds for the zero-length chain. Consequently, using the actual finite sums from step 1.2, [ω]=i[ωi]=(ici)[ν0]=(Mω)[ν0]. The last equality is linearity [F2]. Finite unions of the finite chains and of their finitely many compact primitives remain finite; thus the quotient equality can equivalently be witnessed by the corresponding finite sum of compact primitives under [F5].

F1F2F5step 1.1step 1.2
3.1

If Mω=0, step 2.1 gives [ω]=0; the quotient definition [F5] means precisely ω=dη for a compactly supported η. Conversely, such a derivative has integral zero by [F2]. Thus the claimed iff and injectivity hold. For each real a, the compactly supported form aν0 has integral a by [F2]. This proves surjectivity, with explicit linear inverse aa[ν0]; step 2.1 proves that this inverse is independent of the temporary chosen normalized bump.

F2F5step 1.1step 2.1
4.1

In dimension zero every singleton is open, so [F4] forces the nonempty connected manifold to be one point. Its integral is the orientation sign times the function value by [F2], hence is an isomorphism, and zero integral means the zero form, with zero negative-degree primitive by [F5]. At n=1 every primitive above is a compactly supported function as supplied by [F1], including at the ends of a coordinate interval. Empty support and zero coefficients contribute zero classes and can use zero primitives; nonempty M is necessary since the empty manifold has zero cohomology and cannot map onto R. All selections concern one base bump, one finite support cover, finitely many finite chains, and finitely many primitives for a given input. No countable partition, infinite family of primitives, path selections, or AC is used.

F1F2F4F5step 1.1step 1.2step 2.1step 3.1

Depends on

Used by

Dependency tree · two levels

78 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