Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 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.

De rham cohomology of euclidean space

Example

For every n0, HdR(Rn)=R in degree zero only.

Facts & Assumptions

Given: Euclidean space with centre 0.

[F1]

Poincare lemma for differential forms on star shaped domains: Every closed smooth k-form on a star-shaped open domain is exact for k1. For centre 0, one primitive is ηx(v1,,vk1)=01tk1ωtx(x,v1,,vk1)dt.

[F2]

Zero th de rham cohomology is locally constant functions: HdR0(M) is the algebra of locally constant real functions. For nonempty connected M it is canonically R.

Verification

technique · direct
1.1

For any closed k-form with k1, the radial primitive is ηx(v1,,vk1)=01tk1ωtx(x,v1,,vk1)dt, and dη=ω. Thus every positive-degree class is zero.

F1given
2.1

Euclidean space is nonempty and connected, so its degree-zero classes are constant functions with their ordinary multiplication. Negative degrees are zero by the complex convention. When n=0, the only form space is the constants on a point, giving the same ring.

F2step 1.1

Source locator

Lee, Theorem 17.14, p.447, Poincaré lemma, and Proposition 17.6, p.443, degree zero.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

7 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