Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablejudge 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.

Open subset of R (every point has a neighbourhood inside it), closed subset (complement open), and clopen

Definition

Let U,F⊆R, with neighbourhoods as in The ε-neighbourhood and the punctured ε-neighbourhood of a point of R.

  • U is open when for every x∈U there is a real ε>0 with Nε(x)⊆U.
  • F is closed when its complement R∖F is open.
  • A set is clopen when it is both open and closed.

The whole of the topology of R developed on this page rests on this one definition: closedness is defined as openness of the complement, and every other description of a closed set on this page is a theorem (The closure equals the set together with its limit points, equals the set of points every neighbourhood of which meets it, and is the smallest closed superset; a set is closed iff it contains its limit points, A point lies in the closure of A⊆R iff some sequence in A converges to it, so a subset of R is closed iff it is sequentially closed).

∅ and R are clopen. The condition defining openness quantifies over the elements of the set, so it holds vacuously for ∅; and for x∈R one has N1(x)⊆R, so R is open. Since each of the two is the complement of the other, each is also closed.

Every neighbourhood is open. Let y∈Nε(x) and put δ:=ε−∣y−x∣, which is >0 because y∈Nε(x). The nesting property of The ε-neighbourhood and the punctured ε-neighbourhood of a point of R gives Nδ(y)⊆Nε(x). So every point of Nε(x) has a neighbourhood inside it.

The four open forms of Intervals of R: the nine order-convex forms, nondegeneracy, and length are open sets. Let a,b∈R.

  • (a,b): for x with a<x<b, both x−a>0 and b−x>0, so δ:=min⁡{x−a, b−x} is a positive real (the minimum of a two-element set of reals exists, Every nonempty finite set of reals has a maximum and a minimum, Maximum and minimum of a set). If ∣y−x∣<δ then y>x−δ≥x−(x−a)=a and y<x+δ≤x+(b−x)=b, so y∈(a,b); hence Nδ(x)⊆(a,b).
  • (a,∞): for x>a take δ:=x−a>0; then ∣y−x∣<δ gives y>x−δ=a.
  • (−∞,b): for x<b take δ:=b−x>0; then ∣y−x∣<δ gives y<x+δ=b.
  • (−∞,∞)=R: already treated above.

The four closed forms of Intervals of R: the nine order-convex forms, nondegeneracy, and length are closed sets. In each case the complement is shown open directly.

  • [a,b]: if x∉[a,b] then x<a or x>b by trichotomy (Ordered field). If x<a, take δ:=a−x>0; every y∈Nδ(x) has y<x+δ=a, hence y∉[a,b]. If x>b, take δ:=x−b>0; every y∈Nδ(x) has y>x−δ=b, hence y∉[a,b]. So R∖[a,b] is open.
  • [a,∞): its complement is (−∞,a), which is open by the previous paragraph.
  • (−∞,b]: its complement is (b,∞), which is open.
  • (−∞,∞)=R: its complement is ∅, which is open.

Remarks

  • Open and closed are not opposites, and not exhaustive. A set may be neither: the half-open interval [0,1) is neither open nor closed (FALSE: every subset of R is either open or closed). A set may be both: ∅ and R are clopen. The words are inherited from the interval terminology of Intervals of R: the nine order-convex forms, nondegeneracy, and length, and the agreement between the two usages is exactly the two lists verified above: an interval called open there is an open set here, and an interval called closed there is a closed set here.

  • A clopen set is a disconnection waiting to happen. If A is clopen and both A and R∖A are nonempty, then each of the two is its own closure, so the two are separated in the sense of Separated sets, disconnection, and connected subset of R and R=A∪(R∖A) is a disconnection. Since R is order-convex it is connected (A subset of R is connected if and only if it is order-convex, that is, an interval), so no such A exists: ∅ and R are the only clopen subsets of R.

  • The half-open forms are the ones the two lists omit, and deliberately so: [a,b) and (a,b] with a<b are neither open nor closed as subsets of R.

  • The radius depends on the point. Openness asks for some ε at each point, and that ε may shrink to nothing as the point approaches the edge of the set, as the computation for (a,b) shows: there δ=min⁡{x−a, b−x} tends to 0 as x tends to either endpoint. Asking instead for a single ε that works simultaneously at every point of the set is a strictly stronger condition, and it is not what is defined here; nothing on this page uses it.

Depends on

Used by

…and 47 more results.

Dependency tree · two levels

16 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