Alphabeta Math
CorollaryStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)verified 2026-08-09 (gpt-5.6-terra-codex-subscription)
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 is Fσ, meager and not Gδ, while the irrationals are Gδ, residual and not Fσ

Statement

Write QR for the image of Q in R under the canonical embedding q↦q^ (The rationals embed densely in the reals), the set usually written Q once the identification is made, and put X:=R∖QR for the irrationals. Then:

  1. QR is an Fσ set (Fσ and Gδ subsets of R) and is meager (Nowhere dense, meager (first category), residual, and second category subsets of R);
  2. X is a Gδ set and is residual;
  3. QR is not a Gδ set, and X is not an Fσ set.

Claims 1 and 2 are bookkeeping. Claim 3 is the substance and is exactly where 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 is spent: no argument from the algebra of open and closed sets alone can reach it, since QR and X are interchanged by complementation while Fσ and Gδ are, so any such argument would prove the same thing about both sets and about neither.

Facts & Assumptions

Given: The complete ordered field R, the set QR⊆R of rationals and its complement X=R∖QR.

[L1]

Q≈N (Q is countably infinite, Equinumerous sets, A≈B and A⪯B), q↦q^ is injective with image QR (The rationals embed densely in the reals), and a composition of bijections is a bijection (Injection, surjection, bijection).

[L3]

U is open when every point of it has a neighbourhood inside it, and F is closed when R∖F is open; Nε(x)=(x−ε,x+ε) and x∈Nε(x) (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).

[L5]

A is Fσ when it is the union of a sequence of closed sets and Gδ when it is the intersection of a sequence of open sets; A is Fσ if and only if R∖A is Gδ (Fσ and Gδ subsets of R).

[L7]

There is a bijection J:N×N→N (N×N≈N).

Proof

technique · contradiction
1.1

For c∈R the singleton {c} is closed and nowhere dense: its complement is open, since x≠c gives N∣x−c∣(x)⊆R∖{c} by [L3]; and its interior is empty, since for every real ε>0 the point c+ε⋅2−1 lies in Nε(c) and differs from c, so no neighbourhood is contained in {c}, whence {c} is a closed set with empty interior and [L4] applies.

L3L4
1.2

By [L1] fix a bijection β:N→Q and put e:=ι∘β with ι(q)=q^, a bijection from N onto QR.

L1choose
2.1

QR=⋃n∈N{e(n)}, since e is onto QR; the sets {e(n)} are closed and nowhere dense by step 1.1, so QR is Fσ by [L5] and meager by [L4]. This is claim 1.

step 1.1step 1.2L4L5
3.1

Put Wn:=R∖{e(n)}, an open set by step 1.1 and [L3]. A real x lies in ⋂nWn exactly when x≠e(n) for every n, that is, exactly when x∉QR, so X=⋂nWn and X is Gδ by [L5]; and R∖X=QR is meager by step 2.1, so X is residual by [L4]. This is claim 2. Each Wn is also dense, since every Nε(x) contains two distinct points and so meets R∖{e(n)}, by [L2] and [L3].

step 1.1step 1.2step 2.1L2L3L4L5
4.1

Suppose, for contradiction, that QR is Gδ, and by [L5] fix a sequence (Vn) of open sets with QR=⋂nVn. Each Vn contains QR, which is dense by [L2], so each Vn is dense by [L2]; and each Wn of step 3.1 is open and dense.

assume-contrastep 3.1L2L5choose
5.1

By [L7] fix a bijection J:N×N→N and define a sequence (Dj) by DJ(m,n):=Vn when m=0 and DJ(m,n):=Wn when m≠0; this is total because J is a bijection, and every Dj is open and dense by step 4.1. Moreover ⋂jDj=(⋂nVn)∩(⋂nWn)=QR∩X=∅, since every Vn and every Wn occurs among the Dj and every Dj is one of them.

step 3.1step 4.1L7
6.1

By [L6] the set ⋂jDj is dense, hence nonempty by [L2] and [L3], contradicting step 5.1. The assumption of step 4.1 is therefore untenable: QR is not Gδ; and X is not Fσ, since R∖X=QR would then be Gδ by [L5]. This is claim 3.

step 4.1step 5.1L2L3L5L6discharge-contradiction∎

Remarks

Depends on

Used by

Dependency tree · two levels

73 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