Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedSession-authored (Fable 5 assisted)precheck passjudge pass (z-ai/glm-5.2)audited 2026-07-31
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.

Qn\mathbb{Q}^n is a countable dense subset of Rn\mathbb{R}^n, and rational open boxes form a countable basis

Statement

Let n1n\ge1. The set Qn\mathbb Q^n is countable and dense in Rn\mathbb R^n. Moreover the rational open boxes

i<n(ai,bi),ai,biQ,ai<bi,\prod_{i<n}(a_i,b_i),\qquad a_i,b_i\in\mathbb Q,\quad a_i<b_i,

form a countable basis for the product topology on Rn\mathbb R^n.

Facts & Assumptions

Given: n1n\ge1, the product Rn=i<nR\mathbb R^n=\prod_{i<n}\mathbb R, and the rationals embedded in R\mathbb R.

[L1]

Q\mathbb Q is countably infinite, and every finite power of an at most countable set is at most countable (Q\mathbb{Q} is countably infinite, Every finite power of an at most countable set is at most countable).

[L4]

A family is a basis when each point of each open set lies in one of its members contained in that open set (Basis and subbasis for a topology, and the topology generated by a family of sets).

[L5]

Finite choices may be assembled into a tuple, and a subset of an at most countable set is at most countable (Every natural-number-indexed list of nonempty sets has a choice function on its family of values, Every subset of an at most countable set is at most countable).

Proof

technique · constructive
1.1

By [L1], Qn\mathbb Q^n is at most countable. It is infinite because the injection q(q,0,,0)q\mapsto(q,0,\ldots,0) embeds Q\mathbb Q in it, hence it is countable.

L1
1.2

Let U=i<nUiU=\prod_{i<n}U_i be a nonempty basic product-open set. Every UiU_i is nonempty and open, so [L2] gives a rational qiUiq_i\in U_i; finite choice supplies the tuple q=(qi)i<nQnUq=(q_i)_{i<n}\in\mathbb Q^n\cap U.

L2L5choose
1.3

Let xU=i<nUix\in U=\prod_{i<n}U_i be a basic product-open neighbourhood. For each i<ni<n, use [L6] to choose ri>0r_i>0 with (xiri,xi+ri)Ui(x_i-r_i,x_i+r_i)\subseteq U_i, then use [L2] to choose rationals xiri<ai<xi<bi<xi+ri.x_i-r_i<a_i<x_i<b_i<x_i+r_i. Finite choice assembles these choices, and then xi<n(ai,bi)Ux\in\prod_{i<n}(a_i,b_i)\subseteq U.

L2L5L6choose
2.1

Every nonempty open subset contains a nonempty basic product-open set about each of its points by [L3], so step 1.2 shows that every nonempty open subset meets Qn\mathbb Q^n. Thus Qn\mathbb Q^n is dense.

L3step 1.2
3.1

Step 1.3 and [L4] show that rational open boxes form a basis. They are indexed by a subset of Q2n\mathbb Q^{2n}, which is at most countable by [L1], so the basis is at most countable by [L5].

L1L4L5step 1.3

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 147 results over 27 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