linear_algebra.free_module.strong_rank_condition

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

f37e88f3

(last sync)

Changes in mathlib3port

mathlib3

mathlib3port

61db041a

bump to nightly-2024-03-17-08

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

22f01ce4

Diff

@@ -61,7 +61,7 @@ instance (priority := 100) commRing_strongRankCondition : StrongRankCondition R
     -- Evaluate `(minpoly R g) g` at the vector `(0,...,0,1)`
     have heval := LinearMap.congr_fun (minpoly.aeval R g) (Pi.single (Fin.last n) 1)
     obtain ⟨P, hP⟩ := X_dvd_iff.2 (erase_same (minpoly R g) 0)
-    rw [← monomial_add_erase (minpoly R g) 0, hP] at heval 
+    rw [← monomial_add_erase (minpoly R g) 0, hP] at heval
     replace heval := congr_fun heval (Fin.last n)
     simpa [hnex] using heval
   contradiction

61db041a

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) 2021 Riccardo Brasca. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Riccardo Brasca
 -/
-import Mathbin.LinearAlgebra.Charpoly.Basic
-import Mathbin.LinearAlgebra.InvariantBasisNumber
+import LinearAlgebra.Charpoly.Basic
+import LinearAlgebra.InvariantBasisNumber
 
 #align_import linear_algebra.free_module.strong_rank_condition from "leanprover-community/mathlib"@"61db041ab8e4aaf8cb5c7dc10a7d4ff261997536"

61db041a

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) 2021 Riccardo Brasca. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Riccardo Brasca
-
-! This file was ported from Lean 3 source module linear_algebra.free_module.strong_rank_condition
-! leanprover-community/mathlib commit 61db041ab8e4aaf8cb5c7dc10a7d4ff261997536
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathbin.LinearAlgebra.Charpoly.Basic
 import Mathbin.LinearAlgebra.InvariantBasisNumber
 
+#align_import linear_algebra.free_module.strong_rank_condition from "leanprover-community/mathlib"@"61db041ab8e4aaf8cb5c7dc10a7d4ff261997536"
+
 /-!
 
 # Strong rank condition for commutative rings

61db041a

bump to nightly-2023-06-01-16

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

b9c87c70

Diff

@@ -64,7 +64,7 @@ instance (priority := 100) commRing_strongRankCondition : StrongRankCondition R
     -- Evaluate `(minpoly R g) g` at the vector `(0,...,0,1)`
     have heval := LinearMap.congr_fun (minpoly.aeval R g) (Pi.single (Fin.last n) 1)
     obtain ⟨P, hP⟩ := X_dvd_iff.2 (erase_same (minpoly R g) 0)
-    rw [← monomial_add_erase (minpoly R g) 0, hP] at heval
+    rw [← monomial_add_erase (minpoly R g) 0, hP] at heval 
     replace heval := congr_fun heval (Fin.last n)
     simpa [hnex] using heval
   contradiction

61db041a

bump to nightly-2023-05-28-04

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

6797a637

Diff

@@ -49,8 +49,7 @@ instance (priority := 100) commRing_strongRankCondition : StrongRankCondition R
   by
   suffices ∀ n, ∀ f : (Fin (n + 1) → R) →ₗ[R] Fin n → R, ¬injective f by
     rwa [strongRankCondition_iff_succ R]
-  intro n f
-  by_contra hf
+  intro n f; by_contra hf
   -- Lean is unable to find these instances without help, either via this `letI`, or via duplicate
   -- instances with unecessarily strong typeclasses on `R` and `M`.
   letI : Module.Finite R (Fin n.succ → R) := Module.Finite.pi

61db041a

bump to nightly-2023-05-25-04

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

2175c3c2

Diff

@@ -4,7 +4,7 @@ Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Riccardo Brasca
 
 ! This file was ported from Lean 3 source module linear_algebra.free_module.strong_rank_condition
