topology.uniform_space.matrix | 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

f2ce6086

(last sync)

Changes in mathlib3port

mathlib3

mathlib3port

d64d67d0

bump to nightly-2024-03-17-08

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

22f01ce4

Diff

@@ -45,8 +45,8 @@ theorem uniformContinuous {β : Type _} [UniformSpace β] {f : β → Matrix m n
 instance [CompleteSpace 𝕜] : CompleteSpace (Matrix m n 𝕜) :=
   (by infer_instance : CompleteSpace (m → n → 𝕜))
 
-instance [SeparatedSpace 𝕜] : SeparatedSpace (Matrix m n 𝕜) :=
-  (by infer_instance : SeparatedSpace (m → n → 𝕜))
+instance [T0Space 𝕜] : T0Space (Matrix m n 𝕜) :=
+  (by infer_instance : T0Space (m → n → 𝕜))
 
 end Matrix

d64d67d0

bump to nightly-2023-09-24-06

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

5655435f

Diff

@@ -3,8 +3,8 @@ Copyright (c) 2022 Eric Wieser. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Eric Wieser, Heather Macbeth
 -/
-import Mathbin.Topology.UniformSpace.Pi
-import Mathbin.Data.Matrix.Basic
+import Topology.UniformSpace.Pi
+import Data.Matrix.Basic
 
 #align_import topology.uniform_space.matrix from "leanprover-community/mathlib"@"d64d67d000b974f0d86a2be7918cf800be6271c8"

d64d67d0

bump to nightly-2023-07-20-09

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

9c56d0dd

Diff

@@ -2,15 +2,12 @@
 Copyright (c) 2022 Eric Wieser. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Eric Wieser, Heather Macbeth
-
-! This file was ported from Lean 3 source module topology.uniform_space.matrix
-! leanprover-community/mathlib commit d64d67d000b974f0d86a2be7918cf800be6271c8
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathbin.Topology.UniformSpace.Pi
 import Mathbin.Data.Matrix.Basic
 
+#align_import topology.uniform_space.matrix from "leanprover-community/mathlib"@"d64d67d000b974f0d86a2be7918cf800be6271c8"
+
 /-!
 # Uniform space structure on matrices

d64d67d0

bump to nightly-2023-06-13-21

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

829520ac

Diff

@@ -28,6 +28,7 @@ namespace Matrix
 instance : UniformSpace (Matrix m n 𝕜) :=
   (by infer_instance : UniformSpace (m → n → 𝕜))
 
+#print Matrix.uniformity /-
 theorem uniformity :
     𝓤 (Matrix m n 𝕜) = ⨅ (i : m) (j : n), (𝓤 𝕜).comap fun a => (a.1 i j, a.2 i j) :=
   by
@@ -35,11 +36,14 @@ theorem uniformity :
   simp_rw [Filter.comap_iInf, Filter.comap_comap]
   rfl
 #align matrix.uniformity Matrix.uniformity
+-/
 
+#print Matrix.uniformContinuous /-
 theorem uniformContinuous {β : Type _} [UniformSpace β] {f : β → Matrix m n 𝕜} :
     UniformContinuous f ↔ ∀ i j, UniformContinuous fun x => f x i j := by
   simp only [UniformContinuous, Matrix.uniformity, Filter.tendsto_iInf, Filter.tendsto_comap_iff]
 #align matrix.uniform_continuous Matrix.uniformContinuous
+-/
 
 instance [CompleteSpace 𝕜] : CompleteSpace (Matrix m n 𝕜) :=
   (by infer_instance : CompleteSpace (m → n → 𝕜))

d64d67d0

bump to nightly-2023-05-28-18

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

8d353152

Diff

@@ -19,7 +19,7 @@ import Mathbin.Data.Matrix.Basic
 -/
 
 
-open uniformity Topology
+open scoped uniformity Topology
 
 variable (m n 𝕜 : Type _) [UniformSpace 𝕜]

d64d67d0

bump to nightly-2023-05-28-06

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

ba5d8b97

Diff

@@ -28,12 +28,6 @@ namespace Matrix
 instance : UniformSpace (Matrix m n 𝕜) :=
   (by infer_instance : UniformSpace (m → n → 𝕜))
 
-/- warning: matrix.uniformity -> Matrix.uniformity is a dubious translation:
-lean 3 declaration is
-  forall (m : Type.{u1}) (n : Type.{u2}) (𝕜 : Type.{u3}) [_inst_1 : UniformSpace.{u3} 𝕜], Eq.{succ (max u1 u2 u3)} (Filter.{max u1 u2 u3} (Prod.{max u1 u2 u3, max u1 u2 u3} (Matrix.{u1, u2, u3} m n 𝕜) (Matrix.{u1, u2, u3} m n 𝕜))) (uniformity.{max u1 u2 u3} (Matrix.{u1, u2, u3} m n 𝕜) (Matrix.uniformSpace.{u1, u2, u3} m n 𝕜 _inst_1)) (iInf.{max u1 u2 u3, succ u1} (Filter.{max u1 u2 u3} (Prod.{max u1 u2 u3, max u1 u2 u3} (Matrix.{u1, u2, u3} m n 𝕜) (Matrix.{u1, u2, u3} m n 𝕜))) (ConditionallyCompleteLattice.toHasInf.{max u1 u2 u3} (Filter.{max u1 u2 u3} (Prod.{max u1 u2 u3, max u1 u2 u3} (Matrix.{u1, u2, u3} m n 𝕜) (Matrix.{u1, u2, u3} m n 𝕜))) (CompleteLattice.toConditionallyCompleteLattice.{max u1 u2 u3} (Filter.{max u1 u2 u3} (Prod.{max u1 u2 u3, max u1 u2 u3} (Matrix.{u1, u2, u3} m n 𝕜) (Matrix.{u1, u2, u3} m n 𝕜))) (Filter.completeLattice.{max u1 u2 u3} (Prod.{max u1 u2 u3, max u1 u2 u3} (Matrix.{u1, u2, u3} m n 𝕜) (Matrix.{u1, u2, u3} m n 𝕜))))) m (fun (i : m) => iInf.{max u1 u2 u3, succ u2} (Filter.{max u1 u2 u3} (Prod.{max u1 u2 u3, max u1 u2 u3} (Matrix.{u1, u2, u3} m n 𝕜) (Matrix.{u1, u2, u3} m n 𝕜))) (ConditionallyCompleteLattice.toHasInf.{max u1 u2 u3} (Filter.{max u1 u2 u3} (Prod.{max u1 u2 u3, max u1 u2 u3} (Matrix.{u1, u2, u3} m n 𝕜) (Matrix.{u1, u2, u3} m n 𝕜))) (CompleteLattice.toConditionallyCompleteLattice.{max u1 u2 u3} (Filter.{max u1 u2 u3} (Prod.{max u1 u2 u3, max u1 u2 u3} (Matrix.{u1, u2, u3} m n 𝕜) (Matrix.{u1, u2, u3} m n 𝕜))) (Filter.completeLattice.{max u1 u2 u3} (Prod.{max u1 u2 u3, max u1 u2 u3} (Matrix.{u1, u2, u3} m n 𝕜) (Matrix.{u1, u2, u3} m n 𝕜))))) n (fun (j : n) => Filter.comap.{max u1 u2 u3, u3} (Prod.{max u1 u2 u3, max u1 u2 u3} (Matrix.{u1, u2, u3} m n 𝕜) (Matrix.{u1, u2, u3} m n 𝕜)) (Prod.{u3, u3} 𝕜 𝕜) (fun (a : Prod.{max u1 u2 u3, max u1 u2 u3} (Matrix.{u1, u2, u3} m n 𝕜) (Matrix.{u1, u2, u3} m n 𝕜)) => Prod.mk.{u3, u3} 𝕜 𝕜 (Prod.fst.{max u1 u2 u3, max u1 u2 u3} (Matrix.{u1, u2, u3} m n 𝕜) (Matrix.{u1, u2, u3} m n 𝕜) a i j) (Prod.snd.{max u1 u2 u3, max u1 u2 u3} (Matrix.{u1, u2, u3} m n 𝕜) (Matrix.{u1, u2, u3} m n 𝕜) a i j)) (uniformity.{u3} 𝕜 _inst_1))))
-but is expected to have type
-  forall (m : Type.{u3}) (n : Type.{u2}) (𝕜 : Type.{u1}) [_inst_1 : UniformSpace.{u1} 𝕜], Eq.{max (max (succ u3) (succ u2)) (succ u1)} (Filter.{max (max u1 u2) u3} (Prod.{max (max u1 u2) u3, max (max u1 u2) u3} (Matrix.{u3, u2, u1} m n 𝕜) (Matrix.{u3, u2, u1} m n 𝕜))) (uniformity.{max (max u1 u2) u3} (Matrix.{u3, u2, u1} m n 𝕜) (Matrix.instUniformSpaceMatrix.{u3, u2, u1} m n 𝕜 _inst_1)) (iInf.{max (max u3 u2) u1, succ u3} (Filter.{max (max u3 u2) u1} (Prod.{max (max u1 u2) u3, max (max u1 u2) u3} (Matrix.{u3, u2, u1} m n 𝕜) (Matrix.{u3, u2, u1} m n 𝕜))) (ConditionallyCompleteLattice.toInfSet.{max (max u3 u2) u1} (Filter.{max (max u3 u2) u1} (Prod.{max (max u1 u2) u3, max (max u1 u2) u3} (Matrix.{u3, u2, u1} m n 𝕜) (Matrix.{u3, u2, u1} m n 𝕜))) (CompleteLattice.toConditionallyCompleteLattice.{max (max u3 u2) u1} (Filter.{max (max u3 u2) u1} (Prod.{max (max u1 u2) u3, max (max u1 u2) u3} (Matrix.{u3, u2, u1} m n 𝕜) (Matrix.{u3, u2, u1} m n 𝕜))) (Filter.instCompleteLatticeFilter.{max (max u3 u2) u1} (Prod.{max (max u1 u2) u3, max (max u1 u2) u3} (Matrix.{u3, u2, u1} m n 𝕜) (Matrix.{u3, u2, u1} m n 𝕜))))) m (fun (i : m) => iInf.{max (max u3 u2) u1, succ u2} (Filter.{max (max u3 u2) u1} (Prod.{max (max u1 u2) u3, max (max u1 u2) u3} (Matrix.{u3, u2, u1} m n 𝕜) (Matrix.{u3, u2, u1} m n 𝕜))) (ConditionallyCompleteLattice.toInfSet.{max (max u3 u2) u1} (Filter.{max (max u3 u2) u1} (Prod.{max (max u1 u2) u3, max (max u1 u2) u3} (Matrix.{u3, u2, u1} m n 𝕜) (Matrix.{u3, u2, u1} m n 𝕜))) (CompleteLattice.toConditionallyCompleteLattice.{max (max u3 u2) u1} (Filter.{max (max u3 u2) u1} (Prod.{max (max u1 u2) u3, max (max u1 u2) u3} (Matrix.{u3, u2, u1} m n 𝕜) (Matrix.{u3, u2, u1} m n 𝕜))) (Filter.instCompleteLatticeFilter.{max (max u3 u2) u1} (Prod.{max (max u1 u2) u3, max (max u1 u2) u3} (Matrix.{u3, u2, u1} m n 𝕜) (Matrix.{u3, u2, u1} m n 𝕜))))) n (fun (j : n) => Filter.comap.{max (max u3 u2) u1, u1} (Prod.{max (max u1 u2) u3, max (max u1 u2) u3} (Matrix.{u3, u2, u1} m n 𝕜) (Matrix.{u3, u2, u1} m n 𝕜)) (Prod.{u1, u1} 𝕜 𝕜) (fun (a : Prod.{max (max u1 u2) u3, max (max u1 u2) u3} (Matrix.{u3, u2, u1} m n 𝕜) (Matrix.{u3, u2, u1} m n 𝕜)) => Prod.mk.{u1, u1} 𝕜 𝕜 (Prod.fst.{max (max u3 u2) u1, max (max u3 u2) u1} (Matrix.{u3, u2, u1} m n 𝕜) (Matrix.{u3, u2, u1} m n 𝕜) a i j) (Prod.snd.{max (max u3 u2) u1, max (max u3 u2) u1} (Matrix.{u3, u2, u1} m n 𝕜) (Matrix.{u3, u2, u1} m n 𝕜) a i j)) (uniformity.{u1} 𝕜 _inst_1))))
-Case conversion may be inaccurate. Consider using '#align matrix.uniformity Matrix.uniformityₓ'. -/
 theorem uniformity :
     𝓤 (Matrix m n 𝕜) = ⨅ (i : m) (j : n), (𝓤 𝕜).comap fun a => (a.1 i j, a.2 i j) :=
   by
@@ -42,12 +36,6 @@ theorem uniformity :
   rfl
 #align matrix.uniformity Matrix.uniformity
 
-/- warning: matrix.uniform_continuous -> Matrix.uniformContinuous is a dubious translation:
-lean 3 declaration is
-  forall (m : Type.{u1}) (n : Type.{u2}) (𝕜 : Type.{u3}) [_inst_1 : UniformSpace.{u3} 𝕜] {β : Type.{u4}} [_inst_2 : UniformSpace.{u4} β] {f : β -> (Matrix.{u1, u2, u3} m n 𝕜)}, Iff (UniformContinuous.{u4, max u1 u2 u3} β (Matrix.{u1, u2, u3} m n 𝕜) _inst_2 (Matrix.uniformSpace.{u1, u2, u3} m n 𝕜 _inst_1) f) (forall (i : m) (j : n), UniformContinuous.{u4, u3} β 𝕜 _inst_2 _inst_1 (fun (x : β) => f x i j))
-but is expected to have type
-  forall (m : Type.{u3}) (n : Type.{u2}) (𝕜 : Type.{u1}) [_inst_1 : UniformSpace.{u1} 𝕜] {β : Type.{u4}} [_inst_2 : UniformSpace.{u4} β] {f : β -> (Matrix.{u3, u2, u1} m n 𝕜)}, Iff (UniformContinuous.{u4, max (max u3 u2) u1} β (Matrix.{u3, u2, u1} m n 𝕜) _inst_2 (Matrix.instUniformSpaceMatrix.{u3, u2, u1} m n 𝕜 _inst_1) f) (forall (i : m) (j : n), UniformContinuous.{u4, u1} β 𝕜 _inst_2 _inst_1 (fun (x : β) => f x i j))
-Case conversion may be inaccurate. Consider using '#align matrix.uniform_continuous Matrix.uniformContinuousₓ'. -/
 theorem uniformContinuous {β : Type _} [UniformSpace β] {f : β → Matrix m n 𝕜} :
     UniformContinuous f ↔ ∀ i j, UniformContinuous fun x => f x i j := by
   simp only [UniformContinuous, Matrix.uniformity, Filter.tendsto_iInf, Filter.tendsto_comap_iff]

d64d67d0

bump to nightly-2023-05-14-08

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

d31da313

Diff

@@ -30,15 +30,15 @@ instance : UniformSpace (Matrix m n 𝕜) :=
 
 /- warning: matrix.uniformity -> Matrix.uniformity is a dubious translation:
 lean 3 declaration is
-  forall (m : Type.{u1}) (n : Type.{u2}) (𝕜 : Type.{u3}) [_inst_1 : UniformSpace.{u3} 𝕜], Eq.{succ (max u1 u2 u3)} (Filter.{max u1 u2 u3} (Prod.{max u1 u2 u3, max u1 u2 u3} (Matrix.{u1, u2, u3} m n 𝕜) (Matrix.{u1, u2, u3} m n 𝕜))) (uniformity.{max u1 u2 u3} (Matrix.{u1, u2, u3} m n 𝕜) (Matrix.uniformSpace.{u1, u2, u3} m n 𝕜 _inst_1)) (infᵢ.{max u1 u2 u3, succ u1} (Filter.{max u1 u2 u3} (Prod.{max u1 u2 u3, max u1 u2 u3} (Matrix.{u1, u2, u3} m n 𝕜) (Matrix.{u1, u2, u3} m n 𝕜))) (ConditionallyCompleteLattice.toHasInf.{max u1 u2 u3} (Filter.{max u1 u2 u3} (Prod.{max u1 u2 u3, max u1 u2 u3} (Matrix.{u1, u2, u3} m n 𝕜) (Matrix.{u1, u2, u3} m n 𝕜))) (CompleteLattice.toConditionallyCompleteLattice.{max u1 u2 u3} (Filter.{max u1 u2 u3} (Prod.{max u1 u2 u3, max u1 u2 u3} (Matrix.{u1, u2, u3} m n 𝕜) (Matrix.{u1, u2, u3} m n 𝕜))) (Filter.completeLattice.{max u1 u2 u3} (Prod.{max u1 u2 u3, max u1 u2 u3} (Matrix.{u1, u2, u3} m n 𝕜) (Matrix.{u1, u2, u3} m n 𝕜))))) m (fun (i : m) => infᵢ.{max u1 u2 u3, succ u2} (Filter.{max u1 u2 u3} (Prod.{max u1 u2 u3, max u1 u2 u3} (Matrix.{u1, u2, u3} m n 𝕜) (Matrix.{u1, u2, u3} m n 𝕜))) (ConditionallyCompleteLattice.toHasInf.{max u1 u2 u3} (Filter.{max u1 u2 u3} (Prod.{max u1 u2 u3, max u1 u2 u3} (Matrix.{u1, u2, u3} m n 𝕜) (Matrix.{u1, u2, u3} m n 𝕜))) (CompleteLattice.toConditionallyCompleteLattice.{max u1 u2 u3} (Filter.{max u1 u2 u3} (Prod.{max u1 u2 u3, max u1 u2 u3} (Matrix.{u1, u2, u3} m n 𝕜) (Matrix.{u1, u2, u3} m n 𝕜))) (Filter.completeLattice.{max u1 u2 u3} (Prod.{max u1 u2 u3, max u1 u2 u3} (Matrix.{u1, u2, u3} m n 𝕜) (Matrix.{u1, u2, u3} m n 𝕜))))) n (fun (j : n) => Filter.comap.{max u1 u2 u3, u3} (Prod.{max u1 u2 u3, max u1 u2 u3} (Matrix.{u1, u2, u3} m n 𝕜) (Matrix.{u1, u2, u3} m n 𝕜)) (Prod.{u3, u3} 𝕜 𝕜) (fun (a : Prod.{max u1 u2 u3, max u1 u2 u3} (Matrix.{u1, u2, u3} m n 𝕜) (Matrix.{u1, u2, u3} m n 𝕜)) => Prod.mk.{u3, u3} 𝕜 𝕜 (Prod.fst.{max u1 u2 u3, max u1 u2 u3} (Matrix.{u1, u2, u3} m n 𝕜) (Matrix.{u1, u2, u3} m n 𝕜) a i j) (Prod.snd.{max u1 u2 u3, max u1 u2 u3} (Matrix.{u1, u2, u3} m n 𝕜) (Matrix.{u1, u2, u3} m n 𝕜) a i j)) (uniformity.{u3} 𝕜 _inst_1))))
+  forall (m : Type.{u1}) (n : Type.{u2}) (𝕜 : Type.{u3}) [_inst_1 : UniformSpace.{u3} 𝕜], Eq.{succ (max u1 u2 u3)} (Filter.{max u1 u2 u3} (Prod.{max u1 u2 u3, max u1 u2 u3} (Matrix.{u1, u2, u3} m n 𝕜) (Matrix.{u1, u2, u3} m n 𝕜))) (uniformity.{max u1 u2 u3} (Matrix.{u1, u2, u3} m n 𝕜) (Matrix.uniformSpace.{u1, u2, u3} m n 𝕜 _inst_1)) (iInf.{max u1 u2 u3, succ u1} (Filter.{max u1 u2 u3} (Prod.{max u1 u2 u3, max u1 u2 u3} (Matrix.{u1, u2, u3} m n 𝕜) (Matrix.{u1, u2, u3} m n 𝕜))) (ConditionallyCompleteLattice.toHasInf.{max u1 u2 u3} (Filter.{max u1 u2 u3} (Prod.{max u1 u2 u3, max u1 u2 u3} (Matrix.{u1, u2, u3} m n 𝕜) (Matrix.{u1, u2, u3} m n 𝕜))) (CompleteLattice.toConditionallyCompleteLattice.{max u1 u2 u3} (Filter.{max u1 u2 u3} (Prod.{max u1 u2 u3, max u1 u2 u3} (Matrix.{u1, u2, u3} m n 𝕜) (Matrix.{u1, u2, u3} m n 𝕜))) (Filter.completeLattice.{max u1 u2 u3} (Prod.{max u1 u2 u3, max u1 u2 u3} (Matrix.{u1, u2, u3} m n 𝕜) (Matrix.{u1, u2, u3} m n 𝕜))))) m (fun (i : m) => iInf.{max u1 u2 u3, succ u2} (Filter.{max u1 u2 u3} (Prod.{max u1 u2 u3, max u1 u2 u3} (Matrix.{u1, u2, u3} m n 𝕜) (Matrix.{u1, u2, u3} m n 𝕜))) (ConditionallyCompleteLattice.toHasInf.{max u1 u2 u3} (Filter.{max u1 u2 u3} (Prod.{max u1 u2 u3, max u1 u2 u3} (Matrix.{u1, u2, u3} m n 𝕜) (Matrix.{u1, u2, u3} m n 𝕜))) (CompleteLattice.toConditionallyCompleteLattice.{max u1 u2 u3} (Filter.{max u1 u2 u3} (Prod.{max u1 u2 u3, max u1 u2 u3} (Matrix.{u1, u2, u3} m n 𝕜) (Matrix.{u1, u2, u3} m n 𝕜))) (Filter.completeLattice.{max u1 u2 u3} (Prod.{max u1 u2 u3, max u1 u2 u3} (Matrix.{u1, u2, u3} m n 𝕜) (Matrix.{u1, u2, u3} m n 𝕜))))) n (fun (j : n) => Filter.comap.{max u1 u2 u3, u3} (Prod.{max u1 u2 u3, max u1 u2 u3} (Matrix.{u1, u2, u3} m n 𝕜) (Matrix.{u1, u2, u3} m n 𝕜)) (Prod.{u3, u3} 𝕜 𝕜) (fun (a : Prod.{max u1 u2 u3, max u1 u2 u3} (Matrix.{u1, u2, u3} m n 𝕜) (Matrix.{u1, u2, u3} m n 𝕜)) => Prod.mk.{u3, u3} 𝕜 𝕜 (Prod.fst.{max u1 u2 u3, max u1 u2 u3} (Matrix.{u1, u2, u3} m n 𝕜) (Matrix.{u1, u2, u3} m n 𝕜) a i j) (Prod.snd.{max u1 u2 u3, max u1 u2 u3} (Matrix.{u1, u2, u3} m n 𝕜) (Matrix.{u1, u2, u3} m n 𝕜) a i j)) (uniformity.{u3} 𝕜 _inst_1))))
 but is expected to have type
-  forall (m : Type.{u3}) (n : Type.{u2}) (𝕜 : Type.{u1}) [_inst_1 : UniformSpace.{u1} 𝕜], Eq.{max (max (succ u3) (succ u2)) (succ u1)} (Filter.{max (max u1 u2) u3} (Prod.{max (max u1 u2) u3, max (max u1 u2) u3} (Matrix.{u3, u2, u1} m n 𝕜) (Matrix.{u3, u2, u1} m n 𝕜))) (uniformity.{max (max u1 u2) u3} (Matrix.{u3, u2, u1} m n 𝕜) (Matrix.instUniformSpaceMatrix.{u3, u2, u1} m n 𝕜 _inst_1)) (infᵢ.{max (max u3 u2) u1, succ u3} (Filter.{max (max u3 u2) u1} (Prod.{max (max u1 u2) u3, max (max u1 u2) u3} (Matrix.{u3, u2, u1} m n 𝕜) (Matrix.{u3, u2, u1} m n 𝕜))) (ConditionallyCompleteLattice.toInfSet.{max (max u3 u2) u1} (Filter.{max (max u3 u2) u1} (Prod.{max (max u1 u2) u3, max (max u1 u2) u3} (Matrix.{u3, u2, u1} m n 𝕜) (Matrix.{u3, u2, u1} m n 𝕜))) (CompleteLattice.toConditionallyCompleteLattice.{max (max u3 u2) u1} (Filter.{max (max u3 u2) u1} (Prod.{max (max u1 u2) u3, max (max u1 u2) u3} (Matrix.{u3, u2, u1} m n 𝕜) (Matrix.{u3, u2, u1} m n 𝕜))) (Filter.instCompleteLatticeFilter.{max (max u3 u2) u1} (Prod.{max (max u1 u2) u3, max (max u1 u2) u3} (Matrix.{u3, u2, u1} m n 𝕜) (Matrix.{u3, u2, u1} m n 𝕜))))) m (fun (i : m) => infᵢ.{max (max u3 u2) u1, succ u2} (Filter.{max (max u3 u2) u1} (Prod.{max (max u1 u2) u3, max (max u1 u2) u3} (Matrix.{u3, u2, u1} m n 𝕜) (Matrix.{u3, u2, u1} m n 𝕜))) (ConditionallyCompleteLattice.toInfSet.{max (max u3 u2) u1} (Filter.{max (max u3 u2) u1} (Prod.{max (max u1 u2) u3, max (max u1 u2) u3} (Matrix.{u3, u2, u1} m n 𝕜) (Matrix.{u3, u2, u1} m n 𝕜))) (CompleteLattice.toConditionallyCompleteLattice.{max (max u3 u2) u1} (Filter.{max (max u3 u2) u1} (Prod.{max (max u1 u2) u3, max (max u1 u2) u3} (Matrix.{u3, u2, u1} m n 𝕜) (Matrix.{u3, u2, u1} m n 𝕜))) (Filter.instCompleteLatticeFilter.{max (max u3 u2) u1} (Prod.{max (max u1 u2) u3, max (max u1 u2) u3} (Matrix.{u3, u2, u1} m n 𝕜) (Matrix.{u3, u2, u1} m n 𝕜))))) n (fun (j : n) => Filter.comap.{max (max u3 u2) u1, u1} (Prod.{max (max u1 u2) u3, max (max u1 u2) u3} (Matrix.{u3, u2, u1} m n 𝕜) (Matrix.{u3, u2, u1} m n 𝕜)) (Prod.{u1, u1} 𝕜 𝕜) (fun (a : Prod.{max (max u1 u2) u3, max (max u1 u2) u3} (Matrix.{u3, u2, u1} m n 𝕜) (Matrix.{u3, u2, u1} m n 𝕜)) => Prod.mk.{u1, u1} 𝕜 𝕜 (Prod.fst.{max (max u3 u2) u1, max (max u3 u2) u1} (Matrix.{u3, u2, u1} m n 𝕜) (Matrix.{u3, u2, u1} m n 𝕜) a i j) (Prod.snd.{max (max u3 u2) u1, max (max u3 u2) u1} (Matrix.{u3, u2, u1} m n 𝕜) (Matrix.{u3, u2, u1} m n 𝕜) a i j)) (uniformity.{u1} 𝕜 _inst_1))))
+  forall (m : Type.{u3}) (n : Type.{u2}) (𝕜 : Type.{u1}) [_inst_1 : UniformSpace.{u1} 𝕜], Eq.{max (max (succ u3) (succ u2)) (succ u1)} (Filter.{max (max u1 u2) u3} (Prod.{max (max u1 u2) u3, max (max u1 u2) u3} (Matrix.{u3, u2, u1} m n 𝕜) (Matrix.{u3, u2, u1} m n 𝕜))) (uniformity.{max (max u1 u2) u3} (Matrix.{u3, u2, u1} m n 𝕜) (Matrix.instUniformSpaceMatrix.{u3, u2, u1} m n 𝕜 _inst_1)) (iInf.{max (max u3 u2) u1, succ u3} (Filter.{max (max u3 u2) u1} (Prod.{max (max u1 u2) u3, max (max u1 u2) u3} (Matrix.{u3, u2, u1} m n 𝕜) (Matrix.{u3, u2, u1} m n 𝕜))) (ConditionallyCompleteLattice.toInfSet.{max (max u3 u2) u1} (Filter.{max (max u3 u2) u1} (Prod.{max (max u1 u2) u3, max (max u1 u2) u3} (Matrix.{u3, u2, u1} m n 𝕜) (Matrix.{u3, u2, u1} m n 𝕜))) (CompleteLattice.toConditionallyCompleteLattice.{max (max u3 u2) u1} (Filter.{max (max u3 u2) u1} (Prod.{max (max u1 u2) u3, max (max u1 u2) u3} (Matrix.{u3, u2, u1} m n 𝕜) (Matrix.{u3, u2, u1} m n 𝕜))) (Filter.instCompleteLatticeFilter.{max (max u3 u2) u1} (Prod.{max (max u1 u2) u3, max (max u1 u2) u3} (Matrix.{u3, u2, u1} m n 𝕜) (Matrix.{u3, u2, u1} m n 𝕜))))) m (fun (i : m) => iInf.{max (max u3 u2) u1, succ u2} (Filter.{max (max u3 u2) u1} (Prod.{max (max u1 u2) u3, max (max u1 u2) u3} (Matrix.{u3, u2, u1} m n 𝕜) (Matrix.{u3, u2, u1} m n 𝕜))) (ConditionallyCompleteLattice.toInfSet.{max (max u3 u2) u1} (Filter.{max (max u3 u2) u1} (Prod.{max (max u1 u2) u3, max (max u1 u2) u3} (Matrix.{u3, u2, u1} m n 𝕜) (Matrix.{u3, u2, u1} m n 𝕜))) (CompleteLattice.toConditionallyCompleteLattice.{max (max u3 u2) u1} (Filter.{max (max u3 u2) u1} (Prod.{max (max u1 u2) u3, max (max u1 u2) u3} (Matrix.{u3, u2, u1} m n 𝕜) (Matrix.{u3, u2, u1} m n 𝕜))) (Filter.instCompleteLatticeFilter.{max (max u3 u2) u1} (Prod.{max (max u1 u2) u3, max (max u1 u2) u3} (Matrix.{u3, u2, u1} m n 𝕜) (Matrix.{u3, u2, u1} m n 𝕜))))) n (fun (j : n) => Filter.comap.{max (max u3 u2) u1, u1} (Prod.{max (max u1 u2) u3, max (max u1 u2) u3} (Matrix.{u3, u2, u1} m n 𝕜) (Matrix.{u3, u2, u1} m n 𝕜)) (Prod.{u1, u1} 𝕜 𝕜) (fun (a : Prod.{max (max u1 u2) u3, max (max u1 u2) u3} (Matrix.{u3, u2, u1} m n 𝕜) (Matrix.{u3, u2, u1} m n 𝕜)) => Prod.mk.{u1, u1} 𝕜 𝕜 (Prod.fst.{max (max u3 u2) u1, max (max u3 u2) u1} (Matrix.{u3, u2, u1} m n 𝕜) (Matrix.{u3, u2, u1} m n 𝕜) a i j) (Prod.snd.{max (max u3 u2) u1, max (max u3 u2) u1} (Matrix.{u3, u2, u1} m n 𝕜) (Matrix.{u3, u2, u1} m n 𝕜) a i j)) (uniformity.{u1} 𝕜 _inst_1))))
 Case conversion may be inaccurate. Consider using '#align matrix.uniformity Matrix.uniformityₓ'. -/
 theorem uniformity :
     𝓤 (Matrix m n 𝕜) = ⨅ (i : m) (j : n), (𝓤 𝕜).comap fun a => (a.1 i j, a.2 i j) :=
   by
   erw [Pi.uniformity, Pi.uniformity]
-  simp_rw [Filter.comap_infᵢ, Filter.comap_comap]
+  simp_rw [Filter.comap_iInf, Filter.comap_comap]
   rfl
 #align matrix.uniformity Matrix.uniformity
 
@@ -50,7 +50,7 @@ but is expected to have type
 Case conversion may be inaccurate. Consider using '#align matrix.uniform_continuous Matrix.uniformContinuousₓ'. -/
 theorem uniformContinuous {β : Type _} [UniformSpace β] {f : β → Matrix m n 𝕜} :
     UniformContinuous f ↔ ∀ i j, UniformContinuous fun x => f x i j := by
-  simp only [UniformContinuous, Matrix.uniformity, Filter.tendsto_infᵢ, Filter.tendsto_comap_iff]
+  simp only [UniformContinuous, Matrix.uniformity, Filter.tendsto_iInf, Filter.tendsto_comap_iff]
 #align matrix.uniform_continuous Matrix.uniformContinuous
 
 instance [CompleteSpace 𝕜] : CompleteSpace (Matrix m n 𝕜) :=

d64d67d0

bump to nightly-2023-04-06-02

mathlib commit https://github.com/leanprover-community/mathlib/commit/06a655b5fcfbda03502f9158bbf6c0f1400886f9

89485060

Diff

@@ -4,7 +4,7 @@ Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Eric Wieser, Heather Macbeth
 
 ! This file was ported from Lean 3 source module topology.uniform_space.matrix
-! leanprover-community/mathlib commit f2ce6086713c78a7f880485f7917ea547a215982
+! leanprover-community/mathlib commit d64d67d000b974f0d86a2be7918cf800be6271c8
 ! Please do not edit these lines, except to modify the commit id
 ! if you have ported upstream changes.
 -/
@@ -13,6 +13,9 @@ import Mathbin.Data.Matrix.Basic
 
 /-!
 # Uniform space structure on matrices
+
+> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
+> Any changes to this file require a corresponding PR to mathlib4.
 -/

f2ce6086

bump to nightly-2023-04-04-14

mathlib commit https://github.com/leanprover-community/mathlib/commit/3cacc945118c8c637d89950af01da78307f59325

468d7cfa

Diff

@@ -25,6 +25,12 @@ namespace Matrix
 instance : UniformSpace (Matrix m n 𝕜) :=
   (by infer_instance : UniformSpace (m → n → 𝕜))
 
+/- warning: matrix.uniformity -> Matrix.uniformity is a dubious translation:
+lean 3 declaration is
+  forall (m : Type.{u1}) (n : Type.{u2}) (𝕜 : Type.{u3}) [_inst_1 : UniformSpace.{u3} 𝕜], Eq.{succ (max u1 u2 u3)} (Filter.{max u1 u2 u3} (Prod.{max u1 u2 u3, max u1 u2 u3} (Matrix.{u1, u2, u3} m n 𝕜) (Matrix.{u1, u2, u3} m n 𝕜))) (uniformity.{max u1 u2 u3} (Matrix.{u1, u2, u3} m n 𝕜) (Matrix.uniformSpace.{u1, u2, u3} m n 𝕜 _inst_1)) (infᵢ.{max u1 u2 u3, succ u1} (Filter.{max u1 u2 u3} (Prod.{max u1 u2 u3, max u1 u2 u3} (Matrix.{u1, u2, u3} m n 𝕜) (Matrix.{u1, u2, u3} m n 𝕜))) (ConditionallyCompleteLattice.toHasInf.{max u1 u2 u3} (Filter.{max u1 u2 u3} (Prod.{max u1 u2 u3, max u1 u2 u3} (Matrix.{u1, u2, u3} m n 𝕜) (Matrix.{u1, u2, u3} m n 𝕜))) (CompleteLattice.toConditionallyCompleteLattice.{max u1 u2 u3} (Filter.{max u1 u2 u3} (Prod.{max u1 u2 u3, max u1 u2 u3} (Matrix.{u1, u2, u3} m n 𝕜) (Matrix.{u1, u2, u3} m n 𝕜))) (Filter.completeLattice.{max u1 u2 u3} (Prod.{max u1 u2 u3, max u1 u2 u3} (Matrix.{u1, u2, u3} m n 𝕜) (Matrix.{u1, u2, u3} m n 𝕜))))) m (fun (i : m) => infᵢ.{max u1 u2 u3, succ u2} (Filter.{max u1 u2 u3} (Prod.{max u1 u2 u3, max u1 u2 u3} (Matrix.{u1, u2, u3} m n 𝕜) (Matrix.{u1, u2, u3} m n 𝕜))) (ConditionallyCompleteLattice.toHasInf.{max u1 u2 u3} (Filter.{max u1 u2 u3} (Prod.{max u1 u2 u3, max u1 u2 u3} (Matrix.{u1, u2, u3} m n 𝕜) (Matrix.{u1, u2, u3} m n 𝕜))) (CompleteLattice.toConditionallyCompleteLattice.{max u1 u2 u3} (Filter.{max u1 u2 u3} (Prod.{max u1 u2 u3, max u1 u2 u3} (Matrix.{u1, u2, u3} m n 𝕜) (Matrix.{u1, u2, u3} m n 𝕜))) (Filter.completeLattice.{max u1 u2 u3} (Prod.{max u1 u2 u3, max u1 u2 u3} (Matrix.{u1, u2, u3} m n 𝕜) (Matrix.{u1, u2, u3} m n 𝕜))))) n (fun (j : n) => Filter.comap.{max u1 u2 u3, u3} (Prod.{max u1 u2 u3, max u1 u2 u3} (Matrix.{u1, u2, u3} m n 𝕜) (Matrix.{u1, u2, u3} m n 𝕜)) (Prod.{u3, u3} 𝕜 𝕜) (fun (a : Prod.{max u1 u2 u3, max u1 u2 u3} (Matrix.{u1, u2, u3} m n 𝕜) (Matrix.{u1, u2, u3} m n 𝕜)) => Prod.mk.{u3, u3} 𝕜 𝕜 (Prod.fst.{max u1 u2 u3, max u1 u2 u3} (Matrix.{u1, u2, u3} m n 𝕜) (Matrix.{u1, u2, u3} m n 𝕜) a i j) (Prod.snd.{max u1 u2 u3, max u1 u2 u3} (Matrix.{u1, u2, u3} m n 𝕜) (Matrix.{u1, u2, u3} m n 𝕜) a i j)) (uniformity.{u3} 𝕜 _inst_1))))
+but is expected to have type
+  forall (m : Type.{u3}) (n : Type.{u2}) (𝕜 : Type.{u1}) [_inst_1 : UniformSpace.{u1} 𝕜], Eq.{max (max (succ u3) (succ u2)) (succ u1)} (Filter.{max (max u1 u2) u3} (Prod.{max (max u1 u2) u3, max (max u1 u2) u3} (Matrix.{u3, u2, u1} m n 𝕜) (Matrix.{u3, u2, u1} m n 𝕜))) (uniformity.{max (max u1 u2) u3} (Matrix.{u3, u2, u1} m n 𝕜) (Matrix.instUniformSpaceMatrix.{u3, u2, u1} m n 𝕜 _inst_1)) (infᵢ.{max (max u3 u2) u1, succ u3} (Filter.{max (max u3 u2) u1} (Prod.{max (max u1 u2) u3, max (max u1 u2) u3} (Matrix.{u3, u2, u1} m n 𝕜) (Matrix.{u3, u2, u1} m n 𝕜))) (ConditionallyCompleteLattice.toInfSet.{max (max u3 u2) u1} (Filter.{max (max u3 u2) u1} (Prod.{max (max u1 u2) u3, max (max u1 u2) u3} (Matrix.{u3, u2, u1} m n 𝕜) (Matrix.{u3, u2, u1} m n 𝕜))) (CompleteLattice.toConditionallyCompleteLattice.{max (max u3 u2) u1} (Filter.{max (max u3 u2) u1} (Prod.{max (max u1 u2) u3, max (max u1 u2) u3} (Matrix.{u3, u2, u1} m n 𝕜) (Matrix.{u3, u2, u1} m n 𝕜))) (Filter.instCompleteLatticeFilter.{max (max u3 u2) u1} (Prod.{max (max u1 u2) u3, max (max u1 u2) u3} (Matrix.{u3, u2, u1} m n 𝕜) (Matrix.{u3, u2, u1} m n 𝕜))))) m (fun (i : m) => infᵢ.{max (max u3 u2) u1, succ u2} (Filter.{max (max u3 u2) u1} (Prod.{max (max u1 u2) u3, max (max u1 u2) u3} (Matrix.{u3, u2, u1} m n 𝕜) (Matrix.{u3, u2, u1} m n 𝕜))) (ConditionallyCompleteLattice.toInfSet.{max (max u3 u2) u1} (Filter.{max (max u3 u2) u1} (Prod.{max (max u1 u2) u3, max (max u1 u2) u3} (Matrix.{u3, u2, u1} m n 𝕜) (Matrix.{u3, u2, u1} m n 𝕜))) (CompleteLattice.toConditionallyCompleteLattice.{max (max u3 u2) u1} (Filter.{max (max u3 u2) u1} (Prod.{max (max u1 u2) u3, max (max u1 u2) u3} (Matrix.{u3, u2, u1} m n 𝕜) (Matrix.{u3, u2, u1} m n 𝕜))) (Filter.instCompleteLatticeFilter.{max (max u3 u2) u1} (Prod.{max (max u1 u2) u3, max (max u1 u2) u3} (Matrix.{u3, u2, u1} m n 𝕜) (Matrix.{u3, u2, u1} m n 𝕜))))) n (fun (j : n) => Filter.comap.{max (max u3 u2) u1, u1} (Prod.{max (max u1 u2) u3, max (max u1 u2) u3} (Matrix.{u3, u2, u1} m n 𝕜) (Matrix.{u3, u2, u1} m n 𝕜)) (Prod.{u1, u1} 𝕜 𝕜) (fun (a : Prod.{max (max u1 u2) u3, max (max u1 u2) u3} (Matrix.{u3, u2, u1} m n 𝕜) (Matrix.{u3, u2, u1} m n 𝕜)) => Prod.mk.{u1, u1} 𝕜 𝕜 (Prod.fst.{max (max u3 u2) u1, max (max u3 u2) u1} (Matrix.{u3, u2, u1} m n 𝕜) (Matrix.{u3, u2, u1} m n 𝕜) a i j) (Prod.snd.{max (max u3 u2) u1, max (max u3 u2) u1} (Matrix.{u3, u2, u1} m n 𝕜) (Matrix.{u3, u2, u1} m n 𝕜) a i j)) (uniformity.{u1} 𝕜 _inst_1))))
+Case conversion may be inaccurate. Consider using '#align matrix.uniformity Matrix.uniformityₓ'. -/
 theorem uniformity :
     𝓤 (Matrix m n 𝕜) = ⨅ (i : m) (j : n), (𝓤 𝕜).comap fun a => (a.1 i j, a.2 i j) :=
   by
@@ -33,6 +39,12 @@ theorem uniformity :
   rfl
 #align matrix.uniformity Matrix.uniformity
 
+/- warning: matrix.uniform_continuous -> Matrix.uniformContinuous is a dubious translation:
+lean 3 declaration is
+  forall (m : Type.{u1}) (n : Type.{u2}) (𝕜 : Type.{u3}) [_inst_1 : UniformSpace.{u3} 𝕜] {β : Type.{u4}} [_inst_2 : UniformSpace.{u4} β] {f : β -> (Matrix.{u1, u2, u3} m n 𝕜)}, Iff (UniformContinuous.{u4, max u1 u2 u3} β (Matrix.{u1, u2, u3} m n 𝕜) _inst_2 (Matrix.uniformSpace.{u1, u2, u3} m n 𝕜 _inst_1) f) (forall (i : m) (j : n), UniformContinuous.{u4, u3} β 𝕜 _inst_2 _inst_1 (fun (x : β) => f x i j))
+but is expected to have type
+  forall (m : Type.{u3}) (n : Type.{u2}) (𝕜 : Type.{u1}) [_inst_1 : UniformSpace.{u1} 𝕜] {β : Type.{u4}} [_inst_2 : UniformSpace.{u4} β] {f : β -> (Matrix.{u3, u2, u1} m n 𝕜)}, Iff (UniformContinuous.{u4, max (max u3 u2) u1} β (Matrix.{u3, u2, u1} m n 𝕜) _inst_2 (Matrix.instUniformSpaceMatrix.{u3, u2, u1} m n 𝕜 _inst_1) f) (forall (i : m) (j : n), UniformContinuous.{u4, u1} β 𝕜 _inst_2 _inst_1 (fun (x : β) => f x i j))
+Case conversion may be inaccurate. Consider using '#align matrix.uniform_continuous Matrix.uniformContinuousₓ'. -/
 theorem uniformContinuous {β : Type _} [UniformSpace β] {f : β → Matrix m n 𝕜} :
     UniformContinuous f ↔ ∀ i j, UniformContinuous fun x => f x i j := by
   simp only [UniformContinuous, Matrix.uniformity, Filter.tendsto_infᵢ, Filter.tendsto_comap_iff]

f2ce6086

bump to nightly-2023-02-21-16

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

1107b979

Changes in mathlib4

mathlib3

mathlib4

f2ce6086

chore: adaptations to lean 4.8.0 (#12549)

e50e1c94

Diff

@@ -20,7 +20,7 @@ variable (m n 𝕜 : Type*) [UniformSpace 𝕜]
 
 namespace Matrix
 
-instance : UniformSpace (Matrix m n 𝕜) :=
+instance instUniformSpace : UniformSpace (Matrix m n 𝕜) :=
   (by infer_instance : UniformSpace (m → n → 𝕜))
 
 instance instUniformAddGroup [AddGroup 𝕜] [UniformAddGroup 𝕜] :

f2ce6086

refactor(UniformSpace): drop separationRel (#10644)

We had duplicated API between topological spaces and uniform spaces. In this PR I mostly deduplicate it with some exceptions:

SeparationQuotient.lift' and SeparationQuotient.map are leftovers from the old version that are designed to work with uniform spaces;
probably, some theorems/instances still assume UniformSpace when TopologicalSpace would work.

Outside of UniformSpace/Separation, I mostly changed SeparatedSpace to T0Space and separationRel to Inseparable. I also rewrote a few proofs that were broken by the API change.

Fixes #2031

38155ec4

Diff

@@ -43,7 +43,7 @@ theorem uniformContinuous {β : Type*} [UniformSpace β] {f : β → Matrix m n
 instance [CompleteSpace 𝕜] : CompleteSpace (Matrix m n 𝕜) :=
   (by infer_instance : CompleteSpace (m → n → 𝕜))
 
-instance [SeparatedSpace 𝕜] : SeparatedSpace (Matrix m n 𝕜) :=
-  (by infer_instance : SeparatedSpace (m → n → 𝕜))
+instance [T0Space 𝕜] : T0Space (Matrix m n 𝕜) :=
+  inferInstanceAs (T0Space (m → n → 𝕜))
 
 end Matrix

f2ce6086

feat: show matrices form a UniformAddGroup (#9468)

465865c0

Diff

@@ -3,6 +3,7 @@ Copyright (c) 2022 Eric Wieser. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Eric Wieser, Heather Macbeth
 -/
+import Mathlib.Topology.Algebra.UniformGroup
 import Mathlib.Topology.UniformSpace.Pi
 import Mathlib.Data.Matrix.Basic
 
@@ -22,6 +23,10 @@ namespace Matrix
 instance : UniformSpace (Matrix m n 𝕜) :=
   (by infer_instance : UniformSpace (m → n → 𝕜))
 
+instance instUniformAddGroup [AddGroup 𝕜] [UniformAddGroup 𝕜] :
+    UniformAddGroup (Matrix m n 𝕜) :=
+  inferInstanceAs <| UniformAddGroup (m → n → 𝕜)
+
 theorem uniformity :
     𝓤 (Matrix m n 𝕜) = ⨅ (i : m) (j : n), (𝓤 𝕜).comap fun a => (a.1 i j, a.2 i j) := by
   erw [Pi.uniformity, Pi.uniformity]

f2ce6086

chore: banish Type _ and Sort _ (#6499)

We remove all possible occurences of Type _ and Sort _ in favor of Type* and Sort*.

This has nice performance benefits.

32de3f67

Diff

@@ -15,7 +15,7 @@ import Mathlib.Data.Matrix.Basic
 
 open Uniformity Topology
 
-variable (m n 𝕜 : Type _) [UniformSpace 𝕜]
+variable (m n 𝕜 : Type*) [UniformSpace 𝕜]
 
 namespace Matrix
 
@@ -29,7 +29,7 @@ theorem uniformity :
   rfl
 #align matrix.uniformity Matrix.uniformity
 
-theorem uniformContinuous {β : Type _} [UniformSpace β] {f : β → Matrix m n 𝕜} :
+theorem uniformContinuous {β : Type*} [UniformSpace β] {f : β → Matrix m n 𝕜} :
     UniformContinuous f ↔ ∀ i j, UniformContinuous fun x => f x i j := by
   simp only [UniformContinuous, Matrix.uniformity, Filter.tendsto_iInf, Filter.tendsto_comap_iff]
   apply Iff.intro <;> intro a <;> apply a

f2ce6086

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,15 +2,12 @@
 Copyright (c) 2022 Eric Wieser. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Eric Wieser, Heather Macbeth
-
-! This file was ported from Lean 3 source module topology.uniform_space.matrix
-! leanprover-community/mathlib commit f2ce6086713c78a7f880485f7917ea547a215982
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathlib.Topology.UniformSpace.Pi
 import Mathlib.Data.Matrix.Basic
 
+#align_import topology.uniform_space.matrix from "leanprover-community/mathlib"@"f2ce6086713c78a7f880485f7917ea547a215982"
+
 /-!
 # Uniform space structure on matrices
 -/

f2ce6086

chore: Rename to sSup/iSup (#3938)

As discussed on Zulip

Renames

supₛ → sSup
infₛ → sInf
supᵢ → iSup
infᵢ → iInf
bsupₛ → bsSup
binfₛ → bsInf
bsupᵢ → biSup
binfᵢ → biInf
csupₛ → csSup
cinfₛ → csInf
csupᵢ → ciSup
cinfᵢ → ciInf
unionₛ → sUnion
interₛ → sInter
unionᵢ → iUnion
interᵢ → iInter
bunionₛ → bsUnion
binterₛ → bsInter
bunionᵢ → biUnion
binterᵢ → biInter

Co-authored-by: Parcly Taxel <reddeloostw@gmail.com>

d1eb6264

Diff

@@ -28,13 +28,13 @@ instance : UniformSpace (Matrix m n 𝕜) :=
 theorem uniformity :
     𝓤 (Matrix m n 𝕜) = ⨅ (i : m) (j : n), (𝓤 𝕜).comap fun a => (a.1 i j, a.2 i j) := by
   erw [Pi.uniformity, Pi.uniformity]
-  simp_rw [Filter.comap_infᵢ, Filter.comap_comap]
+  simp_rw [Filter.comap_iInf, Filter.comap_comap]
   rfl
 #align matrix.uniformity Matrix.uniformity
 
 theorem uniformContinuous {β : Type _} [UniformSpace β] {f : β → Matrix m n 𝕜} :
     UniformContinuous f ↔ ∀ i j, UniformContinuous fun x => f x i j := by
-  simp only [UniformContinuous, Matrix.uniformity, Filter.tendsto_infᵢ, Filter.tendsto_comap_iff]
+  simp only [UniformContinuous, Matrix.uniformity, Filter.tendsto_iInf, Filter.tendsto_comap_iff]
   apply Iff.intro <;> intro a <;> apply a
 #align matrix.uniform_continuous Matrix.uniformContinuous

f2ce6086

feat: port Topology.UniformSpace.Matrix (#3262)

Co-authored-by: Parcly Taxel <reddeloostw@gmail.com>

52e74692

`topology.uniform_space.matrix` ⟷ `Mathlib.Topology.UniformSpace.Matrix`

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Renames

Dependencies 9 + 430

topology.uniform_space.matrix ⟷ Mathlib.Topology.UniformSpace.Matrix

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Renames

Dependencies 9 + 430

`topology.uniform_space.matrix` ⟷ `Mathlib.Topology.UniformSpace.Matrix`