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

A smooth positive density with infinite mass

Statement refuted

The assertion that every positive smooth density measure has finite total mass fails for the density dx on R.

Facts & Assumptions

Given: Assume ACω. Manifolds are Hausdorff, second countable and smooth, with boundary allowed; n=0 is allowed unless excluded. Densities are pointwise Borel, 0=0, and λ0(R0)=1. Independent B-page witness: compact-finite Euclidean density with total mass infinity.

[F1]

Positive smooth densities give Radon volume: The measure of a positive finite smooth density is locally finite and compact-finite.

[F2]

Intrinsic density measure and its chart restriction: The identity-chart density one integrates to Lebesgue measure.

Counterexample

1.1

On R the coefficient rx=1 is positive and smooth. Its measure is locally finite, and μr([N,N])=NN1dx=2N for every integer N1. Each compact K is bounded, hence contained in some [N,N] and has finite measure.

F1F2F3
2.1

Given any finite L>0, an integer N>L/2 yields μr(R)2N>L, proving infinite total mass. Thus the hypothesis holds and the asserted finite-total-mass conclusion fails. The same chart computation gives μr()=μr({0})=0 and μr([0,1])=1.

F2F3step 1.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

27 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