number_theory.liouville.residual | Mathlib porting status

Changes since the initial port

The following section lists changes to this file in mathlib3 and mathlib4 that occured after the initial port. Most recent changes are shown first. Hovering over a commit will show all commits associated with the same mathlib3 commit.

Changes in mathlib3

32b08ef8

(last sync)

Changes in mathlib3port

mathlib3

mathlib3port

af471b9e

bump to nightly-2024-04-25-08

mathlib commit https://github.com/leanprover-community/mathlib/commit/65a1391a0106c9204fe45bc73a039f056558cb83

ad7a2212

Diff

@@ -32,7 +32,7 @@ theorem setOf_liouville_eq_iInter_iUnion :
   by
   ext x
   simp only [mem_Inter, mem_Union, Liouville, mem_set_of_eq, exists_prop, mem_diff,
-    mem_singleton_iff, mem_ball, Real.dist_eq, and_comm']
+    mem_singleton_iff, mem_ball, Real.dist_eq, and_comm]
 #align set_of_liouville_eq_Inter_Union setOf_liouville_eq_iInter_iUnion
 -/

af471b9e

bump to nightly-2024-04-09-08

mathlib commit https://github.com/leanprover-community/mathlib/commit/65a1391a0106c9204fe45bc73a039f056558cb83

659ec6f7

Diff

@@ -83,7 +83,7 @@ theorem eventually_residual_liouville : ∀ᶠ x in residual ℝ, Liouville x :=
     · convert mem_ball_self _ using 2
       · push_cast; norm_cast; norm_num
       · refine' one_div_pos.2 (pow_pos (Int.cast_pos.2 _) _)
-        exact mul_pos (Int.coe_nat_pos.2 r.pos) zero_lt_two
+        exact mul_pos (Int.natCast_pos.2 r.pos) zero_lt_two
 #align eventually_residual_liouville eventually_residual_liouville
 -/

af471b9e

bump to nightly-2024-04-06-08

mathlib commit https://github.com/leanprover-community/mathlib/commit/65a1391a0106c9204fe45bc73a039f056558cb83

e34029c9

Diff

@@ -4,7 +4,7 @@ Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Yury Kudryashov
 -/
 import NumberTheory.Liouville.Basic
-import Topology.MetricSpace.Baire
+import Topology.Baire.Lemmas
 import Topology.Instances.Irrational
 
 #align_import number_theory.liouville.residual from "leanprover-community/mathlib"@"af471b9e3ce868f296626d33189b4ce730fa4c00"

af471b9e

bump to nightly-2024-03-17-08

mathlib commit https://github.com/leanprover-community/mathlib/commit/65a1391a0106c9204fe45bc73a039f056558cb83

22f01ce4

Diff

@@ -79,7 +79,7 @@ theorem eventually_residual_liouville : ∀ᶠ x in residual ℝ, Liouville x :=
   · rintro _ ⟨r, rfl⟩
     simp only [mem_Inter, mem_Union]
     refine' fun n => ⟨r.num * 2, r.denom * 2, _, _⟩
-    · have := Int.ofNat_le.2 r.pos; rw [Int.ofNat_one] at this ; linarith
+    · have := Int.ofNat_le.2 r.pos; rw [Int.ofNat_one] at this; linarith
     · convert mem_ball_self _ using 2
       · push_cast; norm_cast; norm_num
       · refine' one_div_pos.2 (pow_pos (Int.cast_pos.2 _) _)

af471b9e

bump to nightly-2024-02-17-08

mathlib commit https://github.com/leanprover-community/mathlib/commit/65a1391a0106c9204fe45bc73a039f056558cb83

42bef5c2

Diff

@@ -36,14 +36,14 @@ theorem setOf_liouville_eq_iInter_iUnion :
 #align set_of_liouville_eq_Inter_Union setOf_liouville_eq_iInter_iUnion
 -/
 
-#print isGδ_setOf_liouville /-
-theorem isGδ_setOf_liouville : IsGδ {x | Liouville x} :=
+#print IsGδ.setOf_liouville /-
+theorem IsGδ.setOf_liouville : IsGδ {x | Liouville x} :=
   by
   rw [setOf_liouville_eq_iInter_iUnion]
-  refine' isGδ_iInter fun n => IsOpen.isGδ _
+  refine' IsGδ.iInter fun n => IsOpen.isGδ _
   refine' isOpen_iUnion fun a => isOpen_iUnion fun b => isOpen_iUnion fun hb => _
   exact is_open_ball.inter is_closed_singleton.is_open_compl
-#align is_Gδ_set_of_liouville isGδ_setOf_liouville
+#align is_Gδ_set_of_liouville IsGδ.setOf_liouville
 -/
 
 /- ./././Mathport/Syntax/Translate/Expr.lean:107:6: warning: expanding binder group (a b) -/
@@ -73,7 +73,7 @@ theorem eventually_residual_liouville : ∀ᶠ x in residual ℝ, Liouville x :=
   refine' eventually_residual.2 ⟨_, _, rat.dense_embedding_coe_real.dense.mono _, subset.rfl⟩
   ·
     exact
-      isGδ_iInter fun n =>
+      IsGδ.iInter fun n =>
         IsOpen.isGδ <|
           isOpen_iUnion fun a => isOpen_iUnion fun b => isOpen_iUnion fun hb => is_open_ball
   · rintro _ ⟨r, rfl⟩

af471b9e

bump to nightly-2023-11-29-11

mathlib commit https://github.com/leanprover-community/mathlib/commit/65a1391a0106c9204fe45bc73a039f056558cb83

049e2cad

Diff

@@ -81,7 +81,7 @@ theorem eventually_residual_liouville : ∀ᶠ x in residual ℝ, Liouville x :=
     refine' fun n => ⟨r.num * 2, r.denom * 2, _, _⟩
     · have := Int.ofNat_le.2 r.pos; rw [Int.ofNat_one] at this ; linarith
     · convert mem_ball_self _ using 2
-      · push_cast ; norm_cast; norm_num
+      · push_cast; norm_cast; norm_num
       · refine' one_div_pos.2 (pow_pos (Int.cast_pos.2 _) _)
         exact mul_pos (Int.coe_nat_pos.2 r.pos) zero_lt_two
 #align eventually_residual_liouville eventually_residual_liouville

af471b9e

bump to nightly-2023-09-24-06

mathlib commit https://github.com/leanprover-community/mathlib/commit/ce64cd319bb6b3e82f31c2d38e79080d377be451

5655435f

Diff

@@ -3,9 +3,9 @@ Copyright (c) 2021 Yury Kudryashov. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Yury Kudryashov
 -/
-import Mathbin.NumberTheory.Liouville.Basic
-import Mathbin.Topology.MetricSpace.Baire
-import Mathbin.Topology.Instances.Irrational
+import NumberTheory.Liouville.Basic
+import Topology.MetricSpace.Baire
+import Topology.Instances.Irrational
 
 #align_import number_theory.liouville.residual from "leanprover-community/mathlib"@"af471b9e3ce868f296626d33189b4ce730fa4c00"

af471b9e

bump to nightly-2023-07-20-09

mathlib commit https://github.com/leanprover-community/mathlib/commit/8ea5598db6caeddde6cb734aa179cc2408dbd345

9c56d0dd

Diff

@@ -2,16 +2,13 @@
 Copyright (c) 2021 Yury Kudryashov. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Yury Kudryashov
-
-! This file was ported from Lean 3 source module number_theory.liouville.residual
-! leanprover-community/mathlib commit af471b9e3ce868f296626d33189b4ce730fa4c00
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathbin.NumberTheory.Liouville.Basic
 import Mathbin.Topology.MetricSpace.Baire
 import Mathbin.Topology.Instances.Irrational
 
+#align_import number_theory.liouville.residual from "leanprover-community/mathlib"@"af471b9e3ce868f296626d33189b4ce730fa4c00"
+
 /-!
 # Density of Liouville numbers

af471b9e

bump to nightly-2023-06-13-21

mathlib commit https://github.com/leanprover-community/mathlib/commit/9fb8964792b4237dac6200193a0d533f1b3f7423

829520ac

Diff

@@ -28,6 +28,7 @@ open scoped Filter
 open Filter Set Metric
 
 /- ./././Mathport/Syntax/Translate/Expr.lean:107:6: warning: expanding binder group (a b) -/
+#print setOf_liouville_eq_iInter_iUnion /-
 theorem setOf_liouville_eq_iInter_iUnion :
     {x | Liouville x} =
       ⋂ n : ℕ, ⋃ (a : ℤ) (b : ℤ) (hb : 1 < b), ball (a / b) (1 / b ^ n) \ {a / b} :=
@@ -36,6 +37,7 @@ theorem setOf_liouville_eq_iInter_iUnion :
   simp only [mem_Inter, mem_Union, Liouville, mem_set_of_eq, exists_prop, mem_diff,
     mem_singleton_iff, mem_ball, Real.dist_eq, and_comm']
 #align set_of_liouville_eq_Inter_Union setOf_liouville_eq_iInter_iUnion
+-/
 
 #print isGδ_setOf_liouville /-
 theorem isGδ_setOf_liouville : IsGδ {x | Liouville x} :=
@@ -48,6 +50,7 @@ theorem isGδ_setOf_liouville : IsGδ {x | Liouville x} :=
 -/
 
 /- ./././Mathport/Syntax/Translate/Expr.lean:107:6: warning: expanding binder group (a b) -/
+#print setOf_liouville_eq_irrational_inter_iInter_iUnion /-
 theorem setOf_liouville_eq_irrational_inter_iInter_iUnion :
     {x | Liouville x} =
       {x | Irrational x} ∩ ⋂ n : ℕ, ⋃ (a : ℤ) (b : ℤ) (hb : 1 < b), ball (a / b) (1 / b ^ n) :=
@@ -62,6 +65,7 @@ theorem setOf_liouville_eq_irrational_inter_iInter_iUnion :
     refine' diff_subset_diff subset.rfl (singleton_subset_iff.2 ⟨a / b, _⟩)
     norm_cast
 #align set_of_liouville_eq_irrational_inter_Inter_Union setOf_liouville_eq_irrational_inter_iInter_iUnion
+-/
 
 #print eventually_residual_liouville /-
 /-- The set of Liouville numbers is a residual set. -/

af471b9e

bump to nightly-2023-06-04-18

mathlib commit https://github.com/leanprover-community/mathlib/commit/5f25c089cb34db4db112556f23c50d12da81b297

3fb4268b

Diff

@@ -4,7 +4,7 @@ Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Yury Kudryashov
 
 ! This file was ported from Lean 3 source module number_theory.liouville.residual
-! leanprover-community/mathlib commit 32b08ef840dd25ca2e47e035c5da03ce16d2dc3c
+! leanprover-community/mathlib commit af471b9e3ce868f296626d33189b4ce730fa4c00
 ! Please do not edit these lines, except to modify the commit id
 ! if you have ported upstream changes.
 -/
@@ -15,6 +15,9 @@ import Mathbin.Topology.Instances.Irrational
 /-!
 # Density of Liouville numbers
 
+> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
+> Any changes to this file require a corresponding PR to mathlib4.
+
 In this file we prove that the set of Liouville numbers form a dense `Gδ` set. We also prove a
 similar statement about irrational numbers.
 -/
@@ -26,7 +29,7 @@ open Filter Set Metric
 
 /- ./././Mathport/Syntax/Translate/Expr.lean:107:6: warning: expanding binder group (a b) -/
 theorem setOf_liouville_eq_iInter_iUnion :
-    { x | Liouville x } =
+    {x | Liouville x} =
       ⋂ n : ℕ, ⋃ (a : ℤ) (b : ℤ) (hb : 1 < b), ball (a / b) (1 / b ^ n) \ {a / b} :=
   by
   ext x
@@ -34,18 +37,20 @@ theorem setOf_liouville_eq_iInter_iUnion :
     mem_singleton_iff, mem_ball, Real.dist_eq, and_comm']
 #align set_of_liouville_eq_Inter_Union setOf_liouville_eq_iInter_iUnion
 
-theorem isGδ_setOf_liouville : IsGδ { x | Liouville x } :=
+#print isGδ_setOf_liouville /-
+theorem isGδ_setOf_liouville : IsGδ {x | Liouville x} :=
   by
   rw [setOf_liouville_eq_iInter_iUnion]
   refine' isGδ_iInter fun n => IsOpen.isGδ _
   refine' isOpen_iUnion fun a => isOpen_iUnion fun b => isOpen_iUnion fun hb => _
   exact is_open_ball.inter is_closed_singleton.is_open_compl
 #align is_Gδ_set_of_liouville isGδ_setOf_liouville
+-/
 
 /- ./././Mathport/Syntax/Translate/Expr.lean:107:6: warning: expanding binder group (a b) -/
 theorem setOf_liouville_eq_irrational_inter_iInter_iUnion :
-    { x | Liouville x } =
-      { x | Irrational x } ∩ ⋂ n : ℕ, ⋃ (a : ℤ) (b : ℤ) (hb : 1 < b), ball (a / b) (1 / b ^ n) :=
+    {x | Liouville x} =
+      {x | Irrational x} ∩ ⋂ n : ℕ, ⋃ (a : ℤ) (b : ℤ) (hb : 1 < b), ball (a / b) (1 / b ^ n) :=
   by
   refine' subset.antisymm _ _
   · refine' subset_inter (fun x hx => hx.Irrational) _
@@ -58,6 +63,7 @@ theorem setOf_liouville_eq_irrational_inter_iInter_iUnion :
     norm_cast
 #align set_of_liouville_eq_irrational_inter_Inter_Union setOf_liouville_eq_irrational_inter_iInter_iUnion
 
+#print eventually_residual_liouville /-
 /-- The set of Liouville numbers is a residual set. -/
 theorem eventually_residual_liouville : ∀ᶠ x in residual ℝ, Liouville x :=
   by
@@ -78,9 +84,12 @@ theorem eventually_residual_liouville : ∀ᶠ x in residual ℝ, Liouville x :=
       · refine' one_div_pos.2 (pow_pos (Int.cast_pos.2 _) _)
         exact mul_pos (Int.coe_nat_pos.2 r.pos) zero_lt_two
 #align eventually_residual_liouville eventually_residual_liouville
+-/
 
+#print dense_liouville /-
 /-- The set of Liouville numbers in dense. -/
-theorem dense_liouville : Dense { x | Liouville x } :=
+theorem dense_liouville : Dense {x | Liouville x} :=
   dense_of_mem_residual eventually_residual_liouville
 #align dense_liouville dense_liouville
+-/

32b08ef8

bump to nightly-2023-06-01-16

mathlib commit https://github.com/leanprover-community/mathlib/commit/cca40788df1b8755d5baf17ab2f27dacc2e17acb

b9c87c70

Diff

@@ -72,7 +72,7 @@ theorem eventually_residual_liouville : ∀ᶠ x in residual ℝ, Liouville x :=
   · rintro _ ⟨r, rfl⟩
     simp only [mem_Inter, mem_Union]
     refine' fun n => ⟨r.num * 2, r.denom * 2, _, _⟩
-    · have := Int.ofNat_le.2 r.pos; rw [Int.ofNat_one] at this; linarith
+    · have := Int.ofNat_le.2 r.pos; rw [Int.ofNat_one] at this ; linarith
     · convert mem_ball_self _ using 2
       · push_cast ; norm_cast; norm_num
       · refine' one_div_pos.2 (pow_pos (Int.cast_pos.2 _) _)

32b08ef8

bump to nightly-2023-05-28-18

mathlib commit https://github.com/leanprover-community/mathlib/commit/917c3c072e487b3cccdbfeff17e75b40e45f66cb

8d353152

Diff

@@ -20,7 +20,7 @@ similar statement about irrational numbers.
 -/
 
 
-open Filter
+open scoped Filter
 
 open Filter Set Metric

32b08ef8

bump to nightly-2023-05-28-04

mathlib commit https://github.com/leanprover-community/mathlib/commit/917c3c072e487b3cccdbfeff17e75b40e45f66cb

6797a637

Diff

@@ -72,13 +72,9 @@ theorem eventually_residual_liouville : ∀ᶠ x in residual ℝ, Liouville x :=
   · rintro _ ⟨r, rfl⟩
     simp only [mem_Inter, mem_Union]
     refine' fun n => ⟨r.num * 2, r.denom * 2, _, _⟩
-    · have := Int.ofNat_le.2 r.pos
-      rw [Int.ofNat_one] at this
-      linarith
+    · have := Int.ofNat_le.2 r.pos; rw [Int.ofNat_one] at this; linarith
     · convert mem_ball_self _ using 2
-      · push_cast
-        norm_cast
-        norm_num
+      · push_cast ; norm_cast; norm_num
       · refine' one_div_pos.2 (pow_pos (Int.cast_pos.2 _) _)
         exact mul_pos (Int.coe_nat_pos.2 r.pos) zero_lt_two
 #align eventually_residual_liouville eventually_residual_liouville

32b08ef8

bump to nightly-2023-05-14-08

mathlib commit https://github.com/leanprover-community/mathlib/commit/e3fb84046afd187b710170887195d50bada934ee

d31da313

Diff

@@ -25,50 +25,50 @@ open Filter
 open Filter Set Metric
 
 /- ./././Mathport/Syntax/Translate/Expr.lean:107:6: warning: expanding binder group (a b) -/
-theorem setOf_liouville_eq_interᵢ_unionᵢ :
+theorem setOf_liouville_eq_iInter_iUnion :
     { x | Liouville x } =
       ⋂ n : ℕ, ⋃ (a : ℤ) (b : ℤ) (hb : 1 < b), ball (a / b) (1 / b ^ n) \ {a / b} :=
   by
   ext x
   simp only [mem_Inter, mem_Union, Liouville, mem_set_of_eq, exists_prop, mem_diff,
     mem_singleton_iff, mem_ball, Real.dist_eq, and_comm']
-#align set_of_liouville_eq_Inter_Union setOf_liouville_eq_interᵢ_unionᵢ
+#align set_of_liouville_eq_Inter_Union setOf_liouville_eq_iInter_iUnion
 
 theorem isGδ_setOf_liouville : IsGδ { x | Liouville x } :=
   by
-  rw [setOf_liouville_eq_interᵢ_unionᵢ]
-  refine' isGδ_interᵢ fun n => IsOpen.isGδ _
-  refine' isOpen_unionᵢ fun a => isOpen_unionᵢ fun b => isOpen_unionᵢ fun hb => _
+  rw [setOf_liouville_eq_iInter_iUnion]
+  refine' isGδ_iInter fun n => IsOpen.isGδ _
+  refine' isOpen_iUnion fun a => isOpen_iUnion fun b => isOpen_iUnion fun hb => _
   exact is_open_ball.inter is_closed_singleton.is_open_compl
 #align is_Gδ_set_of_liouville isGδ_setOf_liouville
 
 /- ./././Mathport/Syntax/Translate/Expr.lean:107:6: warning: expanding binder group (a b) -/
-theorem setOf_liouville_eq_irrational_inter_interᵢ_unionᵢ :
+theorem setOf_liouville_eq_irrational_inter_iInter_iUnion :
     { x | Liouville x } =
       { x | Irrational x } ∩ ⋂ n : ℕ, ⋃ (a : ℤ) (b : ℤ) (hb : 1 < b), ball (a / b) (1 / b ^ n) :=
   by
   refine' subset.antisymm _ _
   · refine' subset_inter (fun x hx => hx.Irrational) _
-    rw [setOf_liouville_eq_interᵢ_unionᵢ]
+    rw [setOf_liouville_eq_iInter_iUnion]
     exact Inter_mono fun n => Union₂_mono fun a b => Union_mono fun hb => diff_subset _ _
-  · simp only [inter_Inter, inter_Union, setOf_liouville_eq_interᵢ_unionᵢ]
+  · simp only [inter_Inter, inter_Union, setOf_liouville_eq_iInter_iUnion]
     refine' Inter_mono fun n => Union₂_mono fun a b => Union_mono fun hb => _
     rw [inter_comm]
     refine' diff_subset_diff subset.rfl (singleton_subset_iff.2 ⟨a / b, _⟩)
     norm_cast
-#align set_of_liouville_eq_irrational_inter_Inter_Union setOf_liouville_eq_irrational_inter_interᵢ_unionᵢ
+#align set_of_liouville_eq_irrational_inter_Inter_Union setOf_liouville_eq_irrational_inter_iInter_iUnion
 
 /-- The set of Liouville numbers is a residual set. -/
 theorem eventually_residual_liouville : ∀ᶠ x in residual ℝ, Liouville x :=
   by
-  rw [Filter.Eventually, setOf_liouville_eq_irrational_inter_interᵢ_unionᵢ]
+  rw [Filter.Eventually, setOf_liouville_eq_irrational_inter_iInter_iUnion]
   refine' eventually_residual_irrational.and _
   refine' eventually_residual.2 ⟨_, _, rat.dense_embedding_coe_real.dense.mono _, subset.rfl⟩
   ·
     exact
-      isGδ_interᵢ fun n =>
+      isGδ_iInter fun n =>
         IsOpen.isGδ <|
-          isOpen_unionᵢ fun a => isOpen_unionᵢ fun b => isOpen_unionᵢ fun hb => is_open_ball
+          isOpen_iUnion fun a => isOpen_iUnion fun b => isOpen_iUnion fun hb => is_open_ball
   · rintro _ ⟨r, rfl⟩
     simp only [mem_Inter, mem_Union]
     refine' fun n => ⟨r.num * 2, r.denom * 2, _, _⟩

32b08ef8

bump to nightly-2023-02-21-16

mathlib commit https://github.com/leanprover-community/mathlib/commit/bd9851ca476957ea4549eb19b40e7b5ade9428cc

1107b979

Changes in mathlib4

mathlib3

mathlib4

32b08ef8

chore: Rename coe_nat/coe_int/coe_rat to natCast/intCast/ratCast (#11499)

This is less exhaustive than its sibling #11486 because edge cases are harder to classify. No fundamental difficulty, just me being a bit fast and lazy.

Reduce the diff of #11203

b2af0d13

Diff

@@ -69,7 +69,7 @@ theorem eventually_residual_liouville : ∀ᶠ x in residual ℝ, Liouville x :=
     · convert @mem_ball_self ℝ _ (r : ℝ) _ _
       · push_cast; norm_cast; simp [Rat.divInt_mul_right (two_ne_zero), Rat.mkRat_self]
       · refine' one_div_pos.2 (pow_pos (Int.cast_pos.2 _) _)
-        exact mul_pos (Int.coe_nat_pos.2 r.pos) zero_lt_two
+        exact mul_pos (Int.natCast_pos.2 r.pos) zero_lt_two
 #align eventually_residual_liouville eventually_residual_liouville
 
 /-- The set of Liouville numbers in dense. -/

32b08ef8

refactor: optimize proofs with omega (#11093)

I ran tryAtEachStep on all files under Mathlib to find all locations where omega succeeds. For each that was a linarith without an only, I tried replacing it with omega, and I verified that elaboration time got smaller. (In almost all cases, there was a noticeable speedup.) I also replaced some slow aesops along the way.

37bc4aba

Diff

@@ -65,7 +65,7 @@ theorem eventually_residual_liouville : ∀ᶠ x in residual ℝ, Liouville x :=
   · rintro _ ⟨r, rfl⟩
     simp only [mem_iInter, mem_iUnion]
     refine fun n => ⟨r.num * 2, r.den * 2, ?_, ?_⟩
-    · have := Int.ofNat_le.2 r.pos; rw [Int.ofNat_one] at this; linarith
+    · have := Int.ofNat_le.2 r.pos; rw [Int.ofNat_one] at this; omega
     · convert @mem_ball_self ℝ _ (r : ℝ) _ _
       · push_cast; norm_cast; simp [Rat.divInt_mul_right (two_ne_zero), Rat.mkRat_self]
       · refine' one_div_pos.2 (pow_pos (Int.cast_pos.2 _) _)

32b08ef8

chore: split MetricSpace/Baire (#10648)

move definition to Topology/Defs/Basic;
move lemmas to Topology/Baire/Lemmas;
move instances to Topology/Baire/CompleteMetrizable and Topology/Baire/LocallyCompactRegular;
assume [UniformSpace X] [IsCountablyGenerated (𝓤 X)] instead of [PseudoMetricSpace X] in the 1st theorem.

This way Lemmas file does not depend on analysis.

744792b4

Diff

@@ -4,7 +4,8 @@ Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Yury Kudryashov
 -/
 import Mathlib.NumberTheory.Liouville.Basic
-import Mathlib.Topology.MetricSpace.Baire
+import Mathlib.Topology.Baire.Lemmas
+import Mathlib.Topology.Baire.LocallyCompactRegular
 import Mathlib.Topology.Instances.Irrational
 
 #align_import number_theory.liouville.residual from "leanprover-community/mathlib"@"32b08ef840dd25ca2e47e035c5da03ce16d2dc3c"

32b08ef8

chore(Topology/GDelta): use new-style dot notation (#10583)

Rename many isGδ_some lemmas to IsGδ.some. Also resolve a TODO.

2be6479c

Diff

@@ -30,13 +30,15 @@ theorem setOf_liouville_eq_iInter_iUnion :
     mem_singleton_iff, mem_ball, Real.dist_eq, and_comm]
 #align set_of_liouville_eq_Inter_Union setOf_liouville_eq_iInter_iUnion
 
-theorem isGδ_setOf_liouville : IsGδ { x | Liouville x } := by
+theorem IsGδ.setOf_liouville : IsGδ { x | Liouville x } := by
   rw [setOf_liouville_eq_iInter_iUnion]
-  refine isGδ_iInter fun n => IsOpen.isGδ ?_
+  refine .iInter fun n => IsOpen.isGδ ?_
   refine isOpen_iUnion fun a => isOpen_iUnion fun b => isOpen_iUnion fun _hb => ?_
   exact isOpen_ball.inter isClosed_singleton.isOpen_compl
 set_option linter.uppercaseLean3 false in
-#align is_Gδ_set_of_liouville isGδ_setOf_liouville
+#align is_Gδ_set_of_liouville IsGδ.setOf_liouville
+
+@[deprecated] alias isGδ_setOf_liouville := IsGδ.setOf_liouville -- 2024-02-15
 
 theorem setOf_liouville_eq_irrational_inter_iInter_iUnion :
     { x | Liouville x } =
@@ -56,8 +58,8 @@ theorem setOf_liouville_eq_irrational_inter_iInter_iUnion :
 theorem eventually_residual_liouville : ∀ᶠ x in residual ℝ, Liouville x := by
   rw [Filter.Eventually, setOf_liouville_eq_irrational_inter_iInter_iUnion]
   refine eventually_residual_irrational.and ?_
-  refine eventually_residual.2 ⟨_, ?_, Rat.denseEmbedding_coe_real.dense.mono ?_, Subset.rfl⟩
-  · exact isGδ_iInter fun n => IsOpen.isGδ <|
+  refine residual_of_dense_Gδ ?_ (Rat.denseEmbedding_coe_real.dense.mono ?_)
+  · exact .iInter fun n => IsOpen.isGδ <|
           isOpen_iUnion fun a => isOpen_iUnion fun b => isOpen_iUnion fun _hb => isOpen_ball
   · rintro _ ⟨r, rfl⟩
     simp only [mem_iInter, mem_iUnion]
@@ -71,5 +73,5 @@ theorem eventually_residual_liouville : ∀ᶠ x in residual ℝ, Liouville x :=
 
 /-- The set of Liouville numbers in dense. -/
 theorem dense_liouville : Dense { x | Liouville x } :=
-    dense_of_mem_residual eventually_residual_liouville
+  dense_of_mem_residual eventually_residual_liouville
 #align dense_liouville dense_liouville

32b08ef8

chore: script to replace headers with #align_import statements (#5979)

depends on: #5966

Co-authored-by: Eric Wieser <wieser.eric@gmail.com> Co-authored-by: Scott Morrison <scott.morrison@gmail.com>

89aa3a3b

Diff

@@ -2,16 +2,13 @@
 Copyright (c) 2021 Yury Kudryashov. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Yury Kudryashov
-
-! This file was ported from Lean 3 source module number_theory.liouville.residual
-! leanprover-community/mathlib commit 32b08ef840dd25ca2e47e035c5da03ce16d2dc3c
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathlib.NumberTheory.Liouville.Basic
 import Mathlib.Topology.MetricSpace.Baire
 import Mathlib.Topology.Instances.Irrational
 
+#align_import number_theory.liouville.residual from "leanprover-community/mathlib"@"32b08ef840dd25ca2e47e035c5da03ce16d2dc3c"
+
 /-!
 # Density of Liouville numbers

32b08ef8

chore: remove occurrences of semicolon after space (#5713)

This is the second half of the changes originally in #5699, removing all occurrences of ; after a space and implementing a linter rule to enforce it.

In most cases this 2-character substring has a space after it, so the following command was run first:

find . -type f -name "*.lean" -exec sed -i -E 's/ ; /; /g' {} \;

The remaining cases were few enough in number that they were done manually.

c795bd35

Diff

@@ -65,7 +65,7 @@ theorem eventually_residual_liouville : ∀ᶠ x in residual ℝ, Liouville x :=
   · rintro _ ⟨r, rfl⟩
     simp only [mem_iInter, mem_iUnion]
     refine fun n => ⟨r.num * 2, r.den * 2, ?_, ?_⟩
-    · have := Int.ofNat_le.2 r.pos; rw [Int.ofNat_one] at this ; linarith
+    · have := Int.ofNat_le.2 r.pos; rw [Int.ofNat_one] at this; linarith
     · convert @mem_ball_self ℝ _ (r : ℝ) _ _
       · push_cast; norm_cast; simp [Rat.divInt_mul_right (two_ne_zero), Rat.mkRat_self]
       · refine' one_div_pos.2 (pow_pos (Int.cast_pos.2 _) _)

32b08ef8

style: allow _ for an argument in notation3 & replace _foo with _ in notation3 (#4652)

e2b5ca37

Diff

@@ -26,7 +26,7 @@ open Filter Set Metric
 
 theorem setOf_liouville_eq_iInter_iUnion :
     { x | Liouville x } =
-      ⋂ n : ℕ, ⋃ (a : ℤ) (b : ℤ) (_hb : 1 < b),
+      ⋂ n : ℕ, ⋃ (a : ℤ) (b : ℤ) (_ : 1 < b),
       ball ((a : ℝ) / b) (1 / (b : ℝ) ^ n) \ {(a : ℝ) / b} := by
   ext x
   simp only [mem_iInter, mem_iUnion, Liouville, mem_setOf_eq, exists_prop, mem_diff,

32b08ef8

feat: port NumberTheory.Liouville.Residual (#4592)

55a106e9

`number_theory.liouville.residual` ⟷ `Mathlib.NumberTheory.Liouville.Residual`

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 12 + 877

number_theory.liouville.residual ⟷ Mathlib.NumberTheory.Liouville.Residual

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 12 + 877

`number_theory.liouville.residual` ⟷ `Mathlib.NumberTheory.Liouville.Residual`