In topology  and analysis  , the closed envelope  (also closure  or closure  ) of a subset of a topological  or  metric space is  the smallest  closed  superset of .
  
    
      
        U 
       
     
    {\ displaystyle U} 
   
 
  
    
      
        U 
       
     
    {\ displaystyle U} 
   
  
definition If a topological space is  , then the  closed  envelope  or the  closure of  a subset is the intersection of all  closed subsets  of which contain. The set is itself closed, so it is the smallest closed  superset  of .
  
    
      
        X 
       
     
    {\ displaystyle X} 
   
 
  
    
      
        
          
            U 
            ¯ 
           
         
       
     
    {\ displaystyle {\ overline {U}}} 
   
 
  
    
      
        U 
        ⊆ 
        X 
       
     
    {\ displaystyle U \ subseteq X} 
   
 
  
    
      
        X 
       
     
    {\ displaystyle X} 
   
 
  
    
      
        U 
       
     
    {\ displaystyle U} 
   
 
  
    
      
        
          
            U 
            ¯ 
           
         
       
     
    {\ displaystyle {\ overline {U}}} 
   
 
  
    
      
        U 
       
     
    {\ displaystyle U} 
   
  
A point is called a point of contact  or  adherence point  of if at least one element of is contained in every  neighborhood  of . consists exactly of the contact points of .
  
    
      
        b 
        ∈ 
        X 
       
     
    {\ displaystyle b \ in X} 
   
 
  
    
      
        U 
       
     
    {\ displaystyle U} 
   
 
  
    
      
        b 
       
     
    {\ displaystyle b} 
   
 
  
    
      
        U 
       
     
    {\ displaystyle U} 
   
 
  
    
      
        
          
            U 
            ¯ 
           
         
       
     
    {\ displaystyle {\ overline {U}}} 
   
 
  
    
      
        U 
       
     
    {\ displaystyle U} 
   
  
The conclusion as a set of limit values If the first axiom of countability is fulfilled  (this applies, for example, if is a metric space), then is the set of all  limit values  of convergent sequences whose terms lie in.
  
    
      
        X 
       
     
    {\ displaystyle X} 
   
 
  
    
      
        X 
       
     
    {\ displaystyle X} 
   
 
  
    
      
        
          
            U 
            ¯ 
           
         
       
     
    {\ displaystyle {\ overline {U}}} 
   
 
  
    
      
        U 
       
     
    {\ displaystyle U} 
   
  
If any topological space is, then the closure of a subset is the set of limit values of convergent networks  , the terms of which are in.
  
    
      
        X 
       
     
    {\ displaystyle X} 
   
 
  
    
      
        U 
        ⊆ 
        X 
       
     
    {\ displaystyle U \ subseteq X} 
   
 
  
    
      
        U 
       
     
    {\ displaystyle U} 
   
  
Completion of spheres in metric spaces 
 
Let it be a metric space with metrics . Note that in general the closed envelope of an open sphere
  
    
      
        X 
       
     
    {\ displaystyle X} 
   
 
  
    
      
        d 
       
     
    {\ displaystyle d} 
   
 
  
    
      
        
          
            
              B. 
              ( 
              x 
              , 
              r 
              ) 
             
            ¯ 
           
         
       
     
    {\ displaystyle {\ overline {B (x, r)}}} 
   
 
  
    
      
        B. 
        ( 
        x 
        , 
        r 
        ) 
        = 
        { 
        y 
        ∈ 
        X 
        ∣ 
        d 
        ( 
        x 
        , 
        y 
        ) 
        < 
        r 
        } 
       
     
    {\ displaystyle B (x, r) = \ {y \ in X \ mid d (x, y) <r \}} 
   
 with radius and center is not the same as the closed sphere
  
    
      
        r 
       
     
    {\ displaystyle r} 
   
 
  
    
      
        x 
        ∈ 
        X 
       
     
    {\ displaystyle x \ in X} 
   
 
  
    
      
        
          
            B. 
            ¯ 
           
         
        ( 
        x 
        , 
        r 
        ) 
        = 
        { 
        y 
        ∈ 
        X 
        ∣ 
        d 
        ( 
        x 
        , 
        y 
        ) 
        ≤ 
        r 
        } 
        . 
       
     
    {\ displaystyle {\ overline {B}} (x, r) = \ {y \ in X \ mid d (x, y) \ leq r \}.} 
   
 Since the closed sphere is a closed set that contains the open sphere, it also contains its closure:
  
    
      
        
          
            
              B. 
              ( 
              x 
              , 
              r 
              ) 
             
            ¯ 
           
         
        ⊆ 
        
          
            B. 
            ¯ 
           
         
        ( 
        x 
        , 
        r 
        ) 
       
     
    {\ displaystyle {\ overline {B (x, r)}} \ subseteq {\ overline {B}} (x, r)} 
   
 To give an example in which this inclusion is real, let X be  a set (with at least two elements) on which a metric passes
  
    
      
        d 
        ( 
        x 
        , 
        y 
        ) 
        = 
        
          { 
          
            
              
                
                  1 
                 
                
                  
                    f 
                    
                      
                        
                          u 
                          ¨ 
                         
                       
                     
                    r 
                   
                    
                  x 
                  ≠ 
                  y 
                 
               
              
                
                  0 
                 
                
                  
                    f 
                    
                      
                        
                          u 
                          ¨ 
                         
                       
                     
                    r 
                   
                    
                  x 
                  = 
                  y 
                 
               
             
           
           
       
     
    {\ displaystyle d (x, y) = \ left \ {{\ begin {matrix} 1 & \ mathrm {f {\ ddot {u}} r} \ x \ not = y \\ 0 & \ mathrm {f {\ ddot {u}} r} \ x = y \ end {matrix}} \ right.} 
   
 is defined. Then applies to each :
  
    
      
        x 
        ∈ 
        X 
       
     
    {\ displaystyle x \ in X} 
   
 
  
    
      
        { 
        x 
        } 
        = 
        B. 
        ( 
        x 
        , 
        1 
        ) 
        = 
        
          
            
              B. 
              ( 
              x 
              , 
              1 
              ) 
             
            ¯ 
           
         
        ⊊ 
        
          
            B. 
            ¯ 
           
         
        ( 
        x 
        , 
        1 
        ) 
        = 
        X 
        . 
       
     
    {\ displaystyle \ {x \} = B (x, 1) = {\ overline {B (x, 1)}} \ subsetneq {\ overline {B}} (x, 1) = X.} 
   
 In addition, there are also metric spaces in which, for a point x  and a radius r,  both inclusions are real at the same time:
  
    
      
        B. 
        ( 
        x 
        , 
        r 
        ) 
        ⊊ 
        
          
            
              B. 
              ( 
              x 
              , 
              r 
              ) 
             
            ¯ 
           
         
        ⊊ 
        
          
            B. 
            ¯ 
           
         
        ( 
        x 
        , 
        r 
        ) 
        . 
       
     
    {\ displaystyle B (x, r) \ subsetneq {\ overline {B (x, r)}} \ subsetneq {\ overline {B}} (x, r).} 
   
 An example is the set with the metric induced by Euclidean space . Here the specified inclusion condition is met :
  
    
      
        X 
        = 
        { 
        ( 
        a 
        , 
        0 
        ) 
        
          | 
         
        a 
        ∈ 
        
          R. 
         
        , 
        - 
        1 
        ≤ 
        a 
        ≤ 
        1 
        } 
        ∪ 
        { 
        ( 
        0 
        , 
        1 
        ) 
        } 
       
     
    {\ displaystyle X = \ {(a, 0) | a \ in \ mathbb {R}, -1 \ leq a \ leq 1 \} \ cup \ {(0,1) \}} 
   
 
  
    
      
        
          
            R. 
           
          
            2 
           
         
       
     
    {\ displaystyle \ mathbb {R} ^ {2}} 
   
 
  
    
      
        x 
        = 
        ( 
        0 
        , 
        0 
        ) 
        , 
        r 
        = 
        1 
       
     
    {\ displaystyle x = (0,0), r = 1} 
   
 
  
    
      
        B. 
        ( 
        0 
        , 
        1 
        ) 
        = 
        { 
        ( 
        a 
        , 
        0 
        ) 
        ∣ 
        a 
        ∈ 
        
          R. 
         
        , 
        - 
        1 
        < 
        a 
        < 
        1 
        } 
        ⊊ 
       
     
    {\ displaystyle B (0,1) = \ {(a, 0) \ mid a \ in \ mathbb {R}, -1 <a <1 \} \ subsetneq} 
   
 
  
    
      
        
          
            
              B. 
              ( 
              0 
              , 
              1 
              ) 
             
            ¯ 
           
         
        = 
        { 
        ( 
        a 
        , 
        0 
        ) 
        ∣ 
        a 
        ∈ 
        
          R. 
         
        , 
        - 
        1 
        ≤ 
        a 
        ≤ 
        1 
        } 
        ⊊ 
       
     
    {\ displaystyle {\ overline {B (0,1)}} = \ {(a, 0) \ mid a \ in \ mathbb {R}, -1 \ leq a \ leq 1 \} \ subsetneq} 
   
 
  
    
      
        
          
            B. 
            ¯ 
           
         
        ( 
        0 
        , 
        1 
        ) 
        = 
        { 
        ( 
        a 
        , 
        0 
        ) 
        ∣ 
        a 
        ∈ 
        
          R. 
         
        , 
        - 
        1 
        ≤ 
        a 
        ≤ 
        1 
        } 
        ∪ 
        { 
        ( 
        0 
        , 
        1 
        ) 
        } 
        = 
        X 
       
     
    {\ displaystyle {\ overline {B}} (0,1) = \ {(a, 0) \ mid a \ in \ mathbb {R}, -1 \ leq a \ leq 1 \} \ cup \ {(0 , 1) \} = X} 
   
  
literature Gabriele Castellini: Categorical Closure Operators.  Birkhäuser, Boston MA et al. 2003, ISBN 0-8176-4250-1  .  
<img src="https://de.wikipedia.org/wiki/Special:CentralAutoLogin/start?type=1x1" alt="" title="" width="1" height="1" style="border: none; position: absolute;">