How this calculation works
Enter a finite universe and select a named topology or supply its proposed open subsets. The checker tests the axioms first. Valid families receive connectedness, compactness and T₀, T₁ and Hausdorff results. Invalid families instead receive concrete missing-set witnesses, so the tool does not silently replace the family with its generated topology.
A finite family is a topology iff it contains ∅ and X and is closed under pairwise union and intersectionA worked example
On X = {a,b,c}, the family {∅,{a},{a,b},X} is a valid connected compact topology. It is T₀ but not T₁ or Hausdorff. Selecting every subset gives the discrete topology, which is Hausdorff and disconnected when the universe has more than one point.
Good to know
Finite spaces on 1–6 points and at most 64 proposed subsets. The SVG shows set membership, not a metric embedding or proof by geometric appearance. All valid finite topological spaces are compact; the tool does not generalize that result to infinite spaces. Properties are withheld for invalid families.
Reference: J Peter May: finite spaces and larger contexts (opens in a new tab) ↗
The collection of open sets is the input
A finite topology is determined by a collection of subsets of its universe. It is not determined by where the points appear on the screen. In the custom mode, every subset you enter is a proposed open set. The checker normalizes duplicate subsets but does not add missing unions or intersections and then pretend the original input was valid.
The original three-point task is retained with the default universe a, b, c. The same finite checks also work for up to six named points. The discrete preset selects every subset, and the indiscrete preset selects only the empty set and the universe. The checkbox list edits the same custom family as the text field, so selecting a subset is equivalent to adding its expression. Switching presets changes the proposed family; it does not change what the topology axioms require.
Use a witness to repair an invalid family
The empty set and the whole universe must be present. The union and intersection of any selected pair must also be present. In a finite family, repeatedly applying those pairwise tests establishes closure for every finite union and finite intersection. An arbitrary union of members of a finite family reduces to the union of finitely many distinct members, which is why this bounded check is sufficient here.
For example, the family {∅,{a},{b},X} on three points fails the union test because {a,b} is missing. The result table identifies that exact pair and the missing subset. It does not report connectedness or compactness for that invalid proposal. The finite set operations calculator can practice a union or intersection independently before you edit the proposed family.
Find a separation rather than guessing from the picture
A valid space is disconnected when a nonempty proper open set has an open complement. Those two sets are disjoint, cover the universe and separate it. The checker lists open sets, marks those whose complements are also open and gives one separating clopen witness when it finds one. A selected subset being open does not by itself mean it creates a separation.
The default nested family {∅,{a},{a,b},X} has no nontrivial clopen subset, so it is connected. In contrast, {∅,{a},{b,c},X} is disconnected: {a} and {b,c} are both open and partition the universe. These conclusions follow from the selected subsets, not from distances between a, b and c or from whether colored outlines happen to overlap.
Compactness and Hausdorffness answer different questions
Every finite topological space is compact. From any open cover, choose one covering member for each point. Because there are finitely many points, the chosen members form a finite subcover. This argument does not require a metric, a drawing with bounded coordinates or the Hausdorff property. It also does not show that an arbitrary infinite space is compact.
Hausdorffness asks whether each pair of distinct points has disjoint open neighborhoods. The checker tests that condition and reports pairs that cannot be separated. In a finite space, Hausdorffness forces the discrete topology. With more than one point, the discrete topology is disconnected, even though it remains compact. The one-point space is both connected and Hausdorff, so the result must depend on universe size.
Interpret the separation columns carefully
T₀ requires each distinct pair to be distinguished by some open set containing one and not the other. T₁ requires each singleton to be closed, which is equivalent here to checking that its complement is open. The default nested three-point family is T₀, but it is not T₁ or Hausdorff. Those labels describe different requirements and should not be collapsed into one generic separation score.
The membership SVG lists the elements inside each selected subset. Its row positions have no metric meaning, and a long family scrolls rather than hiding subsets. Downloading the SVG preserves that membership view. The ideal and quotient ring calculator uses a separate partition diagram for algebraic cosets; that partition should not be mistaken for a collection of open sets unless a topology has actually been defined.
A few questions, answered
Why is compactness always Yes for valid input?
Every finite topological space has a finite subcover for every open cover, by choosing one covering member for each point.
Does the checker silently generate a topology from my subsets?
No. It checks exactly the proposed family after duplicate-subset normalization and reports missing axiom-required sets.
Can an invalid family still show property results?
The checker withholds topological property claims until the axioms pass. The diagram then labels the rows as proposed subsets.
Can a set be open and closed?
Yes. Its complement must also be open. Any nonempty proper clopen subset witnesses disconnectedness.