algebra.lie.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

55e2dfde

(last sync)

Changes in mathlib3port

mathlib3

mathlib3port

5c1efce1

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 Oliver Nash. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Oliver Nash
 -/
-import Mathbin.Algebra.Lie.OfAssociative
-import Mathbin.LinearAlgebra.Matrix.Reindex
-import Mathbin.LinearAlgebra.Matrix.ToLinearEquiv
+import Algebra.Lie.OfAssociative
+import LinearAlgebra.Matrix.Reindex
+import LinearAlgebra.Matrix.ToLinearEquiv
 
 #align_import algebra.lie.matrix from "leanprover-community/mathlib"@"5c1efce12ba86d4901463f61019832f6a4b1a0d0"

5c1efce1

bump to nightly-2023-08-17-09

mathlib commit https://github.com/leanprover-community/mathlib/commit/32a7e535287f9c73f2e4d2aef306a39190f0b504

60285dcc

Diff

@@ -50,7 +50,7 @@ def lieEquivMatrix' : Module.End R (n → R) ≃ₗ⁅R⁆ Matrix n n R :=
       let f := @LinearMap.toMatrix' R _ n n _ _
       change f (T.comp S - S.comp T) = f T * f S - f S * f T
       have h : ∀ T S : Module.End R _, f (T.comp S) = f T ⬝ f S := LinearMap.toMatrix'_comp
-      rw [LinearEquiv.map_sub, h, h, Matrix.mul_eq_mul, Matrix.mul_eq_mul] }
+      rw [LinearEquiv.map_sub, h, h, Matrix.hMul_eq_hMul, Matrix.hMul_eq_hMul] }
 #align lie_equiv_matrix' lieEquivMatrix'
 -/
 
@@ -106,7 +106,7 @@ def Matrix.reindexLieEquiv : Matrix n n R ≃ₗ⁅R⁆ Matrix m m R :=
     toFun := Matrix.reindex e e
     map_lie' := fun M N => by
       simp only [LieRing.of_associative_ring_bracket, Matrix.reindex_apply,
-        Matrix.submatrix_mul_equiv, Matrix.mul_eq_mul, Matrix.submatrix_sub, Pi.sub_apply] }
+        Matrix.submatrix_mul_equiv, Matrix.hMul_eq_hMul, Matrix.submatrix_sub, Pi.sub_apply] }
 #align matrix.reindex_lie_equiv Matrix.reindexLieEquiv
 -/

5c1efce1

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 Oliver Nash. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Oliver Nash
-
-! This file was ported from Lean 3 source module algebra.lie.matrix
-! leanprover-community/mathlib commit 5c1efce12ba86d4901463f61019832f6a4b1a0d0
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathbin.Algebra.Lie.OfAssociative
 import Mathbin.LinearAlgebra.Matrix.Reindex
 import Mathbin.LinearAlgebra.Matrix.ToLinearEquiv
 
+#align_import algebra.lie.matrix from "leanprover-community/mathlib"@"5c1efce12ba86d4901463f61019832f6a4b1a0d0"
+
 /-!
 # Lie algebras of matrices

5c1efce1

bump to nightly-2023-06-13-21

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

829520ac

Diff

@@ -44,6 +44,7 @@ variable {R : Type u} [CommRing R]
 
 variable {n : Type w} [DecidableEq n] [Fintype n]
 
+#print lieEquivMatrix' /-
 /-- The natural equivalence between linear endomorphisms of finite free modules and square matrices
 is compatible with the Lie algebra structures. -/
 def lieEquivMatrix' : Module.End R (n → R) ≃ₗ⁅R⁆ Matrix n n R :=
@@ -54,39 +55,51 @@ def lieEquivMatrix' : Module.End R (n → R) ≃ₗ⁅R⁆ Matrix n n R :=
       have h : ∀ T S : Module.End R _, f (T.comp S) = f T ⬝ f S := LinearMap.toMatrix'_comp
       rw [LinearEquiv.map_sub, h, h, Matrix.mul_eq_mul, Matrix.mul_eq_mul] }
 #align lie_equiv_matrix' lieEquivMatrix'
+-/
 
+#print lieEquivMatrix'_apply /-
 @[simp]
 theorem lieEquivMatrix'_apply (f : Module.End R (n → R)) : lieEquivMatrix' f = f.toMatrix' :=
   rfl
 #align lie_equiv_matrix'_apply lieEquivMatrix'_apply
+-/
 
