Phragmen–Brouwer theorem¶
A theorem schema equating a separation property for unions of disjoint closed sets with unicoherence under specified local and global connectedness hypotheses.
Core Idea¶
Phragmen–Brouwer theorem is a theorem schema equating a separation property for unions of disjoint closed sets with unicoherence under specified local and global connectedness hypotheses.
For a normal, connected, locally connected space X, the Phragmén–Brouwer theorem relates unicoherence to a separation principle: if two points are not separated by either of two disjoint closed sets, then they are not separated by their union. Equivalent formulations say that when X is the union of two closed connected sets, their intersection is connected or empty.
Scope of Application¶
The abstraction recurs literally within normal locally connected continua and spaces where closed separators, connected covers, and Jordan-type arguments are studied. The following habitats preserve the same recognition machinery; they are not invitations to extend the name metaphorically.
- Continuum theory. unicoherent spaces are characterized by intersection behavior.
- Plane topology. separators and complements enter Jordan curve proofs.
- Surface arguments. closed subsets are tested for separation of points.
- Fundamental groupoids. van Kampen methods yield forms of the property.
- Separation counterexamples. failure diagnoses non-unicoherence or missing hypotheses.
Clarity¶
State the precise theorem version and definitions of 'separate' and 'unicoherent.' Verify normality, connectedness, and local connectedness rather than importing a plane intuition. The conclusion concerns the union of disjoint closed sets that individually fail to separate the chosen points.
A practical identification audit begins with the typed roles rather than the title: establish the topological space, verify the distinguished points, then test the remaining conditions and exclusions.
Manages Complexity¶
The equivalence converts a global property of all connected closed covers into a point-separation test for closed sets. It lets difficult complement arguments be replaced by intersection connectivity, or conversely.
The compression remains accountable because each simplification has a named failure condition. Disagreement can be localized to a missing role, an invalid assumption, an ambiguous measurement, or a neighboring abstraction instead of being hidden inside an unanalyzed label.
Abstract Reasoning¶
R1. Verify the ambient separation and connectivity hypotheses. R2. Fix the two points and two disjoint closed candidate separators. R3. Check connectivity of the points in each individual complement. R4. Apply the Phragmén–Brouwer property to the union complement. R5. When using the converse, translate a closed connected cover into the corresponding separation configuration.
Knowledge Transfer¶
The theorem transfers literally only to topological spaces satisfying its stated hypotheses and definitions. Connectedness and union are parents; organizational silos or physical barriers are analogies.
The transfer boundary is explicit: DOMAIN-SPECIFIC PASS / PRIME FAIL: The equivalence applies across qualifying normal, connected, locally connected spaces and variants of separating closed sets. Literal recognition retains the specialist vocabulary and validity conditions of general topology; outside that setting only broader parent operations transfer. The safe move beyond the home habitat is to carry the applicable parent relation and leave the specialist name behind unless every defining role remains literal.
Relationships to Other Abstractions¶
Current abstraction Phragmen–Brouwer theorem Domain-specific
Parents (2) — more general patterns this builds on
-
Phragmen–Brouwer theorem is a decomposition of Connectedness Prime
Connectedness (
prime:connectedness). -
Phragmen–Brouwer theorem is a decomposition of Union Prime
Union (
prime:union).
Hierarchy paths (2) — routes to 2 parentless roots
- Phragmen–Brouwer theorem → Connectedness → Network → Reservoir-Flux Network → Conservation Laws → Invariance
- Phragmen–Brouwer theorem → Union → Set and Membership
Neighborhood in Abstraction Space¶
Phragmen–Brouwer theorem sits in a moderately populated region (57th percentile for distinctiveness): it has near-neighbors but no dense thicket of look-alikes.
Family — General Topology & Separation (12 abstractions)
Nearest neighbors
- A-paracompact Space — 0.90
- Uniform space — 0.89
- Open Set — 0.89
- Topological Space — 0.88
- Collectionwise Normal Space — 0.87
Computed from structural-signature embeddings · 2026-09-08