linear_algebra.matrix.orthogonal | 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

790e98fb

(last sync)

Changes in mathlib3port

mathlib3

mathlib3port

d64d67d0

bump to nightly-2023-09-24-06

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

5655435f

Diff

@@ -3,7 +3,7 @@ Copyright (c) 2021 Lu-Ming Zhang. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Lu-Ming Zhang
 -/
-import Mathbin.Data.Matrix.Basic
+import Data.Matrix.Basic
 
 #align_import linear_algebra.matrix.orthogonal 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,14 +2,11 @@
 Copyright (c) 2021 Lu-Ming Zhang. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Lu-Ming Zhang
-
-! This file was ported from Lean 3 source module linear_algebra.matrix.orthogonal
-! 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.Data.Matrix.Basic
 
+#align_import linear_algebra.matrix.orthogonal from "leanprover-community/mathlib"@"d64d67d000b974f0d86a2be7918cf800be6271c8"
+
 /-!
 # Orthogonal

d64d67d0

bump to nightly-2023-06-13-21

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

829520ac

Diff

@@ -57,41 +57,53 @@ def HasOrthogonalCols [Fintype m] : Prop :=
 #align matrix.has_orthogonal_cols Matrix.HasOrthogonalCols
 -/
 
+#print Matrix.transpose_hasOrthogonalRows_iff_hasOrthogonalCols /-
 /-- `Aᵀ` has orthogonal rows iff `A` has orthogonal columns. -/
 @[simp]
 theorem transpose_hasOrthogonalRows_iff_hasOrthogonalCols [Fintype m] :
     Aᵀ.HasOrthogonalRows ↔ A.HasOrthogonalCols :=
   Iff.rfl
 #align matrix.transpose_has_orthogonal_rows_iff_has_orthogonal_cols Matrix.transpose_hasOrthogonalRows_iff_hasOrthogonalCols
+-/
 
+#print Matrix.transpose_hasOrthogonalCols_iff_hasOrthogonalRows /-
 /-- `Aᵀ` has orthogonal columns iff `A` has orthogonal rows. -/
 @[simp]
 theorem transpose_hasOrthogonalCols_iff_hasOrthogonalRows [Fintype n] :
     Aᵀ.HasOrthogonalCols ↔ A.HasOrthogonalRows :=
   Iff.rfl
 #align matrix.transpose_has_orthogonal_cols_iff_has_orthogonal_rows Matrix.transpose_hasOrthogonalCols_iff_hasOrthogonalRows
+-/
 
 variable {A}
 
+#print Matrix.HasOrthogonalRows.hasOrthogonalCols /-
 theorem HasOrthogonalRows.hasOrthogonalCols [Fintype m] (h : Aᵀ.HasOrthogonalRows) :
     A.HasOrthogonalCols :=
   h
 #align matrix.has_orthogonal_rows.has_orthogonal_cols Matrix.HasOrthogonalRows.hasOrthogonalCols
+-/
 
+#print Matrix.HasOrthogonalCols.transpose_hasOrthogonalRows /-
 theorem HasOrthogonalCols.transpose_hasOrthogonalRows [Fintype m] (h : A.HasOrthogonalCols) :
     Aᵀ.HasOrthogonalRows :=
   h
 #align matrix.has_orthogonal_cols.transpose_has_orthogonal_rows Matrix.HasOrthogonalCols.transpose_hasOrthogonalRows
+-/
 
+#print Matrix.HasOrthogonalCols.hasOrthogonalRows /-
 theorem HasOrthogonalCols.hasOrthogonalRows [Fintype n] (h : Aᵀ.HasOrthogonalCols) :
     A.HasOrthogonalRows :=
   h
 #align matrix.has_orthogonal_cols.has_orthogonal_rows Matrix.HasOrthogonalCols.hasOrthogonalRows
+-/
 
+#print Matrix.HasOrthogonalRows.transpose_hasOrthogonalCols /-
 theorem HasOrthogonalRows.transpose_hasOrthogonalCols [Fintype n] (h : A.HasOrthogonalRows) :
     Aᵀ.HasOrthogonalCols :=
   h
 #align matrix.has_orthogonal_rows.transpose_has_orthogonal_cols Matrix.HasOrthogonalRows.transpose_hasOrthogonalCols
