Alphabeta Math
False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-27
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.

FALSE: Q is a Gδ subset of R

Statement

False claim: Q, that is the set QR of rationals inside R (The rationals embed densely in the reals), is a Gδ set (Fσ and Gδ subsets of R): there is a sequence (Vn) of open subsets of R with QR=⋂nVn.

The claim looks plausible by symmetry. QR is Fσ, being a countable union of singletons; the irrationals are Gδ, being a countable intersection of complements of singletons; and the two classes are exchanged by complementation. So one expects each set to belong to both classes. It does not: the symmetry between the two classes says nothing about a single set, and the obstruction is the Baire category theorem.

Facts & Assumptions

Given: The set QR⊆R of rationals.

[A1]

The false claim: QR is a Gδ subset of R.

[L1]

QR is Fσ and meager, the irrationals are Gδ and residual, and QR is not Gδ (Q is Fσ, meager and not Gδ, while the irrationals are Gδ, residual and not Fσ, claims 1, 2 and 3).

Refutation

technique · direct
1.1

By claim 3 of [L1], QR is not a Gδ subset of R, which is the direct negation of [A1].

A1L1L2
1.2

The reason, recorded here so that the refutation is not merely a pointer: were QR=⋂nVn with each Vn open, every Vn would contain the dense set QR and so be dense; adjoining the dense open sets R∖{q}, one for each rational q, would produce an at most countable family of dense open sets whose intersection is QR minus every rational, that is ∅, contradicting [L3].

L1L2L3
2.1

So [A1] is false, and the refutation is carried out in full in [L1].

step 1.1step 1.2A1∎

Remarks

Depends on

Used by

Dependency tree · two levels

32 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