Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedPipeline-generatedjudge pass (gpt-6-luna)
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.

Closed real intervals are compact by completeness

Statement

If a<b in a Dedekind-complete ordered field, every relative open cover of [a,b] has a finite subcover. Relative openness means openness in the subspace topology inherited from the real line.

Facts & Assumptions

Given: A complete ordered field and a<b.

[A1]

Dedekind-complete ordered real field: every nonempty bounded-above subset has a least upper bound.

Proof

1.1givenA1construct

Fix a relative open cover U of [a,b]. Let S be the set of x∈[a,b] for which [a,x] has a finite subcover. A member containing a contains a relative neighborhood [a,a+δ) for some δ>0; choosing η=min⁡(δ/2,(b−a)/2) shows a+η∈S. Thus S is nonempty and bounded above by b. By [A1], c=sup⁡S exists.

2.1step 1.1A1chooseconstruct

If c<b, a cover member containing c contains (c−δ,c+δ)∩[a,b] for some δ>0. Let η=min⁡(δ/2,(b−c)/2)>0. Since c is the supremum, choose x∈S with x>c−η. A finite cover of [a,x] together with the member covering c covers [a,c+η]. This places c+η in S, contradicting that c is an upper bound. Hence c=b.

3.1step 2.1chooseconstruct∎

If b∈S, the required finite subcover already exists. Otherwise a cover member containing b contains (b−δ,b] for some δ>0. Because b=sup⁡S, choose x∈S with x>b−δ. A finite cover of [a,x] and that member cover all of [a,b].

Depends on

Used by

Dependency tree · one level

1 result within one dependency step 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