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

c0cc689b

(last sync)

Changes in mathlib3port

mathlib3

mathlib3port

36938f77

bump to nightly-2023-11-15-06

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

38c8ceef

Diff

@@ -178,14 +178,14 @@ theorem lie_of_of_ne [DecidableEq ι] {i j : ι} (hij : j ≠ i) (x : L i) (y :
 #align direct_sum.lie_of_of_ne DirectSum.lie_of_of_ne
 -/
 
-#print DirectSum.lie_of_of_eq /-
-theorem lie_of_of_eq [DecidableEq ι] {i j : ι} (hij : j = i) (x : L i) (y : L j) :
+#print DirectSum.lie_of_same /-
+theorem lie_of_same [DecidableEq ι] {i j : ι} (hij : j = i) (x : L i) (y : L j) :
     ⁅of L i x, of L j y⁆ = of L i ⁅x, hij.recOn y⁆ :=
   by
   have : of L j y = of L i (hij.rec_on y) := Eq.drec (Eq.refl _) hij
   rw [this, ← lie_algebra_of_apply R ι L i ⁅x, hij.rec_on y⁆, LieHom.map_lie, lie_algebra_of_apply,
     lie_algebra_of_apply]
-#align direct_sum.lie_of_of_eq DirectSum.lie_of_of_eq
+#align direct_sum.lie_of_of_eq DirectSum.lie_of_same
 -/
 
 #print DirectSum.lie_of /-

36938f77

bump to nightly-2023-09-24-06

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

5655435f

Diff

@@ -3,10 +3,10 @@ Copyright (c) 2020 Oliver Nash. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Oliver Nash
 -/
-import Mathbin.Algebra.DirectSum.Module
-import Mathbin.Algebra.Lie.OfAssociative
-import Mathbin.Algebra.Lie.Submodule
-import Mathbin.Algebra.Lie.Basic
+import Algebra.DirectSum.Module
+import Algebra.Lie.OfAssociative
+import Algebra.Lie.Submodule
+import Algebra.Lie.Basic
 
 #align_import algebra.lie.direct_sum from "leanprover-community/mathlib"@"36938f775671ff28bea1c0310f1608e4afbb22e0"

36938f77

bump to nightly-2023-07-20-09

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

9c56d0dd

Diff

@@ -2,17 +2,14 @@
 Copyright (c) 2020 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.direct_sum
-! leanprover-community/mathlib commit 36938f775671ff28bea1c0310f1608e4afbb22e0
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathbin.Algebra.DirectSum.Module
 import Mathbin.Algebra.Lie.OfAssociative
 import Mathbin.Algebra.Lie.Submodule
 import Mathbin.Algebra.Lie.Basic
 
+#align_import algebra.lie.direct_sum from "leanprover-community/mathlib"@"36938f775671ff28bea1c0310f1608e4afbb22e0"
+
 /-!
 # Direct sums of Lie algebras and Lie modules

36938f77

bump to nightly-2023-07-12-07

mathlib commit https://github.com/leanprover-community/mathlib/commit/4e24c4bfcff371c71f7ba22050308aa17815626c

9849f9d1

Diff

@@ -31,7 +31,7 @@ universe u v w w₁
 
 namespace DirectSum
 
-open Dfinsupp
+open DFinsupp
 
 open scoped DirectSum
 
@@ -164,7 +164,7 @@ def lieAlgebraComponent (j : ι) : (⨁ i, L i) →ₗ⁅R⁆ L j :=
 @[ext]
 theorem lieAlgebra_ext {x y : ⨁ i, L i}
     (h : ∀ i, lieAlgebraComponent R ι L i x = lieAlgebraComponent R ι L i y) : x = y :=
-  Dfinsupp.ext h
+  DFinsupp.ext h
 #align direct_sum.lie_algebra_ext DirectSum.lieAlgebra_ext
 -/

36938f77

bump to nightly-2023-06-20-01

mathlib commit https://github.com/leanprover-community/mathlib/commit/2a0ce625dbb0ffbc7d1316597de0b25c1ec75303

9b351f8c

Diff

@@ -232,7 +232,7 @@ def toLieAlgebra [DecidableEq ι] (L' : Type w₁) [LieRing L'] [LieAlgebra R L'
         by
         simp only [← LieAlgebra.ad_apply R]
         rw [← LinearMap.comp_apply, ← LinearMap.comp_apply]
-        congr; clear y; ext (i y); exact this i y
+        congr; clear y; ext i y; exact this i y
       suffices
         ∀ (i j) (y : L i) (x : L j),
           to_module R ι L' f' ⁅of L j x, of L i y⁆ =
@@ -242,7 +242,7 @@ def toLieAlgebra [DecidableEq ι] (L' : Type w₁) [LieRing L'] [LieAlgebra R L'
         rw [← lie_skew x, ← lie_skew (to_module R ι L' f' x)]
         simp only [LinearMap.map_neg, neg_inj, ← LieAlgebra.ad_apply R]
         rw [← LinearMap.comp_apply, ← LinearMap.comp_apply]
-        congr; clear x; ext (j x); exact this j i x y
+        congr; clear x; ext j x; exact this j i x y
       intro i j y x
       simp only [lie_of R, lie_algebra_of_apply, LieHom.coe_toLinearMap, to_add_monoid_of,
         coe_to_module_eq_coe_to_add_monoid, LinearMap.toAddMonoidHom_coe]

36938f77

bump to nightly-2023-06-13-21

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

829520ac

Diff

@@ -58,10 +58,12 @@ instance : LieRingModule L (⨁ i, M i)
   lie_add x m n := by ext; simp only [map_range_apply, add_apply, lie_add]
   leibniz_lie x y m := by ext; simp only [map_range_apply, lie_lie, add_apply, sub_add_cancel]
 
+#print DirectSum.lie_module_bracket_apply /-
 @[simp]
 theorem lie_module_bracket_apply (x : L) (m : ⨁ i, M i) (i : ι) : ⁅x, m⁆ i = ⁅x, m i⁆ :=
   mapRange_apply _ _ m i
 #align direct_sum.lie_module_bracket_apply DirectSum.lie_module_bracket_apply
+-/
 
 instance : LieModule R L (⨁ i, M i)
     where
@@ -70,6 +72,7 @@ instance : LieModule R L (⨁ i, M i)
 
 variable (R ι L M)
 
+#print DirectSum.lieModuleOf /-
 /-- The inclusion of each component into a direct sum as a morphism of Lie modules. -/
 def lieModuleOf [DecidableEq ι] (j : ι) : M j →ₗ⁅R,L⁆ ⨁ i, M i :=
   { lof R ι M j with
@@ -78,13 +81,16 @@ def lieModuleOf [DecidableEq ι] (j : ι) : M j →ₗ⁅R,L⁆ ⨁ i, M i :=
       · rw [← h]; simp
       · simp [lof, single_eq_of_ne h] }
 #align direct_sum.lie_module_of DirectSum.lieModuleOf
+-/
 
+#print DirectSum.lieModuleComponent /-
 /-- The projection map onto one component, as a morphism of Lie modules. -/
 def lieModuleComponent (j : ι) : (⨁ i, M i) →ₗ⁅R,L⁆ M j :=
   { component R ι M j with
     map_lie' := fun x m => by
       simp only [component, lapply_apply, lie_module_bracket_apply, LinearMap.toFun_eq_coe] }
 #align direct_sum.lie_module_component DirectSum.lieModuleComponent
+-/
 
 end Modules
 
@@ -113,10 +119,12 @@ instance lieRing : LieRing (⨁ i, L i) :=
 #align direct_sum.lie_ring DirectSum.lieRing
 -/
 
+#print DirectSum.bracket_apply /-
 @[simp]
 theorem bracket_apply (x y : ⨁ i, L i) (i : ι) : ⁅x, y⁆ i = ⁅x i, y i⁆ :=
   zipWith_apply _ _ x y i
 #align direct_sum.bracket_apply DirectSum.bracket_apply
+-/
 
 #print DirectSum.lieAlgebra /-
 instance lieAlgebra : LieAlgebra R (⨁ i, L i) :=
@@ -152,14 +160,15 @@ def lieAlgebraComponent (j : ι) : (⨁ i, L i) →ₗ⁅R⁆ L j :=
 #align direct_sum.lie_algebra_component DirectSum.lieAlgebraComponent
 -/
 
+#print DirectSum.lieAlgebra_ext /-
 @[ext]
 theorem lieAlgebra_ext {x y : ⨁ i, L i}
     (h : ∀ i, lieAlgebraComponent R ι L i x = lieAlgebraComponent R ι L i y) : x = y :=
   Dfinsupp.ext h
 #align direct_sum.lie_algebra_ext DirectSum.lieAlgebra_ext
+-/
 
-include R
-
+#print DirectSum.lie_of_of_ne /-
 theorem lie_of_of_ne [DecidableEq ι] {i j : ι} (hij : j ≠ i) (x : L i) (y : L j) :
     ⁅of L i x, of L j y⁆ = 0 := by
   apply lie_algebra_ext R ι L; intro k
@@ -170,7 +179,9 @@ theorem lie_of_of_ne [DecidableEq ι] {i j : ι} (hij : j ≠ i) (x : L i) (y :
   · simp only [dif_neg, not_false_iff, lie_zero, hik.symm, hij]
   · simp only [dif_neg, not_false_iff, zero_lie, hik]
 #align direct_sum.lie_of_of_ne DirectSum.lie_of_of_ne
+-/
 
+#print DirectSum.lie_of_of_eq /-
 theorem lie_of_of_eq [DecidableEq ι] {i j : ι} (hij : j = i) (x : L i) (y : L j) :
     ⁅of L i x, of L j y⁆ = of L i ⁅x, hij.recOn y⁆ :=
   by
@@ -178,7 +189,9 @@ theorem lie_of_of_eq [DecidableEq ι] {i j : ι} (hij : j = i) (x : L i) (y : L
   rw [this, ← lie_algebra_of_apply R ι L i ⁅x, hij.rec_on y⁆, LieHom.map_lie, lie_algebra_of_apply,
     lie_algebra_of_apply]
 #align direct_sum.lie_of_of_eq DirectSum.lie_of_of_eq
+-/
 
+#print DirectSum.lie_of /-
 @[simp]
 theorem lie_of [DecidableEq ι] {i j : ι} (x : L i) (y : L j) :
     ⁅of L i x, of L j y⁆ = if hij : j = i then lieAlgebraOf R ι L i ⁅x, hij.recOn y⁆ else 0 :=
@@ -187,9 +200,11 @@ theorem lie_of [DecidableEq ι] {i j : ι} (x : L i) (y : L j) :
   · simp only [lie_of_of_eq R ι L hij x y, hij, dif_pos, not_false_iff, lie_algebra_of_apply]
   · simp only [lie_of_of_ne R ι L hij x y, hij, dif_neg, not_false_iff]
 #align direct_sum.lie_of DirectSum.lie_of
+-/
 
 variable {R L ι}
 
+#print DirectSum.toLieAlgebra /-
 /-- Given a family of Lie algebras `L i`, together with a family of morphisms of Lie algebras
 `f i : L i →ₗ⁅R⁆ L'` into a fixed Lie algebra `L'`, we have a natural linear map:
 `(⨁ i, L i) →ₗ[R] L'`. If in addition `⁅f i x, f j y⁆ = 0` for any `x ∈ L i` and `y ∈ L j` (`i ≠ j`)
@@ -237,6 +252,7 @@ def toLieAlgebra [DecidableEq ι] (L' : Type w₁) [LieRing L'] [LieAlgebra R L'
           LinearMap.toAddMonoidHom_coe]
       · simp only [h, hf j i h.symm x y, dif_neg, not_false_iff, AddMonoidHom.map_zero] }
 #align direct_sum.to_lie_algebra DirectSum.toLieAlgebra
+-/
 
 end Algebras

36938f77

bump to nightly-2023-06-07-03

mathlib commit https://github.com/leanprover-community/mathlib/commit/58a272265b5e05f258161260dd2c5d247213cbd3

831e78ce

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.direct_sum
-! leanprover-community/mathlib commit c0cc689babd41c0e9d5f02429211ffbe2403472a
+! leanprover-community/mathlib commit 36938f775671ff28bea1c0310f1608e4afbb22e0
 ! Please do not edit these lines, except to modify the commit id
 ! if you have ported upstream changes.
 -/
@@ -16,6 +16,9 @@ import Mathbin.Algebra.Lie.Basic
 /-!
 # Direct sums of Lie algebras and Lie modules
 
+> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
+> Any changes to this file require a corresponding PR to mathlib4.
+
 Direct sums of Lie algebras and Lie modules carry natural algebra and module structures.
 
 ## Tags

c0cc689b

bump to nightly-2023-06-05-21

mathlib commit https://github.com/leanprover-community/mathlib/commit/13361559d66b84f80b6d5a1c4a26aa5054766725

c2e91d3c

Diff

@@ -94,6 +94,7 @@ variable (L : ι → Type w)
 
 variable [∀ i, LieRing (L i)] [∀ i, LieAlgebra R (L i)]
 
+#print DirectSum.lieRing /-
 instance lieRing : LieRing (⨁ i, L i) :=
   {
     (inferInstance :
@@ -107,20 +108,24 @@ instance lieRing : LieRing (⨁ i, L i) :=
       ext; simp only [sub_apply, zip_with_apply, add_apply, zero_apply]
       apply leibniz_lie }
 #align direct_sum.lie_ring DirectSum.lieRing
+-/
 
 @[simp]
 theorem bracket_apply (x y : ⨁ i, L i) (i : ι) : ⁅x, y⁆ i = ⁅x i, y i⁆ :=
   zipWith_apply _ _ x y i
 #align direct_sum.bracket_apply DirectSum.bracket_apply
 
+#print DirectSum.lieAlgebra /-
 instance lieAlgebra : LieAlgebra R (⨁ i, L i) :=
   { (inferInstance : Module R _) with
     lie_smul := fun c x y => by ext;
       simp only [zip_with_apply, smul_apply, bracket_apply, lie_smul] }
 #align direct_sum.lie_algebra DirectSum.lieAlgebra
+-/
 
 variable (R ι L)
 
+#print DirectSum.lieAlgebraOf /-
 /-- The inclusion of each component into the direct sum as morphism of Lie algebras. -/
 @[simps]
 def lieAlgebraOf [DecidableEq ι] (j : ι) : L j →ₗ⁅R⁆ ⨁ i, L i :=
@@ -131,7 +136,9 @@ def lieAlgebraOf [DecidableEq ι] (j : ι) : L j →ₗ⁅R⁆ ⨁ i, L i :=
       · rw [← h]; simp [of]
       · simp [of, single_eq_of_ne h] }
 #align direct_sum.lie_algebra_of DirectSum.lieAlgebraOf
+-/
 
+#print DirectSum.lieAlgebraComponent /-
 /-- The projection map onto one component, as a morphism of Lie algebras. -/
 @[simps]
 def lieAlgebraComponent (j : ι) : (⨁ i, L i) →ₗ⁅R⁆ L j :=
@@ -140,6 +147,7 @@ def lieAlgebraComponent (j : ι) : (⨁ i, L i) →ₗ⁅R⁆ L j :=
     map_lie' := fun x y => by
       simp only [component, bracket_apply, lapply_apply, LinearMap.toFun_eq_coe] }
 #align direct_sum.lie_algebra_component DirectSum.lieAlgebraComponent
+-/
 
 @[ext]
 theorem lieAlgebra_ext {x y : ⨁ i, L i}
@@ -233,17 +241,21 @@ section Ideals
 
 variable {L : Type w} [LieRing L] [LieAlgebra R L] (I : ι → LieIdeal R L)
 
+#print DirectSum.lieRingOfIdeals /-
 /-- The fact that this instance is necessary seems to be a bug in typeclass inference. See
 [this Zulip thread](https://leanprover.zulipchat.com/#narrow/stream/113488-general/topic/
 Typeclass.20resolution.20under.20binders/near/245151099). -/
 instance lieRingOfIdeals : LieRing (⨁ i, I i) :=
   DirectSum.lieRing fun i => ↥(I i)
 #align direct_sum.lie_ring_of_ideals DirectSum.lieRingOfIdeals
+-/
 
+#print DirectSum.lieAlgebraOfIdeals /-
 /-- See `direct_sum.lie_ring_of_ideals` comment. -/
 instance lieAlgebraOfIdeals : LieAlgebra R (⨁ i, I i) :=
   DirectSum.lieAlgebra fun i => ↥(I i)
 #align direct_sum.lie_algebra_of_ideals DirectSum.lieAlgebraOfIdeals
+-/
 
 end Ideals

c0cc689b

bump to nightly-2023-06-01-16

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

b9c87c70

Diff

@@ -206,7 +206,7 @@ def toLieAlgebra [DecidableEq ι] (L' : Type w₁) [LieRing L'] [LieAlgebra R L'
         by
         simp only [← LieAlgebra.ad_apply R]
         rw [← LinearMap.comp_apply, ← LinearMap.comp_apply]
-        congr ; clear y; ext (i y); exact this i y
+        congr; clear y; ext (i y); exact this i y
       suffices
         ∀ (i j) (y : L i) (x : L j),
           to_module R ι L' f' ⁅of L j x, of L i y⁆ =
@@ -216,7 +216,7 @@ def toLieAlgebra [DecidableEq ι] (L' : Type w₁) [LieRing L'] [LieAlgebra R L'
         rw [← lie_skew x, ← lie_skew (to_module R ι L' f' x)]
         simp only [LinearMap.map_neg, neg_inj, ← LieAlgebra.ad_apply R]
         rw [← LinearMap.comp_apply, ← LinearMap.comp_apply]
-        congr ; clear x; ext (j x); exact this j i x y
+        congr; clear x; ext (j x); exact this j i x y
       intro i j y x
       simp only [lie_of R, lie_algebra_of_apply, LieHom.coe_toLinearMap, to_add_monoid_of,
         coe_to_module_eq_coe_to_add_monoid, LinearMap.toAddMonoidHom_coe]

c0cc689b

bump to nightly-2023-05-28-18

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

8d353152

Diff

@@ -30,7 +30,7 @@ namespace DirectSum
 
 open Dfinsupp
 
-open DirectSum
+open scoped DirectSum
 
 variable {R : Type u} {ι : Type v} [CommRing R]

c0cc689b

bump to nightly-2023-05-28-04

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

6797a637

Diff

@@ -51,15 +51,9 @@ variable [∀ i, LieRingModule L (M i)] [∀ i, LieModule R L (M i)]
 instance : LieRingModule L (⨁ i, M i)
     where
   bracket x m := m.mapRange (fun i m' => ⁅x, m'⁆) fun i => lie_zero x
-  add_lie x y m := by
-    ext
-    simp only [map_range_apply, add_apply, add_lie]
-  lie_add x m n := by
-    ext
-    simp only [map_range_apply, add_apply, lie_add]
-  leibniz_lie x y m := by
-    ext
-    simp only [map_range_apply, lie_lie, add_apply, sub_add_cancel]
+  add_lie x y m := by ext; simp only [map_range_apply, add_apply, add_lie]
+  lie_add x m n := by ext; simp only [map_range_apply, add_apply, lie_add]
+  leibniz_lie x y m := by ext; simp only [map_range_apply, lie_lie, add_apply, sub_add_cancel]
 
 @[simp]
 theorem lie_module_bracket_apply (x : L) (m : ⨁ i, M i) (i : ι) : ⁅x, m⁆ i = ⁅x, m i⁆ :=
@@ -68,12 +62,8 @@ theorem lie_module_bracket_apply (x : L) (m : ⨁ i, M i) (i : ι) : ⁅x, m⁆
 
 instance : LieModule R L (⨁ i, M i)
     where
-  smul_lie t x m := by
-    ext i
-    simp only [smul_lie, lie_module_bracket_apply, smul_apply]
-  lie_smul t x m := by
-    ext i
-    simp only [lie_smul, lie_module_bracket_apply, smul_apply]
+  smul_lie t x m := by ext i; simp only [smul_lie, lie_module_bracket_apply, smul_apply]
+  lie_smul t x m := by ext i; simp only [lie_smul, lie_module_bracket_apply, smul_apply]
 
 variable (R ι L M)
 
@@ -82,8 +72,7 @@ def lieModuleOf [DecidableEq ι] (j : ι) : M j →ₗ⁅R,L⁆ ⨁ i, M i :=
   { lof R ι M j with
     map_lie' := fun x m => by
       ext i; by_cases h : j = i
-      · rw [← h]
-        simp
+      · rw [← h]; simp
       · simp [lof, single_eq_of_ne h] }
 #align direct_sum.lie_module_of DirectSum.lieModuleOf
 
@@ -111,18 +100,11 @@ instance lieRing : LieRing (⨁ i, L i) :=
       AddCommGroup
         _) with
     bracket := zipWith (fun i => fun x y => ⁅x, y⁆) fun i => lie_zero 0
-    add_lie := fun x y z => by
-      ext
-      simp only [zip_with_apply, add_apply, add_lie]
-    lie_add := fun x y z => by
-      ext
-      simp only [zip_with_apply, add_apply, lie_add]
-    lie_self := fun x => by
-      ext
-      simp only [zip_with_apply, add_apply, lie_self, zero_apply]
+    add_lie := fun x y z => by ext; simp only [zip_with_apply, add_apply, add_lie]
+    lie_add := fun x y z => by ext; simp only [zip_with_apply, add_apply, lie_add]
+    lie_self := fun x => by ext; simp only [zip_with_apply, add_apply, lie_self, zero_apply]
     leibniz_lie := fun x y z => by
-      ext
-      simp only [sub_apply, zip_with_apply, add_apply, zero_apply]
+      ext; simp only [sub_apply, zip_with_apply, add_apply, zero_apply]
       apply leibniz_lie }
 #align direct_sum.lie_ring DirectSum.lieRing
 
@@ -133,8 +115,7 @@ theorem bracket_apply (x y : ⨁ i, L i) (i : ι) : ⁅x, y⁆ i = ⁅x i, y i
 
 instance lieAlgebra : LieAlgebra R (⨁ i, L i) :=
   { (inferInstance : Module R _) with
-    lie_smul := fun c x y => by
-      ext
+    lie_smul := fun c x y => by ext;
       simp only [zip_with_apply, smul_apply, bracket_apply, lie_smul] }
 #align direct_sum.lie_algebra DirectSum.lieAlgebra
 
@@ -146,10 +127,8 @@ def lieAlgebraOf [DecidableEq ι] (j : ι) : L j →ₗ⁅R⁆ ⨁ i, L i :=
   { lof R ι L j with
     toFun := of L j
     map_lie' := fun x y => by
-      ext i
-      by_cases h : j = i
-      · rw [← h]
-        simp [of]
+      ext i; by_cases h : j = i
+      · rw [← h]; simp [of]
       · simp [of, single_eq_of_ne h] }
 #align direct_sum.lie_algebra_of DirectSum.lieAlgebraOf
 
@@ -227,10 +206,7 @@ def toLieAlgebra [DecidableEq ι] (L' : Type w₁) [LieRing L'] [LieAlgebra R L'
         by
         simp only [← LieAlgebra.ad_apply R]
         rw [← LinearMap.comp_apply, ← LinearMap.comp_apply]
-        congr
-        clear y
-        ext (i y)
-        exact this i y
+        congr ; clear y; ext (i y); exact this i y
       suffices
         ∀ (i j) (y : L i) (x : L j),
           to_module R ι L' f' ⁅of L j x, of L i y⁆ =
@@ -240,10 +216,7 @@ def toLieAlgebra [DecidableEq ι] (L' : Type w₁) [LieRing L'] [LieAlgebra R L'
         rw [← lie_skew x, ← lie_skew (to_module R ι L' f' x)]
         simp only [LinearMap.map_neg, neg_inj, ← LieAlgebra.ad_apply R]
         rw [← LinearMap.comp_apply, ← LinearMap.comp_apply]
-        congr
-        clear x
-        ext (j x)
-        exact this j i x y
+        congr ; clear x; ext (j x); exact this j i x y
       intro i j y x
       simp only [lie_of R, lie_algebra_of_apply, LieHom.coe_toLinearMap, to_add_monoid_of,
         coe_to_module_eq_coe_to_add_monoid, LinearMap.toAddMonoidHom_coe]

c0cc689b

bump to nightly-2023-02-27-16

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

feafc24f

Diff

@@ -245,11 +245,11 @@ def toLieAlgebra [DecidableEq ι] (L' : Type w₁) [LieRing L'] [LieAlgebra R L'
         ext (j x)
         exact this j i x y
       intro i j y x
-      simp only [lie_of R, lie_algebra_of_apply, LieHom.coe_to_linearMap, to_add_monoid_of,
+      simp only [lie_of R, lie_algebra_of_apply, LieHom.coe_toLinearMap, to_add_monoid_of,
         coe_to_module_eq_coe_to_add_monoid, LinearMap.toAddMonoidHom_coe]
       rcases eq_or_ne i j with (h | h)
       · have h' : f j (h.rec_on y) = f i y := Eq.drec (Eq.refl _) h
-        simp only [h, h', LieHom.coe_to_linearMap, dif_pos, LieHom.map_lie, to_add_monoid_of,
+        simp only [h, h', LieHom.coe_toLinearMap, dif_pos, LieHom.map_lie, to_add_monoid_of,
           LinearMap.toAddMonoidHom_coe]
       · simp only [h, hf j i h.symm x y, dif_neg, not_false_iff, AddMonoidHom.map_zero] }
 #align direct_sum.to_lie_algebra DirectSum.toLieAlgebra

c0cc689b

bump to nightly-2023-02-21-16

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

1107b979

Changes in mathlib4

mathlib3

mathlib4

c0cc689b

chore: adapt to multiple goal linter 1 (#12338)

A PR accompanying #12339.

Zulip discussion

45f93f3f

Diff

@@ -166,16 +166,16 @@ def lieAlgebraOf [DecidableEq ι] (j : ι) : L j →ₗ⁅R⁆ ⨁ i, L i :=
         -- with `simp [of, singleAddHom]`
         simp only [of, singleAddHom, bracket_apply]
         erw [AddHom.coe_mk, single_apply, single_apply]
-        simp? [h] says simp only [h, ↓reduceDite, single_apply]
-        intros
-        erw [single_add]
+        · simp? [h] says simp only [h, ↓reduceDite, single_apply]
+        · intros
+          erw [single_add]
       · -- This used to be the end of the proof before leanprover/lean4#2644
         -- with `simp [of, singleAddHom]`
         simp only [of, singleAddHom, bracket_apply]
         erw [AddHom.coe_mk, single_apply, single_apply]
-        simp only [h, dite_false, single_apply, lie_self]
-        intros
-        erw [single_add] }
+        · simp only [h, dite_false, single_apply, lie_self]
+        · intros
+          erw [single_add] }
 #align direct_sum.lie_algebra_of DirectSum.lieAlgebraOf
 
 /-- The projection map onto one component, as a morphism of Lie algebras. -/

c0cc689b

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

@@ -38,11 +38,8 @@ structure. -/
 
 
 variable {L : Type w₁} {M : ι → Type w}
-
 variable [LieRing L] [LieAlgebra R L]
-
 variable [∀ i, AddCommGroup (M i)] [∀ i, Module R (M i)]
-
 variable [∀ i, LieRingModule L (M i)] [∀ i, LieModule R L (M i)]
 
 instance : LieRingModule L (⨁ i, M i) where
@@ -100,7 +97,6 @@ section Algebras
 
 
 variable (L : ι → Type w)
-
 variable [∀ i, LieRing (L i)] [∀ i, LieAlgebra R (L i)]
 
 instance lieRing : LieRing (⨁ i, L i) :=

c0cc689b

chore: prepare Lean version bump with explicit simp (#10999)

Co-authored-by: Scott Morrison <scott.morrison@gmail.com>

38bce757

Diff

@@ -228,7 +228,7 @@ def toLieAlgebra [DecidableEq ι] (L' : Type w₁) [LieRing L'] [LieAlgebra R L'
         rw [← LinearMap.comp_apply, ← LinearMap.comp_apply]
         congr; clear x; ext j x; exact this j i x y
       intro i j y x
-      simp only [coe_toModule_eq_coe_toAddMonoid, toAddMonoid_of]
+      simp only [f', coe_toModule_eq_coe_toAddMonoid, toAddMonoid_of]
       -- And finish with trivial case analysis.
       obtain rfl | hij := Decidable.eq_or_ne i j
       · simp_rw [lie_of_same, toAddMonoid_of, LinearMap.toAddMonoidHom_coe, LieHom.coe_toLinearMap,

c0cc689b

chore: move to v4.6.0-rc1, merging adaptations from bump/v4.6.0 (#10176)

Co-authored-by: Scott Morrison <scott.morrison@gmail.com> Co-authored-by: Eric Wieser <wieser.eric@gmail.com> Co-authored-by: Joachim Breitner <mail@joachim-breitner.de>

490d2d48

Diff

@@ -170,7 +170,7 @@ def lieAlgebraOf [DecidableEq ι] (j : ι) : L j →ₗ⁅R⁆ ⨁ i, L i :=
         -- with `simp [of, singleAddHom]`
         simp only [of, singleAddHom, bracket_apply]
         erw [AddHom.coe_mk, single_apply, single_apply]
-        simp? [h] says simp only [h, dite_eq_ite, ite_true, single_apply]
+        simp? [h] says simp only [h, ↓reduceDite, single_apply]
         intros
         erw [single_add]
       · -- This used to be the end of the proof before leanprover/lean4#2644

c0cc689b

refactor: Use Pairwise wherever possible (#9236)

Performed with a regex search for ∀ (.) (.), \1 ≠ \2 →, and a few variants to catch implicit binders and explicit types.

I have deliberately avoided trying to make the analogous Set.Pairwise transformation (or any Pairwise (foo on bar) transformations) in this PR, to keep the diff small.

Co-authored-by: Yaël Dillies <yael.dillies@gmail.com>

86393c89

Diff

@@ -204,7 +204,7 @@ variable {R L ι}
 then this map is a morphism of Lie algebras. -/
 @[simps]
 def toLieAlgebra [DecidableEq ι] (L' : Type w₁) [LieRing L'] [LieAlgebra R L']
-    (f : ∀ i, L i →ₗ⁅R⁆ L') (hf : ∀ i j : ι, i ≠ j → ∀ (x : L i) (y : L j), ⁅f i x, f j y⁆ = 0) :
+    (f : ∀ i, L i →ₗ⁅R⁆ L') (hf : Pairwise fun i j => ∀ (x : L i) (y : L j), ⁅f i x, f j y⁆ = 0) :
     (⨁ i, L i) →ₗ⁅R⁆ L' :=
   { toModule R ι L' fun i => (f i : L i →ₗ[R] L') with
     toFun := toModule R ι L' fun i => (f i : L i →ₗ[R] L')
@@ -234,7 +234,7 @@ def toLieAlgebra [DecidableEq ι] (L' : Type w₁) [LieRing L'] [LieAlgebra R L'
       · simp_rw [lie_of_same, toAddMonoid_of, LinearMap.toAddMonoidHom_coe, LieHom.coe_toLinearMap,
           LieHom.map_lie]
       · simp_rw [lie_of_of_ne _ hij.symm, map_zero,  LinearMap.toAddMonoidHom_coe,
-          LieHom.coe_toLinearMap, hf j i hij.symm x y] }
+          LieHom.coe_toLinearMap, hf hij.symm x y] }
 #align direct_sum.to_lie_algebra DirectSum.toLieAlgebra
 
 end Algebras

c0cc689b

chore: Remove nonterminal simp at (#7795)

Removes nonterminal uses of simp at. Replaces most of these with instances of simp? ... says.

Co-authored-by: Scott Morrison <scott.morrison@gmail.com> Co-authored-by: Mario Carneiro <di.gama@gmail.com>

4160b2aa

Diff

@@ -170,7 +170,7 @@ def lieAlgebraOf [DecidableEq ι] (j : ι) : L j →ₗ⁅R⁆ ⨁ i, L i :=
         -- with `simp [of, singleAddHom]`
         simp only [of, singleAddHom, bracket_apply]
         erw [AddHom.coe_mk, single_apply, single_apply]
-        simp [h]
+        simp? [h] says simp only [h, dite_eq_ite, ite_true, single_apply]
         intros
         erw [single_add]
       · -- This used to be the end of the proof before leanprover/lean4#2644

c0cc689b

chore: bump to v4.3.0-rc2 (#8366)

PR contents

This is the supremum of

#8284
#8056
#8023
#8332
#8226 (already approved)
#7834 (already approved)

along with some minor fixes from failures on nightly-testing as Mathlib master is merged into it.

Note that some PRs for changes that are already compatible with the current toolchain and will be necessary have already been split out: #8380.

I am hopeful that in future we will be able to progressively merge adaptation PRs into a bump/v4.X.0 branch, so we never end up with a "big merge" like this. However one of these adaptation PRs (#8056) predates my new scheme for combined CI, and it wasn't possible to keep that PR viable in the meantime.

Lean PRs involved in this bump

In particular this includes adjustments for the Lean PRs

leanprover/lean4#2778

We can get rid of all the

local macro_rules | `($x ^ $y) => `(HPow.hPow $x $y) -- Porting note: See issue [lean4#2220](https://github.com/leanprover/lean4/pull/2220)

macros across Mathlib (and in any projects that want to write natural number powers of reals).

leanprover/lean4#2722

Changes the default behaviour of simp to (config := {decide := false}). This makes simp (and consequentially norm_num) less powerful, but also more consistent, and less likely to blow up in long failures. This requires a variety of changes: changing some previously by simp or norm_num to decide or rfl, or adding (config := {decide := true}).

leanprover/lean4#2783

This changed the behaviour of simp so that simp [f] will only unfold "fully applied" occurrences of f. The old behaviour can be recovered with simp (config := { unfoldPartialApp := true }). We may in future add a syntax for this, e.g. simp [!f]; please provide feedback! In the meantime, we have made the following changes:

switching to using explicit lemmas that have the intended level of application
(config := { unfoldPartialApp := true }) in some places, to recover the old behaviour
Using @[eqns] to manually adjust the equation lemmas for a particular definition, recovering the old behaviour just for that definition. See #8371, where we do this for Function.comp and Function.flip.

This change in Lean may require further changes down the line (e.g. adding the !f syntax, and/or upstreaming the special treatment for Function.comp and Function.flip, and/or removing this special treatment). Please keep an open and skeptical mind about these changes!

Co-authored-by: leanprover-community-mathlib4-bot <leanprover-community-mathlib4-bot@users.noreply.github.com> Co-authored-by: Scott Morrison <scott.morrison@gmail.com> Co-authored-by: Eric Wieser <wieser.eric@gmail.com> Co-authored-by: Mauricio Collares <mauricio@collares.org>

40b64f79

Diff

@@ -145,7 +145,7 @@ theorem lie_of [DecidableEq ι] {i j : ι} (x : L i) (y : L j) :
     ⁅of L i x, of L j y⁆ = if hij : i = j then of L i ⁅x, hij.symm.recOn y⁆ else 0 := by
   obtain rfl | hij := Decidable.eq_or_ne i j
   · simp only [lie_of_same L x y, dif_pos]
-  · simp only [lie_of_of_ne L hij x y, hij, dif_neg]
+  · simp only [lie_of_of_ne L hij x y, hij, dif_neg, dite_false]
 #align direct_sum.lie_of DirectSum.lie_of
 
 instance lieAlgebra : LieAlgebra R (⨁ i, L i) :=

c0cc689b

fix(Mathlib/Algebra/Lie/DirectSum): remove unused R argument from lemmas (#8388)

This made them not actually work as a simp lemma.

Also extracts a common result that can be used to prove single_add for DFinsupp and Finsupp, and a new Finsupp.single_mul lemma.

f5eb981b

Diff

@@ -126,6 +126,28 @@ theorem bracket_apply (x y : ⨁ i, L i) (i : ι) : ⁅x, y⁆ i = ⁅x i, y i
   zipWith_apply _ _ x y i
 #align direct_sum.bracket_apply DirectSum.bracket_apply
 
+theorem lie_of_same [DecidableEq ι] {i : ι} (x y : L i) :
+    ⁅of L i x, of L i y⁆ = of L i ⁅x, y⁆ :=
+  DFinsupp.zipWith_single_single _ _ _ _
+#align direct_sum.lie_of_of_eq DirectSum.lie_of_same
+
+theorem lie_of_of_ne [DecidableEq ι] {i j : ι} (hij : i ≠ j) (x : L i) (y : L j) :
+    ⁅of L i x, of L j y⁆ = 0 := by
+  refine DFinsupp.ext fun k => ?_
+  rw [bracket_apply]
+  obtain rfl | hik := Decidable.eq_or_ne i k
+  · rw [of_eq_of_ne _ _ _ _ hij.symm, lie_zero, zero_apply]
+  · rw [of_eq_of_ne _ _ _ _ hik, zero_lie, zero_apply]
+#align direct_sum.lie_of_of_ne DirectSum.lie_of_of_ne
+
+@[simp]
+theorem lie_of [DecidableEq ι] {i j : ι} (x : L i) (y : L j) :
+    ⁅of L i x, of L j y⁆ = if hij : i = j then of L i ⁅x, hij.symm.recOn y⁆ else 0 := by
+  obtain rfl | hij := Decidable.eq_or_ne i j
+  · simp only [lie_of_same L x y, dif_pos]
+  · simp only [lie_of_of_ne L hij x y, hij, dif_neg]
+#align direct_sum.lie_of DirectSum.lie_of
+
 instance lieAlgebra : LieAlgebra R (⨁ i, L i) :=
   { (inferInstance : Module R _) with
     lie_smul := fun c x y => by
@@ -174,37 +196,6 @@ theorem lieAlgebra_ext {x y : ⨁ i, L i}
   DFinsupp.ext h
 #align direct_sum.lie_algebra_ext DirectSum.lieAlgebra_ext
 
-theorem lie_of_of_ne [DecidableEq ι] {i j : ι} (hij : j ≠ i) (x : L i) (y : L j) :
-    ⁅of L i x, of L j y⁆ = 0 := by
-  apply lieAlgebra_ext R ι L; intro k
-  rw [LieHom.map_lie]
-  simp only [of, singleAddHom, AddMonoidHom.coe_mk, ZeroHom.coe_mk, lieAlgebraComponent_apply,
-    component, lapply, LinearMap.coe_mk, AddHom.coe_mk, single_apply, LieHom.map_zero]
-  -- The next four lines were not needed before leanprover/lean4#2644
-  erw [AddMonoidHom.coe_mk, AddHom.coe_mk, ZeroHom.coe_mk]
-  rotate_left
-  intros; erw [single_add]
-  erw [single_apply, single_apply]
-  by_cases hik : i = k
-  · simp only [dif_neg, not_false_iff, lie_zero, hik.symm, hij]
-  · simp only [dif_neg, not_false_iff, zero_lie, hik]
-#align direct_sum.lie_of_of_ne DirectSum.lie_of_of_ne
-
-theorem lie_of_of_eq [DecidableEq ι] {i j : ι} (hij : j = i) (x : L i) (y : L j) :
-    ⁅of L i x, of L j y⁆ = of L i ⁅x, hij.recOn y⁆ := by
-  have : of L j y = of L i (hij.recOn y) := Eq.rec (Eq.refl _) hij
-  rw [this, ← lieAlgebraOf_apply R ι L i ⁅x, hij.recOn y⁆, LieHom.map_lie, lieAlgebraOf_apply,
-    lieAlgebraOf_apply]
-#align direct_sum.lie_of_of_eq DirectSum.lie_of_of_eq
-
-@[simp]
-theorem lie_of [DecidableEq ι] {i j : ι} (x : L i) (y : L j) :
-    ⁅of L i x, of L j y⁆ = if hij : j = i then lieAlgebraOf R ι L i ⁅x, hij.recOn y⁆ else 0 := by
-  by_cases hij : j = i
-  · simp only [lie_of_of_eq R ι L hij x y, hij, dif_pos, not_false_iff, lieAlgebraOf_apply]
-  · simp only [lie_of_of_ne R ι L hij x y, hij, dif_neg, not_false_iff]
-#align direct_sum.lie_of DirectSum.lie_of
-
 variable {R L ι}
 
 /-- Given a family of Lie algebras `L i`, together with a family of morphisms of Lie algebras
@@ -236,16 +227,14 @@ def toLieAlgebra [DecidableEq ι] (L' : Type w₁) [LieRing L'] [LieAlgebra R L'
         simp only [LinearMap.map_neg, neg_inj, ← LieAlgebra.ad_apply R]
         rw [← LinearMap.comp_apply, ← LinearMap.comp_apply]
         congr; clear x; ext j x; exact this j i x y
-      -- Tidy up and use `lie_of`.
       intro i j y x
-      simp only [lie_of R, lieAlgebraOf_apply, LieHom.coe_toLinearMap, toAddMonoid_of,
-        coe_toModule_eq_coe_toAddMonoid, LinearMap.toAddMonoidHom_coe]
+      simp only [coe_toModule_eq_coe_toAddMonoid, toAddMonoid_of]
       -- And finish with trivial case analysis.
-      rcases eq_or_ne i j with (h | h)
-      · have h' : f j (h.recOn y) = f i y := Eq.rec (Eq.refl _) h
-        simp only [h, h', LieHom.coe_toLinearMap, dif_pos, LieHom.map_lie, toAddMonoid_of,
-          LinearMap.toAddMonoidHom_coe]
-      · simp only [h, hf j i h.symm x y, dif_neg, not_false_iff, AddMonoidHom.map_zero] }
+      obtain rfl | hij := Decidable.eq_or_ne i j
+      · simp_rw [lie_of_same, toAddMonoid_of, LinearMap.toAddMonoidHom_coe, LieHom.coe_toLinearMap,
+          LieHom.map_lie]
+      · simp_rw [lie_of_of_ne _ hij.symm, map_zero,  LinearMap.toAddMonoidHom_coe,
+          LieHom.coe_toLinearMap, hf j i hij.symm x y] }
 #align direct_sum.to_lie_algebra DirectSum.toLieAlgebra
 
 end Algebras

c0cc689b

Revert "chore: revert #7703 (#7710)"

This reverts commit f3695eb2.

ab56fa28

Diff

@@ -79,7 +79,11 @@ def lieModuleOf [DecidableEq ι] (j : ι) : M j →ₗ⁅R,L⁆ ⨁ i, M i :=
       refine' DFinsupp.ext fun i => _ -- Porting note: Originally `ext i`
       by_cases h : j = i
       · rw [← h]; simp
-      · simp [lof, lsingle, h] }
+      · -- This used to be the end of the proof before leanprover/lean4#2644
+        -- old proof `simp [lof, lsingle, h]`
+        simp only [lof, lsingle, AddHom.toFun_eq_coe, lie_module_bracket_apply]
+        erw [AddHom.coe_mk]
+        simp [h] }
 #align direct_sum.lie_module_of DirectSum.lieModuleOf
 
 /-- The projection map onto one component, as a morphism of Lie modules. -/
@@ -139,8 +143,21 @@ def lieAlgebraOf [DecidableEq ι] (j : ι) : L j →ₗ⁅R⁆ ⨁ i, L i :=
     map_lie' := fun {x y} => by
       refine' DFinsupp.ext fun i => _ -- Porting note: Originally `ext i`
       by_cases h : j = i
-      · rw [← h]; simp [of, singleAddHom]
-      · simp [of, singleAddHom, h] }
+      · rw [← h]
+        -- This used to be the end of the proof before leanprover/lean4#2644
+        -- with `simp [of, singleAddHom]`
+        simp only [of, singleAddHom, bracket_apply]
+        erw [AddHom.coe_mk, single_apply, single_apply]
+        simp [h]
+        intros
+        erw [single_add]
+      · -- This used to be the end of the proof before leanprover/lean4#2644
+        -- with `simp [of, singleAddHom]`
+        simp only [of, singleAddHom, bracket_apply]
+        erw [AddHom.coe_mk, single_apply, single_apply]
+        simp only [h, dite_false, single_apply, lie_self]
+        intros
+        erw [single_add] }
 #align direct_sum.lie_algebra_of DirectSum.lieAlgebraOf
 
 /-- The projection map onto one component, as a morphism of Lie algebras. -/
@@ -163,6 +180,11 @@ theorem lie_of_of_ne [DecidableEq ι] {i j : ι} (hij : j ≠ i) (x : L i) (y :
   rw [LieHom.map_lie]
   simp only [of, singleAddHom, AddMonoidHom.coe_mk, ZeroHom.coe_mk, lieAlgebraComponent_apply,
     component, lapply, LinearMap.coe_mk, AddHom.coe_mk, single_apply, LieHom.map_zero]
+  -- The next four lines were not needed before leanprover/lean4#2644
+  erw [AddMonoidHom.coe_mk, AddHom.coe_mk, ZeroHom.coe_mk]
+  rotate_left
+  intros; erw [single_add]
+  erw [single_apply, single_apply]
   by_cases hik : i = k
   · simp only [dif_neg, not_false_iff, lie_zero, hik.symm, hij]
   · simp only [dif_neg, not_false_iff, zero_lie, hik]

c0cc689b

chore: revert #7703 (#7710)

This reverts commit 26eb2b0a.

f3695eb2

Diff

@@ -79,11 +79,7 @@ def lieModuleOf [DecidableEq ι] (j : ι) : M j →ₗ⁅R,L⁆ ⨁ i, M i :=
       refine' DFinsupp.ext fun i => _ -- Porting note: Originally `ext i`
       by_cases h : j = i
       · rw [← h]; simp
-      · -- This used to be the end of the proof before leanprover/lean4#2644
-        -- old proof `simp [lof, lsingle, h]`
-        simp only [lof, lsingle, AddHom.toFun_eq_coe, lie_module_bracket_apply]
-        erw [AddHom.coe_mk]
-        simp [h] }
+      · simp [lof, lsingle, h] }
 #align direct_sum.lie_module_of DirectSum.lieModuleOf
 
 /-- The projection map onto one component, as a morphism of Lie modules. -/
@@ -143,21 +139,8 @@ def lieAlgebraOf [DecidableEq ι] (j : ι) : L j →ₗ⁅R⁆ ⨁ i, L i :=
     map_lie' := fun {x y} => by
       refine' DFinsupp.ext fun i => _ -- Porting note: Originally `ext i`
       by_cases h : j = i
-      · rw [← h]
-        -- This used to be the end of the proof before leanprover/lean4#2644
-        -- with `simp [of, singleAddHom]`
-        simp only [of, singleAddHom, bracket_apply]
-        erw [AddHom.coe_mk, single_apply, single_apply]
-        simp [h]
-        intros
-        erw [single_add]
-      · -- This used to be the end of the proof before leanprover/lean4#2644
-        -- with `simp [of, singleAddHom]`
-        simp only [of, singleAddHom, bracket_apply]
-        erw [AddHom.coe_mk, single_apply, single_apply]
-        simp only [h, dite_false, single_apply, lie_self]
-        intros
-        erw [single_add] }
+      · rw [← h]; simp [of, singleAddHom]
+      · simp [of, singleAddHom, h] }
 #align direct_sum.lie_algebra_of DirectSum.lieAlgebraOf
 
 /-- The projection map onto one component, as a morphism of Lie algebras. -/
@@ -180,11 +163,6 @@ theorem lie_of_of_ne [DecidableEq ι] {i j : ι} (hij : j ≠ i) (x : L i) (y :
   rw [LieHom.map_lie]
   simp only [of, singleAddHom, AddMonoidHom.coe_mk, ZeroHom.coe_mk, lieAlgebraComponent_apply,
     component, lapply, LinearMap.coe_mk, AddHom.coe_mk, single_apply, LieHom.map_zero]
-  -- The next four lines were not needed before leanprover/lean4#2644
-  erw [AddMonoidHom.coe_mk, AddHom.coe_mk, ZeroHom.coe_mk]
-  rotate_left
-  intros; erw [single_add]
-  erw [single_apply, single_apply]
   by_cases hik : i = k
   · simp only [dif_neg, not_false_iff, lie_zero, hik.symm, hij]
   · simp only [dif_neg, not_false_iff, zero_lie, hik]

c0cc689b

chore: bump toolchain to v4.2.0-rc2 (#7703)

This includes all the changes from #7606.

Co-authored-by: Scott Morrison <scott.morrison@gmail.com>

26eb2b0a

Diff

@@ -79,7 +79,11 @@ def lieModuleOf [DecidableEq ι] (j : ι) : M j →ₗ⁅R,L⁆ ⨁ i, M i :=
       refine' DFinsupp.ext fun i => _ -- Porting note: Originally `ext i`
       by_cases h : j = i
       · rw [← h]; simp
-      · simp [lof, lsingle, h] }
+      · -- This used to be the end of the proof before leanprover/lean4#2644
+        -- old proof `simp [lof, lsingle, h]`
+        simp only [lof, lsingle, AddHom.toFun_eq_coe, lie_module_bracket_apply]
+        erw [AddHom.coe_mk]
+        simp [h] }
 #align direct_sum.lie_module_of DirectSum.lieModuleOf
 
 /-- The projection map onto one component, as a morphism of Lie modules. -/
@@ -139,8 +143,21 @@ def lieAlgebraOf [DecidableEq ι] (j : ι) : L j →ₗ⁅R⁆ ⨁ i, L i :=
     map_lie' := fun {x y} => by
       refine' DFinsupp.ext fun i => _ -- Porting note: Originally `ext i`
       by_cases h : j = i
-      · rw [← h]; simp [of, singleAddHom]
-      · simp [of, singleAddHom, h] }
+      · rw [← h]
+        -- This used to be the end of the proof before leanprover/lean4#2644
+        -- with `simp [of, singleAddHom]`
+        simp only [of, singleAddHom, bracket_apply]
+        erw [AddHom.coe_mk, single_apply, single_apply]
+        simp [h]
+        intros
+        erw [single_add]
+      · -- This used to be the end of the proof before leanprover/lean4#2644
+        -- with `simp [of, singleAddHom]`
+        simp only [of, singleAddHom, bracket_apply]
+        erw [AddHom.coe_mk, single_apply, single_apply]
+        simp only [h, dite_false, single_apply, lie_self]
+        intros
+        erw [single_add] }
 #align direct_sum.lie_algebra_of DirectSum.lieAlgebraOf
 
 /-- The projection map onto one component, as a morphism of Lie algebras. -/
@@ -163,6 +180,11 @@ theorem lie_of_of_ne [DecidableEq ι] {i j : ι} (hij : j ≠ i) (x : L i) (y :
   rw [LieHom.map_lie]
   simp only [of, singleAddHom, AddMonoidHom.coe_mk, ZeroHom.coe_mk, lieAlgebraComponent_apply,
     component, lapply, LinearMap.coe_mk, AddHom.coe_mk, single_apply, LieHom.map_zero]
+  -- The next four lines were not needed before leanprover/lean4#2644
+  erw [AddMonoidHom.coe_mk, AddHom.coe_mk, ZeroHom.coe_mk]
+  rotate_left
+  intros; erw [single_add]
+  erw [single_apply, single_apply]
   by_cases hik : i = k
   · simp only [dif_neg, not_false_iff, lie_zero, hik.symm, hij]
   · simp only [dif_neg, not_false_iff, zero_lie, hik]

c0cc689b

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,17 +2,14 @@
 Copyright (c) 2020 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.direct_sum
-! leanprover-community/mathlib commit c0cc689babd41c0e9d5f02429211ffbe2403472a
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathlib.Algebra.DirectSum.Module
 import Mathlib.Algebra.Lie.OfAssociative
 import Mathlib.Algebra.Lie.Submodule
 import Mathlib.Algebra.Lie.Basic
 
+#align_import algebra.lie.direct_sum from "leanprover-community/mathlib"@"c0cc689babd41c0e9d5f02429211ffbe2403472a"
+
 /-!
 # Direct sums of Lie algebras and Lie modules

c0cc689b

chore: rename Dfinsupp to DFinsupp (#5822)

See #4354

268b7d43

Diff

@@ -28,7 +28,7 @@ universe u v w w₁
 
 namespace DirectSum
 
-open Dfinsupp
+open DFinsupp
 
 open scoped DirectSum
 
@@ -51,13 +51,13 @@ variable [∀ i, LieRingModule L (M i)] [∀ i, LieModule R L (M i)]
 instance : LieRingModule L (⨁ i, M i) where
   bracket x m := m.mapRange (fun i m' => ⁅x, m'⁆) fun i => lie_zero x
   add_lie x y m := by
-    refine' Dfinsupp.ext fun _ => _ -- Porting note: Originally `ext`
+    refine' DFinsupp.ext fun _ => _ -- Porting note: Originally `ext`
     simp only [mapRange_apply, add_apply, add_lie]
   lie_add x m n := by
-    refine' Dfinsupp.ext fun _ => _ -- Porting note: Originally `ext`
+    refine' DFinsupp.ext fun _ => _ -- Porting note: Originally `ext`
     simp only [mapRange_apply, add_apply, lie_add]
   leibniz_lie x y m := by
-    refine' Dfinsupp.ext fun _ => _ -- Porting note: Originally `ext`
+    refine' DFinsupp.ext fun _ => _ -- Porting note: Originally `ext`
     simp only [mapRange_apply, lie_lie, add_apply, sub_add_cancel]
 
 @[simp]
@@ -67,10 +67,10 @@ theorem lie_module_bracket_apply (x : L) (m : ⨁ i, M i) (i : ι) : ⁅x, m⁆
 
 instance : LieModule R L (⨁ i, M i) where
   smul_lie t x m := by
-    refine' Dfinsupp.ext fun _ => _ -- Porting note: Originally `ext i`
+    refine' DFinsupp.ext fun _ => _ -- Porting note: Originally `ext i`
     simp only [smul_lie, lie_module_bracket_apply, smul_apply]
   lie_smul t x m := by
-    refine' Dfinsupp.ext fun _ => _ -- Porting note: Originally `ext i`
+    refine' DFinsupp.ext fun _ => _ -- Porting note: Originally `ext i`
     simp only [lie_smul, lie_module_bracket_apply, smul_apply]
 
 variable (R ι L M)
@@ -79,7 +79,7 @@ variable (R ι L M)
 def lieModuleOf [DecidableEq ι] (j : ι) : M j →ₗ⁅R,L⁆ ⨁ i, M i :=
   { lof R ι M j with
     map_lie' := fun {x m} => by
-      refine' Dfinsupp.ext fun i => _ -- Porting note: Originally `ext i`
+      refine' DFinsupp.ext fun i => _ -- Porting note: Originally `ext i`
       by_cases h : j = i
       · rw [← h]; simp
       · simp [lof, lsingle, h] }
@@ -106,16 +106,16 @@ instance lieRing : LieRing (⨁ i, L i) :=
   { (inferInstance : AddCommGroup _) with
     bracket := zipWith (fun i => fun x y => ⁅x, y⁆) fun i => lie_zero 0
     add_lie := fun x y z => by
-      refine' Dfinsupp.ext fun _ => _ -- Porting note: Originally `ext`
+      refine' DFinsupp.ext fun _ => _ -- Porting note: Originally `ext`
       simp only [zipWith_apply, add_apply, add_lie]
     lie_add := fun x y z => by
-      refine' Dfinsupp.ext fun _ => _ -- Porting note: Originally `ext`
+      refine' DFinsupp.ext fun _ => _ -- Porting note: Originally `ext`
       simp only [zipWith_apply, add_apply, lie_add]
     lie_self := fun x => by
-      refine' Dfinsupp.ext fun _ => _ -- Porting note: Originally `ext`
+      refine' DFinsupp.ext fun _ => _ -- Porting note: Originally `ext`
       simp only [zipWith_apply, add_apply, lie_self, zero_apply]
     leibniz_lie := fun x y z => by
-      refine' Dfinsupp.ext fun _ => _ -- Porting note: Originally `ext`
+      refine' DFinsupp.ext fun _ => _ -- Porting note: Originally `ext`
       simp only [sub_apply, zipWith_apply, add_apply, zero_apply]
       apply leibniz_lie }
 #align direct_sum.lie_ring DirectSum.lieRing
@@ -128,7 +128,7 @@ theorem bracket_apply (x y : ⨁ i, L i) (i : ι) : ⁅x, y⁆ i = ⁅x i, y i
 instance lieAlgebra : LieAlgebra R (⨁ i, L i) :=
   { (inferInstance : Module R _) with
     lie_smul := fun c x y => by
-      refine' Dfinsupp.ext fun _ => _ -- Porting note: Originally `ext`
+      refine' DFinsupp.ext fun _ => _ -- Porting note: Originally `ext`
       simp only [zipWith_apply, smul_apply, bracket_apply, lie_smul] }
 #align direct_sum.lie_algebra DirectSum.lieAlgebra
 
@@ -140,7 +140,7 @@ def lieAlgebraOf [DecidableEq ι] (j : ι) : L j →ₗ⁅R⁆ ⨁ i, L i :=
   { lof R ι L j with
     toFun := of L j
     map_lie' := fun {x y} => by
-      refine' Dfinsupp.ext fun i => _ -- Porting note: Originally `ext i`
+      refine' DFinsupp.ext fun i => _ -- Porting note: Originally `ext i`
       by_cases h : j = i
       · rw [← h]; simp [of, singleAddHom]
       · simp [of, singleAddHom, h] }
@@ -157,7 +157,7 @@ def lieAlgebraComponent (j : ι) : (⨁ i, L i) →ₗ⁅R⁆ L j :=
 @[ext]
 theorem lieAlgebra_ext {x y : ⨁ i, L i}
     (h : ∀ i, lieAlgebraComponent R ι L i x = lieAlgebraComponent R ι L i y) : x = y :=
-  Dfinsupp.ext h
+  DFinsupp.ext h
 #align direct_sum.lie_algebra_ext DirectSum.lieAlgebra_ext
 
 theorem lie_of_of_ne [DecidableEq ι] {i j : ι} (hij : j ≠ i) (x : L i) (y : L j) :

c0cc689b

chore: remove superfluous parentheses in calls to ext (#5258)

Co-authored-by: Xavier Roblot <46200072+xroblot@users.noreply.github.com> Co-authored-by: Joël Riou <joel.riou@universite-paris-saclay.fr> Co-authored-by: Riccardo Brasca <riccardo.brasca@gmail.com> Co-authored-by: Yury G. Kudryashov <urkud@urkud.name> Co-authored-by: Scott Morrison <scott.morrison@anu.edu.au> Co-authored-by: Scott Morrison <scott.morrison@gmail.com> Co-authored-by: Jeremy Tan Jie Rui <reddeloostw@gmail.com> Co-authored-by: Pol'tta / Miyahara Kō <pol_tta@outlook.jp> Co-authored-by: Jason Yuen <jason_yuen2007@hotmail.com> Co-authored-by: Mario Carneiro <di.gama@gmail.com> Co-authored-by: Jireh Loreaux <loreaujy@gmail.com> Co-authored-by: Ruben Van de Velde <65514131+Ruben-VandeVelde@users.noreply.github.com> Co-authored-by: Kyle Miller <kmill31415@gmail.com> Co-authored-by: Heather Macbeth <25316162+hrmacbeth@users.noreply.github.com> Co-authored-by: Jujian Zhang <jujian.zhang1998@outlook.com> Co-authored-by: Yaël Dillies <yael.dillies@gmail.com>

3d6731dc

Diff

@@ -207,7 +207,7 @@ def toLieAlgebra [DecidableEq ι] (L' : Type w₁) [LieRing L'] [LieAlgebra R L'
             ⁅toModule R ι L' f' x, toModule R ι L' f' (of L i y)⁆ by
         simp only [← LieAlgebra.ad_apply R]
         rw [← LinearMap.comp_apply, ← LinearMap.comp_apply]
-        congr; clear y; ext (i y); exact this i y
+        congr; clear y; ext i y; exact this i y
       -- Similarly, we can reduce to the case that `x` has only one non-zero component.
       suffices ∀ (i j) (y : L i) (x : L j),
           toModule R ι L' f' ⁅of L j x, of L i y⁆ =
@@ -216,7 +216,7 @@ def toLieAlgebra [DecidableEq ι] (L' : Type w₁) [LieRing L'] [LieAlgebra R L'
         rw [← lie_skew x, ← lie_skew (toModule R ι L' f' x)]
         simp only [LinearMap.map_neg, neg_inj, ← LieAlgebra.ad_apply R]
         rw [← LinearMap.comp_apply, ← LinearMap.comp_apply]
-        congr; clear x; ext (j x); exact this j i x y
+        congr; clear x; ext j x; exact this j i x y
       -- Tidy up and use `lie_of`.
       intro i j y x
       simp only [lie_of R, lieAlgebraOf_apply, LieHom.coe_toLinearMap, toAddMonoid_of,

c0cc689b

feat: port Algebra.Lie.DirectSum (#4684)

d7599344

`algebra.lie.direct_sum` ⟷ `Mathlib.Algebra.Lie.DirectSum`

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

PR contents

Lean PRs involved in this bump

leanprover/lean4#2778

leanprover/lean4#2722

leanprover/lean4#2783

Dependencies 8 + 472

algebra.lie.direct_sum ⟷ Mathlib.Algebra.Lie.DirectSum

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

PR contents

Lean PRs involved in this bump

leanprover/lean4#2778

leanprover/lean4#2722

leanprover/lean4#2783

Dependencies 8 + 472

`algebra.lie.direct_sum` ⟷ `Mathlib.Algebra.Lie.DirectSum`