+#print lieEquivMatrix'_symm_apply /-
 @[simp]
 theorem lieEquivMatrix'_symm_apply (A : Matrix n n R) :
     (@lieEquivMatrix' R _ n _ _).symm A = A.toLin' :=
   rfl
 #align lie_equiv_matrix'_symm_apply lieEquivMatrix'_symm_apply
+-/
 
+#print Matrix.lieConj /-
 /-- An invertible matrix induces a Lie algebra equivalence from the space of matrices to itself. -/
 def Matrix.lieConj (P : Matrix n n R) (h : Invertible P) : Matrix n n R ≃ₗ⁅R⁆ Matrix n n R :=
   ((@lieEquivMatrix' R _ n _ _).symm.trans (P.toLinearEquiv' h).lieConj).trans lieEquivMatrix'
 #align matrix.lie_conj Matrix.lieConj
+-/
 
+#print Matrix.lieConj_apply /-
 @[simp]
 theorem Matrix.lieConj_apply (P A : Matrix n n R) (h : Invertible P) :
     P.lieConj h A = P ⬝ A ⬝ P⁻¹ := by
   simp [LinearEquiv.conj_apply, Matrix.lieConj, LinearMap.toMatrix'_comp,
     LinearMap.toMatrix'_toLin']
 #align matrix.lie_conj_apply Matrix.lieConj_apply
+-/
 
+#print Matrix.lieConj_symm_apply /-
 @[simp]
 theorem Matrix.lieConj_symm_apply (P A : Matrix n n R) (h : Invertible P) :
     (P.lieConj h).symm A = P⁻¹ ⬝ A ⬝ P := by
   simp [LinearEquiv.symm_conj_apply, Matrix.lieConj, LinearMap.toMatrix'_comp,
     LinearMap.toMatrix'_toLin']
 #align matrix.lie_conj_symm_apply Matrix.lieConj_symm_apply
+-/
 
 variable {m : Type w₁} [DecidableEq m] [Fintype m] (e : n ≃ m)
 
+#print Matrix.reindexLieEquiv /-
 /-- For square matrices, the natural map that reindexes a matrix's rows and columns with equivalent
 types, `matrix.reindex`, is an equivalence of Lie algebras. -/
 def Matrix.reindexLieEquiv : Matrix n n R ≃ₗ⁅R⁆ Matrix m m R :=
@@ -98,18 +111,23 @@ def Matrix.reindexLieEquiv : Matrix n n R ≃ₗ⁅R⁆ Matrix m m R :=
       simp only [LieRing.of_associative_ring_bracket, Matrix.reindex_apply,
         Matrix.submatrix_mul_equiv, Matrix.mul_eq_mul, Matrix.submatrix_sub, Pi.sub_apply] }
 #align matrix.reindex_lie_equiv Matrix.reindexLieEquiv
+-/
 
+#print Matrix.reindexLieEquiv_apply /-
 @[simp]
 theorem Matrix.reindexLieEquiv_apply (M : Matrix n n R) :
     Matrix.reindexLieEquiv e M = Matrix.reindex e e M :=
   rfl
 #align matrix.reindex_lie_equiv_apply Matrix.reindexLieEquiv_apply
+-/
 
+#print Matrix.reindexLieEquiv_symm /-
 @[simp]
 theorem Matrix.reindexLieEquiv_symm :
     (Matrix.reindexLieEquiv e : _ ≃ₗ⁅R⁆ _).symm = Matrix.reindexLieEquiv e.symm :=
   rfl
 #align matrix.reindex_lie_equiv_symm Matrix.reindexLieEquiv_symm
+-/
 
 end Matrices

5c1efce1

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: Oliver Nash
 
 ! This file was ported from Lean 3 source module algebra.lie.matrix
-! leanprover-community/mathlib commit 55e2dfde0cff928ce5c70926a3f2c7dee3e2dd99
+! leanprover-community/mathlib commit 5c1efce12ba86d4901463f61019832f6a4b1a0d0
 ! Please do not edit these lines, except to modify the commit id
 ! if you have ported upstream changes.
 -/
@@ -15,6 +15,9 @@ import Mathbin.LinearAlgebra.Matrix.ToLinearEquiv
 /-!
 # Lie algebras of matrices
 
+> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
+> Any changes to this file require a corresponding PR to mathlib4.
+
 An important class of Lie algebras are those arising from the associative algebra structure on
 square matrices over a commutative ring. This file provides some very basic definitions whose
 primary value stems from their utility when constructing the classical Lie algebras using matrices.

55e2dfde

bump to nightly-2023-05-28-18

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

8d353152

Diff

@@ -35,7 +35,7 @@ universe u v w w₁ w₂
 
 section Matrices
 
-open Matrix
+open scoped Matrix
 
 variable {R : Type u} [CommRing R]

55e2dfde

bump to nightly-2023-02-21-16

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

1107b979

Changes in mathlib4

mathlib3

mathlib4

55e2dfde

chore: remove redundant LinearEquiv.map_neg/sub (#12330)

These are redundant with _root_.{map_neg,map_sub}.

ae4dd74c

Diff

@@ -45,7 +45,7 @@ def lieEquivMatrix' : Module.End R (n → R) ≃ₗ⁅R⁆ Matrix n n R :=
       let f := @LinearMap.toMatrix' R _ n n _ _
       change f (T.comp S - S.comp T) = f T * f S - f S * f T
       have h : ∀ T S : Module.End R _, f (T.comp S) = f T * f S := LinearMap.toMatrix'_comp
-      rw [LinearEquiv.map_sub, h, h] }
+      rw [map_sub, h, h] }
 #align lie_equiv_matrix' lieEquivMatrix'
 
 @[simp]

