Alphabeta Math
CorollaryStatement: AI-adaptedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-21
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 closed disc of radius r0 has Jordan content πr2

Statement

A closed disc of radius r0 has Jordan content πr2.

Facts & Assumptions

Given: A real radius r0 and the closed disc Dr:={(x,y)R2:x2+y2r2}.

[L1]

For every r>0, the Riemann area of the closed disc of radius r is πr2 (A disc of radius r has Riemann area pi r squared; in particular the unit disc has area pi).

[L2]

Every degenerate rectangle has Jordan content 0 (Jordan inner and outer content and Jordan measurable bounded sets in Rm).

[L3]

A region between continuous graphs is compact and Jordan measurable, and its graph area equals its Jordan content (Riemann area between continuous graphs equals Jordan content).

Proof

technique · cases
1.1

In the case r=0, the disc is the singleton {(0,0)}=[(0,0),(0,0)], a degenerate rectangle, so [L2] gives cont(D0)=0=π02.

assume-case zeroL2
1.2

In the case r>0, the disc is the region on [r,r] between the continuous graphs y=r2x2 and y=r2x2; [L3] identifies its Jordan content with its Riemann graph area, which [L1] evaluates as πr2.

assume-case posL1L3
2.1

The cases r=0 and r>0 exhaust r0, and each gives cont(Dr)=πr2.

step 1.1step 1.2cases-exhaustive

Depends on

Used by

Dependency tree · two levels

26 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