Alphabeta Math
LemmaStatement: 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.

The de Rham map is an isomorphism on convex coordinate domains

Statement

On a nonempty convex open subset V⊆Rn, or a nonempty convex relatively open subset V⊆Hn, the de Rham integration map IV:HdRk(V)⟶H∞k(V;R) is an isomorphism in every degree. Both sides are R in degree zero, identified by the value on the one component, and zero in positive and negative degrees. The same holds on a manifold coordinate domain diffeomorphic to such a V. No choice assumption is needed.

Facts & Assumptions

[F1]

Naturality of the de Rham map gives naturality of integration on cochains and cohomology, also for boundary manifolds.

[F2]

The de Rham homotopy formula extends to boundary manifolds gives H1∗−H0∗=dLH+LHd, with a smooth primitive operator also at a spatial boundary.

[F3]

Barycentric subdivision and prism preserve smooth singular chains supplies a smooth homotopy prism after flattening time, with the unchanged identity H1#−H0#=∂P+P∂.

[F4]

Smooth singular chain and cochain complexes retains every simplex, including the unique constant simplex in each degree on a point, with the signed face differential and its dual.

[F5]

De Rham integration cochain evaluates a zero-form on each point simplex; in degree zero this is evaluation, not the zero map.

[F6]

Smooth singular chains and cochains are functorial for smooth maps supplies the chain, cochain and cohomology maps of the constant projection and inclusion of a point.

Proof

Given: A nonempty convex domain V of either kind in the statement. Fix one c∈V, and let p:V→{c} and i:{c}→V be projection and inclusion.

1.1F2given

Set H(x,t)=c+t(x−c). Convexity makes this target-valued for 0≤t≤1; its polynomial coordinate expression gives all required local extensions. Its endpoint maps are ip and the identity. For a closed form ω of positive degree, the constant-map pullback is zero because its derivative is zero. Thus [F2] gives ω=d(LHω). For a closed zero-form f, the same identity has LHf=0 and df=0, so f−f(c)=0. Conversely constant functions are closed. Hence de Rham cohomology is zero in positive degrees and is R in degree zero, with evaluation at c inverse to the constant-function map.

1.2F4given

On the point {c} there is exactly one simplex sj in every degree j≥0. For j≥1, its boundary is (∑a=0j(−1)a)sj−1, equal to sj−1 when j is even and zero when j is odd. Therefore the cochain group is R in each nonnegative degree, with δk=0 for even k and δk=id⁡ for odd k. This unnormalized complex has H0=R and Hk=0 for k>0: in positive odd degree the kernel is zero, and in positive even degree the entire kernel is the preceding image.

2.1F3F4F6step 1.1

The unmodified radial homotopy need not extend into a boundary target beyond the time endpoints. Use the time-flattened prism guaranteed by [F3] instead. It has the same endpoint maps and gives a degree-one chain operator P with id⁡#−(ip)#=∂P+P∂. For a cochain φ of degree k≥1 set Dφ=φPk−1, and set D=0 in degree zero. Direct evaluation gives δDφ+Dδφ=φ−(ip)∗φ. In degree zero the first term is zero and the second is φ∂P0, so this identity still holds. No dual exactness theorem or selected cochain extension is used.

3.1F4F6step 2.1step 1.2

Since pi=id⁡{c}, [F6] gives i∗p∗=id⁡ on cochains of the point. Step 2.1 gives p∗i∗=id⁡ on cohomology of V, because the difference on any cocycle is the coboundary δDφ. Thus i∗,p∗ are inverse cohomology maps. More explicitly in positive degree, for a cocycle φ let β=i∗φ. In odd degree β=0 by step 1.2, so take γ=0; in positive even degree take the preceding-degree point cochain with the same scalar value as β, so δγ=β. Then φ=δ(Dφ+p∗γ). This proves positive-degree vanishing without a representative-selection principle. In degree zero, evaluation at c and constant cochains give the inverse identifications with R.

4.1F1F4F5step 1.1step 3.1

By [F5], integration sends the constant function a to the cochain with value a on every point simplex. Thus the degree-zero map is the identity under the two identifications with R in steps 1.1 and 3.1. In every positive degree both groups vanish, so their unique linear map is an isomorphism; negative degrees are zero by the complex conventions. A coordinate diffeomorphism and its inverse give inverse pullback maps in both theories, and [F1] transports these conclusions to the coordinate domain.

5.1F2F3F4step 1.1step 1.2step 3.1step 4.1∎

Nonemptiness is used only to fix one contraction centre; the empty domain instead has zero groups on both sides and still a comparison isomorphism, but not the asserted degree-zero identification with R. For n=0 the nonempty domain is a point, already calculated in step 1.2, and all positive-degree forms vanish. Degree one is covered by the zero odd-degree kernel at the point and the explicit primitive formulas. Constant and degenerate simplices are retained throughout. The endpoint flattening in step 2.1 preserves c and x, and [F2] handles both endpoints for forms. A single centre and explicit operators suffice; no choices over families of domains or cohomology classes are made.

Depends on

Dependency tree · 2 levels

Sources