Alphabeta Math
CounterexampleConstruction: AI-adaptedVerification: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-07
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 wrong boundary sign in the half-space computation

Statement refuted

False assertion: Stokes on the standard oriented half-line remains valid if its boundary point is assigned the positive sign instead of its induced negative sign.

Facts & Assumptions

[F1]

Compact-support Stokes on the upper half-space: Give Hn={xn≥0} the standard orientation, n≥1, and its face the outward-normal-first orientation. If η∈Ωcn−1(Hn) and j:∂Hn↪Hn, then ∫Hndη=∫∂Hnj∗η. With η=∑iai dx1∧⋯∧dxi^∧⋯∧dxn, both sides are (−1)n∫Rn−1an(x′,0) dx′ for n>1, and −a1(0) for n=1.

Counterexample

Given: The proposed assertion; use the data constructed below.

1.1construct

Choose a smooth compactly supported f on [0,∞) with f=1 near zero. Explicitly, put b(u)=e−1/u for u>0 and zero otherwise, and f(t)=b(2−t)/(b(2−t)+b(t−1)). The denominator is positive for all t, and all derivatives of b vanish at zero, so f is smooth, equals one for t at most one, and zero for t at least two.

2.1F1step 1.1∎

The half-space Stokes formula in dimension one gives ∫0∞f′(t)dt=−f(0)=−1, equivalently the FTC difference f(2)−f(0). Giving the endpoint positive sign instead yields +f(0)=1, so the proposed convention breaks the identity.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

6 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