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.

Continuous functions on a closed interval attain their extrema

Statement

If f:[a,b]→R is continuous and a≤b, then f is bounded and attains both a maximum and a minimum on [a,b].

Facts & Assumptions

Given: A Dedekind-complete ordered field, a≤b, and continuity as in Continuity and derivative on a real interval.

[L1]

Closed real intervals are compact by completeness: every relative open cover of a nondegenerate closed interval has a finite subcover.

[L2]

Dedekind completeness implies the Archimedean property: the natural numbers are unbounded above.

[L3]

Continuity and derivative on a real interval: continuity is the relative epsilon-delta condition on [a,b].

[A1]

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

[L4]

Real and complex modulus product and triangle inequalities: real absolute value satisfies ∣x+y∣≤∣x∣+∣y∣.

Proof

1.1givenL1L2L3L4A1construct

If a=b, the singleton range consists only of f(a), so the conclusion holds. Suppose a<b. For each natural n≥1, put Un={x∈[a,b]:∣f(x)∣<n}. These sets cover [a,b] by [L2]. Each is relatively open: at any x∈Un, the margin n−∣f(x)∣>0 and [L3] gives a neighborhood where ∣f(t)−f(x)∣ is smaller than that margin; [L4] then gives ∣f(t)∣<n. By [L1] a finite subcollection covers; taking its largest index shows ∣f∣ is bounded. Consequently M=sup⁡f([a,b]) exists by [A1].

2.1step 1.1L2L3A1choose

If M is not attained, for every n≥1 define Vn={x∈[a,b]:f(x)<M−1/n}. For each x, M−f(x)>0; by [L2] choose n with 1/n<M−f(x), so the Vn cover. Each Vn is relatively open by [L3] and the positive margin M−1/n−f(x). A finite subcover and its largest index N imply f(x)<M−1/N for all x, making M−1/N an upper bound for f([a,b]). This contradicts that M is the least upper bound. Thus the maximum is attained.

3.1step 2.1algebra∎

The function −f is continuous because ∣(−f(t))−(−f(x))∣=∣f(t)−f(x)∣. Applying steps 1.1 and 2.1 to −f, its attained maximum is the attained minimum of f.

Depends on

Used by

Dependency tree · two levels

7 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