Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-28
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.

Baire category inside a closed bounded interval: if [a,b] with a<b is covered by a sequence of closed sets, then one of them contains a nondegenerate closed subinterval of [a,b]; no choice principle is used

Statement

Let a,b∈R with a<b and let (Fn)n∈N be a sequence of closed subsets of R (Open subset of R (every point has a neighbourhood inside it), closed subset (complement open), and clopen) with

[a,b]  ⊆  ⋃n∈NFn

(Intervals of R: the nine order-convex forms, nondegeneracy, and length). Then there are n∈N and reals u<v with

[u,v]  ⊆  Fn∩[a,b].

No choice principle is used. The only category input is Baire category in R, by nested intervals with canonically chosen rational endpoints: a countable intersection of dense open sets is dense, so R is not a countable union of nowhere dense sets, whose own proof selects nothing: it fixes one enumeration of the rationals and takes least indices. Nothing further is chosen below, the argument being a direct application of that theorem to the complements of the Fn.

Facts & Assumptions

Given: Reals a<b and a sequence (Fn)n∈N of closed subsets of R with [a,b]⊆⋃nFn.

[L4]

[a,b] is closed: its complement {x:x<a}∪{x:x>b} is open, since x<a gives Na−x(x)⊆{z:z<a} and x>b gives Nx−b(x)⊆{z:z>b} (Open subset of R (every point has a neighbourhood inside it), closed subset (complement open), and clopen, The ε-neighbourhood and the punctured ε-neighbourhood of a point of R, Intervals of R: the nine order-convex forms, nondegeneracy, and length).

[L5]

Nε(y)=(y−ε,y+ε), and for a<b the midpoint y:=(a+b)/2 and radius ε:=(b−a)/2>0 give Nε(y)=(a,b)⊆[a,b] (The ε-neighbourhood and the punctured ε-neighbourhood of a point of R, Intervals of R: the nine order-convex forms, nondegeneracy, and length).

Proof

technique · contradiction
1.1

Put Gn:=Fn∩[a,b] for n∈N. Each Gn is closed, being an intersection of two closed sets, and [a,b]=⋃nGn, since [a,b] is contained in the union of the Fn and each Gn is contained in [a,b].

L3L4
1.2

Suppose, for contradiction, that no Gn contains a nondegenerate closed interval, that is, that there are no n and no reals u<v with [u,v]⊆Gn.

assume-contra
2.1

Each Vn:=R∖Gn is open, and it is dense. Openness is the complement of a closed set. For density, let y be real and ε>0 real; if Nε(y)∩Vn were empty then Nε(y)⊆Gn, and then [y−ε/2, y+ε/2] would be a nondegenerate closed interval inside Gn, contrary to step 1.2.

step 1.1step 1.2L2L3L5
3.1

By the Baire category theorem the intersection ⋂nVn is dense in R, so it meets the neighbourhood N(b−a)/2((a+b)/2)=(a,b): there is x∈(a,b) with x∉Gn for every n.

step 2.1L1L2L5
4.1

But x∈(a,b)⊆[a,b]=⋃nGn, so x∈Gn for some n, contradicting step 3.1. The assumption of step 1.2 is therefore false, and some Gn=Fn∩[a,b] contains a nondegenerate closed interval [u,v].

step 1.1step 1.2step 3.1discharge-contradiction∎

Remarks

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