Definition
A topological space is compact if every cover of the space by members of a subbase has a finite subcover: equivalently, if every open cover by subbasic open sets admits a finite subcover, then every open cover admits a finite subcover (compactness).
Principle
Principle
Compactness can be verified by checking the finite-subcover property only on covers formed from a generating subbasis rather than all open covers; subbasic covers encode enough combinatorial information about the topology to detect compactness.
Demonstration
Demonstration
In proving Tychonoff's theorem, one uses the product subbase of cylinder sets: showing that every cover of the product by these subbasic sets has a finite subcover yields compactness of the product if each factor is compact.
Misapplication
Misapplication
Attempting to apply the theorem using a family that is not a subbasis for the topology, or checking only finite intersections of subbasic sets without ensuring they generate the topology, which can give false conclusions about compactness.
Consequence
Consequence
Reduces many compactness proofs to combinatorial checks on a manageable generating family; enables elegant proofs of product-compactness results and simplifies verification in constructions defined by subbases.
Reversal
Reversal
If a space is compact then trivially every cover by elements of any subbasis has a finite subcover; the theorem's power is that the converse test (checking subbasic covers) suffices to establish compactness in general.
Boundary
Boundary
Applies when one has an explicit subbasis generating the topology; it is a tool for checking compactness, not a criterion that replaces other structural hypotheses (e.g., local compactness, Hausdorff separation) when these are relevant.
Semantic Tension
Semantic Tension
Tension appears with base-based compactness arguments: one may prefer to use a basis or nets/filters for compactness; the subbase viewpoint trades local refinement for a coarser but globally generating family, which can be more efficient or less precise.
Synthesis
Synthesis
Alexander's Subbase Theorem compresses the compactness condition to checks on covers by a generating subbasis: if every such subbasic cover has a finite subcover, the space is compact, a principle leveraged in key compactness proofs.