Alphabeta Math
CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (z-ai/glm-5.2)audited 2026-07-26
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.

The nested closed unbounded sets [k,)[k, \infty) have empty intersection, so boundedness cannot be dropped

Statement refuted

Refuted claim: a nested sequence of nonempty closed intervals has nonempty intersection, boundedness being unnecessary (A nested sequence of nonempty closed bounded intervals has nonempty intersection, and the intersection is a single point exactly when the lengths tend to 00, Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length).

The witness is Ik=[k,)I_k = [k, \infty) for kNk \in \mathbb{N}, where kk denotes the canonical natural of R\mathbb{R}. Each is a nonempty closed interval, the family is nested, and

kN[k,)=.\bigcap_{k \in \mathbb{N}} [k, \infty) = \emptyset .

A nested sequence of nonempty closed bounded intervals has nonempty intersection, and the intersection is a single point exactly when the lengths tend to 00 therefore cannot be improved by deleting "bounded" from its hypotheses. Together with the open-interval counterexample on this page, which deletes "closed" instead, this shows that the two hypotheses are independent and that neither is an artefact of the proof.

Facts & Assumptions

Given: For kNk \in \mathbb{N} the set Ik:={xR:kx}I_k := \{x \in \mathbb{R} : k \le x\}, where kk denotes the canonical natural k1Rk \cdot 1_{\mathbb{R}}; this is the closed interval [k,)[k,\infty) (Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length, Sequences of reals: bounded, eventually, frequently, tails, subsequences).

[L1]

Intervals: [a,)={x:ax}[a, \infty) = \{x : a \le x\} is a closed interval, it is not bounded above, and it is nonempty since it contains aa (Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length).

[L2]

Canonical naturals: mm1Rm \mapsto m \cdot 1_{\mathbb{R}} is strictly increasing, so kk+1k \le k+1 in R\mathbb{R} for every kNk \in \mathbb{N} (Canonical naturals are positive and strictly increasing).

[L3]

Archimedean property: for every real xx there is a natural n1n \ge 1 with x<n1Rx < n \cdot 1_{\mathbb{R}} (Every complete ordered field is Archimedean).

[L4]

Trichotomy and transitivity of the order on R\mathbb{R} (Complete ordered field (least-upper-bound property), Ordered field).

[L6]

The refuted claim: a nested sequence of nonempty closed intervals has nonempty intersection.

Counterexample

technique · direct
1.1

Each IkI_k is a nonempty closed interval, containing the canonical natural kk; and none of them is bounded, since [a,)[a,\infty) has no upper bound.

givenL1
2.1

The family is nested: kk+1k \le k+1 in R\mathbb{R}, so k+1xk+1 \le x implies kxk \le x, that is Ik+1IkI_{k+1} \subseteq I_k.

step 1.1L2L4
3.1

Suppose xx belonged to every IkI_k. Then k1Rxk \cdot 1_{\mathbb{R}} \le x for every kNk \in \mathbb{N}.

step 2.1L1
4.1

By the Archimedean property fix a natural n1n \ge 1 with x<n1Rx < n \cdot 1_{\mathbb{R}}; step 3.1 applied to k=nk = n gives n1Rxn \cdot 1_{\mathbb{R}} \le x, which trichotomy forbids.

step 3.1L3L4
5.1

So no such xx exists: the family (Ik)(I_k) consists of nonempty closed intervals, is nested, and has empty intersection. The claim is refuted, and boundedness cannot be dropped from A nested sequence of nonempty closed bounded intervals has nonempty intersection, and the intersection is a single point exactly when the lengths tend to 00.

step 1.1step 2.1step 4.1L5L6

Remarks

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 60 results over 12 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources