The algebraic structure generated by iterating the set operations of topological closure and set-complement on subsets of a topological space; it records all distinct sets obtainable from a given subset by successive applications of closure and complement.

Principle

Apply the two operations Cl (closure) and C (complement) repeatedly to a subset A ⊆ X; Kuratowski's theorem gives an upper bound (14) on the number of distinct sets produced in a T1 topological space, and the algebra encodes those combinatorial relations.

Demonstration

For a carefully chosen subset A of the real line with the usual topology one can realize all 14 distinct sets obtained by alternating closure and complement operations; each resulting set is expressible by a finite word in Cl and C applied to A.

Misapplication

Confusing closure with interior or using the Kuratowski algebra without regard to the ambient topology (closure depends on the topology), or assuming the 14-set upper bound holds in non-T1 or exotic topologies without checking hypotheses.

Consequence

The closure-complement algebra provides a combinatorial invariant of the topology relative to a subset, helpful for understanding the interplay between closures, interiors and boundary and for constructing pathological examples.

Reversal

Replacing closure by interior (noting Int = C ◦ Cl ◦ C) yields an equivalent description via interior and complement; reversing the order of operations exposes symmetries and dualities in the algebra.

Boundary

Depends fundamentally on the topological closure operator; in discrete topologies the algebra collapses (fewer distinct sets), while in certain non-T1 spaces Kuratowski's 14-set maximum may fail or need reinterpretation.

Semantic Tension

Close to Boolean algebra generated by open or closed sets but distinct in emphasis: Kuratowski algebra focuses on the monoid generated by two specific operations (closure and complement) and the combinatorics of their iterates.

Synthesis

The Kuratowski closure-complement algebra is the finite combinatorial structure obtained by iterating closure and complement on a subset; it encapsulates how closure and complementation interact in the given topology and yields concrete bounds (like the 14-set theorem) and counterexamples.