+-/
 
 end Matrix

d64d67d0

bump to nightly-2023-05-28-18

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

8d353152

Diff

@@ -39,7 +39,7 @@ variable [Mul α] [AddCommMonoid α]
 
 variable (A : Matrix m n α)
 
-open Matrix
+open scoped Matrix
 
 #print Matrix.HasOrthogonalRows /-
 /-- `A.has_orthogonal_rows` means matrix `A` has orthogonal rows (with respect to

d64d67d0

bump to nightly-2023-05-28-06

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

ba5d8b97

Diff

@@ -57,12 +57,6 @@ def HasOrthogonalCols [Fintype m] : Prop :=
 #align matrix.has_orthogonal_cols Matrix.HasOrthogonalCols
 -/
 
-/- warning: matrix.transpose_has_orthogonal_rows_iff_has_orthogonal_cols -> Matrix.transpose_hasOrthogonalRows_iff_hasOrthogonalCols is a dubious translation:
-lean 3 declaration is
-  forall {α : Type.{u1}} {n : Type.{u2}} {m : Type.{u3}} [_inst_1 : Mul.{u1} α] [_inst_2 : AddCommMonoid.{u1} α] (A : Matrix.{u3, u2, u1} m n α) [_inst_3 : Fintype.{u3} m], Iff (Matrix.HasOrthogonalRows.{u1, u3, u2} α m n _inst_1 _inst_2 (Matrix.transpose.{u1, u3, u2} m n α A) _inst_3) (Matrix.HasOrthogonalCols.{u1, u2, u3} α n m _inst_1 _inst_2 A _inst_3)
-but is expected to have type
-  forall {α : Type.{u2}} {n : Type.{u1}} {m : Type.{u3}} [_inst_1 : Mul.{u2} α] [_inst_2 : AddCommMonoid.{u2} α] (A : Matrix.{u3, u1, u2} m n α) [_inst_3 : Fintype.{u3} m], Iff (Matrix.HasOrthogonalRows.{u2, u3, u1} α m n _inst_1 _inst_2 (Matrix.transpose.{u2, u3, u1} m n α A) _inst_3) (Matrix.HasOrthogonalCols.{u2, u1, u3} α n m _inst_1 _inst_2 A _inst_3)
-Case conversion may be inaccurate. Consider using '#align matrix.transpose_has_orthogonal_rows_iff_has_orthogonal_cols Matrix.transpose_hasOrthogonalRows_iff_hasOrthogonalColsₓ'. -/
 /-- `Aᵀ` has orthogonal rows iff `A` has orthogonal columns. -/
 @[simp]
 theorem transpose_hasOrthogonalRows_iff_hasOrthogonalCols [Fintype m] :
@@ -70,12 +64,6 @@ theorem transpose_hasOrthogonalRows_iff_hasOrthogonalCols [Fintype m] :
   Iff.rfl
 #align matrix.transpose_has_orthogonal_rows_iff_has_orthogonal_cols Matrix.transpose_hasOrthogonalRows_iff_hasOrthogonalCols
 
-/- warning: matrix.transpose_has_orthogonal_cols_iff_has_orthogonal_rows -> Matrix.transpose_hasOrthogonalCols_iff_hasOrthogonalRows is a dubious translation:
-lean 3 declaration is
-  forall {α : Type.{u1}} {n : Type.{u2}} {m : Type.{u3}} [_inst_1 : Mul.{u1} α] [_inst_2 : AddCommMonoid.{u1} α] (A : Matrix.{u3, u2, u1} m n α) [_inst_3 : Fintype.{u2} n], Iff (Matrix.HasOrthogonalCols.{u1, u3, u2} α m n _inst_1 _inst_2 (Matrix.transpose.{u1, u3, u2} m n α A) _inst_3) (Matrix.HasOrthogonalRows.{u1, u2, u3} α n m _inst_1 _inst_2 A _inst_3)
-but is expected to have type
-  forall {α : Type.{u2}} {n : Type.{u3}} {m : Type.{u1}} [_inst_1 : Mul.{u2} α] [_inst_2 : AddCommMonoid.{u2} α] (A : Matrix.{u1, u3, u2} m n α) [_inst_3 : Fintype.{u3} n], Iff (Matrix.HasOrthogonalCols.{u2, u1, u3} α m n _inst_1 _inst_2 (Matrix.transpose.{u2, u1, u3} m n α A) _inst_3) (Matrix.HasOrthogonalRows.{u2, u3, u1} α n m _inst_1 _inst_2 A _inst_3)
-Case conversion may be inaccurate. Consider using '#align matrix.transpose_has_orthogonal_cols_iff_has_orthogonal_rows Matrix.transpose_hasOrthogonalCols_iff_hasOrthogonalRowsₓ'. -/
 /-- `Aᵀ` has orthogonal columns iff `A` has orthogonal rows. -/
 @[simp]
 theorem transpose_hasOrthogonalCols_iff_hasOrthogonalRows [Fintype n] :
@@ -85,45 +73,21 @@ theorem transpose_hasOrthogonalCols_iff_hasOrthogonalRows [Fintype n] :
 
 variable {A}
 
-/- warning: matrix.has_orthogonal_rows.has_orthogonal_cols -> Matrix.HasOrthogonalRows.hasOrthogonalCols is a dubious translation:
-lean 3 declaration is
-  forall {α : Type.{u1}} {n : Type.{u2}} {m : Type.{u3}} [_inst_1 : Mul.{u1} α] [_inst_2 : AddCommMonoid.{u1} α] {A : Matrix.{u3, u2, u1} m n α} [_inst_3 : Fintype.{u3} m], (Matrix.HasOrthogonalRows.{u1, u3, u2} α m n _inst_1 _inst_2 (Matrix.transpose.{u1, u3, u2} m n α A) _inst_3) -> (Matrix.HasOrthogonalCols.{u1, u2, u3} α n m _inst_1 _inst_2 A _inst_3)
-but is expected to have type
-  forall {α : Type.{u2}} {n : Type.{u1}} {m : Type.{u3}} [_inst_1 : Mul.{u2} α] [_inst_2 : AddCommMonoid.{u2} α] {A : Matrix.{u3, u1, u2} m n α} [_inst_3 : Fintype.{u3} m], (Matrix.HasOrthogonalRows.{u2, u3, u1} α m n _inst_1 _inst_2 (Matrix.transpose.{u2, u3, u1} m n α A) _inst_3) -> (Matrix.HasOrthogonalCols.{u2, u1, u3} α n m _inst_1 _inst_2 A _inst_3)
-Case conversion may be inaccurate. Consider using '#align matrix.has_orthogonal_rows.has_orthogonal_cols Matrix.HasOrthogonalRows.hasOrthogonalColsₓ'. -/
 theorem HasOrthogonalRows.hasOrthogonalCols [Fintype m] (h : Aᵀ.HasOrthogonalRows) :
     A.HasOrthogonalCols :=
   h
 #align matrix.has_orthogonal_rows.has_orthogonal_cols Matrix.HasOrthogonalRows.hasOrthogonalCols
 
-/- warning: matrix.has_orthogonal_cols.transpose_has_orthogonal_rows -> Matrix.HasOrthogonalCols.transpose_hasOrthogonalRows is a dubious translation:
-lean 3 declaration is
-  forall {α : Type.{u1}} {n : Type.{u2}} {m : Type.{u3}} [_inst_1 : Mul.{u1} α] [_inst_2 : AddCommMonoid.{u1} α] {A : Matrix.{u3, u2, u1} m n α} [_inst_3 : Fintype.{u3} m], (Matrix.HasOrthogonalCols.{u1, u2, u3} α n m _inst_1 _inst_2 A _inst_3) -> (Matrix.HasOrthogonalRows.{u1, u3, u2} α m n _inst_1 _inst_2 (Matrix.transpose.{u1, u3, u2} m n α A) _inst_3)
-but is expected to have type
-  forall {α : Type.{u2}} {n : Type.{u1}} {m : Type.{u3}} [_inst_1 : Mul.{u2} α] [_inst_2 : AddCommMonoid.{u2} α] {A : Matrix.{u3, u1, u2} m n α} [_inst_3 : Fintype.{u3} m], (Matrix.HasOrthogonalCols.{u2, u1, u3} α n m _inst_1 _inst_2 A _inst_3) -> (Matrix.HasOrthogonalRows.{u2, u3, u1} α m n _inst_1 _inst_2 (Matrix.transpose.{u2, u3, u1} m n α A) _inst_3)
-Case conversion may be inaccurate. Consider using '#align matrix.has_orthogonal_cols.transpose_has_orthogonal_rows Matrix.HasOrthogonalCols.transpose_hasOrthogonalRowsₓ'. -/
 theorem HasOrthogonalCols.transpose_hasOrthogonalRows [Fintype m] (h : A.HasOrthogonalCols) :
     Aᵀ.HasOrthogonalRows :=
   h
 #align matrix.has_orthogonal_cols.transpose_has_orthogonal_rows Matrix.HasOrthogonalCols.transpose_hasOrthogonalRows
 
-/- warning: matrix.has_orthogonal_cols.has_orthogonal_rows -> Matrix.HasOrthogonalCols.hasOrthogonalRows is a dubious translation:
-lean 3 declaration is
-  forall {α : Type.{u1}} {n : Type.{u2}} {m : Type.{u3}} [_inst_1 : Mul.{u1} α] [_inst_2 : AddCommMonoid.{u1} α] {A : Matrix.{u3, u2, u1} m n α} [_inst_3 : Fintype.{u2} n], (Matrix.HasOrthogonalCols.{u1, u3, u2} α m n _inst_1 _inst_2 (Matrix.transpose.{u1, u3, u2} m n α A) _inst_3) -> (Matrix.HasOrthogonalRows.{u1, u2, u3} α n m _inst_1 _inst_2 A _inst_3)
-but is expected to have type
-  forall {α : Type.{u2}} {n : Type.{u3}} {m : Type.{u1}} [_inst_1 : Mul.{u2} α] [_inst_2 : AddCommMonoid.{u2} α] {A : Matrix.{u1, u3, u2} m n α} [_inst_3 : Fintype.{u3} n], (Matrix.HasOrthogonalCols.{u2, u1, u3} α m n _inst_1 _inst_2 (Matrix.transpose.{u2, u1, u3} m n α A) _inst_3) -> (Matrix.HasOrthogonalRows.{u2, u3, u1} α n m _inst_1 _inst_2 A _inst_3)
-Case conversion may be inaccurate. Consider using '#align matrix.has_orthogonal_cols.has_orthogonal_rows Matrix.HasOrthogonalCols.hasOrthogonalRowsₓ'. -/
 theorem HasOrthogonalCols.hasOrthogonalRows [Fintype n] (h : Aᵀ.HasOrthogonalCols) :
     A.HasOrthogonalRows :=
   h
 #align matrix.has_orthogonal_cols.has_orthogonal_rows Matrix.HasOrthogonalCols.hasOrthogonalRows
 
-/- warning: matrix.has_orthogonal_rows.transpose_has_orthogonal_cols -> Matrix.HasOrthogonalRows.transpose_hasOrthogonalCols is a dubious translation:
-lean 3 declaration is
-  forall {α : Type.{u1}} {n : Type.{u2}} {m : Type.{u3}} [_inst_1 : Mul.{u1} α] [_inst_2 : AddCommMonoid.{u1} α] {A : Matrix.{u3, u2, u1} m n α} [_inst_3 : Fintype.{u2} n], (Matrix.HasOrthogonalRows.{u1, u2, u3} α n m _inst_1 _inst_2 A _inst_3) -> (Matrix.HasOrthogonalCols.{u1, u3, u2} α m n _inst_1 _inst_2 (Matrix.transpose.{u1, u3, u2} m n α A) _inst_3)
-but is expected to have type
-  forall {α : Type.{u2}} {n : Type.{u3}} {m : Type.{u1}} [_inst_1 : Mul.{u2} α] [_inst_2 : AddCommMonoid.{u2} α] {A : Matrix.{u1, u3, u2} m n α} [_inst_3 : Fintype.{u3} n], (Matrix.HasOrthogonalRows.{u2, u3, u1} α n m _inst_1 _inst_2 A _inst_3) -> (Matrix.HasOrthogonalCols.{u2, u1, u3} α m n _inst_1 _inst_2 (Matrix.transpose.{u2, u1, u3} m n α A) _inst_3)
-Case conversion may be inaccurate. Consider using '#align matrix.has_orthogonal_rows.transpose_has_orthogonal_cols Matrix.HasOrthogonalRows.transpose_hasOrthogonalColsₓ'. -/
 theorem HasOrthogonalRows.transpose_hasOrthogonalCols [Fintype n] (h : A.HasOrthogonalRows) :
     Aᵀ.HasOrthogonalCols :=
   h

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: Lu-Ming Zhang
 
 ! This file was ported from Lean 3 source module linear_algebra.matrix.orthogonal
-! leanprover-community/mathlib commit 790e98fbb5ec433d89d833320954607e79ae9071
+! 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
 /-!
 # Orthogonal
 
+> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
+> Any changes to this file require a corresponding PR to mathlib4.
+
 This file contains definitions and properties concerning orthogonality of rows and columns.
 
 ## Main results

790e98fb

bump to nightly-2023-04-04-14

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

468d7cfa

Diff

@@ -38,18 +38,28 @@ variable (A : Matrix m n α)
 
 open Matrix
 
+#print Matrix.HasOrthogonalRows /-
 /-- `A.has_orthogonal_rows` means matrix `A` has orthogonal rows (with respect to
 `matrix.dot_product`). -/
 def HasOrthogonalRows [Fintype n] : Prop :=
   ∀ ⦃i₁ i₂⦄, i₁ ≠ i₂ → dotProduct (A i₁) (A i₂) = 0
 #align matrix.has_orthogonal_rows Matrix.HasOrthogonalRows
+-/
 
+#print Matrix.HasOrthogonalCols /-
 /-- `A.has_orthogonal_rows` means matrix `A` has orthogonal columns (with respect to
 `matrix.dot_product`). -/
 def HasOrthogonalCols [Fintype m] : Prop :=
   HasOrthogonalRows Aᵀ
 #align matrix.has_orthogonal_cols Matrix.HasOrthogonalCols
+-/
 
+/- warning: matrix.transpose_has_orthogonal_rows_iff_has_orthogonal_cols -> Matrix.transpose_hasOrthogonalRows_iff_hasOrthogonalCols is a dubious translation:
+lean 3 declaration is
+  forall {α : Type.{u1}} {n : Type.{u2}} {m : Type.{u3}} [_inst_1 : Mul.{u1} α] [_inst_2 : AddCommMonoid.{u1} α] (A : Matrix.{u3, u2, u1} m n α) [_inst_3 : Fintype.{u3} m], Iff (Matrix.HasOrthogonalRows.{u1, u3, u2} α m n _inst_1 _inst_2 (Matrix.transpose.{u1, u3, u2} m n α A) _inst_3) (Matrix.HasOrthogonalCols.{u1, u2, u3} α n m _inst_1 _inst_2 A _inst_3)
+but is expected to have type
+  forall {α : Type.{u2}} {n : Type.{u1}} {m : Type.{u3}} [_inst_1 : Mul.{u2} α] [_inst_2 : AddCommMonoid.{u2} α] (A : Matrix.{u3, u1, u2} m n α) [_inst_3 : Fintype.{u3} m], Iff (Matrix.HasOrthogonalRows.{u2, u3, u1} α m n _inst_1 _inst_2 (Matrix.transpose.{u2, u3, u1} m n α A) _inst_3) (Matrix.HasOrthogonalCols.{u2, u1, u3} α n m _inst_1 _inst_2 A _inst_3)
+Case conversion may be inaccurate. Consider using '#align matrix.transpose_has_orthogonal_rows_iff_has_orthogonal_cols Matrix.transpose_hasOrthogonalRows_iff_hasOrthogonalColsₓ'. -/
 /-- `Aᵀ` has orthogonal rows iff `A` has orthogonal columns. -/
 @[simp]
 theorem transpose_hasOrthogonalRows_iff_hasOrthogonalCols [Fintype m] :
@@ -57,6 +67,12 @@ theorem transpose_hasOrthogonalRows_iff_hasOrthogonalCols [Fintype m] :
   Iff.rfl
 #align matrix.transpose_has_orthogonal_rows_iff_has_orthogonal_cols Matrix.transpose_hasOrthogonalRows_iff_hasOrthogonalCols
 
+/- warning: matrix.transpose_has_orthogonal_cols_iff_has_orthogonal_rows -> Matrix.transpose_hasOrthogonalCols_iff_hasOrthogonalRows is a dubious translation:
+lean 3 declaration is
+  forall {α : Type.{u1}} {n : Type.{u2}} {m : Type.{u3}} [_inst_1 : Mul.{u1} α] [_inst_2 : AddCommMonoid.{u1} α] (A : Matrix.{u3, u2, u1} m n α) [_inst_3 : Fintype.{u2} n], Iff (Matrix.HasOrthogonalCols.{u1, u3, u2} α m n _inst_1 _inst_2 (Matrix.transpose.{u1, u3, u2} m n α A) _inst_3) (Matrix.HasOrthogonalRows.{u1, u2, u3} α n m _inst_1 _inst_2 A _inst_3)
+but is expected to have type
+  forall {α : Type.{u2}} {n : Type.{u3}} {m : Type.{u1}} [_inst_1 : Mul.{u2} α] [_inst_2 : AddCommMonoid.{u2} α] (A : Matrix.{u1, u3, u2} m n α) [_inst_3 : Fintype.{u3} n], Iff (Matrix.HasOrthogonalCols.{u2, u1, u3} α m n _inst_1 _inst_2 (Matrix.transpose.{u2, u1, u3} m n α A) _inst_3) (Matrix.HasOrthogonalRows.{u2, u3, u1} α n m _inst_1 _inst_2 A _inst_3)
+Case conversion may be inaccurate. Consider using '#align matrix.transpose_has_orthogonal_cols_iff_has_orthogonal_rows Matrix.transpose_hasOrthogonalCols_iff_hasOrthogonalRowsₓ'. -/
 /-- `Aᵀ` has orthogonal columns iff `A` has orthogonal rows. -/
 @[simp]
 theorem transpose_hasOrthogonalCols_iff_hasOrthogonalRows [Fintype n] :
@@ -66,21 +82,45 @@ theorem transpose_hasOrthogonalCols_iff_hasOrthogonalRows [Fintype n] :
 
 variable {A}
 
+/- warning: matrix.has_orthogonal_rows.has_orthogonal_cols -> Matrix.HasOrthogonalRows.hasOrthogonalCols is a dubious translation:
+lean 3 declaration is
+  forall {α : Type.{u1}} {n : Type.{u2}} {m : Type.{u3}} [_inst_1 : Mul.{u1} α] [_inst_2 : AddCommMonoid.{u1} α] {A : Matrix.{u3, u2, u1} m n α} [_inst_3 : Fintype.{u3} m], (Matrix.HasOrthogonalRows.{u1, u3, u2} α m n _inst_1 _inst_2 (Matrix.transpose.{u1, u3, u2} m n α A) _inst_3) -> (Matrix.HasOrthogonalCols.{u1, u2, u3} α n m _inst_1 _inst_2 A _inst_3)
+but is expected to have type
+  forall {α : Type.{u2}} {n : Type.{u1}} {m : Type.{u3}} [_inst_1 : Mul.{u2} α] [_inst_2 : AddCommMonoid.{u2} α] {A : Matrix.{u3, u1, u2} m n α} [_inst_3 : Fintype.{u3} m], (Matrix.HasOrthogonalRows.{u2, u3, u1} α m n _inst_1 _inst_2 (Matrix.transpose.{u2, u3, u1} m n α A) _inst_3) -> (Matrix.HasOrthogonalCols.{u2, u1, u3} α n m _inst_1 _inst_2 A _inst_3)
+Case conversion may be inaccurate. Consider using '#align matrix.has_orthogonal_rows.has_orthogonal_cols Matrix.HasOrthogonalRows.hasOrthogonalColsₓ'. -/
 theorem HasOrthogonalRows.hasOrthogonalCols [Fintype m] (h : Aᵀ.HasOrthogonalRows) :
     A.HasOrthogonalCols :=
   h
 #align matrix.has_orthogonal_rows.has_orthogonal_cols Matrix.HasOrthogonalRows.hasOrthogonalCols
 
+/- warning: matrix.has_orthogonal_cols.transpose_has_orthogonal_rows -> Matrix.HasOrthogonalCols.transpose_hasOrthogonalRows is a dubious translation:
+lean 3 declaration is
+  forall {α : Type.{u1}} {n : Type.{u2}} {m : Type.{u3}} [_inst_1 : Mul.{u1} α] [_inst_2 : AddCommMonoid.{u1} α] {A : Matrix.{u3, u2, u1} m n α} [_inst_3 : Fintype.{u3} m], (Matrix.HasOrthogonalCols.{u1, u2, u3} α n m _inst_1 _inst_2 A _inst_3) -> (Matrix.HasOrthogonalRows.{u1, u3, u2} α m n _inst_1 _inst_2 (Matrix.transpose.{u1, u3, u2} m n α A) _inst_3)
+but is expected to have type
+  forall {α : Type.{u2}} {n : Type.{u1}} {m : Type.{u3}} [_inst_1 : Mul.{u2} α] [_inst_2 : AddCommMonoid.{u2} α] {A : Matrix.{u3, u1, u2} m n α} [_inst_3 : Fintype.{u3} m], (Matrix.HasOrthogonalCols.{u2, u1, u3} α n m _inst_1 _inst_2 A _inst_3) -> (Matrix.HasOrthogonalRows.{u2, u3, u1} α m n _inst_1 _inst_2 (Matrix.transpose.{u2, u3, u1} m n α A) _inst_3)
+Case conversion may be inaccurate. Consider using '#align matrix.has_orthogonal_cols.transpose_has_orthogonal_rows Matrix.HasOrthogonalCols.transpose_hasOrthogonalRowsₓ'. -/
 theorem HasOrthogonalCols.transpose_hasOrthogonalRows [Fintype m] (h : A.HasOrthogonalCols) :
     Aᵀ.HasOrthogonalRows :=
   h
 #align matrix.has_orthogonal_cols.transpose_has_orthogonal_rows Matrix.HasOrthogonalCols.transpose_hasOrthogonalRows
 
+/- warning: matrix.has_orthogonal_cols.has_orthogonal_rows -> Matrix.HasOrthogonalCols.hasOrthogonalRows is a dubious translation:
+lean 3 declaration is
+  forall {α : Type.{u1}} {n : Type.{u2}} {m : Type.{u3}} [_inst_1 : Mul.{u1} α] [_inst_2 : AddCommMonoid.{u1} α] {A : Matrix.{u3, u2, u1} m n α} [_inst_3 : Fintype.{u2} n], (Matrix.HasOrthogonalCols.{u1, u3, u2} α m n _inst_1 _inst_2 (Matrix.transpose.{u1, u3, u2} m n α A) _inst_3) -> (Matrix.HasOrthogonalRows.{u1, u2, u3} α n m _inst_1 _inst_2 A _inst_3)
+but is expected to have type
+  forall {α : Type.{u2}} {n : Type.{u3}} {m : Type.{u1}} [_inst_1 : Mul.{u2} α] [_inst_2 : AddCommMonoid.{u2} α] {A : Matrix.{u1, u3, u2} m n α} [_inst_3 : Fintype.{u3} n], (Matrix.HasOrthogonalCols.{u2, u1, u3} α m n _inst_1 _inst_2 (Matrix.transpose.{u2, u1, u3} m n α A) _inst_3) -> (Matrix.HasOrthogonalRows.{u2, u3, u1} α n m _inst_1 _inst_2 A _inst_3)
+Case conversion may be inaccurate. Consider using '#align matrix.has_orthogonal_cols.has_orthogonal_rows Matrix.HasOrthogonalCols.hasOrthogonalRowsₓ'. -/
 theorem HasOrthogonalCols.hasOrthogonalRows [Fintype n] (h : Aᵀ.HasOrthogonalCols) :
     A.HasOrthogonalRows :=
   h
 #align matrix.has_orthogonal_cols.has_orthogonal_rows Matrix.HasOrthogonalCols.hasOrthogonalRows
 
+/- warning: matrix.has_orthogonal_rows.transpose_has_orthogonal_cols -> Matrix.HasOrthogonalRows.transpose_hasOrthogonalCols is a dubious translation:
+lean 3 declaration is
+  forall {α : Type.{u1}} {n : Type.{u2}} {m : Type.{u3}} [_inst_1 : Mul.{u1} α] [_inst_2 : AddCommMonoid.{u1} α] {A : Matrix.{u3, u2, u1} m n α} [_inst_3 : Fintype.{u2} n], (Matrix.HasOrthogonalRows.{u1, u2, u3} α n m _inst_1 _inst_2 A _inst_3) -> (Matrix.HasOrthogonalCols.{u1, u3, u2} α m n _inst_1 _inst_2 (Matrix.transpose.{u1, u3, u2} m n α A) _inst_3)
+but is expected to have type
+  forall {α : Type.{u2}} {n : Type.{u3}} {m : Type.{u1}} [_inst_1 : Mul.{u2} α] [_inst_2 : AddCommMonoid.{u2} α] {A : Matrix.{u1, u3, u2} m n α} [_inst_3 : Fintype.{u3} n], (Matrix.HasOrthogonalRows.{u2, u3, u1} α n m _inst_1 _inst_2 A _inst_3) -> (Matrix.HasOrthogonalCols.{u2, u1, u3} α m n _inst_1 _inst_2 (Matrix.transpose.{u2, u1, u3} m n α A) _inst_3)
+Case conversion may be inaccurate. Consider using '#align matrix.has_orthogonal_rows.transpose_has_orthogonal_cols Matrix.HasOrthogonalRows.transpose_hasOrthogonalColsₓ'. -/
 theorem HasOrthogonalRows.transpose_hasOrthogonalCols [Fintype n] (h : A.HasOrthogonalRows) :
     Aᵀ.HasOrthogonalCols :=
   h

790e98fb

bump to nightly-2023-02-21-16

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

1107b979

Changes in mathlib4

mathlib3

mathlib4

790e98fb

chore(*): remove empty lines between variable statements (#11418)

Empty lines were removed by executing the following Python script twice

import os
import re


# Loop through each file in the repository
for dir_path, dirs, files in os.walk('.'):
  for filename in files:
    if filename.endswith('.lean'):
      file_path = os.path.join(dir_path, filename)

      # Open the file and read its contents
      with open(file_path, 'r') as file:
        content = file.read()

      # Use a regular expression to replace sequences of "variable" lines separated by empty lines
      # with sequences without empty lines
      modified_content = re.sub(r'(variable.*\n)\n(variable(?! .* in))', r'\1\2', content)

      # Write the modified content back to the file
      with open(file_path, 'w') as file:
        file.write(modified_content)

75c86f04

Diff

@@ -28,9 +28,7 @@ orthogonal
 namespace Matrix
 
 variable {α n m : Type*}
-
 variable [Mul α] [AddCommMonoid α]
-
 variable (A : Matrix m n α)
 
 open Matrix

790e98fb

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

@@ -27,7 +27,7 @@ orthogonal
 
 namespace Matrix
 
-variable {α n m : Type _}
+variable {α n m : Type*}
 
 variable [Mul α] [AddCommMonoid α]

790e98fb

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,14 +2,11 @@
 Copyright (c) 2021 Lu-Ming Zhang. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Lu-Ming Zhang
-
-! This file was ported from Lean 3 source module linear_algebra.matrix.orthogonal
-! leanprover-community/mathlib commit 790e98fbb5ec433d89d833320954607e79ae9071
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathlib.Data.Matrix.Basic
 
+#align_import linear_algebra.matrix.orthogonal from "leanprover-community/mathlib"@"790e98fbb5ec433d89d833320954607e79ae9071"
+
 /-!
 # Orthogonal

790e98fb

feat: port LinearAlgebra.Matrix.Orthogonal (#3235)

Co-authored-by: Parcly Taxel <reddeloostw@gmail.com> Co-authored-by: Jeremy Tan Jie Rui <reddeloostw@gmail.com> Co-authored-by: ChrisHughes24 <chrishughes24@gmail.com>

d75ac724

`linear_algebra.matrix.orthogonal` ⟷ `Mathlib.LinearAlgebra.Matrix.Orthogonal`

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 8 + 384

linear_algebra.matrix.orthogonal ⟷ Mathlib.LinearAlgebra.Matrix.Orthogonal

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 8 + 384

`linear_algebra.matrix.orthogonal` ⟷ `Mathlib.LinearAlgebra.Matrix.Orthogonal`