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

In R the interiors of Q and of its complement are both empty while the interior of their union is everything

Statement refuted

Refuted: that int⁡(A∪B)=int⁡(A)∪int⁡(B). Claim 3 of Interior commutes with finite intersections and closure with finite unions, while the two reverse combinations are inclusions only and both fail for infinite families; the space is the disjoint union of interior, boundary and exterior asserts only the inclusion int⁡(A)∪int⁡(B)⊆int⁡(A∪B), and the gap can be the whole space.

Witness. In R with its usual topology (Metrizable space: a topological space whose topology is induced by some metric; metrizability is topological, the metric is not, The absolute value makes R a metric space: d(x,y)=∣x−y∣ is a metric, its open balls are the intervals (x−r,x+r), and it is unbounded) take A:=Q, the image of the rationals in R, and B:=R∖Q. Then

int⁡(A)=int⁡(B)=∅,int⁡(A∪B)=int⁡(R)=R.

Facts & Assumptions

Given: R with its usual topology, the set Q⊆R of rationals and its complement R∖Q.

[L2]

For a<b the interval (a,b) is uncountable (Every nondegenerate interval of R is uncountable, Finite, countably infinite, countable, uncountable); Q is at most countable (Q is countably infinite) and every subset of an at most countable set is at most countable (Every subset of an at most countable set is at most countable).

[L3]

Strictly between any two reals lies a rational (The rationals embed densely in the reals).

Counterexample

technique · direct
1.1

A nonempty open subset of R contains a ball (x−r, x+r) with r>0, and x−r<x+r, so that ball is uncountable by [L2].

L1L2
1.2

No nonempty open subset of R is contained in R∖Q: such a set would contain a ball (x−r, x+r), and by [L3] there is a rational strictly between x−r and x+r, which lies in that ball and not in R∖Q.

L1L3
1.3

Q∪(R∖Q)=R, which is open, so int⁡(Q∪(R∖Q))=R.

A1
2.1

No nonempty open subset of R is contained in Q: such a set would contain an uncountable ball by step 1.1, while every subset of Q is at most countable by [L2].

step 1.1L2
3.1

By step 2.1 the only open subset of Q is ∅, so int⁡(Q)=∅; by step 1.2 the same holds for R∖Q, so int⁡(R∖Q)=∅.

step 2.1step 1.2A1
4.1

By steps 3.1 and 1.3 the left side of the inclusion of [L4] is ∅∪∅=∅ and the right side is R, so the inclusion is strict and the identity fails as badly as it can.

step 3.1step 1.3L4∎

Remarks

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

86 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