-! leanprover-community/mathlib commit f37e88f3ec14ee5eab18a9330ace717740e9c92c
+! leanprover-community/mathlib commit 61db041ab8e4aaf8cb5c7dc10a7d4ff261997536
 ! 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.InvariantBasisNumber
 
 # Strong rank condition for commutative rings
 
+> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
+> Any changes to this file require a corresponding PR to mathlib4.
+
 We prove that any nontrivial commutative ring satisfies `strong_rank_condition`, meaning that
 if there is an injective linear map `(fin n → R) →ₗ[R] fin m → R`, then `n ≤ m`. This implies that
 any commutative ring satisfies `invariant_basis_number`: the rank of a finitely generated free

f37e88f3

bump to nightly-2023-05-23-12

mathlib commit https://github.com/leanprover-community/mathlib/commit/75e7fca56381d056096ce5d05e938f63a6567828

52e3d5e8

Diff

@@ -40,6 +40,7 @@ variable (R : Type _) [CommRing R] [Nontrivial R]
 
 open Polynomial Function Fin LinearMap
 
+#print commRing_strongRankCondition /-
 /-- Any commutative ring satisfies the `strong_rank_condition`. -/
 instance (priority := 100) commRing_strongRankCondition : StrongRankCondition R :=
   by
@@ -66,4 +67,5 @@ instance (priority := 100) commRing_strongRankCondition : StrongRankCondition R
     simpa [hnex] using heval
   contradiction
 #align comm_ring_strong_rank_condition commRing_strongRankCondition
+-/

f37e88f3

bump to nightly-2023-02-21-16

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

1107b979

Changes in mathlib4

mathlib3

mathlib4

f37e88f3

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

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

38bce757

Diff

@@ -59,6 +59,6 @@ instance (priority := 100) commRing_strongRankCondition : StrongRankCondition R
     rw [← monomial_add_erase (minpoly R g) 0, hP] at heval
     replace heval := congr_fun heval (Fin.last n)
     -- Porting note: ...it's just that this line gives a timeout without slightly raising heartbeats
-    simpa [hnex] using heval
+    simpa [g, hnex] using heval
   contradiction
 #align comm_ring_strong_rank_condition commRing_strongRankCondition

f37e88f3

chore: update/remove heart beat bumps (#6860)

We clean up heart beat bumps after #6474.

c95f05bd

Diff

@@ -37,8 +37,6 @@ variable (R : Type*) [CommRing R] [Nontrivial R]
 
 open Polynomial Function Fin LinearMap
 
-set_option maxHeartbeats 250000 in
-set_option synthInstance.maxHeartbeats 25000 in
 /-- Any commutative ring satisfies the `StrongRankCondition`. -/
 instance (priority := 100) commRing_strongRankCondition : StrongRankCondition R := by
   suffices ∀ n, ∀ f : (Fin (n + 1) → R) →ₗ[R] Fin n → R, ¬Injective f by

f37e88f3

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

@@ -33,7 +33,7 @@ vector `(0,...,0,1)` gives `a₀`, contradiction.
 -/
 
 
-variable (R : Type _) [CommRing R] [Nontrivial R]
+variable (R : Type*) [CommRing R] [Nontrivial R]
 
 open Polynomial Function Fin LinearMap

f37e88f3

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) 2021 Riccardo Brasca. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Riccardo Brasca
-
-! This file was ported from Lean 3 source module linear_algebra.free_module.strong_rank_condition
-! leanprover-community/mathlib commit f37e88f3ec14ee5eab18a9330ace717740e9c92c
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathlib.LinearAlgebra.Charpoly.Basic
 import Mathlib.LinearAlgebra.InvariantBasisNumber
 
+#align_import linear_algebra.free_module.strong_rank_condition from "leanprover-community/mathlib"@"f37e88f3ec14ee5eab18a9330ace717740e9c92c"
+
 /-!
 
 # Strong rank condition for commutative rings

f37e88f3