55e2dfde

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

@@ -35,7 +35,6 @@ section Matrices
 open scoped Matrix
 
 variable {R : Type u} [CommRing R]
-
 variable {n : Type w} [DecidableEq n] [Fintype n]
 
 /-- The natural equivalence between linear endomorphisms of finite free modules and square matrices

55e2dfde

refactor(Data/Matrix): Eliminate ⬝ notation in favor of HMul (#6487)

The main difficulty here is that * has a slightly difference precedence to ⬝. notably around smul and neg.

The other annoyance is that ↑U ⬝ A ⬝ ↑U⁻¹ : Matrix m m 𝔸 now has to be written U.val * A * (U⁻¹).val in order to typecheck.

A downside of this change to consider: if you have a goal of A * (B * C) = (A * B) * C, mul_assoc now gives the illusion of matching, when in fact Matrix.mul_assoc is needed. Previously the distinct symbol made it easy to avoid this mistake.

On the flipside, there is now no need to rewrite by Matrix.mul_eq_mul all the time (indeed, the lemma is now removed).

38c07226

Diff

@@ -45,8 +45,8 @@ def lieEquivMatrix' : Module.End R (n → R) ≃ₗ⁅R⁆ Matrix n n R :=
     map_lie' := fun {T S} => by
       let f := @LinearMap.toMatrix' R _ n n _ _
       change f (T.comp S - S.comp T) = f T * f S - f S * f T
-      have h : ∀ T S : Module.End R _, f (T.comp S) = f T ⬝ f S := LinearMap.toMatrix'_comp
-      rw [LinearEquiv.map_sub, h, h, Matrix.mul_eq_mul, Matrix.mul_eq_mul] }
+      have h : ∀ T S : Module.End R _, f (T.comp S) = f T * f S := LinearMap.toMatrix'_comp
+      rw [LinearEquiv.map_sub, h, h] }
 #align lie_equiv_matrix' lieEquivMatrix'
 
 @[simp]
@@ -68,14 +68,14 @@ def Matrix.lieConj (P : Matrix n n R) (h : Invertible P) : Matrix n n R ≃ₗ
 
 @[simp]
 theorem Matrix.lieConj_apply (P A : Matrix n n R) (h : Invertible P) :
-    P.lieConj h A = P ⬝ A ⬝ P⁻¹ := by
+    P.lieConj h A = P * A * P⁻¹ := by
   simp [LinearEquiv.conj_apply, Matrix.lieConj, LinearMap.toMatrix'_comp,
     LinearMap.toMatrix'_toLin']
 #align matrix.lie_conj_apply Matrix.lieConj_apply
 
 @[simp]
 theorem Matrix.lieConj_symm_apply (P A : Matrix n n R) (h : Invertible P) :
-    (P.lieConj h).symm A = P⁻¹ ⬝ A ⬝ P := by
+    (P.lieConj h).symm A = P⁻¹ * A * P := by
   simp [LinearEquiv.symm_conj_apply, Matrix.lieConj, LinearMap.toMatrix'_comp,
     LinearMap.toMatrix'_toLin']
 #align matrix.lie_conj_symm_apply Matrix.lieConj_symm_apply
@@ -89,7 +89,7 @@ def Matrix.reindexLieEquiv : Matrix n n R ≃ₗ⁅R⁆ Matrix m m R :=
     toFun := Matrix.reindex e e
     map_lie' := fun {_ _} => by
       simp only [LieRing.of_associative_ring_bracket, Matrix.reindex_apply,
-        Matrix.submatrix_mul_equiv, Matrix.mul_eq_mul, Matrix.submatrix_sub, Pi.sub_apply] }
+        Matrix.submatrix_mul_equiv, Matrix.submatrix_sub, Pi.sub_apply] }
 #align matrix.reindex_lie_equiv Matrix.reindexLieEquiv
 
 @[simp]

55e2dfde

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 Oliver Nash. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Oliver Nash
-
-! This file was ported from Lean 3 source module algebra.lie.matrix
-! leanprover-community/mathlib commit 55e2dfde0cff928ce5c70926a3f2c7dee3e2dd99
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathlib.Algebra.Lie.OfAssociative
 import Mathlib.LinearAlgebra.Matrix.Reindex
 import Mathlib.LinearAlgebra.Matrix.ToLinearEquiv
 
+#align_import algebra.lie.matrix from "leanprover-community/mathlib"@"55e2dfde0cff928ce5c70926a3f2c7dee3e2dd99"
+
 /-!
 # Lie algebras of matrices

55e2dfde

feat: port Algebra.Lie.Matrix (#4621)

533e6e46

`algebra.lie.matrix` ⟷ `Mathlib.Algebra.Lie.Matrix`

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 10 + 621

algebra.lie.matrix ⟷ Mathlib.Algebra.Lie.Matrix

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 10 + 621

`algebra.lie.matrix` ⟷ `Mathlib.Algebra.Lie.Matrix`