topology.G_delta

# Gδ sets #

THIS FILE IS SYNCHRONIZED WITH MATHLIB4. Any changes to this file require a corresponding PR to mathlib4.

In this file we define Gδ sets and prove their basic properties.

## Main definitions #

• is_Gδ: a set s is a Gδ set if it can be represented as an intersection of countably many open sets;

• residual: the σ-filter of residual sets. A set s is called residual if it includes a countable intersection of dense open sets.

## Main results #

We prove that finite or countable intersections of Gδ sets is a Gδ set. We also prove that the continuity set of a function from a topological space to an (e)metric space is a Gδ set.

## Tags #

Gδ set, residual set

def is_Gδ {α : Type u_1} (s : set α) :
Prop

A Gδ set is a countable intersection of open sets.

Equations
theorem is_open.is_Gδ {α : Type u_1} {s : set α} (h : is_open s) :

An open set is a Gδ set.

@[simp]
theorem is_Gδ_empty {α : Type u_1}  :
@[simp]
theorem is_Gδ_univ {α : Type u_1}  :
theorem is_Gδ_bInter_of_open {α : Type u_1} {ι : Type u_4} {I : set ι} (hI : I.countable) {f : ι set α} (hf : (i : ι), i I is_open (f i)) :
is_Gδ ( (i : ι) (H : i I), f i)
theorem is_Gδ_Inter_of_open {α : Type u_1} {ι : Type u_4} [encodable ι] {f : ι set α} (hf : (i : ι), is_open (f i)) :
is_Gδ ( (i : ι), f i)
theorem is_Gδ_Inter {α : Type u_1} {ι : Type u_4} [encodable ι] {s : ι set α} (hs : (i : ι), is_Gδ (s i)) :
is_Gδ ( (i : ι), s i)

The intersection of an encodable family of Gδ sets is a Gδ set.

theorem is_Gδ_bInter {α : Type u_1} {ι : Type u_4} {s : set ι} (hs : s.countable) {t : Π (i : ι), i s set α} (ht : (i : ι) (H : i s), is_Gδ (t i H)) :
is_Gδ ( (i : ι) (H : i s), t i H)
theorem is_Gδ_sInter {α : Type u_1} {S : set (set α)} (h : (s : set α), s S ) (hS : S.countable) :

A countable intersection of Gδ sets is a Gδ set.

theorem is_Gδ.inter {α : Type u_1} {s t : set α} (hs : is_Gδ s) (ht : is_Gδ t) :
is_Gδ (s t)
theorem is_Gδ.union {α : Type u_1} {s t : set α} (hs : is_Gδ s) (ht : is_Gδ t) :
is_Gδ (s t)

The union of two Gδ sets is a Gδ set.

theorem is_Gδ_bUnion {α : Type u_1} {ι : Type u_4} {s : set ι} (hs : s.finite) {f : ι set α} (h : (i : ι), i s is_Gδ (f i)) :
is_Gδ ( (i : ι) (H : i s), f i)

The union of finitely many Gδ sets is a Gδ set.

theorem is_closed.is_Gδ {α : Type u_1} {s : set α} (hs : is_closed s) :
theorem is_Gδ_compl_singleton {α : Type u_1} [t1_space α] (a : α) :
theorem set.countable.is_Gδ_compl {α : Type u_1} [t1_space α] {s : set α} (hs : s.countable) :
theorem set.finite.is_Gδ_compl {α : Type u_1} [t1_space α] {s : set α} (hs : s.finite) :
theorem set.subsingleton.is_Gδ_compl {α : Type u_1} [t1_space α] {s : set α} (hs : s.subsingleton) :
theorem finset.is_Gδ_compl {α : Type u_1} [t1_space α] (s : finset α) :
theorem is_Gδ_singleton {α : Type u_1} [t1_space α] (a : α) :
is_Gδ {a}
theorem set.finite.is_Gδ {α : Type u_1} [t1_space α] {s : set α} (hs : s.finite) :
theorem is_Gδ_set_of_continuous_at {α : Type u_1} {β : Type u_2} (f : α β) :
is_Gδ {x : α | x}

The set of points where a function is continuous is a Gδ set.

@[protected, instance]
def residual (α : Type u_1)  :

A set s is called residual if it includes a countable intersection of dense open sets.

Equations
Instances for residual
@[protected, instance]
theorem residual_of_dense_open {α : Type u_1} {s : set α} (ho : is_open s) (hd : dense s) :
s

Dense open sets are residual.

theorem residual_of_dense_Gδ {α : Type u_1} {s : set α} (ho : is_Gδ s) (hd : dense s) :
s

Dense Gδ sets are residual.

theorem mem_residual_iff {α : Type u_1} {s : set α} :
s (S : set (set α)), ( (t : set α), t S is_open t) ( (t : set α), t S dense t) S.countable ⋂₀ S s

A set is residual iff it includes a countable intersection of dense open sets.