chore: bump to nightly-2023-07-01 (#5409)

depends on: https://github.com/leanprover/std4/pull/163
depends on: #5584
depends on: #5715
depends on: #5729
depends on: https://github.com/leanprover/std4/pull/173

Co-authored-by: Komyyy <pol_tta@outlook.jp> Co-authored-by: Scott Morrison <scott.morrison@gmail.com> Co-authored-by: Scott Morrison <scott.morrison@anu.edu.au> Co-authored-by: Ruben Van de Velde <65514131+Ruben-VandeVelde@users.noreply.github.com> Co-authored-by: Mario Carneiro <di.gama@gmail.com>

906f7221

Diff

@@ -51,10 +51,10 @@ instance (priority := 100) commRing_strongRankCondition : StrongRankCondition R
   -- Porting note: Lean can now find these instances without help...
   -- letI : Module.Finite R (Fin n.succ → R) := Module.Finite.pi
   -- letI : Module.Free R (Fin n.succ → R) := Module.Free.pi _ _
-  let g : (Fin (n + 1) → R) →ₗ[R] Fin (n + 1) → R := (ExtendByZero.linearMap R castSuccEmb).comp f
-  have hg : Injective g := (extend_injective (RelEmbedding.injective castSuccEmb) _).comp hf
-  have hnex : ¬∃ i : Fin n, castSuccEmb i = last n :=
-    fun ⟨i, hi⟩ => ne_of_lt (castSuccEmb_lt_last i) hi
+  let g : (Fin (n + 1) → R) →ₗ[R] Fin (n + 1) → R := (ExtendByZero.linearMap R castSucc).comp f
+  have hg : Injective g := (extend_injective Fin.strictMono_castSucc.injective _).comp hf
+  have hnex : ¬∃ i : Fin n, castSucc i = last n :=
+    fun ⟨i, hi⟩ => ne_of_lt (castSucc_lt_last i) hi
   let a₀ := (minpoly R g).coeff 0
   have : a₀ ≠ 0 := minpoly_coeff_zero_of_injective hg
   have : a₀ = 0 := by

f37e88f3

chore: rename Fin.castSucc to Fin.castSuccEmb (#5729)

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

f4e42872

Diff

@@ -51,9 +51,10 @@ instance (priority := 100) commRing_strongRankCondition : StrongRankCondition R
   -- Porting note: Lean can now find these instances without help...
   -- letI : Module.Finite R (Fin n.succ → R) := Module.Finite.pi
   -- letI : Module.Free R (Fin n.succ → R) := Module.Free.pi _ _
-  let g : (Fin (n + 1) → R) →ₗ[R] Fin (n + 1) → R := (ExtendByZero.linearMap R castSucc).comp f
-  have hg : Injective g := (extend_injective (RelEmbedding.injective castSucc) _).comp hf
-  have hnex : ¬∃ i : Fin n, castSucc i = last n := fun ⟨i, hi⟩ => ne_of_lt (castSucc_lt_last i) hi
+  let g : (Fin (n + 1) → R) →ₗ[R] Fin (n + 1) → R := (ExtendByZero.linearMap R castSuccEmb).comp f
+  have hg : Injective g := (extend_injective (RelEmbedding.injective castSuccEmb) _).comp hf
+  have hnex : ¬∃ i : Fin n, castSuccEmb i = last n :=
+    fun ⟨i, hi⟩ => ne_of_lt (castSuccEmb_lt_last i) hi
   let a₀ := (minpoly R g).coeff 0
   have : a₀ ≠ 0 := minpoly_coeff_zero_of_injective hg
   have : a₀ = 0 := by

f37e88f3

feat: port LinearAlgebra.FreeModule.StrongRankCondition (#4262)

bcdaa34a

`linear_algebra.free_module.strong_rank_condition` ⟷ `Mathlib.LinearAlgebra.FreeModule.StrongRankCondition`

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 10 + 631

linear_algebra.free_module.strong_rank_condition ⟷ Mathlib.LinearAlgebra.FreeModule.StrongRankCondition

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 10 + 631

`linear_algebra.free_module.strong_rank_condition` ⟷ `Mathlib.LinearAlgebra.FreeModule.StrongRankCondition`