Alphabeta Math
False statementConstruction: AI-adaptedVerification: 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 a cochain map without Stokes on simplices

Statement

False. The integration map can be shown to satisfy δI=Id without establishing Stokes' identity on smooth singular simplices.

Facts & Assumptions

[F1]

De Rham integration is a cochain map states δI=Id for the integration cochain.

Refutation

Given: A smooth (k+1)-simplex σ:Δk+1M and a smooth k-form ω.

1.1

Directly from the definitions of the singular coboundary and integration cochain, (δIk(ω))(σ)=Ik(ω)(σ)=σω, while Ik+1(dω)(σ)=σdω. Consequently the cochain-map equality evaluated on this one simplex is precisely σω=σdω, with the alternating face orientations built into σ.

F1given
2.1

Thus simplex Stokes implies the cochain identity by linearity over finite chains, and conversely the cochain identity for every ω and every simplex implies every one of these Stokes identities by step 1.1. This is the identity asserted in [F1]. The zero form, a degenerate simplex, k=0, and an empty manifold merely give special instances of the same equality; they do not establish the general claim. Hence omitting simplex Stokes (or a result logically equivalent to all its instances) leaves the cochain-map assertion unproved. No choice principle is involved.

F1step 1.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

4 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