Skip to content

Urysohn's lemma

A normal-space theorem that separates any disjoint closed sets by a continuous function taking prescribed values 0 and 1 on them.

Version
v1 · 2026-09-28 · History
Domain-specific #
12740
Domain group
Formal Sciences
Origin domain
Mathematics
Subdomain
General Topology → Mathematics
Aliases
Urysohn lemma, Urysohn separation lemma

Core Idea

Urysohn's lemma turns a separation property of a topological space into a continuous real-valued witness. In a normal space, any disjoint closed A and B can be assigned opposite endpoint values by some continuous f:X→[0,1]. Conversely, if such a function exists for every pair, inverse images of separated subintervals give disjoint open neighborhoods of A and B, recovering normality. The theorem is about all disjoint closed pairs, not one fortunate construction, and the nonempty-set convention is inessential to the separation idea.

The endpoint condition is inclusion, not exactness: A lies within f⁻¹(0) and B within f⁻¹(1), but additional points may share those values. Requiring exact fibers leads toward a stronger perfectly-normal setting. Standard proofs nest open neighborhoods along dyadic levels to construct a continuous separator; that proof technique explains why mere disjointness is insufficient without normality. The lemma supplies functions in extension and partition-of-unity arguments, while retaining the hypotheses of those later constructions. It is distinct from a continuous function as an object and from a normal space as a class, even though it relates the two.

Scope of Application

These uses require a normal ambient topology and a declared closed-pair separation task.

  • Point-set topology. Characterize normality by continuous closed-set separators.
  • Function construction. Build [0,1]-valued witnesses for a specified disjoint closed pair.
  • Extension arguments. Use separators as ingredients in Tietze-type constructions.
  • Partition of unity. Separate closed pieces under the surrounding cover's required hypotheses.

Clarity

For any two disjoint closed A and B in a normal space, a continuous f:X→[0,1] can be 0 on A and 1 on B; the universal availability also characterizes normality. A function for one lucky pair proves no such space-wide property. The nearest stronger miss demands exact endpoint fibers, which the lemma does not. A discontinuous indicator is not a substitute for the continuous witness, and the Hausdorff convention should be stated separately.

Manages Complexity

Topological separation is stated in terms of many open neighborhoods. The lemma packages each closed-pair separation into one continuous scalar witness that can be composed and combined in later proofs. This reduces proof complexity but only if the quantifier and closedness are retained; dropping them makes the convenient functional form falsely universal.

Abstract Reasoning

  1. State the ambient topology and which normality convention is used.
  2. Choose disjoint closed A and B, retaining the universal quantifier for the theorem.
  3. Seek a continuous [0,1]-valued function fixed to opposite endpoint values on those sets.
  4. Distinguish inclusion in endpoint fibers from equality of whole fibers.
  5. Use inverse images of separated intervals for the converse or the separator as a bounded ingredient in later constructions.

Knowledge Transfer

The closed-pair-to-continuous-witness move transfers across metric and compact Hausdorff spaces because they satisfy the needed normality conditions. Particular formulas on R do not transfer to an arbitrary normal space; there one uses the topological construction. Tietze extension and partitions of unity can reuse separators, but only with their own closedness and cover hypotheses. Without normality or closed disjoint inputs, this exact guarantee stops.

Relationships to Other Abstractions

Local relationship map for Urysohn's lemmaParents appear above the current abstraction, mutual partners to the right, and children below. Node labels state whether each abstraction is prime or domain-specific; colors identify relation types.Urysohn's lemmaDOMAINDomain-specific abstraction: Normal space — is a kind ofNormal spaceDOMAIN

Current abstraction Urysohn's lemma Domain-specific

Parents (1) — more general patterns this builds on

  • Urysohn's lemma is a kind of Normal space Domain-specific

    Urysohn's lemma is the analytic characterization theorem of exactly the separation property that defines a normal space.

Hierarchy path (1) — routes to 1 parentless root

Neighborhood in Abstraction Space

Urysohn's lemma sits in a crowded region of the domain-specific corpus (30th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Algebraic Varieties & Topological Invariants (27 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-08