Alphabeta Math
CounterexampleConstruction: AI-adaptedVerification: AI-generatedSession-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.

Q[0,2]\mathbb{Q} \cap [0,2] is bounded and disconnected, so being an interval of Q\mathbb{Q} is not enough

Statement refuted

Refuted claim: the set E:=QR[0,2]E := \mathbb{Q}_{\mathbb{R}} \cap [0,2] of rationals between 00 and 22 is connected (Separated sets, disconnection, and connected subset of R\mathbb{R}), where QR\mathbb{Q}_{\mathbb{R}} is the copy of Q\mathbb{Q} inside R\mathbb{R} (The rationals embed densely in the reals).

EE is bounded, and it contains every rational lying between its two endpoints, so it is order-convex as a subset of the ordered field Q\mathbb{Q}: it is an interval of that field. As a subset of R\mathbb{R} it is nevertheless disconnected, split at the irrational point 2\sqrt 2. So the equivalence of A subset of R\mathbb{R} is connected if and only if it is order-convex, that is, an interval genuinely uses the completeness of R\mathbb{R}, and "is an interval of the order it carries from Q\mathbb{Q}" is not enough to make a set connected.

Facts & Assumptions

Given: The copy QR\mathbb{Q}_{\mathbb{R}} of Q\mathbb{Q} in R\mathbb{R}, the set E:=QR[0,2]E := \mathbb{Q}_{\mathbb{R}} \cap [0,2], and the real rr with r0r \ge 0 and r2=2r^2 = 2.

[A1]

The refuted claim: EE is connected.

[L1]

Separated sets, disconnection and connectedness (Separated sets, disconnection, and connected subset of R\mathbb{R}).

[L3]

Each of (,c](-\infty, c] and [c,)[c,\infty) is a closed set and each of (,c)(-\infty,c) and (c,)(c,\infty) is an open set (Open subset of R\mathbb{R} (every point has a neighbourhood inside it), closed subset (complement open), and clopen, Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length).

[L4]

In a complete ordered field every a0a \ge 0 has a unique s0s \ge 0 with s2=as^2 = a (Square roots exist: a unique a0\sqrt{a} \ge 0 with (a)2=a(\sqrt{a})^2 = a; the positives are {x2:x0}\{x^2 : x \neq 0\}).

[L5]

No rational squares to 22 (FALSE: some rational number squares to 2); the map qq^q \mapsto \hat q is an injective embedding of ordered fields, so it preserves sums, products and the order (The rationals embed densely in the reals, The rationals as equivalence classes of pairs of integers).

[L6]

Squaring is strictly monotone on the nonnegatives: 0a<b0 \le a < b gives a2<b2a^2 < b^2 (Squaring is monotone on the nonnegatives); 0<10 < 1 and the order is total and transitive (The multiplicative identity is positive, Ordered field, Complete ordered field (least-upper-bound property)).

[L7]

A set is bounded when it has an upper and a lower bound (Lower bound, bounded below, bounded set).

Counterexample

technique · direct
1.1

By [L4] there is a unique real r0r \ge 0 with r2=2r^2 = 2, and 0<r<20 < r < 2: indeed r0r \ne 0 since 02=020^2 = 0 \ne 2, while r2r \ge 2 would give r24>2r^2 \ge 4 > 2 by [L6].

L4L6
1.2

rQRr \notin \mathbb{Q}_{\mathbb{R}}: if r=q^r = \hat q for a rational qq, then q2^=q^q^=r2=2=2^\widehat{q^2} = \hat q \cdot \hat q = r^2 = 2 = \hat 2 by [L5], and injectivity of the embedding gives q2=2q^2 = 2 in Q\mathbb{Q}, contradicting [L5].

L5
1.3

EE is bounded, since 0y20 \le y \le 2 for every yEy \in E by the definition of EE.

givenL7
2.1

Put A:=E(,r)A := E \cap (-\infty, r) and B:=E(r,)B := E \cap (r, \infty). Then AB=EA \cup B = E, because every yEy \in E satisfies yry \ne r by step 1.2 and hence y<ry < r or y>ry > r; and both are nonempty, since 0A0 \in A and 2B2 \in B by step 1.1, both being rationals in [0,2][0,2].

step 1.1step 1.2L3L5L6
3.1

AA and BB are separated: (,r](-\infty, r] is closed and contains AA, so A(,r]\overline{A} \subseteq (-\infty,r] by [L2] and hence AB(,r](r,)=\overline{A} \cap B \subseteq (-\infty,r] \cap (r,\infty) = \varnothing; symmetrically B[r,)\overline{B} \subseteq [r,\infty) and AB=A \cap \overline{B} = \varnothing. Hence (A,B)(A,B) is a disconnection of EE and EE is disconnected, so the claim [A1] is refuted.

step 2.1A1L1L2L3

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: 66 results over 29 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