Alphabeta Math
False statementConstruction: AI-adaptedVerification: AI-generatedprecheck 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.

FALSE: an arbitrary intersection of open subsets of R is open

Statement

False claim: for every family U of open subsets of R (Open subset of R (every point has a neighbourhood inside it), closed subset (complement open), and clopen), the intersection ⋂U is open.

The true statement is Arbitrary unions and finite intersections of open subsets of R are open, and dually for closed sets, claim 2, which asserts this for finite families only. The claim above deletes the word "finite", and the refutation below shows that the word cannot be deleted.

Facts & Assumptions

Given: For each natural k≥1 the interval Uk:=(−1/k, 1/k), where 1/k abbreviates the inverse of the canonical natural k⋅1R, which is positive for k≥1.

[A1]

The false claim: for every family U of open subsets of R, the set ⋂U is open.

[L1]

U is open when every x∈U admits ε>0 with Nε(x)⊆U, and each interval of the form (a,b) is an open set (Open subset of R (every point has a neighbourhood inside it), closed subset (complement open), and clopen, Intervals of R: the nine order-convex forms, nondegeneracy, and length).

[L2]

Nε(x)={ y:∣y−x∣<ε }=(x−ε,x+ε) (The ε-neighbourhood and the punctured ε-neighbourhood of a point of R).

[L3]

Reciprocal Archimedean property: for every real ε>0 there is a natural n≥1 with 1/n<ε (For every ε>0 in a complete ordered field there is a natural n≥1 with 1/n<ε, Every complete ordered field is Archimedean).

[L4]

Absolute value: ∣z∣≥0, ∣z∣=0 exactly when z=0, and for c>0 one has ∣z∣<c exactly when −c<z<c (Basic properties of the absolute value).

[L5]

Canonical naturals are positive for k≥1 and their inverses are positive (Canonical naturals are positive and strictly increasing, Inverses of positives are positive, and reciprocation reverses order); 0<1, so 2:=1+1>0 and 0<d⋅2−1<d for d>0 (The multiplicative identity is positive, Order is preserved by adding a constant and by adding inequalities, Sign rules for products and monotonicity of multiplication, Ordered field, Complete ordered field (least-upper-bound property)). These order-arithmetic facts are stated by their sources for the strict order only; the nonstrict forms used below follow by adjoining the equality case, in which the two sides coincide.

Refutation

technique · direct
1.1

Each Uk is an open subset of R, being an interval of the form (a,b) with a=−1/k and b=1/k, and 1/k>0 by [L5].

L1L5
1.2

0∈Uk for every k≥1, since ∣0−0∣=0<1/k by [L4] and [L5].

L4L5
1.3

The singleton {0} is not open: for every real ε>0 the element ε⋅2−1 satisfies 0<ε⋅2−1<ε by [L5], so it lies in Nε(0) by [L2] and [L4] and differs from 0; hence no Nε(0) is contained in {0}.

L1L2L4L5
2.1

⋂k≥1Uk={0}: the inclusion ⊇ is step 1.2, and for the other inclusion let x≠0; then ∣x∣>0 by [L4], so [L3] supplies a natural n≥1 with 1/n<∣x∣, and x∈Un would mean ∣x∣<1/n by [L4], which trichotomy forbids; hence x∉Un and x is not in the intersection.

step 1.2L3L4
3.1

The family { Uk:k≥1 } consists of open subsets of R by step 1.1, and its intersection is {0} by step 2.1, which is not open by step 1.3. So the claim [A1] fails for this family and is false.

step 1.1step 1.3step 2.1A1∎

Remarks

Depends on

Used by

Dependency tree · two levels

24 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