Alphabeta Math
LemmaStatement: AI-adaptedProof: 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.

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

Statement

Let (X,T) be a topological space, with interior, closure, boundary and exterior as in Interior, closure, boundary, exterior, derived set and isolated point in a topological space. Then:

  1. Monotonicity. A⊆B implies int⁡(A)⊆int⁡(B) and A‾⊆B‾.
  2. The two identities. For all A,B⊆X, int⁡(A∩B)=int⁡(A)∩int⁡(B),A∪B‾=A‾∪B‾.
  3. The two reverse combinations are inclusions only. For all A,B⊆X, int⁡(A)∪int⁡(B)⊆int⁡(A∪B),A∩B‾⊆A‾∩B‾, and both inclusions are strict for A={p} and B=X∖{p} in the cofinite topology on an infinite set X with p∈X (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies).
  4. Both identities of claim 2 fail for infinite families. In the same space, with I:=X∖{p}, ⋃x∈I{x}‾=I⊊X=⋃x∈I{x}‾,int⁡(⋂x∈I(X∖{x}))=∅⊊{p}=⋂x∈Iint⁡(X∖{x}).
  5. Trichotomy of position. For every A⊆X the three sets int⁡(A), ∂A and ext⁡(A) are pairwise disjoint and their union is X.

Facts & Assumptions

Given: A topological space (X,T) and subsets A,B⊆X; and, for claims 3 and 4, an infinite set X carrying the cofinite topology, a point p∈X and the index set I:=X∖{p}.

[A1]

int⁡(A) is the largest open subset of A and A‾ is the smallest closed superset of A; int⁡(A)⊆A⊆A‾; ext⁡(A)=X∖A‾ and ∂A=A‾∖int⁡(A) (Interior, closure, boundary, exterior, derived set and isolated point in a topological space).

[L1]

A topology is closed under binary intersections (T3) and its closed sets under binary unions (C3) (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison).

[L2]

In the cofinite topology on X the open sets are ∅ together with the sets of finite complement, and the closed sets are X together with the finite subsets of X (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies).

[L3]

A subset of a finite set is finite, and a union of two finite sets is finite (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies); "infinite" means "not finite" (Finite, countably infinite, countable, uncountable).

Proof

technique · direct
1.1

Claim 1: if A⊆B then every open U⊆A satisfies U⊆B, so int⁡(A)⊆int⁡(B); and B‾ is a closed set containing B⊇A, so A‾⊆B‾.

A1
1.2

int⁡(A)∩int⁡(B) is open by (T3) and is contained in A∩B, so it is contained in int⁡(A∩B); and A‾∪B‾ is closed by (C3) and contains A∪B, so it contains A∪B‾.

A1L1
1.3

Since X is infinite, X∖{p} is infinite: were it finite, X={p}∪(X∖{p}) would be a union of two finite sets and hence finite. In particular I≠∅.

givenL3
1.4

Claim 5: int⁡(A)⊆A‾ by [A1], so the three sets int⁡(A), ∂A=A‾∖int⁡(A) and ext⁡(A)=X∖A‾ are pairwise disjoint, the first two inside A‾ and the third outside it; and their union is int⁡(A)∪(A‾∖int⁡(A))∪(X∖A‾)=A‾∪(X∖A‾)=X.

A1
2.1

Claim 1 applied to A∩B⊆A and A∩B⊆B gives int⁡(A∩B)⊆int⁡(A)∩int⁡(B) and A∩B‾⊆A‾∩B‾; applied to A⊆A∪B and B⊆A∪B it gives int⁡(A)∪int⁡(B)⊆int⁡(A∪B) and A‾∪B‾⊆A∪B‾.

step 1.1
2.2

In the cofinite topology on the infinite X: the set {p} is closed, being finite, so {p}‾={p}; and {p} is not open, since X∖{p} is infinite by step 1.3, so the only open subset of {p} is ∅ and int⁡({p})=∅.

step 1.3A1L2
2.3

In the same space B:=X∖{p} is open, its complement {p} being finite, so int⁡(B)=B; and B is infinite by step 1.3, so the only closed set containing B is X and B‾=X.

step 1.3A1L2
2.4

For x∈I the singleton {x} is finite, hence closed, so {x}‾={x} and ⋃x∈I{x}‾=I; meanwhile ⋃x∈I{x}=I is infinite by step 1.3, so its closure is X, and p∈X∖I makes the inclusion strict.

step 1.3A1L2
3.1

Combining step 1.2 with step 2.1 proves claim 2, and the two inclusions of claim 3 are among those obtained in step 2.1.

step 1.2step 2.1
3.2

With A:={p} and B:=X∖{p}: int⁡(A)∪int⁡(B)=∅∪B=X∖{p}, while A∪B=X is open and so int⁡(A∪B)=X; the inclusion is therefore strict.

step 2.2step 2.3A1
3.3

With the same A and B: A∩B=∅, which is closed, so A∩B‾=∅, while A‾∩B‾={p}∩X={p}; the inclusion is therefore strict, and claim 3 is proved.

step 2.2step 2.3A1L2
3.4

For x∈I the set X∖{x} is open, so int⁡(X∖{x})=X∖{x} and ⋂x∈Iint⁡(X∖{x})=X∖I={p}; meanwhile ⋂x∈I(X∖{x})={p} has empty interior by step 2.2, so the inclusion is strict and claim 4 is proved.

step 1.3step 2.2A1L2
4.1

Claims 1, 2, 3, 4 and 5 are established by step 1.1, step 3.1, steps 3.2 and 3.3, steps 2.4 and 3.4, and step 1.4 respectively.

step 1.1step 3.1step 3.2step 3.3step 2.4step 3.4step 1.4∎

Remarks

  • Why the witnesses are all in one space. The cofinite topology on an infinite set makes every finite set closed and every infinite set dense, so it separates the four combinations of int⁡,  ⋅ ‾, ∪ and ∩ with a single pair of sets and a single index set, the two families of claim 4 being the singletons and their complements. The same four failures occur in R with its usual topology, and the sharpest form of the first is on the companion page: the interiors of Q and of its complement are both empty while the interior of their union is everything (In R the interiors of Q and of its complement are both empty while the interior of their union is everything ↗).

  • Claim 2 does extend to any finite number of sets, by iterating it, but not to a family indexed by a set that merely happens to be finite in some other sense: the induction is on the number of sets and claim 4 shows where it stops.

  • The four inclusions of claims 2 and 3 are the only ones that hold in general. For an arbitrary family the surviving statements are ⋃iint⁡(Ai)⊆int⁡(⋃iAi), int⁡(⋂iAi)⊆⋂iint⁡(Ai), ⋃iAi‾⊆⋃iAi‾ and ⋂iAi‾⊆⋂iAi‾, each by monotonicity alone, and claim 4 shows that two of the four are already strict: the third for the family of singletons and the second for the family of their complements.

Depends on

Used by

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