/-
Copyright 2025 The Formal Conjectures Authors.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
-/
module
public import FormalConjecturesUtilKöthe conjecture
Reference: Wikipedia
@[expose] public sectionopen Ideal TwoSidedIdeal Polynomialopen Matrixuniverse u v wvariable {R : Type*}variable [Ring R]namespace Koethe
Say a subset I of a ring R is nilpotent if all its elements are nilpotent.
def IsNil {S : Type*} [SetLike S R] (I : S) := ∀ i ∈ I, IsNilpotent i-- TODO(lezeau): add some basic API and already known results for nil ideals
variable (R) in
The Kothe Radical of a ring R is the sum of all (two-sided) nil ideals of R.
Tags: Kothe Radical, upper nilradical
def KotheRadical : TwoSidedIdeal R := sSup {I : TwoSidedIdeal R | IsNil I}-- This is often denoted `Nil*(R)`
local notation "Nil* " R => KotheRadical RA subset of a nil subset is nil.
@[category API, AMS 16]
theorem IsNil.mono {S : Type*} [SetLike S R] {I J : S} (h : (I : Set R) ⊆ J) (hJ : IsNil J) :
IsNil I :=
fun i hi => hJ i (h hi)The zero two-sided ideal is nil.
R:Type u_1inst✝:Ring Rx:Rhx:x = 0⊢ IsNilpotent x
exact hx ▸ IsNilpotent.zero All goals completed! 🐙The sum of two nil two-sided ideals is nil.
@[category API, AMS 16]
theorem IsNil.sup {I J : TwoSidedIdeal R} (hI : IsNil I) (hJ : IsNil J) : IsNil (I ⊔ J) := by R:Type u_1inst✝:Ring RI:TwoSidedIdeal RJ:TwoSidedIdeal RhI:IsNil IhJ:IsNil J⊢ IsNil (I ⊔ J)
intro x hx R:Type u_1inst✝:Ring RI:TwoSidedIdeal RJ:TwoSidedIdeal RhI:IsNil IhJ:IsNil Jx:Rhx:x ∈ I ⊔ J⊢ IsNilpotent x
obtain ⟨a, ha, b, hb, rfl⟩ := TwoSidedIdeal.mem_sup.mp hx R:Type u_1inst✝:Ring RI:TwoSidedIdeal RJ:TwoSidedIdeal RhI:IsNil IhJ:IsNil Ja:Rha:a ∈ Ib:Rhb:b ∈ Jhx:a + b ∈ I ⊔ J⊢ IsNilpotent (a + b)
obtain ⟨m, hm⟩ := hJ b hb R:Type u_1inst✝:Ring RI:TwoSidedIdeal RJ:TwoSidedIdeal RhI:IsNil IhJ:IsNil Ja:Rha:a ∈ Ib:Rhb:b ∈ Jhx:a + b ∈ I ⊔ Jm:ℕhm:b ^ m = 0⊢ IsNilpotent (a + b)
-- Modulo `I`, the element `a + b` is `b`, hence `(a + b) ^ m ∈ I`.
have hmem : (a + b) ^ m ∈ I := by R:Type u_1inst✝:Ring RI:TwoSidedIdeal RJ:TwoSidedIdeal RhI:IsNil IhJ:IsNil J⊢ IsNil (I ⊔ J) R:Type u_1inst✝:Ring RI:TwoSidedIdeal RJ:TwoSidedIdeal RhI:IsNil IhJ:IsNil Ja:Rha:a ∈ Ib:Rhb:b ∈ Jhx:a + b ∈ I ⊔ Jm:ℕhm:b ^ m = 0hmem:(a + b) ^ m ∈ I⊢ IsNilpotent (a + b)
have ha' : (a : I.ringCon.Quotient) = 0 := I.ringCon.eq.mpr ha R:Type u_1inst✝:Ring RI:TwoSidedIdeal RJ:TwoSidedIdeal RhI:IsNil IhJ:IsNil Ja:Rha:a ∈ Ib:Rhb:b ∈ Jhx:a + b ∈ I ⊔ Jm:ℕhm:b ^ m = 0ha':↑a = 0⊢ (a + b) ^ m ∈ I R:Type u_1inst✝:Ring RI:TwoSidedIdeal RJ:TwoSidedIdeal RhI:IsNil IhJ:IsNil Ja:Rha:a ∈ Ib:Rhb:b ∈ Jhx:a + b ∈ I ⊔ Jm:ℕhm:b ^ m = 0hmem:(a + b) ^ m ∈ I⊢ IsNilpotent (a + b)
rw [TwoSidedIdeal.mem_iff, R:Type u_1inst✝:Ring RI:TwoSidedIdeal RJ:TwoSidedIdeal RhI:IsNil IhJ:IsNil Ja:Rha:a ∈ Ib:Rhb:b ∈ Jhx:a + b ∈ I ⊔ Jm:ℕhm:b ^ m = 0ha':↑a = 0⊢ I.ringCon ((a + b) ^ m) 0 R:Type u_1inst✝:Ring RI:TwoSidedIdeal RJ:TwoSidedIdeal RhI:IsNil IhJ:IsNil Ja:Rha:a ∈ Ib:Rhb:b ∈ Jhx:a + b ∈ I ⊔ Jm:ℕhm:b ^ m = 0hmem:(a + b) ^ m ∈ I⊢ IsNilpotent (a + b) ← I.ringCon.eq, R:Type u_1inst✝:Ring RI:TwoSidedIdeal RJ:TwoSidedIdeal RhI:IsNil IhJ:IsNil Ja:Rha:a ∈ Ib:Rhb:b ∈ Jhx:a + b ∈ I ⊔ Jm:ℕhm:b ^ m = 0ha':↑a = 0⊢ ↑((a + b) ^ m) = ↑0 R:Type u_1inst✝:Ring RI:TwoSidedIdeal RJ:TwoSidedIdeal RhI:IsNil IhJ:IsNil Ja:Rha:a ∈ Ib:Rhb:b ∈ Jhx:a + b ∈ I ⊔ Jm:ℕhm:b ^ m = 0hmem:(a + b) ^ m ∈ I⊢ IsNilpotent (a + b) RingCon.coe_pow, R:Type u_1inst✝:Ring RI:TwoSidedIdeal RJ:TwoSidedIdeal RhI:IsNil IhJ:IsNil Ja:Rha:a ∈ Ib:Rhb:b ∈ Jhx:a + b ∈ I ⊔ Jm:ℕhm:b ^ m = 0ha':↑a = 0⊢ ↑(a + b) ^ m = ↑0 R:Type u_1inst✝:Ring RI:TwoSidedIdeal RJ:TwoSidedIdeal RhI:IsNil IhJ:IsNil Ja:Rha:a ∈ Ib:Rhb:b ∈ Jhx:a + b ∈ I ⊔ Jm:ℕhm:b ^ m = 0hmem:(a + b) ^ m ∈ I⊢ IsNilpotent (a + b) RingCon.coe_add, R:Type u_1inst✝:Ring RI:TwoSidedIdeal RJ:TwoSidedIdeal RhI:IsNil IhJ:IsNil Ja:Rha:a ∈ Ib:Rhb:b ∈ Jhx:a + b ∈ I ⊔ Jm:ℕhm:b ^ m = 0ha':↑a = 0⊢ (↑a + ↑b) ^ m = ↑0 R:Type u_1inst✝:Ring RI:TwoSidedIdeal RJ:TwoSidedIdeal RhI:IsNil IhJ:IsNil Ja:Rha:a ∈ Ib:Rhb:b ∈ Jhx:a + b ∈ I ⊔ Jm:ℕhm:b ^ m = 0hmem:(a + b) ^ m ∈ I⊢ IsNilpotent (a + b) ha', R:Type u_1inst✝:Ring RI:TwoSidedIdeal RJ:TwoSidedIdeal RhI:IsNil IhJ:IsNil Ja:Rha:a ∈ Ib:Rhb:b ∈ Jhx:a + b ∈ I ⊔ Jm:ℕhm:b ^ m = 0ha':↑a = 0⊢ (0 + ↑b) ^ m = ↑0 R:Type u_1inst✝:Ring RI:TwoSidedIdeal RJ:TwoSidedIdeal RhI:IsNil IhJ:IsNil Ja:Rha:a ∈ Ib:Rhb:b ∈ Jhx:a + b ∈ I ⊔ Jm:ℕhm:b ^ m = 0hmem:(a + b) ^ m ∈ I⊢ IsNilpotent (a + b) zero_add, R:Type u_1inst✝:Ring RI:TwoSidedIdeal RJ:TwoSidedIdeal RhI:IsNil IhJ:IsNil Ja:Rha:a ∈ Ib:Rhb:b ∈ Jhx:a + b ∈ I ⊔ Jm:ℕhm:b ^ m = 0ha':↑a = 0⊢ ↑b ^ m = ↑0 R:Type u_1inst✝:Ring RI:TwoSidedIdeal RJ:TwoSidedIdeal RhI:IsNil IhJ:IsNil Ja:Rha:a ∈ Ib:Rhb:b ∈ Jhx:a + b ∈ I ⊔ Jm:ℕhm:b ^ m = 0hmem:(a + b) ^ m ∈ I⊢ IsNilpotent (a + b)
← RingCon.coe_pow, R:Type u_1inst✝:Ring RI:TwoSidedIdeal RJ:TwoSidedIdeal RhI:IsNil IhJ:IsNil Ja:Rha:a ∈ Ib:Rhb:b ∈ Jhx:a + b ∈ I ⊔ Jm:ℕhm:b ^ m = 0ha':↑a = 0⊢ ↑(b ^ m) = ↑0 R:Type u_1inst✝:Ring RI:TwoSidedIdeal RJ:TwoSidedIdeal RhI:IsNil IhJ:IsNil Ja:Rha:a ∈ Ib:Rhb:b ∈ Jhx:a + b ∈ I ⊔ Jm:ℕhm:b ^ m = 0hmem:(a + b) ^ m ∈ I⊢ IsNilpotent (a + b) hm R:Type u_1inst✝:Ring RI:TwoSidedIdeal RJ:TwoSidedIdeal RhI:IsNil IhJ:IsNil Ja:Rha:a ∈ Ib:Rhb:b ∈ Jhx:a + b ∈ I ⊔ Jm:ℕhm:b ^ m = 0ha':↑a = 0⊢ ↑0 = ↑0 R:Type u_1inst✝:Ring RI:TwoSidedIdeal RJ:TwoSidedIdeal RhI:IsNil IhJ:IsNil Ja:Rha:a ∈ Ib:Rhb:b ∈ Jhx:a + b ∈ I ⊔ Jm:ℕhm:b ^ m = 0hmem:(a + b) ^ m ∈ I⊢ IsNilpotent (a + b)] R:Type u_1inst✝:Ring RI:TwoSidedIdeal RJ:TwoSidedIdeal RhI:IsNil IhJ:IsNil Ja:Rha:a ∈ Ib:Rhb:b ∈ Jhx:a + b ∈ I ⊔ Jm:ℕhm:b ^ m = 0hmem:(a + b) ^ m ∈ I⊢ IsNilpotent (a + b) R:Type u_1inst✝:Ring RI:TwoSidedIdeal RJ:TwoSidedIdeal RhI:IsNil IhJ:IsNil Ja:Rha:a ∈ Ib:Rhb:b ∈ Jhx:a + b ∈ I ⊔ Jm:ℕhm:b ^ m = 0hmem:(a + b) ^ m ∈ I⊢ IsNilpotent (a + b)
obtain ⟨k, hk⟩ := hI _ hmem R:Type u_1inst✝:Ring RI:TwoSidedIdeal RJ:TwoSidedIdeal RhI:IsNil IhJ:IsNil Ja:Rha:a ∈ Ib:Rhb:b ∈ Jhx:a + b ∈ I ⊔ Jm:ℕhm:b ^ m = 0hmem:(a + b) ^ m ∈ Ik:ℕhk:((a + b) ^ m) ^ k = 0⊢ IsNilpotent (a + b)
exact ⟨m * k, by R:Type u_1inst✝:Ring RI:TwoSidedIdeal RJ:TwoSidedIdeal RhI:IsNil IhJ:IsNil Ja:Rha:a ∈ Ib:Rhb:b ∈ Jhx:a + b ∈ I ⊔ Jm:ℕhm:b ^ m = 0hmem:(a + b) ^ m ∈ Ik:ℕhk:((a + b) ^ m) ^ k = 0⊢ (a + b) ^ (m * k) = 0 rw [pow_mul, R:Type u_1inst✝:Ring RI:TwoSidedIdeal RJ:TwoSidedIdeal RhI:IsNil IhJ:IsNil Ja:Rha:a ∈ Ib:Rhb:b ∈ Jhx:a + b ∈ I ⊔ Jm:ℕhm:b ^ m = 0hmem:(a + b) ^ m ∈ Ik:ℕhk:((a + b) ^ m) ^ k = 0⊢ ((a + b) ^ m) ^ k = 0 All goals completed! 🐙 hk R:Type u_1inst✝:Ring RI:TwoSidedIdeal RJ:TwoSidedIdeal RhI:IsNil IhJ:IsNil Ja:Rha:a ∈ Ib:Rhb:b ∈ Jhx:a + b ∈ I ⊔ Jm:ℕhm:b ^ m = 0hmem:(a + b) ^ m ∈ Ik:ℕhk:((a + b) ^ m) ^ k = 0⊢ 0 = 0 All goals completed! 🐙] All goals completed! 🐙⟩variable (R) in
The Köthe radical is a nil ideal: every element of Nil* R is nilpotent. This is a standard
fact which does not depend on the Köthe conjecture.
@[category API, AMS 16]
theorem isNil_kotheRadical : IsNil (Nil* R) := by R:Type u_1inst✝:Ring R⊢ IsNil (Nil* R)
-- The union of all nil two-sided ideals is itself a nil two-sided ideal.
let K : TwoSidedIdeal R := .mk' {x | ∃ I : TwoSidedIdeal R, IsNil I ∧ x ∈ I}
⟨⊥, isNil_bot, TwoSidedIdeal.zero_mem ⊥⟩
(by R:Type u_1inst✝:Ring R⊢ ∀ {x y : R}, x ∈ {x | ∃ I, IsNil I ∧ x ∈ I} → y ∈ {x | ∃ I, IsNil I ∧ x ∈ I} → x + y ∈ {x | ∃ I, IsNil I ∧ x ∈ I} R:Type u_1inst✝:Ring RK:TwoSidedIdeal R := mk' {x | ∃ I, IsNil I ∧ x ∈ I} ⋯ ⋯ ⋯ ⋯ ⋯⊢ IsNil (Nil* R)
rintro x y ⟨I, hI, hx⟩ ⟨J, hJ, hy⟩ R:Type u_1inst✝:Ring Rx:Ry:RI:TwoSidedIdeal RhI:IsNil Ihx:x ∈ IJ:TwoSidedIdeal RhJ:IsNil Jhy:y ∈ J⊢ x + y ∈ {x | ∃ I, IsNil I ∧ x ∈ I} R:Type u_1inst✝:Ring RK:TwoSidedIdeal R := mk' {x | ∃ I, IsNil I ∧ x ∈ I} ⋯ ⋯ ⋯ ⋯ ⋯⊢ IsNil (Nil* R)
exact ⟨I ⊔ J, hI.sup hJ,
add_mem (TwoSidedIdeal.mem_sup_left hx) (TwoSidedIdeal.mem_sup_right hy)⟩ All goals completed! 🐙 R:Type u_1inst✝:Ring RK:TwoSidedIdeal R := mk' {x | ∃ I, IsNil I ∧ x ∈ I} ⋯ ⋯ ⋯ ⋯ ⋯⊢ IsNil (Nil* R))
(by R:Type u_1inst✝:Ring R⊢ ∀ {x : R}, x ∈ {x | ∃ I, IsNil I ∧ x ∈ I} → -x ∈ {x | ∃ I, IsNil I ∧ x ∈ I} R:Type u_1inst✝:Ring RK:TwoSidedIdeal R := mk' {x | ∃ I, IsNil I ∧ x ∈ I} ⋯ ⋯ ⋯ ⋯ ⋯⊢ IsNil (Nil* R) rintro x ⟨I, hI, hx⟩ R:Type u_1inst✝:Ring Rx:RI:TwoSidedIdeal RhI:IsNil Ihx:x ∈ I⊢ -x ∈ {x | ∃ I, IsNil I ∧ x ∈ I} R:Type u_1inst✝:Ring RK:TwoSidedIdeal R := mk' {x | ∃ I, IsNil I ∧ x ∈ I} ⋯ ⋯ ⋯ ⋯ ⋯⊢ IsNil (Nil* R); exact ⟨I, hI, neg_mem hx⟩ All goals completed! 🐙 R:Type u_1inst✝:Ring RK:TwoSidedIdeal R := mk' {x | ∃ I, IsNil I ∧ x ∈ I} ⋯ ⋯ ⋯ ⋯ ⋯⊢ IsNil (Nil* R))
(by R:Type u_1inst✝:Ring R⊢ ∀ {x y : R}, y ∈ {x | ∃ I, IsNil I ∧ x ∈ I} → x * y ∈ {x | ∃ I, IsNil I ∧ x ∈ I} R:Type u_1inst✝:Ring RK:TwoSidedIdeal R := mk' {x | ∃ I, IsNil I ∧ x ∈ I} ⋯ ⋯ ⋯ ⋯ ⋯⊢ IsNil (Nil* R) rintro x y ⟨I, hI, hy⟩ R:Type u_1inst✝:Ring Rx:Ry:RI:TwoSidedIdeal RhI:IsNil Ihy:y ∈ I⊢ x * y ∈ {x | ∃ I, IsNil I ∧ x ∈ I} R:Type u_1inst✝:Ring RK:TwoSidedIdeal R := mk' {x | ∃ I, IsNil I ∧ x ∈ I} ⋯ ⋯ ⋯ ⋯ ⋯⊢ IsNil (Nil* R); exact ⟨I, hI, I.mul_mem_left _ _ hy⟩ All goals completed! 🐙 R:Type u_1inst✝:Ring RK:TwoSidedIdeal R := mk' {x | ∃ I, IsNil I ∧ x ∈ I} ⋯ ⋯ ⋯ ⋯ ⋯⊢ IsNil (Nil* R))
(by R:Type u_1inst✝:Ring R⊢ ∀ {x y : R}, x ∈ {x | ∃ I, IsNil I ∧ x ∈ I} → x * y ∈ {x | ∃ I, IsNil I ∧ x ∈ I} R:Type u_1inst✝:Ring RK:TwoSidedIdeal R := mk' {x | ∃ I, IsNil I ∧ x ∈ I} ⋯ ⋯ ⋯ ⋯ ⋯⊢ IsNil (Nil* R) rintro x y ⟨I, hI, hx⟩ R:Type u_1inst✝:Ring Rx:Ry:RI:TwoSidedIdeal RhI:IsNil Ihx:x ∈ I⊢ x * y ∈ {x | ∃ I, IsNil I ∧ x ∈ I} R:Type u_1inst✝:Ring RK:TwoSidedIdeal R := mk' {x | ∃ I, IsNil I ∧ x ∈ I} ⋯ ⋯ ⋯ ⋯ ⋯⊢ IsNil (Nil* R); exact ⟨I, hI, I.mul_mem_right _ _ hx⟩ All goals completed! 🐙 R:Type u_1inst✝:Ring RK:TwoSidedIdeal R := mk' {x | ∃ I, IsNil I ∧ x ∈ I} ⋯ ⋯ ⋯ ⋯ ⋯⊢ IsNil (Nil* R)) R:Type u_1inst✝:Ring RK:TwoSidedIdeal R := mk' {x | ∃ I, IsNil I ∧ x ∈ I} ⋯ ⋯ ⋯ ⋯ ⋯⊢ IsNil (Nil* R)
have hK : IsNil K := fun x hx => by R:Type u_1inst✝:Ring RK:TwoSidedIdeal R := mk' {x | ∃ I, IsNil I ∧ x ∈ I} ⋯ ⋯ ⋯ ⋯ ⋯x:Rhx:x ∈ K⊢ IsNilpotent x R:Type u_1inst✝:Ring RK:TwoSidedIdeal R := mk' {x | ∃ I, IsNil I ∧ x ∈ I} ⋯ ⋯ ⋯ ⋯ ⋯hK:IsNil K⊢ IsNil (Nil* R)
obtain ⟨I, hI, hx⟩ := (TwoSidedIdeal.mem_mk' _ _ _ _ _ _ x).mp hx R:Type u_1inst✝:Ring RK:TwoSidedIdeal R := mk' {x | ∃ I, IsNil I ∧ x ∈ I} ⋯ ⋯ ⋯ ⋯ ⋯x:Rhx✝:x ∈ KI:TwoSidedIdeal RhI:IsNil Ihx:x ∈ I⊢ IsNilpotent x R:Type u_1inst✝:Ring RK:TwoSidedIdeal R := mk' {x | ∃ I, IsNil I ∧ x ∈ I} ⋯ ⋯ ⋯ ⋯ ⋯hK:IsNil K⊢ IsNil (Nil* R)
exact hI x hx R:Type u_1inst✝:Ring RK:TwoSidedIdeal R := mk' {x | ∃ I, IsNil I ∧ x ∈ I} ⋯ ⋯ ⋯ ⋯ ⋯hK:IsNil K⊢ IsNil (Nil* R) R:Type u_1inst✝:Ring RK:TwoSidedIdeal R := mk' {x | ∃ I, IsNil I ∧ x ∈ I} ⋯ ⋯ ⋯ ⋯ ⋯hK:IsNil K⊢ IsNil (Nil* R)
refine hK.mono (TwoSidedIdeal.le_iff.mp (sSup_le fun I hI => ?_)) R:Type u_1inst✝:Ring RK:TwoSidedIdeal R := mk' {x | ∃ I, IsNil I ∧ x ∈ I} ⋯ ⋯ ⋯ ⋯ ⋯hK:IsNil KI:TwoSidedIdeal RhI:I ∈ {I | IsNil I}⊢ I ≤ K
intro x hx R:Type u_1inst✝:Ring RK:TwoSidedIdeal R := mk' {x | ∃ I, IsNil I ∧ x ∈ I} ⋯ ⋯ ⋯ ⋯ ⋯hK:IsNil KI:TwoSidedIdeal RhI:I ∈ {I | IsNil I}x:Rhx:x ∈ I⊢ x ∈ K
exact (TwoSidedIdeal.mem_mk' _ _ _ _ _ _ x).mpr ⟨I, hI, hx⟩ All goals completed! 🐙
If L is a nil left ideal, then so is L * y for any y.
@[category API, AMS 16]
theorem IsNil.map_mulRight {L : Ideal R} (hL : IsNil L) (y : R) :
IsNil (Submodule.map (LinearMap.mulRight R y) L) := by R:Type u_1inst✝:Ring RL:Ideal RhL:IsNil Ly:R⊢ IsNil (Submodule.map (LinearMap.mulRight R y) L)
intro z hz R:Type u_1inst✝:Ring RL:Ideal RhL:IsNil Ly:Rz:Rhz:z ∈ Submodule.map (LinearMap.mulRight R y) L⊢ IsNilpotent z
obtain ⟨x, hx, rfl⟩ := Submodule.mem_map.mp hz R:Type u_1inst✝:Ring RL:Ideal RhL:IsNil Ly:Rx:Rhx:x ∈ Lhz:(LinearMap.mulRight R y) x ∈ Submodule.map (LinearMap.mulRight R y) L⊢ IsNilpotent ((LinearMap.mulRight R y) x)
obtain ⟨k, hk⟩ := hL _ (L.mul_mem_left y hx) R:Type u_1inst✝:Ring RL:Ideal RhL:IsNil Ly:Rx:Rhx:x ∈ Lhz:(LinearMap.mulRight R y) x ∈ Submodule.map (LinearMap.mulRight R y) Lk:ℕhk:(y * x) ^ k = 0⊢ IsNilpotent ((LinearMap.mulRight R y) x)
refine ⟨k + 1, ?_⟩ R:Type u_1inst✝:Ring RL:Ideal RhL:IsNil Ly:Rx:Rhx:x ∈ Lhz:(LinearMap.mulRight R y) x ∈ Submodule.map (LinearMap.mulRight R y) Lk:ℕhk:(y * x) ^ k = 0⊢ (LinearMap.mulRight R y) x ^ (k + 1) = 0
rw [LinearMap.mulRight_apply, R:Type u_1inst✝:Ring RL:Ideal RhL:IsNil Ly:Rx:Rhx:x ∈ Lhz:(LinearMap.mulRight R y) x ∈ Submodule.map (LinearMap.mulRight R y) Lk:ℕhk:(y * x) ^ k = 0⊢ (x * y) ^ (k + 1) = 0 All goals completed! 🐙 pow_succ, R:Type u_1inst✝:Ring RL:Ideal RhL:IsNil Ly:Rx:Rhx:x ∈ Lhz:(LinearMap.mulRight R y) x ∈ Submodule.map (LinearMap.mulRight R y) Lk:ℕhk:(y * x) ^ k = 0⊢ (x * y) ^ k * (x * y) = 0 All goals completed! 🐙 ← mul_assoc, R:Type u_1inst✝:Ring RL:Ideal RhL:IsNil Ly:Rx:Rhx:x ∈ Lhz:(LinearMap.mulRight R y) x ∈ Submodule.map (LinearMap.mulRight R y) Lk:ℕhk:(y * x) ^ k = 0⊢ (x * y) ^ k * x * y = 0 All goals completed! 🐙 mul_pow_mul, R:Type u_1inst✝:Ring RL:Ideal RhL:IsNil Ly:Rx:Rhx:x ∈ Lhz:(LinearMap.mulRight R y) x ∈ Submodule.map (LinearMap.mulRight R y) Lk:ℕhk:(y * x) ^ k = 0⊢ x * (y * x) ^ k * y = 0 All goals completed! 🐙 hk, R:Type u_1inst✝:Ring RL:Ideal RhL:IsNil Ly:Rx:Rhx:x ∈ Lhz:(LinearMap.mulRight R y) x ∈ Submodule.map (LinearMap.mulRight R y) Lk:ℕhk:(y * x) ^ k = 0⊢ x * 0 * y = 0 All goals completed! 🐙 mul_zero, R:Type u_1inst✝:Ring RL:Ideal RhL:IsNil Ly:Rx:Rhx:x ∈ Lhz:(LinearMap.mulRight R y) x ∈ Submodule.map (LinearMap.mulRight R y) Lk:ℕhk:(y * x) ^ k = 0⊢ 0 * y = 0 All goals completed! 🐙 zero_mul R:Type u_1inst✝:Ring RL:Ideal RhL:IsNil Ly:Rx:Rhx:x ∈ Lhz:(LinearMap.mulRight R y) x ∈ Submodule.map (LinearMap.mulRight R y) Lk:ℕhk:(y * x) ^ k = 0⊢ 0 = 0 All goals completed! 🐙] All goals completed! 🐙The Köthe conjecture: In any ring, the sum of two nil left ideals is nil.
@[category research open, AMS 16]
theorem KotheConjecture (I J : Ideal R) (hI : IsNil I) (hJ : IsNil J) : IsNil (I + J) := by R:Type u_1inst✝:Ring RI:Ideal RJ:Ideal RhI:IsNil IhJ:IsNil J⊢ IsNil (I + J)
sorry All goals completed! 🐙The Köthe conjecture: every left nil radical is contained in the Köthe radical.
@[category research open, AMS 16]
theorem KotherConjecture.variants.le_KotherRadical {I : Ideal R} (hI : IsNil I) :
(I : Set R) ⊆ KotheRadical R := by R:Type u_1inst✝:Ring RI:Ideal RhI:IsNil I⊢ ↑I ⊆ ↑(Nil* R)
sorry All goals completed! 🐙open scoped Classical in
The Köthe conjecture: for any nil ideal I of R, the matrix ideal M_n(I) is a nil ideal
of the matrix ring M_n(R).
@[category research open, AMS 16]
theorem KotherConjecture.variants.general_matrix {I : TwoSidedIdeal R} (hI : IsNil I)
(n : Type*) [Fintype n] : IsNil (matrix n I) := by R:Type u_1inst✝¹:Ring RI:TwoSidedIdeal RhI:IsNil In:Type u_2inst✝:Fintype n⊢ IsNil (TwoSidedIdeal.matrix n I)
sorry All goals completed! 🐙
The Köthe conjecture: for any nil ideal I of R, the matrix ideal M_2(I) is a nil ideal
of the matrix ring M_2(R).
@[category research open, AMS 16]
theorem KotherConjecture.variants.two_by_two_matrix {I : TwoSidedIdeal R} (hI : IsNil I) :
IsNil (matrix (Fin 2) I) := by R:Type u_1inst✝:Ring RI:TwoSidedIdeal RhI:IsNil I⊢ IsNil (TwoSidedIdeal.matrix (Fin 2) I)
sorry All goals completed! 🐙open scoped Classical in
The Köthe conjecture: for any finite index type n, the Köthe radical of the matrix
ring M_n(R) is the ideal M_n(Nil*(R)) of matrices with entries in the Köthe radical of R.
@[category research open, AMS 16]
theorem KotherConjecture.variants.matrixOver_KotherRadical (n : Type*) [Fintype n] :
matrix n (Nil* R) = Nil* (Matrix n n R) := by R:Type u_1inst✝¹:Ring Rn:Type u_2inst✝:Fintype n⊢ TwoSidedIdeal.matrix n (Nil* R) = Nil* Matrix n n R
sorry All goals completed! 🐙/-
### Relations between the different formulations
All the formulations of the Köthe conjecture above are known to be equivalent (Krempa). We record
here the implications that have a short formal proof. In particular each of
`KotheConjecture`, `KotherConjecture.variants.le_KotherRadical`,
`KotherConjecture.variants.two_by_two_matrix` and
`KotherConjecture.variants.matrixOver_KotherRadical` implies
`KotherConjecture.variants.general_matrix`, so that a counterexample to the latter immediately
yields counterexamples to all the others.
The implication `KotherConjecture.variants.general_matrix → KotheConjecture` (also due to Krempa)
is not formalized here.
-/
section ColumnIdealvariable {n : Type*} [Fintype n] [DecidableEq n]
The left ideal of Matrix n n R consisting of the matrices with entries in I which are
supported on the j-th column.
def columnIdeal (I : TwoSidedIdeal R) (j : n) : Ideal (Matrix n n R) where
carrier := {M | ∀ i k, M i k ∈ I ∧ (k ≠ j → M i k = 0)}
zero_mem' _ _ := ⟨I.zero_mem, fun _ => rfl⟩
add_mem' hM hN i k :=
⟨add_mem (hM i k).1 (hN i k).1, fun hk => by R:Type u_1inst✝²:Ring Rn:Type u_2inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rj:na✝:Matrix n n Rb✝:Matrix n n RhM:a✝ ∈ {M | ∀ (i k : n), M i k ∈ I ∧ (k ≠ j → M i k = 0)}hN:b✝ ∈ {M | ∀ (i k : n), M i k ∈ I ∧ (k ≠ j → M i k = 0)}i:nk:nhk:k ≠ j⊢ (a✝ + b✝) i k = 0 simp [(hM i k).2 hk, (hN i k).2 hk] All goals completed! 🐙⟩
smul_mem' B _ hM i k := by R:Type u_1inst✝²:Ring Rn:Type u_2inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rj:nB:Matrix n n Rx✝:Matrix n n RhM:x✝ ∈ {M | ∀ (i k : n), M i k ∈ I ∧ (k ≠ j → M i k = 0)}i:nk:n⊢ (B • x✝) i k ∈ I ∧ (k ≠ j → (B • x✝) i k = 0)
simp only [smul_eq_mul, Matrix.mul_apply] R:Type u_1inst✝²:Ring Rn:Type u_2inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rj:nB:Matrix n n Rx✝:Matrix n n RhM:x✝ ∈ {M | ∀ (i k : n), M i k ∈ I ∧ (k ≠ j → M i k = 0)}i:nk:n⊢ ∑ j, B i j * x✝ j k ∈ I ∧ (k ≠ j → ∑ j, B i j * x✝ j k = 0)
refine ⟨sum_mem fun l _ => I.mul_mem_left _ _ (hM l k).1, fun hk => ?_⟩ R:Type u_1inst✝²:Ring Rn:Type u_2inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rj:nB:Matrix n n Rx✝:Matrix n n RhM:x✝ ∈ {M | ∀ (i k : n), M i k ∈ I ∧ (k ≠ j → M i k = 0)}i:nk:nhk:k ≠ j⊢ ∑ j, B i j * x✝ j k = 0
exact Finset.sum_eq_zero fun l _ => by R:Type u_1inst✝²:Ring Rn:Type u_2inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rj:nB:Matrix n n Rx✝¹:Matrix n n RhM:x✝ ∈ {M | ∀ (i k : n), M i k ∈ I ∧ (k ≠ j → M i k = 0)}i:nk:nhk:k ≠ jl:nx✝:l ∈ Finset.univ⊢ B i l * x✝¹ l k = 0 rw [(hM l k).2 hk, R:Type u_1inst✝²:Ring Rn:Type u_2inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rj:nB:Matrix n n Rx✝¹:Matrix n n RhM:x✝ ∈ {M | ∀ (i k : n), M i k ∈ I ∧ (k ≠ j → M i k = 0)}i:nk:nhk:k ≠ jl:nx✝:l ∈ Finset.univ⊢ B i l * 0 = 0 All goals completed! 🐙 mul_zero R:Type u_1inst✝²:Ring Rn:Type u_2inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rj:nB:Matrix n n Rx✝¹:Matrix n n RhM:x✝ ∈ {M | ∀ (i k : n), M i k ∈ I ∧ (k ≠ j → M i k = 0)}i:nk:nhk:k ≠ jl:nx✝:l ∈ Finset.univ⊢ 0 = 0 All goals completed! 🐙] All goals completed! 🐙
Powers of a matrix supported on the j-th column are controlled by the (j, j) entry.
@[category API, AMS 16]
theorem pow_succ_apply_of_mem_columnIdeal {I : TwoSidedIdeal R} {j : n} {M : Matrix n n R}
(hM : M ∈ columnIdeal I j) (m : ℕ) (i k : n) :
(M ^ (m + 1)) i k = M i k * M j j ^ m := by R:Type u_1inst✝²:Ring Rn:Type u_2inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rj:nM:Matrix n n RhM:M ∈ columnIdeal I jm:ℕi:nk:n⊢ (M ^ (m + 1)) i k = M i k * M j j ^ m
induction m generalizing i k with
| zero => zero R:Type u_1inst✝²:Ring Rn:Type u_2inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rj:nM:Matrix n n RhM:M ∈ columnIdeal I ji:nk:n⊢ (M ^ (0 + 1)) i k = M i k * M j j ^ 0 simp All goals completed! 🐙
| succ m ih => succ R:Type u_1inst✝²:Ring Rn:Type u_2inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rj:nM:Matrix n n RhM:M ∈ columnIdeal I jm:ℕih:∀ (i k : n), (M ^ (m + 1)) i k = M i k * M j j ^ mi:nk:n⊢ (M ^ (m + 1 + 1)) i k = M i k * M j j ^ (m + 1)
rw [pow_succ, succ R:Type u_1inst✝²:Ring Rn:Type u_2inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rj:nM:Matrix n n RhM:M ∈ columnIdeal I jm:ℕih:∀ (i k : n), (M ^ (m + 1)) i k = M i k * M j j ^ mi:nk:n⊢ (M ^ (m + 1) * M) i k = M i k * M j j ^ (m + 1) succ R:Type u_1inst✝²:Ring Rn:Type u_2inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rj:nM:Matrix n n RhM:M ∈ columnIdeal I jm:ℕih:∀ (i k : n), (M ^ (m + 1)) i k = M i k * M j j ^ mi:nk:n⊢ ∑ j, (M ^ (m + 1)) i j * M j k = M i k * M j j ^ (m + 1) Matrix.mul_apply succ R:Type u_1inst✝²:Ring Rn:Type u_2inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rj:nM:Matrix n n RhM:M ∈ columnIdeal I jm:ℕih:∀ (i k : n), (M ^ (m + 1)) i k = M i k * M j j ^ mi:nk:n⊢ ∑ j, (M ^ (m + 1)) i j * M j k = M i k * M j j ^ (m + 1) succ R:Type u_1inst✝²:Ring Rn:Type u_2inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rj:nM:Matrix n n RhM:M ∈ columnIdeal I jm:ℕih:∀ (i k : n), (M ^ (m + 1)) i k = M i k * M j j ^ mi:nk:n⊢ ∑ j, (M ^ (m + 1)) i j * M j k = M i k * M j j ^ (m + 1)]succ R:Type u_1inst✝²:Ring Rn:Type u_2inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rj:nM:Matrix n n RhM:M ∈ columnIdeal I jm:ℕih:∀ (i k : n), (M ^ (m + 1)) i k = M i k * M j j ^ mi:nk:n⊢ ∑ j, (M ^ (m + 1)) i j * M j k = M i k * M j j ^ (m + 1)
rcases eq_or_ne k j with hk | hk succ.inl R:Type u_1inst✝²:Ring Rn:Type u_2inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rj:nM:Matrix n n RhM:M ∈ columnIdeal I jm:ℕih:∀ (i k : n), (M ^ (m + 1)) i k = M i k * M j j ^ mi:nk:nhk:k = j⊢ ∑ j, (M ^ (m + 1)) i j * M j k = M i k * M j j ^ (m + 1)succ.inr R:Type u_1inst✝²:Ring Rn:Type u_2inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rj:nM:Matrix n n RhM:M ∈ columnIdeal I jm:ℕih:∀ (i k : n), (M ^ (m + 1)) i k = M i k * M j j ^ mi:nk:nhk:k ≠ j⊢ ∑ j, (M ^ (m + 1)) i j * M j k = M i k * M j j ^ (m + 1)
· succ.inl R:Type u_1inst✝²:Ring Rn:Type u_2inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rj:nM:Matrix n n RhM:M ∈ columnIdeal I jm:ℕih:∀ (i k : n), (M ^ (m + 1)) i k = M i k * M j j ^ mi:nk:nhk:k = j⊢ ∑ j, (M ^ (m + 1)) i j * M j k = M i k * M j j ^ (m + 1) rw [hk, succ.inl R:Type u_1inst✝²:Ring Rn:Type u_2inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rj:nM:Matrix n n RhM:M ∈ columnIdeal I jm:ℕih:∀ (i k : n), (M ^ (m + 1)) i k = M i k * M j j ^ mi:nk:nhk:k = j⊢ ∑ j_1, (M ^ (m + 1)) i j_1 * M j_1 j = M i j * M j j ^ (m + 1) All goals completed! 🐙 Finset.sum_eq_single j (fun l _ hl => by R:Type u_1inst✝²:Ring Rn:Type u_2inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rj:nM:Matrix n n RhM:M ∈ columnIdeal I jm:ℕih:∀ (i k : n), (M ^ (m + 1)) i k = M i k * M j j ^ mi:nk:nhk:k = jl:nx✝:l ∈ Finset.univhl:l ≠ j⊢ (M ^ (m + 1)) i l * M l j = 0 All goals completed! 🐙 rw [ih, R:Type u_1inst✝²:Ring Rn:Type u_2inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rj:nM:Matrix n n RhM:M ∈ columnIdeal I jm:ℕih:∀ (i k : n), (M ^ (m + 1)) i k = M i k * M j j ^ mi:nk:nhk:k = jl:nx✝:l ∈ Finset.univhl:l ≠ j⊢ M i l * M j j ^ m * M l j = 0 All goals completed! 🐙 All goals completed! 🐙 (hM i l).2 hl, R:Type u_1inst✝²:Ring Rn:Type u_2inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rj:nM:Matrix n n RhM:M ∈ columnIdeal I jm:ℕih:∀ (i k : n), (M ^ (m + 1)) i k = M i k * M j j ^ mi:nk:nhk:k = jl:nx✝:l ∈ Finset.univhl:l ≠ j⊢ 0 * M j j ^ m * M l j = 0 All goals completed! 🐙 All goals completed! 🐙 zero_mul, R:Type u_1inst✝²:Ring Rn:Type u_2inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rj:nM:Matrix n n RhM:M ∈ columnIdeal I jm:ℕih:∀ (i k : n), (M ^ (m + 1)) i k = M i k * M j j ^ mi:nk:nhk:k = jl:nx✝:l ∈ Finset.univhl:l ≠ j⊢ 0 * M l j = 0 All goals completed! 🐙 All goals completed! 🐙 zero_mul R:Type u_1inst✝²:Ring Rn:Type u_2inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rj:nM:Matrix n n RhM:M ∈ columnIdeal I jm:ℕih:∀ (i k : n), (M ^ (m + 1)) i k = M i k * M j j ^ mi:nk:nhk:k = jl:nx✝:l ∈ Finset.univhl:l ≠ j⊢ 0 = 0 All goals completed! 🐙 All goals completed! 🐙] All goals completed! 🐙 All goals completed! 🐙)
(fun h => absurd (Finset.mem_univ _) h), ih, succ.inl R:Type u_1inst✝²:Ring Rn:Type u_2inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rj:nM:Matrix n n RhM:M ∈ columnIdeal I jm:ℕih:∀ (i k : n), (M ^ (m + 1)) i k = M i k * M j j ^ mi:nk:nhk:k = j⊢ M i j * M j j ^ m * M j j = M i j * M j j ^ (m + 1) All goals completed! 🐙 pow_succ, succ.inl R:Type u_1inst✝²:Ring Rn:Type u_2inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rj:nM:Matrix n n RhM:M ∈ columnIdeal I jm:ℕih:∀ (i k : n), (M ^ (m + 1)) i k = M i k * M j j ^ mi:nk:nhk:k = j⊢ M i j * M j j ^ m * M j j = M i j * (M j j ^ m * M j j) All goals completed! 🐙 mul_assoc succ.inl R:Type u_1inst✝²:Ring Rn:Type u_2inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rj:nM:Matrix n n RhM:M ∈ columnIdeal I jm:ℕih:∀ (i k : n), (M ^ (m + 1)) i k = M i k * M j j ^ mi:nk:nhk:k = j⊢ M i j * (M j j ^ m * M j j) = M i j * (M j j ^ m * M j j) All goals completed! 🐙] All goals completed! 🐙
· succ.inr R:Type u_1inst✝²:Ring Rn:Type u_2inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rj:nM:Matrix n n RhM:M ∈ columnIdeal I jm:ℕih:∀ (i k : n), (M ^ (m + 1)) i k = M i k * M j j ^ mi:nk:nhk:k ≠ j⊢ ∑ j, (M ^ (m + 1)) i j * M j k = M i k * M j j ^ (m + 1) rw [(hM i k).2 hk, succ.inr R:Type u_1inst✝²:Ring Rn:Type u_2inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rj:nM:Matrix n n RhM:M ∈ columnIdeal I jm:ℕih:∀ (i k : n), (M ^ (m + 1)) i k = M i k * M j j ^ mi:nk:nhk:k ≠ j⊢ ∑ j, (M ^ (m + 1)) i j * M j k = 0 * M j j ^ (m + 1) succ.inr R:Type u_1inst✝²:Ring Rn:Type u_2inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rj:nM:Matrix n n RhM:M ∈ columnIdeal I jm:ℕih:∀ (i k : n), (M ^ (m + 1)) i k = M i k * M j j ^ mi:nk:nhk:k ≠ j⊢ ∑ j, (M ^ (m + 1)) i j * M j k = 0 zero_mul succ.inr R:Type u_1inst✝²:Ring Rn:Type u_2inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rj:nM:Matrix n n RhM:M ∈ columnIdeal I jm:ℕih:∀ (i k : n), (M ^ (m + 1)) i k = M i k * M j j ^ mi:nk:nhk:k ≠ j⊢ ∑ j, (M ^ (m + 1)) i j * M j k = 0succ.inr R:Type u_1inst✝²:Ring Rn:Type u_2inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rj:nM:Matrix n n RhM:M ∈ columnIdeal I jm:ℕih:∀ (i k : n), (M ^ (m + 1)) i k = M i k * M j j ^ mi:nk:nhk:k ≠ j⊢ ∑ j, (M ^ (m + 1)) i j * M j k = 0]succ.inr R:Type u_1inst✝²:Ring Rn:Type u_2inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rj:nM:Matrix n n RhM:M ∈ columnIdeal I jm:ℕih:∀ (i k : n), (M ^ (m + 1)) i k = M i k * M j j ^ mi:nk:nhk:k ≠ j⊢ ∑ j, (M ^ (m + 1)) i j * M j k = 0
exact Finset.sum_eq_zero fun l _ => by R:Type u_1inst✝²:Ring Rn:Type u_2inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rj:nM:Matrix n n RhM:M ∈ columnIdeal I jm:ℕih:∀ (i k : n), (M ^ (m + 1)) i k = M i k * M j j ^ mi:nk:nhk:k ≠ jl:nx✝:l ∈ Finset.univ⊢ (M ^ (m + 1)) i l * M l k = 0 rw [(hM l k).2 hk, R:Type u_1inst✝²:Ring Rn:Type u_2inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rj:nM:Matrix n n RhM:M ∈ columnIdeal I jm:ℕih:∀ (i k : n), (M ^ (m + 1)) i k = M i k * M j j ^ mi:nk:nhk:k ≠ jl:nx✝:l ∈ Finset.univ⊢ (M ^ (m + 1)) i l * 0 = 0 All goals completed! 🐙 mul_zero R:Type u_1inst✝²:Ring Rn:Type u_2inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rj:nM:Matrix n n RhM:M ∈ columnIdeal I jm:ℕih:∀ (i k : n), (M ^ (m + 1)) i k = M i k * M j j ^ mi:nk:nhk:k ≠ jl:nx✝:l ∈ Finset.univ⊢ 0 = 0 All goals completed! 🐙] All goals completed! 🐙
For a nil ideal I, the column ideals columnIdeal I j are nil left ideals.
@[category API, AMS 16]
theorem isNil_columnIdeal {I : TwoSidedIdeal R} (hI : IsNil I) (j : n) :
IsNil (columnIdeal I j) := by R:Type u_1inst✝²:Ring Rn:Type u_2inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal RhI:IsNil Ij:n⊢ IsNil (columnIdeal I j)
intro M hM R:Type u_1inst✝²:Ring Rn:Type u_2inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal RhI:IsNil Ij:nM:Matrix n n RhM:M ∈ columnIdeal I j⊢ IsNilpotent M
obtain ⟨m, hm⟩ := hI _ (hM j j).1 R:Type u_1inst✝²:Ring Rn:Type u_2inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal RhI:IsNil Ij:nM:Matrix n n RhM:M ∈ columnIdeal I jm:ℕhm:M j j ^ m = 0⊢ IsNilpotent M
refine ⟨m + 1, ?_⟩ R:Type u_1inst✝²:Ring Rn:Type u_2inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal RhI:IsNil Ij:nM:Matrix n n RhM:M ∈ columnIdeal I jm:ℕhm:M j j ^ m = 0⊢ M ^ (m + 1) = 0
ext i k R:Type u_1inst✝²:Ring Rn:Type u_2inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal RhI:IsNil Ij:nM:Matrix n n RhM:M ∈ columnIdeal I jm:ℕhm:M j j ^ m = 0i:nk:n⊢ (M ^ (m + 1)) i k = 0 i k
rw [pow_succ_apply_of_mem_columnIdeal hM m i k, R:Type u_1inst✝²:Ring Rn:Type u_2inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal RhI:IsNil Ij:nM:Matrix n n RhM:M ∈ columnIdeal I jm:ℕhm:M j j ^ m = 0i:nk:n⊢ M i k * M j j ^ m = 0 i k All goals completed! 🐙 hm, R:Type u_1inst✝²:Ring Rn:Type u_2inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal RhI:IsNil Ij:nM:Matrix n n RhM:M ∈ columnIdeal I jm:ℕhm:M j j ^ m = 0i:nk:n⊢ M i k * 0 = 0 i k All goals completed! 🐙 mul_zero, R:Type u_1inst✝²:Ring Rn:Type u_2inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal RhI:IsNil Ij:nM:Matrix n n RhM:M ∈ columnIdeal I jm:ℕhm:M j j ^ m = 0i:nk:n⊢ 0 = 0 i k All goals completed! 🐙 Matrix.zero_apply R:Type u_1inst✝²:Ring Rn:Type u_2inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal RhI:IsNil Ij:nM:Matrix n n RhM:M ∈ columnIdeal I jm:ℕhm:M j j ^ m = 0i:nk:n⊢ 0 = 0 All goals completed! 🐙] All goals completed! 🐙
The matrix ideal M_n(I) is the sum of the column ideals columnIdeal I j.
@[category API, AMS 16]
theorem mem_iSup_columnIdeal {I : TwoSidedIdeal R} {M : Matrix n n R}
(hM : M ∈ TwoSidedIdeal.matrix n I) :
M ∈ ⨆ j, columnIdeal I j := by R:Type u_1inst✝²:Ring Rn:Type u_2inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal RM:Matrix n n RhM:M ∈ TwoSidedIdeal.matrix n I⊢ M ∈ ⨆ j, columnIdeal I j
have : M = ∑ j, Matrix.of fun i k => if k = j then M i k else 0 := by
ext i k R:Type u_1inst✝²:Ring Rn:Type u_2inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal RM:Matrix n n RhM:M ∈ TwoSidedIdeal.matrix n Ii:nk:n⊢ M i k = (∑ j, of fun i k ↦ if k = j then M i k else 0) i k R:Type u_1inst✝²:Ring Rn:Type u_2inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal RM:Matrix n n RhM:M ∈ TwoSidedIdeal.matrix n Ithis:M = ∑ j, of fun i k ↦ if k = j then M i k else 0⊢ M ∈ ⨆ j, columnIdeal I j
simp [Matrix.sum_apply] R:Type u_1inst✝²:Ring Rn:Type u_2inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal RM:Matrix n n RhM:M ∈ TwoSidedIdeal.matrix n Ithis:M = ∑ j, of fun i k ↦ if k = j then M i k else 0⊢ M ∈ ⨆ j, columnIdeal I j R:Type u_1inst✝²:Ring Rn:Type u_2inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal RM:Matrix n n RhM:M ∈ TwoSidedIdeal.matrix n Ithis:M = ∑ j, of fun i k ↦ if k = j then M i k else 0⊢ M ∈ ⨆ j, columnIdeal I j
rw [this R:Type u_1inst✝²:Ring Rn:Type u_2inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal RM:Matrix n n RhM:M ∈ TwoSidedIdeal.matrix n Ithis:M = ∑ j, of fun i k ↦ if k = j then M i k else 0⊢ (∑ j, of fun i k ↦ if k = j then M i k else 0) ∈ ⨆ j, columnIdeal I j R:Type u_1inst✝²:Ring Rn:Type u_2inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal RM:Matrix n n RhM:M ∈ TwoSidedIdeal.matrix n Ithis:M = ∑ j, of fun i k ↦ if k = j then M i k else 0⊢ (∑ j, of fun i k ↦ if k = j then M i k else 0) ∈ ⨆ j, columnIdeal I j] R:Type u_1inst✝²:Ring Rn:Type u_2inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal RM:Matrix n n RhM:M ∈ TwoSidedIdeal.matrix n Ithis:M = ∑ j, of fun i k ↦ if k = j then M i k else 0⊢ (∑ j, of fun i k ↦ if k = j then M i k else 0) ∈ ⨆ j, columnIdeal I j
refine sum_mem fun j _ => Submodule.mem_iSup_of_mem j fun i k => ?_ R:Type u_1inst✝²:Ring Rn:Type u_2inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal RM:Matrix n n RhM:M ∈ TwoSidedIdeal.matrix n Ithis:M = ∑ j, of fun i k ↦ if k = j then M i k else 0j:nx✝:j ∈ Finset.univi:nk:n⊢ of (fun i k ↦ if k = j then M i k else 0) i k ∈ I ∧ (k ≠ j → of (fun i k ↦ if k = j then M i k else 0) i k = 0)
simp only [Matrix.of_apply] R:Type u_1inst✝²:Ring Rn:Type u_2inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal RM:Matrix n n RhM:M ∈ TwoSidedIdeal.matrix n Ithis:M = ∑ j, of fun i k ↦ if k = j then M i k else 0j:nx✝:j ∈ Finset.univi:nk:n⊢ (if k = j then M i k else 0) ∈ I ∧ (k ≠ j → (if k = j then M i k else 0) = 0)
refine ⟨?_, fun hk => if_neg hk⟩ R:Type u_1inst✝²:Ring Rn:Type u_2inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal RM:Matrix n n RhM:M ∈ TwoSidedIdeal.matrix n Ithis:M = ∑ j, of fun i k ↦ if k = j then M i k else 0j:nx✝:j ∈ Finset.univi:nk:n⊢ (if k = j then M i k else 0) ∈ I
split_ifs pos R:Type u_1inst✝²:Ring Rn:Type u_2inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal RM:Matrix n n RhM:M ∈ TwoSidedIdeal.matrix n Ithis:M = ∑ j, of fun i k ↦ if k = j then M i k else 0j:nx✝:j ∈ Finset.univi:nk:nh✝:k = j⊢ M i k ∈ Ineg R:Type u_1inst✝²:Ring Rn:Type u_2inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal RM:Matrix n n RhM:M ∈ TwoSidedIdeal.matrix n Ithis:M = ∑ j, of fun i k ↦ if k = j then M i k else 0j:nx✝:j ∈ Finset.univi:nk:nh✝:¬k = j⊢ 0 ∈ I
· pos R:Type u_1inst✝²:Ring Rn:Type u_2inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal RM:Matrix n n RhM:M ∈ TwoSidedIdeal.matrix n Ithis:M = ∑ j, of fun i k ↦ if k = j then M i k else 0j:nx✝:j ∈ Finset.univi:nk:nh✝:k = j⊢ M i k ∈ I exact hM i k All goals completed! 🐙
· neg R:Type u_1inst✝²:Ring Rn:Type u_2inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal RM:Matrix n n RhM:M ∈ TwoSidedIdeal.matrix n Ithis:M = ∑ j, of fun i k ↦ if k = j then M i k else 0j:nx✝:j ∈ Finset.univi:nk:nh✝:¬k = j⊢ 0 ∈ I exact I.zero_mem All goals completed! 🐙end ColumnIdeal
If the Köthe conjecture holds (for rings in universe w), then a finite sum of nil left
ideals is nil.
@[category API, AMS 16]
theorem isNil_iSup_of_kotheConjecture (h : type_of% @KotheConjecture.{w}) {S : Type w} [Ring S]
{ι : Type*} [Fintype ι] {L : ι → Ideal S} (hL : ∀ i, IsNil (L i)) :
IsNil (⨆ i, L i) := by h:∀ {R : Type w} [inst : Ring R] (I J : Ideal R), IsNil I → IsNil J → IsNil (I + J)S:Type winst✝¹:Ring Sι:Type u_2inst✝:Fintype ιL:ι → Ideal ShL:∀ (i : ι), IsNil (L i)⊢ IsNil (⨆ i, L i)
rw [← Finset.sup_univ_eq_iSup h:∀ {R : Type w} [inst : Ring R] (I J : Ideal R), IsNil I → IsNil J → IsNil (I + J)S:Type winst✝¹:Ring Sι:Type u_2inst✝:Fintype ιL:ι → Ideal ShL:∀ (i : ι), IsNil (L i)⊢ IsNil (Finset.univ.sup fun i ↦ L i) h:∀ {R : Type w} [inst : Ring R] (I J : Ideal R), IsNil I → IsNil J → IsNil (I + J)S:Type winst✝¹:Ring Sι:Type u_2inst✝:Fintype ιL:ι → Ideal ShL:∀ (i : ι), IsNil (L i)⊢ IsNil (Finset.univ.sup fun i ↦ L i)] h:∀ {R : Type w} [inst : Ring R] (I J : Ideal R), IsNil I → IsNil J → IsNil (I + J)S:Type winst✝¹:Ring Sι:Type u_2inst✝:Fintype ιL:ι → Ideal ShL:∀ (i : ι), IsNil (L i)⊢ IsNil (Finset.univ.sup fun i ↦ L i)
refine Finset.sup_induction ?_ (fun a ha b hb => h a b ha hb) fun i _ => hL i h:∀ {R : Type w} [inst : Ring R] (I J : Ideal R), IsNil I → IsNil J → IsNil (I + J)S:Type winst✝¹:Ring Sι:Type u_2inst✝:Fintype ιL:ι → Ideal ShL:∀ (i : ι), IsNil (L i)⊢ IsNil ⊥
intro x hx h:∀ {R : Type w} [inst : Ring R] (I J : Ideal R), IsNil I → IsNil J → IsNil (I + J)S:Type winst✝¹:Ring Sι:Type u_2inst✝:Fintype ιL:ι → Ideal ShL:∀ (i : ι), IsNil (L i)x:Shx:x ∈ ⊥⊢ IsNilpotent x
rw [Submodule.mem_bot h:∀ {R : Type w} [inst : Ring R] (I J : Ideal R), IsNil I → IsNil J → IsNil (I + J)S:Type winst✝¹:Ring Sι:Type u_2inst✝:Fintype ιL:ι → Ideal ShL:∀ (i : ι), IsNil (L i)x:Shx:x = 0⊢ IsNilpotent x h:∀ {R : Type w} [inst : Ring R] (I J : Ideal R), IsNil I → IsNil J → IsNil (I + J)S:Type winst✝¹:Ring Sι:Type u_2inst✝:Fintype ιL:ι → Ideal ShL:∀ (i : ι), IsNil (L i)x:Shx:x = 0⊢ IsNilpotent x] at hx h:∀ {R : Type w} [inst : Ring R] (I J : Ideal R), IsNil I → IsNil J → IsNil (I + J)S:Type winst✝¹:Ring Sι:Type u_2inst✝:Fintype ιL:ι → Ideal ShL:∀ (i : ι), IsNil (L i)x:Shx:x = 0⊢ IsNilpotent x
exact hx ▸ IsNilpotent.zero All goals completed! 🐙
The Köthe conjecture (for rings in universe max u v) implies the general matrix
formulation for rings in universe u and index types in universe v.
@[category research solved, AMS 16]
theorem KotherConjecture.variants.general_matrix_of_KotheConjecture
(h : type_of% @KotheConjecture.{max u v}) :
type_of% @KotherConjecture.variants.general_matrix.{u, v} := by h:∀ {R : Type (max u v)} [inst : Ring R] (I J : Ideal R), IsNil I → IsNil J → IsNil (I + J)⊢ ∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)
classical
intro R _ I hI n _ M hM h:∀ {R : Type (max u v)} [inst : Ring R] (I J : Ideal R), IsNil I → IsNil J → IsNil (I + J)R:Type uinst✝¹:Ring RI:TwoSidedIdeal RhI:IsNil In:Type vinst✝:Fintype nM:Matrix n n RhM:M ∈ TwoSidedIdeal.matrix n I⊢ IsNilpotent M
exact isNil_iSup_of_kotheConjecture h (fun j => isNil_columnIdeal hI j) M
(mem_iSup_columnIdeal hM) All goals completed! 🐙If every nil left ideal is contained in the Köthe radical, then the Köthe conjecture holds.
@[category research solved, AMS 16]
theorem KotherConjecture.variants.KotheConjecture_of_le_KotherRadical
(h : type_of% @KotherConjecture.variants.le_KotherRadical.{u}) :
type_of% @KotheConjecture.{u} := by h:∀ {R : Type u} [inst : Ring R] {I : Ideal R}, IsNil I → ↑I ⊆ ↑(Nil* R)⊢ ∀ {R : Type u} [inst : Ring R] (I J : Ideal R), IsNil I → IsNil J → IsNil (I + J)
intro R _ I J hI hJ x hx h:∀ {R : Type u} [inst : Ring R] {I : Ideal R}, IsNil I → ↑I ⊆ ↑(Nil* R)R:Type uinst✝:Ring RI:Ideal RJ:Ideal RhI:IsNil IhJ:IsNil Jx:Rhx:x ∈ I + J⊢ IsNilpotent x
rw [Submodule.add_eq_sup, h:∀ {R : Type u} [inst : Ring R] {I : Ideal R}, IsNil I → ↑I ⊆ ↑(Nil* R)R:Type uinst✝:Ring RI:Ideal RJ:Ideal RhI:IsNil IhJ:IsNil Jx:Rhx:x ∈ I ⊔ J⊢ IsNilpotent x h:∀ {R : Type u} [inst : Ring R] {I : Ideal R}, IsNil I → ↑I ⊆ ↑(Nil* R)R:Type uinst✝:Ring RI:Ideal RJ:Ideal RhI:IsNil IhJ:IsNil Jx:Rhx:∃ y ∈ I, ∃ z ∈ J, y + z = x⊢ IsNilpotent x Submodule.mem_sup h:∀ {R : Type u} [inst : Ring R] {I : Ideal R}, IsNil I → ↑I ⊆ ↑(Nil* R)R:Type uinst✝:Ring RI:Ideal RJ:Ideal RhI:IsNil IhJ:IsNil Jx:Rhx:∃ y ∈ I, ∃ z ∈ J, y + z = x⊢ IsNilpotent x h:∀ {R : Type u} [inst : Ring R] {I : Ideal R}, IsNil I → ↑I ⊆ ↑(Nil* R)R:Type uinst✝:Ring RI:Ideal RJ:Ideal RhI:IsNil IhJ:IsNil Jx:Rhx:∃ y ∈ I, ∃ z ∈ J, y + z = x⊢ IsNilpotent x] at hx h:∀ {R : Type u} [inst : Ring R] {I : Ideal R}, IsNil I → ↑I ⊆ ↑(Nil* R)R:Type uinst✝:Ring RI:Ideal RJ:Ideal RhI:IsNil IhJ:IsNil Jx:Rhx:∃ y ∈ I, ∃ z ∈ J, y + z = x⊢ IsNilpotent x
obtain ⟨y, hy, z, hz, rfl⟩ := hx h:∀ {R : Type u} [inst : Ring R] {I : Ideal R}, IsNil I → ↑I ⊆ ↑(Nil* R)R:Type uinst✝:Ring RI:Ideal RJ:Ideal RhI:IsNil IhJ:IsNil Jy:Rhy:y ∈ Iz:Rhz:z ∈ J⊢ IsNilpotent (y + z)
exact isNil_kotheRadical R _ (add_mem (h hI hy) (h hJ hz)) All goals completed! 🐙The Köthe conjecture implies that every nil left ideal is contained in the Köthe radical.
@[category research solved, AMS 16]
theorem KotherConjecture.variants.le_KotherRadical_of_KotheConjecture
(h : type_of% @KotheConjecture.{u}) :
type_of% @KotherConjecture.variants.le_KotherRadical.{u} := by h:∀ {R : Type u} [inst : Ring R] (I J : Ideal R), IsNil I → IsNil J → IsNil (I + J)⊢ ∀ {R : Type u} [inst : Ring R] {I : Ideal R}, IsNil I → ↑I ⊆ ↑(Nil* R)
intro R _ I hI h:∀ {R : Type u} [inst : Ring R] (I J : Ideal R), IsNil I → IsNil J → IsNil (I + J)R:Type uinst✝:Ring RI:Ideal RhI:IsNil I⊢ ↑I ⊆ ↑(Nil* R)
-- The union of all nil left ideals is a nil two-sided ideal.
let K : TwoSidedIdeal R := .mk' {x | ∃ L : Ideal R, IsNil L ∧ x ∈ L}
⟨⊥, fun x hx => by h:∀ {R : Type u} [inst : Ring R] (I J : Ideal R), IsNil I → IsNil J → IsNil (I + J)R:Type uinst✝:Ring RI:Ideal RhI:IsNil Ix:Rhx:x ∈ ⊥⊢ IsNilpotent x h:∀ {R : Type u} [inst : Ring R] (I J : Ideal R), IsNil I → IsNil J → IsNil (I + J)R:Type uinst✝:Ring RI:Ideal RhI:IsNil IK:TwoSidedIdeal R := mk' {x | ∃ L, IsNil L ∧ x ∈ L} ⋯ ⋯ ⋯ ⋯ ⋯⊢ ↑I ⊆ ↑(Nil* R) rw [Ideal.mem_bot h:∀ {R : Type u} [inst : Ring R] (I J : Ideal R), IsNil I → IsNil J → IsNil (I + J)R:Type uinst✝:Ring RI:Ideal RhI:IsNil Ix:Rhx:x = 0⊢ IsNilpotent x h:∀ {R : Type u} [inst : Ring R] (I J : Ideal R), IsNil I → IsNil J → IsNil (I + J)R:Type uinst✝:Ring RI:Ideal RhI:IsNil Ix:Rhx:x = 0⊢ IsNilpotent x h:∀ {R : Type u} [inst : Ring R] (I J : Ideal R), IsNil I → IsNil J → IsNil (I + J)R:Type uinst✝:Ring RI:Ideal RhI:IsNil IK:TwoSidedIdeal R := mk' {x | ∃ L, IsNil L ∧ x ∈ L} ⋯ ⋯ ⋯ ⋯ ⋯⊢ ↑I ⊆ ↑(Nil* R)] at hx h:∀ {R : Type u} [inst : Ring R] (I J : Ideal R), IsNil I → IsNil J → IsNil (I + J)R:Type uinst✝:Ring RI:Ideal RhI:IsNil Ix:Rhx:x = 0⊢ IsNilpotent x h:∀ {R : Type u} [inst : Ring R] (I J : Ideal R), IsNil I → IsNil J → IsNil (I + J)R:Type uinst✝:Ring RI:Ideal RhI:IsNil IK:TwoSidedIdeal R := mk' {x | ∃ L, IsNil L ∧ x ∈ L} ⋯ ⋯ ⋯ ⋯ ⋯⊢ ↑I ⊆ ↑(Nil* R); exact hx ▸ IsNilpotent.zero All goals completed! 🐙 h:∀ {R : Type u} [inst : Ring R] (I J : Ideal R), IsNil I → IsNil J → IsNil (I + J)R:Type uinst✝:Ring RI:Ideal RhI:IsNil IK:TwoSidedIdeal R := mk' {x | ∃ L, IsNil L ∧ x ∈ L} ⋯ ⋯ ⋯ ⋯ ⋯⊢ ↑I ⊆ ↑(Nil* R),
Submodule.zero_mem _⟩
(by h:∀ {R : Type u} [inst : Ring R] (I J : Ideal R), IsNil I → IsNil J → IsNil (I + J)R:Type uinst✝:Ring RI:Ideal RhI:IsNil I⊢ ∀ {x y : R}, x ∈ {x | ∃ L, IsNil L ∧ x ∈ L} → y ∈ {x | ∃ L, IsNil L ∧ x ∈ L} → x + y ∈ {x | ∃ L, IsNil L ∧ x ∈ L} h:∀ {R : Type u} [inst : Ring R] (I J : Ideal R), IsNil I → IsNil J → IsNil (I + J)R:Type uinst✝:Ring RI:Ideal RhI:IsNil IK:TwoSidedIdeal R := mk' {x | ∃ L, IsNil L ∧ x ∈ L} ⋯ ⋯ ⋯ ⋯ ⋯⊢ ↑I ⊆ ↑(Nil* R)
rintro x y ⟨L, hL, hx⟩ ⟨L', hL', hy⟩ h:∀ {R : Type u} [inst : Ring R] (I J : Ideal R), IsNil I → IsNil J → IsNil (I + J)R:Type uinst✝:Ring RI:Ideal RhI:IsNil Ix:Ry:RL:Ideal RhL:IsNil Lhx:x ∈ LL':Ideal RhL':IsNil L'hy:y ∈ L'⊢ x + y ∈ {x | ∃ L, IsNil L ∧ x ∈ L} h:∀ {R : Type u} [inst : Ring R] (I J : Ideal R), IsNil I → IsNil J → IsNil (I + J)R:Type uinst✝:Ring RI:Ideal RhI:IsNil IK:TwoSidedIdeal R := mk' {x | ∃ L, IsNil L ∧ x ∈ L} ⋯ ⋯ ⋯ ⋯ ⋯⊢ ↑I ⊆ ↑(Nil* R)
exact ⟨L + L', h L L' hL hL', Submodule.add_mem_sup hx hy⟩ All goals completed! 🐙 h:∀ {R : Type u} [inst : Ring R] (I J : Ideal R), IsNil I → IsNil J → IsNil (I + J)R:Type uinst✝:Ring RI:Ideal RhI:IsNil IK:TwoSidedIdeal R := mk' {x | ∃ L, IsNil L ∧ x ∈ L} ⋯ ⋯ ⋯ ⋯ ⋯⊢ ↑I ⊆ ↑(Nil* R))
(by h:∀ {R : Type u} [inst : Ring R] (I J : Ideal R), IsNil I → IsNil J → IsNil (I + J)R:Type uinst✝:Ring RI:Ideal RhI:IsNil I⊢ ∀ {x : R}, x ∈ {x | ∃ L, IsNil L ∧ x ∈ L} → -x ∈ {x | ∃ L, IsNil L ∧ x ∈ L} h:∀ {R : Type u} [inst : Ring R] (I J : Ideal R), IsNil I → IsNil J → IsNil (I + J)R:Type uinst✝:Ring RI:Ideal RhI:IsNil IK:TwoSidedIdeal R := mk' {x | ∃ L, IsNil L ∧ x ∈ L} ⋯ ⋯ ⋯ ⋯ ⋯⊢ ↑I ⊆ ↑(Nil* R) rintro x ⟨L, hL, hx⟩ h:∀ {R : Type u} [inst : Ring R] (I J : Ideal R), IsNil I → IsNil J → IsNil (I + J)R:Type uinst✝:Ring RI:Ideal RhI:IsNil Ix:RL:Ideal RhL:IsNil Lhx:x ∈ L⊢ -x ∈ {x | ∃ L, IsNil L ∧ x ∈ L} h:∀ {R : Type u} [inst : Ring R] (I J : Ideal R), IsNil I → IsNil J → IsNil (I + J)R:Type uinst✝:Ring RI:Ideal RhI:IsNil IK:TwoSidedIdeal R := mk' {x | ∃ L, IsNil L ∧ x ∈ L} ⋯ ⋯ ⋯ ⋯ ⋯⊢ ↑I ⊆ ↑(Nil* R); exact ⟨L, hL, neg_mem hx⟩ All goals completed! 🐙 h:∀ {R : Type u} [inst : Ring R] (I J : Ideal R), IsNil I → IsNil J → IsNil (I + J)R:Type uinst✝:Ring RI:Ideal RhI:IsNil IK:TwoSidedIdeal R := mk' {x | ∃ L, IsNil L ∧ x ∈ L} ⋯ ⋯ ⋯ ⋯ ⋯⊢ ↑I ⊆ ↑(Nil* R))
(by h:∀ {R : Type u} [inst : Ring R] (I J : Ideal R), IsNil I → IsNil J → IsNil (I + J)R:Type uinst✝:Ring RI:Ideal RhI:IsNil I⊢ ∀ {x y : R}, y ∈ {x | ∃ L, IsNil L ∧ x ∈ L} → x * y ∈ {x | ∃ L, IsNil L ∧ x ∈ L} h:∀ {R : Type u} [inst : Ring R] (I J : Ideal R), IsNil I → IsNil J → IsNil (I + J)R:Type uinst✝:Ring RI:Ideal RhI:IsNil IK:TwoSidedIdeal R := mk' {x | ∃ L, IsNil L ∧ x ∈ L} ⋯ ⋯ ⋯ ⋯ ⋯⊢ ↑I ⊆ ↑(Nil* R) rintro x y ⟨L, hL, hy⟩ h:∀ {R : Type u} [inst : Ring R] (I J : Ideal R), IsNil I → IsNil J → IsNil (I + J)R:Type uinst✝:Ring RI:Ideal RhI:IsNil Ix:Ry:RL:Ideal RhL:IsNil Lhy:y ∈ L⊢ x * y ∈ {x | ∃ L, IsNil L ∧ x ∈ L} h:∀ {R : Type u} [inst : Ring R] (I J : Ideal R), IsNil I → IsNil J → IsNil (I + J)R:Type uinst✝:Ring RI:Ideal RhI:IsNil IK:TwoSidedIdeal R := mk' {x | ∃ L, IsNil L ∧ x ∈ L} ⋯ ⋯ ⋯ ⋯ ⋯⊢ ↑I ⊆ ↑(Nil* R); exact ⟨L, hL, L.mul_mem_left _ hy⟩ All goals completed! 🐙 h:∀ {R : Type u} [inst : Ring R] (I J : Ideal R), IsNil I → IsNil J → IsNil (I + J)R:Type uinst✝:Ring RI:Ideal RhI:IsNil IK:TwoSidedIdeal R := mk' {x | ∃ L, IsNil L ∧ x ∈ L} ⋯ ⋯ ⋯ ⋯ ⋯⊢ ↑I ⊆ ↑(Nil* R))
(by h:∀ {R : Type u} [inst : Ring R] (I J : Ideal R), IsNil I → IsNil J → IsNil (I + J)R:Type uinst✝:Ring RI:Ideal RhI:IsNil I⊢ ∀ {x y : R}, x ∈ {x | ∃ L, IsNil L ∧ x ∈ L} → x * y ∈ {x | ∃ L, IsNil L ∧ x ∈ L} h:∀ {R : Type u} [inst : Ring R] (I J : Ideal R), IsNil I → IsNil J → IsNil (I + J)R:Type uinst✝:Ring RI:Ideal RhI:IsNil IK:TwoSidedIdeal R := mk' {x | ∃ L, IsNil L ∧ x ∈ L} ⋯ ⋯ ⋯ ⋯ ⋯⊢ ↑I ⊆ ↑(Nil* R)
rintro x y ⟨L, hL, hx⟩ h:∀ {R : Type u} [inst : Ring R] (I J : Ideal R), IsNil I → IsNil J → IsNil (I + J)R:Type uinst✝:Ring RI:Ideal RhI:IsNil Ix:Ry:RL:Ideal RhL:IsNil Lhx:x ∈ L⊢ x * y ∈ {x | ∃ L, IsNil L ∧ x ∈ L} h:∀ {R : Type u} [inst : Ring R] (I J : Ideal R), IsNil I → IsNil J → IsNil (I + J)R:Type uinst✝:Ring RI:Ideal RhI:IsNil IK:TwoSidedIdeal R := mk' {x | ∃ L, IsNil L ∧ x ∈ L} ⋯ ⋯ ⋯ ⋯ ⋯⊢ ↑I ⊆ ↑(Nil* R)
exact ⟨Submodule.map (LinearMap.mulRight R y) L, hL.map_mulRight y,
Submodule.mem_map_of_mem hx⟩ All goals completed! 🐙 h:∀ {R : Type u} [inst : Ring R] (I J : Ideal R), IsNil I → IsNil J → IsNil (I + J)R:Type uinst✝:Ring RI:Ideal RhI:IsNil IK:TwoSidedIdeal R := mk' {x | ∃ L, IsNil L ∧ x ∈ L} ⋯ ⋯ ⋯ ⋯ ⋯⊢ ↑I ⊆ ↑(Nil* R)) h:∀ {R : Type u} [inst : Ring R] (I J : Ideal R), IsNil I → IsNil J → IsNil (I + J)R:Type uinst✝:Ring RI:Ideal RhI:IsNil IK:TwoSidedIdeal R := mk' {x | ∃ L, IsNil L ∧ x ∈ L} ⋯ ⋯ ⋯ ⋯ ⋯⊢ ↑I ⊆ ↑(Nil* R)
have hK : IsNil K := fun x hx => by h:∀ {R : Type u} [inst : Ring R] (I J : Ideal R), IsNil I → IsNil J → IsNil (I + J)R:Type uinst✝:Ring RI:Ideal RhI:IsNil IK:TwoSidedIdeal R := mk' {x | ∃ L, IsNil L ∧ x ∈ L} ⋯ ⋯ ⋯ ⋯ ⋯x:Rhx:x ∈ K⊢ IsNilpotent x h:∀ {R : Type u} [inst : Ring R] (I J : Ideal R), IsNil I → IsNil J → IsNil (I + J)R:Type uinst✝:Ring RI:Ideal RhI:IsNil IK:TwoSidedIdeal R := mk' {x | ∃ L, IsNil L ∧ x ∈ L} ⋯ ⋯ ⋯ ⋯ ⋯hK:IsNil K⊢ ↑I ⊆ ↑(Nil* R)
obtain ⟨L, hL, hx⟩ := (TwoSidedIdeal.mem_mk' _ _ _ _ _ _ x).mp hx h:∀ {R : Type u} [inst : Ring R] (I J : Ideal R), IsNil I → IsNil J → IsNil (I + J)R:Type uinst✝:Ring RI:Ideal RhI:IsNil IK:TwoSidedIdeal R := mk' {x | ∃ L, IsNil L ∧ x ∈ L} ⋯ ⋯ ⋯ ⋯ ⋯x:Rhx✝:x ∈ KL:Ideal RhL:IsNil Lhx:x ∈ L⊢ IsNilpotent x h:∀ {R : Type u} [inst : Ring R] (I J : Ideal R), IsNil I → IsNil J → IsNil (I + J)R:Type uinst✝:Ring RI:Ideal RhI:IsNil IK:TwoSidedIdeal R := mk' {x | ∃ L, IsNil L ∧ x ∈ L} ⋯ ⋯ ⋯ ⋯ ⋯hK:IsNil K⊢ ↑I ⊆ ↑(Nil* R)
exact hL x hx h:∀ {R : Type u} [inst : Ring R] (I J : Ideal R), IsNil I → IsNil J → IsNil (I + J)R:Type uinst✝:Ring RI:Ideal RhI:IsNil IK:TwoSidedIdeal R := mk' {x | ∃ L, IsNil L ∧ x ∈ L} ⋯ ⋯ ⋯ ⋯ ⋯hK:IsNil K⊢ ↑I ⊆ ↑(Nil* R) h:∀ {R : Type u} [inst : Ring R] (I J : Ideal R), IsNil I → IsNil J → IsNil (I + J)R:Type uinst✝:Ring RI:Ideal RhI:IsNil IK:TwoSidedIdeal R := mk' {x | ∃ L, IsNil L ∧ x ∈ L} ⋯ ⋯ ⋯ ⋯ ⋯hK:IsNil K⊢ ↑I ⊆ ↑(Nil* R)
intro x hx h:∀ {R : Type u} [inst : Ring R] (I J : Ideal R), IsNil I → IsNil J → IsNil (I + J)R:Type uinst✝:Ring RI:Ideal RhI:IsNil IK:TwoSidedIdeal R := mk' {x | ∃ L, IsNil L ∧ x ∈ L} ⋯ ⋯ ⋯ ⋯ ⋯hK:IsNil Kx:Rhx:x ∈ ↑I⊢ x ∈ ↑(Nil* R)
have hxK : x ∈ K := (TwoSidedIdeal.mem_mk' _ _ _ _ _ _ x).mpr ⟨I, hI, hx⟩ h:∀ {R : Type u} [inst : Ring R] (I J : Ideal R), IsNil I → IsNil J → IsNil (I + J)R:Type uinst✝:Ring RI:Ideal RhI:IsNil IK:TwoSidedIdeal R := mk' {x | ∃ L, IsNil L ∧ x ∈ L} ⋯ ⋯ ⋯ ⋯ ⋯hK:IsNil Kx:Rhx:x ∈ ↑IhxK:x ∈ K⊢ x ∈ ↑(Nil* R)
exact TwoSidedIdeal.le_iff.mp (le_sSup hK) hxK All goals completed! 🐙
If every nil left ideal is contained in the Köthe radical (for rings in universe max u v),
then the general matrix formulation holds.
@[category research solved, AMS 16]
theorem KotherConjecture.variants.general_matrix_of_le_KotherRadical
(h : type_of% @KotherConjecture.variants.le_KotherRadical.{max u v}) :
type_of% @KotherConjecture.variants.general_matrix.{u, v} :=
general_matrix_of_KotheConjecture (KotheConjecture_of_le_KotherRadical h)
The general matrix formulation of the Köthe conjecture trivially implies the 2 × 2 one.
@[category test, AMS 16]
theorem KotherConjecture.variants.two_by_two_matrix_of_general_matrix
(h : type_of% @KotherConjecture.variants.general_matrix.{u, 0}) :
type_of% @KotherConjecture.variants.two_by_two_matrix.{u} := by h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)⊢ ∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R}, IsNil I → IsNil (TwoSidedIdeal.matrix (Fin 2) I)
intro R _ I hI h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝:Ring RI:TwoSidedIdeal RhI:IsNil I⊢ IsNil (TwoSidedIdeal.matrix (Fin 2) I)
convert h hI (Fin 2) All goals completed! 🐙section MatrixTransfervariable {m : Type*} [Fintype m] [DecidableEq m] {n : Type*} [Fintype n] [DecidableEq n]
Nilness of the matrix ideal M_n(I) only depends on the cardinality of n.
@[category API, AMS 16]
theorem isNil_matrix_of_equiv (e : m ≃ n) {I : TwoSidedIdeal R}
(h : IsNil (TwoSidedIdeal.matrix m I)) : IsNil (TwoSidedIdeal.matrix n I) := by R:Type u_1inst✝⁴:Ring Rm:Type u_2inst✝³:Fintype minst✝²:DecidableEq mn:Type u_3inst✝¹:Fintype ninst✝:DecidableEq ne:m ≃ nI:TwoSidedIdeal Rh:IsNil (TwoSidedIdeal.matrix m I)⊢ IsNil (TwoSidedIdeal.matrix n I)
intro M hM R:Type u_1inst✝⁴:Ring Rm:Type u_2inst✝³:Fintype minst✝²:DecidableEq mn:Type u_3inst✝¹:Fintype ninst✝:DecidableEq ne:m ≃ nI:TwoSidedIdeal Rh:IsNil (TwoSidedIdeal.matrix m I)M:Matrix n n RhM:M ∈ TwoSidedIdeal.matrix n I⊢ IsNilpotent M
have hM' : (Matrix.reindexRingEquiv R e).symm M ∈ TwoSidedIdeal.matrix m I := fun i j => hM _ _ R:Type u_1inst✝⁴:Ring Rm:Type u_2inst✝³:Fintype minst✝²:DecidableEq mn:Type u_3inst✝¹:Fintype ninst✝:DecidableEq ne:m ≃ nI:TwoSidedIdeal Rh:IsNil (TwoSidedIdeal.matrix m I)M:Matrix n n RhM:M ∈ TwoSidedIdeal.matrix n IhM':(reindexRingEquiv R e).symm M ∈ TwoSidedIdeal.matrix m I⊢ IsNilpotent M
simpa using (h _ hM').map (Matrix.reindexRingEquiv R e) All goals completed! 🐙
If M_{n ⊕ m}(I) is nil then so is M_n(I), using the block embedding.
@[category API, AMS 16]
theorem isNil_matrix_of_sum {I : TwoSidedIdeal R} (h : IsNil (TwoSidedIdeal.matrix (n ⊕ m) I)) :
IsNil (TwoSidedIdeal.matrix n I) := by R:Type u_1inst✝⁴:Ring Rm:Type u_2inst✝³:Fintype minst✝²:DecidableEq mn:Type u_3inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rh:IsNil (TwoSidedIdeal.matrix (n ⊕ m) I)⊢ IsNil (TwoSidedIdeal.matrix n I)
intro M hM R:Type u_1inst✝⁴:Ring Rm:Type u_2inst✝³:Fintype minst✝²:DecidableEq mn:Type u_3inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rh:IsNil (TwoSidedIdeal.matrix (n ⊕ m) I)M:Matrix n n RhM:M ∈ TwoSidedIdeal.matrix n I⊢ IsNilpotent M
have hM' : Matrix.fromBlocks M 0 0 0 ∈ TwoSidedIdeal.matrix (n ⊕ m) I := by R:Type u_1inst✝⁴:Ring Rm:Type u_2inst✝³:Fintype minst✝²:DecidableEq mn:Type u_3inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rh:IsNil (TwoSidedIdeal.matrix (n ⊕ m) I)⊢ IsNil (TwoSidedIdeal.matrix n I) R:Type u_1inst✝⁴:Ring Rm:Type u_2inst✝³:Fintype minst✝²:DecidableEq mn:Type u_3inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rh:IsNil (TwoSidedIdeal.matrix (n ⊕ m) I)M:Matrix n n RhM:M ∈ TwoSidedIdeal.matrix n IhM':fromBlocks M 0 0 0 ∈ TwoSidedIdeal.matrix (n ⊕ m) I⊢ IsNilpotent M
rw [TwoSidedIdeal.mem_matrix R:Type u_1inst✝⁴:Ring Rm:Type u_2inst✝³:Fintype minst✝²:DecidableEq mn:Type u_3inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rh:IsNil (TwoSidedIdeal.matrix (n ⊕ m) I)M:Matrix n n RhM:∀ (i j : n), M i j ∈ I⊢ ∀ (i j : n ⊕ m), fromBlocks M 0 0 0 i j ∈ I R:Type u_1inst✝⁴:Ring Rm:Type u_2inst✝³:Fintype minst✝²:DecidableEq mn:Type u_3inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rh:IsNil (TwoSidedIdeal.matrix (n ⊕ m) I)M:Matrix n n RhM:∀ (i j : n), M i j ∈ I⊢ ∀ (i j : n ⊕ m), fromBlocks M 0 0 0 i j ∈ I R:Type u_1inst✝⁴:Ring Rm:Type u_2inst✝³:Fintype minst✝²:DecidableEq mn:Type u_3inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rh:IsNil (TwoSidedIdeal.matrix (n ⊕ m) I)M:Matrix n n RhM:M ∈ TwoSidedIdeal.matrix n IhM':fromBlocks M 0 0 0 ∈ TwoSidedIdeal.matrix (n ⊕ m) I⊢ IsNilpotent M] at hM ⊢ R:Type u_1inst✝⁴:Ring Rm:Type u_2inst✝³:Fintype minst✝²:DecidableEq mn:Type u_3inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rh:IsNil (TwoSidedIdeal.matrix (n ⊕ m) I)M:Matrix n n RhM:∀ (i j : n), M i j ∈ I⊢ ∀ (i j : n ⊕ m), fromBlocks M 0 0 0 i j ∈ I R:Type u_1inst✝⁴:Ring Rm:Type u_2inst✝³:Fintype minst✝²:DecidableEq mn:Type u_3inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rh:IsNil (TwoSidedIdeal.matrix (n ⊕ m) I)M:Matrix n n RhM:M ∈ TwoSidedIdeal.matrix n IhM':fromBlocks M 0 0 0 ∈ TwoSidedIdeal.matrix (n ⊕ m) I⊢ IsNilpotent M
rintro (i | i) (j | j) inl.inl R:Type u_1inst✝⁴:Ring Rm:Type u_2inst✝³:Fintype minst✝²:DecidableEq mn:Type u_3inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rh:IsNil (TwoSidedIdeal.matrix (n ⊕ m) I)M:Matrix n n RhM:∀ (i j : n), M i j ∈ Ii:nj:n⊢ fromBlocks M 0 0 0 (Sum.inl i) (Sum.inl j) ∈ Iinl.inr R:Type u_1inst✝⁴:Ring Rm:Type u_2inst✝³:Fintype minst✝²:DecidableEq mn:Type u_3inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rh:IsNil (TwoSidedIdeal.matrix (n ⊕ m) I)M:Matrix n n RhM:∀ (i j : n), M i j ∈ Ii:nj:m⊢ fromBlocks M 0 0 0 (Sum.inl i) (Sum.inr j) ∈ Iinr.inl R:Type u_1inst✝⁴:Ring Rm:Type u_2inst✝³:Fintype minst✝²:DecidableEq mn:Type u_3inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rh:IsNil (TwoSidedIdeal.matrix (n ⊕ m) I)M:Matrix n n RhM:∀ (i j : n), M i j ∈ Ii:mj:n⊢ fromBlocks M 0 0 0 (Sum.inr i) (Sum.inl j) ∈ Iinr.inr R:Type u_1inst✝⁴:Ring Rm:Type u_2inst✝³:Fintype minst✝²:DecidableEq mn:Type u_3inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rh:IsNil (TwoSidedIdeal.matrix (n ⊕ m) I)M:Matrix n n RhM:∀ (i j : n), M i j ∈ Ii:mj:m⊢ fromBlocks M 0 0 0 (Sum.inr i) (Sum.inr j) ∈ I R:Type u_1inst✝⁴:Ring Rm:Type u_2inst✝³:Fintype minst✝²:DecidableEq mn:Type u_3inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rh:IsNil (TwoSidedIdeal.matrix (n ⊕ m) I)M:Matrix n n RhM:M ∈ TwoSidedIdeal.matrix n IhM':fromBlocks M 0 0 0 ∈ TwoSidedIdeal.matrix (n ⊕ m) I⊢ IsNilpotent M <;> inl.inl R:Type u_1inst✝⁴:Ring Rm:Type u_2inst✝³:Fintype minst✝²:DecidableEq mn:Type u_3inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rh:IsNil (TwoSidedIdeal.matrix (n ⊕ m) I)M:Matrix n n RhM:∀ (i j : n), M i j ∈ Ii:nj:n⊢ fromBlocks M 0 0 0 (Sum.inl i) (Sum.inl j) ∈ Iinl.inr R:Type u_1inst✝⁴:Ring Rm:Type u_2inst✝³:Fintype minst✝²:DecidableEq mn:Type u_3inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rh:IsNil (TwoSidedIdeal.matrix (n ⊕ m) I)M:Matrix n n RhM:∀ (i j : n), M i j ∈ Ii:nj:m⊢ fromBlocks M 0 0 0 (Sum.inl i) (Sum.inr j) ∈ Iinr.inl R:Type u_1inst✝⁴:Ring Rm:Type u_2inst✝³:Fintype minst✝²:DecidableEq mn:Type u_3inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rh:IsNil (TwoSidedIdeal.matrix (n ⊕ m) I)M:Matrix n n RhM:∀ (i j : n), M i j ∈ Ii:mj:n⊢ fromBlocks M 0 0 0 (Sum.inr i) (Sum.inl j) ∈ Iinr.inr R:Type u_1inst✝⁴:Ring Rm:Type u_2inst✝³:Fintype minst✝²:DecidableEq mn:Type u_3inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rh:IsNil (TwoSidedIdeal.matrix (n ⊕ m) I)M:Matrix n n RhM:∀ (i j : n), M i j ∈ Ii:mj:m⊢ fromBlocks M 0 0 0 (Sum.inr i) (Sum.inr j) ∈ I R:Type u_1inst✝⁴:Ring Rm:Type u_2inst✝³:Fintype minst✝²:DecidableEq mn:Type u_3inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rh:IsNil (TwoSidedIdeal.matrix (n ⊕ m) I)M:Matrix n n RhM:M ∈ TwoSidedIdeal.matrix n IhM':fromBlocks M 0 0 0 ∈ TwoSidedIdeal.matrix (n ⊕ m) I⊢ IsNilpotent M simp [hM] R:Type u_1inst✝⁴:Ring Rm:Type u_2inst✝³:Fintype minst✝²:DecidableEq mn:Type u_3inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rh:IsNil (TwoSidedIdeal.matrix (n ⊕ m) I)M:Matrix n n RhM:M ∈ TwoSidedIdeal.matrix n IhM':fromBlocks M 0 0 0 ∈ TwoSidedIdeal.matrix (n ⊕ m) I⊢ IsNilpotent M R:Type u_1inst✝⁴:Ring Rm:Type u_2inst✝³:Fintype minst✝²:DecidableEq mn:Type u_3inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rh:IsNil (TwoSidedIdeal.matrix (n ⊕ m) I)M:Matrix n n RhM:M ∈ TwoSidedIdeal.matrix n IhM':fromBlocks M 0 0 0 ∈ TwoSidedIdeal.matrix (n ⊕ m) I⊢ IsNilpotent M
obtain ⟨k, hk⟩ := h _ hM' R:Type u_1inst✝⁴:Ring Rm:Type u_2inst✝³:Fintype minst✝²:DecidableEq mn:Type u_3inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rh:IsNil (TwoSidedIdeal.matrix (n ⊕ m) I)M:Matrix n n RhM:M ∈ TwoSidedIdeal.matrix n IhM':fromBlocks M 0 0 0 ∈ TwoSidedIdeal.matrix (n ⊕ m) Ik:ℕhk:fromBlocks M 0 0 0 ^ k = 0⊢ IsNilpotent M
have key : ∀ k, (Matrix.fromBlocks M 0 0 0 : Matrix (n ⊕ m) (n ⊕ m) R) ^ (k + 1) =
Matrix.fromBlocks (M ^ (k + 1)) 0 0 0 := by R:Type u_1inst✝⁴:Ring Rm:Type u_2inst✝³:Fintype minst✝²:DecidableEq mn:Type u_3inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rh:IsNil (TwoSidedIdeal.matrix (n ⊕ m) I)⊢ IsNil (TwoSidedIdeal.matrix n I) R:Type u_1inst✝⁴:Ring Rm:Type u_2inst✝³:Fintype minst✝²:DecidableEq mn:Type u_3inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rh:IsNil (TwoSidedIdeal.matrix (n ⊕ m) I)M:Matrix n n RhM:M ∈ TwoSidedIdeal.matrix n IhM':fromBlocks M 0 0 0 ∈ TwoSidedIdeal.matrix (n ⊕ m) Ik:ℕhk:fromBlocks M 0 0 0 ^ k = 0key:∀ (k : ℕ), fromBlocks M 0 0 0 ^ (k + 1) = fromBlocks (M ^ (k + 1)) 0 0 0⊢ IsNilpotent M
intro k R:Type u_1inst✝⁴:Ring Rm:Type u_2inst✝³:Fintype minst✝²:DecidableEq mn:Type u_3inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rh:IsNil (TwoSidedIdeal.matrix (n ⊕ m) I)M:Matrix n n RhM:M ∈ TwoSidedIdeal.matrix n IhM':fromBlocks M 0 0 0 ∈ TwoSidedIdeal.matrix (n ⊕ m) Ik✝:ℕhk:fromBlocks M 0 0 0 ^ k = 0k:ℕ⊢ fromBlocks M 0 0 0 ^ (k + 1) = fromBlocks (M ^ (k + 1)) 0 0 0 R:Type u_1inst✝⁴:Ring Rm:Type u_2inst✝³:Fintype minst✝²:DecidableEq mn:Type u_3inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rh:IsNil (TwoSidedIdeal.matrix (n ⊕ m) I)M:Matrix n n RhM:M ∈ TwoSidedIdeal.matrix n IhM':fromBlocks M 0 0 0 ∈ TwoSidedIdeal.matrix (n ⊕ m) Ik:ℕhk:fromBlocks M 0 0 0 ^ k = 0key:∀ (k : ℕ), fromBlocks M 0 0 0 ^ (k + 1) = fromBlocks (M ^ (k + 1)) 0 0 0⊢ IsNilpotent M
induction k with
| zero => zero R:Type u_1inst✝⁴:Ring Rm:Type u_2inst✝³:Fintype minst✝²:DecidableEq mn:Type u_3inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rh:IsNil (TwoSidedIdeal.matrix (n ⊕ m) I)M:Matrix n n RhM:M ∈ TwoSidedIdeal.matrix n IhM':fromBlocks M 0 0 0 ∈ TwoSidedIdeal.matrix (n ⊕ m) Ik:ℕhk:fromBlocks M 0 0 0 ^ k = 0⊢ fromBlocks M 0 0 0 ^ (0 + 1) = fromBlocks (M ^ (0 + 1)) 0 0 0 R:Type u_1inst✝⁴:Ring Rm:Type u_2inst✝³:Fintype minst✝²:DecidableEq mn:Type u_3inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rh:IsNil (TwoSidedIdeal.matrix (n ⊕ m) I)M:Matrix n n RhM:M ∈ TwoSidedIdeal.matrix n IhM':fromBlocks M 0 0 0 ∈ TwoSidedIdeal.matrix (n ⊕ m) Ik:ℕhk:fromBlocks M 0 0 0 ^ k = 0key:∀ (k : ℕ), fromBlocks M 0 0 0 ^ (k + 1) = fromBlocks (M ^ (k + 1)) 0 0 0⊢ IsNilpotent M simp All goals completed! 🐙 R:Type u_1inst✝⁴:Ring Rm:Type u_2inst✝³:Fintype minst✝²:DecidableEq mn:Type u_3inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rh:IsNil (TwoSidedIdeal.matrix (n ⊕ m) I)M:Matrix n n RhM:M ∈ TwoSidedIdeal.matrix n IhM':fromBlocks M 0 0 0 ∈ TwoSidedIdeal.matrix (n ⊕ m) Ik:ℕhk:fromBlocks M 0 0 0 ^ k = 0key:∀ (k : ℕ), fromBlocks M 0 0 0 ^ (k + 1) = fromBlocks (M ^ (k + 1)) 0 0 0⊢ IsNilpotent M
| succ k ih => succ R:Type u_1inst✝⁴:Ring Rm:Type u_2inst✝³:Fintype minst✝²:DecidableEq mn:Type u_3inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rh:IsNil (TwoSidedIdeal.matrix (n ⊕ m) I)M:Matrix n n RhM:M ∈ TwoSidedIdeal.matrix n IhM':fromBlocks M 0 0 0 ∈ TwoSidedIdeal.matrix (n ⊕ m) Ik✝:ℕhk:fromBlocks M 0 0 0 ^ k = 0k:ℕih:fromBlocks M 0 0 0 ^ (k + 1) = fromBlocks (M ^ (k + 1)) 0 0 0⊢ fromBlocks M 0 0 0 ^ (k + 1 + 1) = fromBlocks (M ^ (k + 1 + 1)) 0 0 0 R:Type u_1inst✝⁴:Ring Rm:Type u_2inst✝³:Fintype minst✝²:DecidableEq mn:Type u_3inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rh:IsNil (TwoSidedIdeal.matrix (n ⊕ m) I)M:Matrix n n RhM:M ∈ TwoSidedIdeal.matrix n IhM':fromBlocks M 0 0 0 ∈ TwoSidedIdeal.matrix (n ⊕ m) Ik:ℕhk:fromBlocks M 0 0 0 ^ k = 0key:∀ (k : ℕ), fromBlocks M 0 0 0 ^ (k + 1) = fromBlocks (M ^ (k + 1)) 0 0 0⊢ IsNilpotent M rw [pow_succ, succ R:Type u_1inst✝⁴:Ring Rm:Type u_2inst✝³:Fintype minst✝²:DecidableEq mn:Type u_3inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rh:IsNil (TwoSidedIdeal.matrix (n ⊕ m) I)M:Matrix n n RhM:M ∈ TwoSidedIdeal.matrix n IhM':fromBlocks M 0 0 0 ∈ TwoSidedIdeal.matrix (n ⊕ m) Ik✝:ℕhk:fromBlocks M 0 0 0 ^ k = 0k:ℕih:fromBlocks M 0 0 0 ^ (k + 1) = fromBlocks (M ^ (k + 1)) 0 0 0⊢ fromBlocks M 0 0 0 ^ (k + 1) * fromBlocks M 0 0 0 = fromBlocks (M ^ (k + 1 + 1)) 0 0 0 succ R:Type u_1inst✝⁴:Ring Rm:Type u_2inst✝³:Fintype minst✝²:DecidableEq mn:Type u_3inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rh:IsNil (TwoSidedIdeal.matrix (n ⊕ m) I)M:Matrix n n RhM:M ∈ TwoSidedIdeal.matrix n IhM':fromBlocks M 0 0 0 ∈ TwoSidedIdeal.matrix (n ⊕ m) Ik✝:ℕhk:fromBlocks M 0 0 0 ^ k = 0k:ℕih:fromBlocks M 0 0 0 ^ (k + 1) = fromBlocks (M ^ (k + 1)) 0 0 0⊢ fromBlocks (M ^ (k + 1) * M + 0 * 0) (M ^ (k + 1) * 0 + 0 * 0) (0 * M + 0 * 0) (0 * 0 + 0 * 0) =
fromBlocks (M ^ (k + 1 + 1)) 0 0 0 R:Type u_1inst✝⁴:Ring Rm:Type u_2inst✝³:Fintype minst✝²:DecidableEq mn:Type u_3inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rh:IsNil (TwoSidedIdeal.matrix (n ⊕ m) I)M:Matrix n n RhM:M ∈ TwoSidedIdeal.matrix n IhM':fromBlocks M 0 0 0 ∈ TwoSidedIdeal.matrix (n ⊕ m) Ik:ℕhk:fromBlocks M 0 0 0 ^ k = 0key:∀ (k : ℕ), fromBlocks M 0 0 0 ^ (k + 1) = fromBlocks (M ^ (k + 1)) 0 0 0⊢ IsNilpotent M ih, succ R:Type u_1inst✝⁴:Ring Rm:Type u_2inst✝³:Fintype minst✝²:DecidableEq mn:Type u_3inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rh:IsNil (TwoSidedIdeal.matrix (n ⊕ m) I)M:Matrix n n RhM:M ∈ TwoSidedIdeal.matrix n IhM':fromBlocks M 0 0 0 ∈ TwoSidedIdeal.matrix (n ⊕ m) Ik✝:ℕhk:fromBlocks M 0 0 0 ^ k = 0k:ℕih:fromBlocks M 0 0 0 ^ (k + 1) = fromBlocks (M ^ (k + 1)) 0 0 0⊢ fromBlocks (M ^ (k + 1)) 0 0 0 * fromBlocks M 0 0 0 = fromBlocks (M ^ (k + 1 + 1)) 0 0 0succ R:Type u_1inst✝⁴:Ring Rm:Type u_2inst✝³:Fintype minst✝²:DecidableEq mn:Type u_3inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rh:IsNil (TwoSidedIdeal.matrix (n ⊕ m) I)M:Matrix n n RhM:M ∈ TwoSidedIdeal.matrix n IhM':fromBlocks M 0 0 0 ∈ TwoSidedIdeal.matrix (n ⊕ m) Ik✝:ℕhk:fromBlocks M 0 0 0 ^ k = 0k:ℕih:fromBlocks M 0 0 0 ^ (k + 1) = fromBlocks (M ^ (k + 1)) 0 0 0⊢ fromBlocks (M ^ (k + 1) * M + 0 * 0) (M ^ (k + 1) * 0 + 0 * 0) (0 * M + 0 * 0) (0 * 0 + 0 * 0) =
fromBlocks (M ^ (k + 1 + 1)) 0 0 0 R:Type u_1inst✝⁴:Ring Rm:Type u_2inst✝³:Fintype minst✝²:DecidableEq mn:Type u_3inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rh:IsNil (TwoSidedIdeal.matrix (n ⊕ m) I)M:Matrix n n RhM:M ∈ TwoSidedIdeal.matrix n IhM':fromBlocks M 0 0 0 ∈ TwoSidedIdeal.matrix (n ⊕ m) Ik:ℕhk:fromBlocks M 0 0 0 ^ k = 0key:∀ (k : ℕ), fromBlocks M 0 0 0 ^ (k + 1) = fromBlocks (M ^ (k + 1)) 0 0 0⊢ IsNilpotent M Matrix.fromBlocks_multiply succ R:Type u_1inst✝⁴:Ring Rm:Type u_2inst✝³:Fintype minst✝²:DecidableEq mn:Type u_3inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rh:IsNil (TwoSidedIdeal.matrix (n ⊕ m) I)M:Matrix n n RhM:M ∈ TwoSidedIdeal.matrix n IhM':fromBlocks M 0 0 0 ∈ TwoSidedIdeal.matrix (n ⊕ m) Ik✝:ℕhk:fromBlocks M 0 0 0 ^ k = 0k:ℕih:fromBlocks M 0 0 0 ^ (k + 1) = fromBlocks (M ^ (k + 1)) 0 0 0⊢ fromBlocks (M ^ (k + 1) * M + 0 * 0) (M ^ (k + 1) * 0 + 0 * 0) (0 * M + 0 * 0) (0 * 0 + 0 * 0) =
fromBlocks (M ^ (k + 1 + 1)) 0 0 0succ R:Type u_1inst✝⁴:Ring Rm:Type u_2inst✝³:Fintype minst✝²:DecidableEq mn:Type u_3inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rh:IsNil (TwoSidedIdeal.matrix (n ⊕ m) I)M:Matrix n n RhM:M ∈ TwoSidedIdeal.matrix n IhM':fromBlocks M 0 0 0 ∈ TwoSidedIdeal.matrix (n ⊕ m) Ik✝:ℕhk:fromBlocks M 0 0 0 ^ k = 0k:ℕih:fromBlocks M 0 0 0 ^ (k + 1) = fromBlocks (M ^ (k + 1)) 0 0 0⊢ fromBlocks (M ^ (k + 1) * M + 0 * 0) (M ^ (k + 1) * 0 + 0 * 0) (0 * M + 0 * 0) (0 * 0 + 0 * 0) =
fromBlocks (M ^ (k + 1 + 1)) 0 0 0 R:Type u_1inst✝⁴:Ring Rm:Type u_2inst✝³:Fintype minst✝²:DecidableEq mn:Type u_3inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rh:IsNil (TwoSidedIdeal.matrix (n ⊕ m) I)M:Matrix n n RhM:M ∈ TwoSidedIdeal.matrix n IhM':fromBlocks M 0 0 0 ∈ TwoSidedIdeal.matrix (n ⊕ m) Ik:ℕhk:fromBlocks M 0 0 0 ^ k = 0key:∀ (k : ℕ), fromBlocks M 0 0 0 ^ (k + 1) = fromBlocks (M ^ (k + 1)) 0 0 0⊢ IsNilpotent M]succ R:Type u_1inst✝⁴:Ring Rm:Type u_2inst✝³:Fintype minst✝²:DecidableEq mn:Type u_3inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rh:IsNil (TwoSidedIdeal.matrix (n ⊕ m) I)M:Matrix n n RhM:M ∈ TwoSidedIdeal.matrix n IhM':fromBlocks M 0 0 0 ∈ TwoSidedIdeal.matrix (n ⊕ m) Ik✝:ℕhk:fromBlocks M 0 0 0 ^ k = 0k:ℕih:fromBlocks M 0 0 0 ^ (k + 1) = fromBlocks (M ^ (k + 1)) 0 0 0⊢ fromBlocks (M ^ (k + 1) * M + 0 * 0) (M ^ (k + 1) * 0 + 0 * 0) (0 * M + 0 * 0) (0 * 0 + 0 * 0) =
fromBlocks (M ^ (k + 1 + 1)) 0 0 0 R:Type u_1inst✝⁴:Ring Rm:Type u_2inst✝³:Fintype minst✝²:DecidableEq mn:Type u_3inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rh:IsNil (TwoSidedIdeal.matrix (n ⊕ m) I)M:Matrix n n RhM:M ∈ TwoSidedIdeal.matrix n IhM':fromBlocks M 0 0 0 ∈ TwoSidedIdeal.matrix (n ⊕ m) Ik:ℕhk:fromBlocks M 0 0 0 ^ k = 0key:∀ (k : ℕ), fromBlocks M 0 0 0 ^ (k + 1) = fromBlocks (M ^ (k + 1)) 0 0 0⊢ IsNilpotent M; simp [pow_succ] R:Type u_1inst✝⁴:Ring Rm:Type u_2inst✝³:Fintype minst✝²:DecidableEq mn:Type u_3inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rh:IsNil (TwoSidedIdeal.matrix (n ⊕ m) I)M:Matrix n n RhM:M ∈ TwoSidedIdeal.matrix n IhM':fromBlocks M 0 0 0 ∈ TwoSidedIdeal.matrix (n ⊕ m) Ik:ℕhk:fromBlocks M 0 0 0 ^ k = 0key:∀ (k : ℕ), fromBlocks M 0 0 0 ^ (k + 1) = fromBlocks (M ^ (k + 1)) 0 0 0⊢ IsNilpotent M R:Type u_1inst✝⁴:Ring Rm:Type u_2inst✝³:Fintype minst✝²:DecidableEq mn:Type u_3inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rh:IsNil (TwoSidedIdeal.matrix (n ⊕ m) I)M:Matrix n n RhM:M ∈ TwoSidedIdeal.matrix n IhM':fromBlocks M 0 0 0 ∈ TwoSidedIdeal.matrix (n ⊕ m) Ik:ℕhk:fromBlocks M 0 0 0 ^ k = 0key:∀ (k : ℕ), fromBlocks M 0 0 0 ^ (k + 1) = fromBlocks (M ^ (k + 1)) 0 0 0⊢ IsNilpotent M
have := key k R:Type u_1inst✝⁴:Ring Rm:Type u_2inst✝³:Fintype minst✝²:DecidableEq mn:Type u_3inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rh:IsNil (TwoSidedIdeal.matrix (n ⊕ m) I)M:Matrix n n RhM:M ∈ TwoSidedIdeal.matrix n IhM':fromBlocks M 0 0 0 ∈ TwoSidedIdeal.matrix (n ⊕ m) Ik:ℕhk:fromBlocks M 0 0 0 ^ k = 0key:∀ (k : ℕ), fromBlocks M 0 0 0 ^ (k + 1) = fromBlocks (M ^ (k + 1)) 0 0 0this:fromBlocks M 0 0 0 ^ (k + 1) = fromBlocks (M ^ (k + 1)) 0 0 0⊢ IsNilpotent M
rw [pow_succ, R:Type u_1inst✝⁴:Ring Rm:Type u_2inst✝³:Fintype minst✝²:DecidableEq mn:Type u_3inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rh:IsNil (TwoSidedIdeal.matrix (n ⊕ m) I)M:Matrix n n RhM:M ∈ TwoSidedIdeal.matrix n IhM':fromBlocks M 0 0 0 ∈ TwoSidedIdeal.matrix (n ⊕ m) Ik:ℕhk:fromBlocks M 0 0 0 ^ k = 0key:∀ (k : ℕ), fromBlocks M 0 0 0 ^ (k + 1) = fromBlocks (M ^ (k + 1)) 0 0 0this:fromBlocks M 0 0 0 ^ k * fromBlocks M 0 0 0 = fromBlocks (M ^ (k + 1)) 0 0 0⊢ IsNilpotent M R:Type u_1inst✝⁴:Ring Rm:Type u_2inst✝³:Fintype minst✝²:DecidableEq mn:Type u_3inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rh:IsNil (TwoSidedIdeal.matrix (n ⊕ m) I)M:Matrix n n RhM:M ∈ TwoSidedIdeal.matrix n IhM':fromBlocks M 0 0 0 ∈ TwoSidedIdeal.matrix (n ⊕ m) Ik:ℕhk:fromBlocks M 0 0 0 ^ k = 0key:∀ (k : ℕ), fromBlocks M 0 0 0 ^ (k + 1) = fromBlocks (M ^ (k + 1)) 0 0 0this:0 = fromBlocks (M ^ (k + 1)) 0 0 0⊢ IsNilpotent M hk, R:Type u_1inst✝⁴:Ring Rm:Type u_2inst✝³:Fintype minst✝²:DecidableEq mn:Type u_3inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rh:IsNil (TwoSidedIdeal.matrix (n ⊕ m) I)M:Matrix n n RhM:M ∈ TwoSidedIdeal.matrix n IhM':fromBlocks M 0 0 0 ∈ TwoSidedIdeal.matrix (n ⊕ m) Ik:ℕhk:fromBlocks M 0 0 0 ^ k = 0key:∀ (k : ℕ), fromBlocks M 0 0 0 ^ (k + 1) = fromBlocks (M ^ (k + 1)) 0 0 0this:0 * fromBlocks M 0 0 0 = fromBlocks (M ^ (k + 1)) 0 0 0⊢ IsNilpotent M R:Type u_1inst✝⁴:Ring Rm:Type u_2inst✝³:Fintype minst✝²:DecidableEq mn:Type u_3inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rh:IsNil (TwoSidedIdeal.matrix (n ⊕ m) I)M:Matrix n n RhM:M ∈ TwoSidedIdeal.matrix n IhM':fromBlocks M 0 0 0 ∈ TwoSidedIdeal.matrix (n ⊕ m) Ik:ℕhk:fromBlocks M 0 0 0 ^ k = 0key:∀ (k : ℕ), fromBlocks M 0 0 0 ^ (k + 1) = fromBlocks (M ^ (k + 1)) 0 0 0this:0 = fromBlocks (M ^ (k + 1)) 0 0 0⊢ IsNilpotent M zero_mul R:Type u_1inst✝⁴:Ring Rm:Type u_2inst✝³:Fintype minst✝²:DecidableEq mn:Type u_3inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rh:IsNil (TwoSidedIdeal.matrix (n ⊕ m) I)M:Matrix n n RhM:M ∈ TwoSidedIdeal.matrix n IhM':fromBlocks M 0 0 0 ∈ TwoSidedIdeal.matrix (n ⊕ m) Ik:ℕhk:fromBlocks M 0 0 0 ^ k = 0key:∀ (k : ℕ), fromBlocks M 0 0 0 ^ (k + 1) = fromBlocks (M ^ (k + 1)) 0 0 0this:0 = fromBlocks (M ^ (k + 1)) 0 0 0⊢ IsNilpotent M R:Type u_1inst✝⁴:Ring Rm:Type u_2inst✝³:Fintype minst✝²:DecidableEq mn:Type u_3inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rh:IsNil (TwoSidedIdeal.matrix (n ⊕ m) I)M:Matrix n n RhM:M ∈ TwoSidedIdeal.matrix n IhM':fromBlocks M 0 0 0 ∈ TwoSidedIdeal.matrix (n ⊕ m) Ik:ℕhk:fromBlocks M 0 0 0 ^ k = 0key:∀ (k : ℕ), fromBlocks M 0 0 0 ^ (k + 1) = fromBlocks (M ^ (k + 1)) 0 0 0this:0 = fromBlocks (M ^ (k + 1)) 0 0 0⊢ IsNilpotent M] at this R:Type u_1inst✝⁴:Ring Rm:Type u_2inst✝³:Fintype minst✝²:DecidableEq mn:Type u_3inst✝¹:Fintype ninst✝:DecidableEq nI:TwoSidedIdeal Rh:IsNil (TwoSidedIdeal.matrix (n ⊕ m) I)M:Matrix n n RhM:M ∈ TwoSidedIdeal.matrix n IhM':fromBlocks M 0 0 0 ∈ TwoSidedIdeal.matrix (n ⊕ m) Ik:ℕhk:fromBlocks M 0 0 0 ^ k = 0key:∀ (k : ℕ), fromBlocks M 0 0 0 ^ (k + 1) = fromBlocks (M ^ (k + 1)) 0 0 0this:0 = fromBlocks (M ^ (k + 1)) 0 0 0⊢ IsNilpotent M
exact ⟨k + 1, (Matrix.fromBlocks_inj.mp (this.symm.trans Matrix.fromBlocks_zero.symm)).1⟩ All goals completed! 🐙end MatrixTransfer
If M_2(J) is nil for every nil ideal J of every ring in universe u, then nilness of
M_m(I) implies nilness of M_{2m}(I), using M_2(M_m(R)) ≃ M_{2m}(R).
@[category API, AMS 16]
theorem isNil_matrix_prod_of_two_by_two_matrix
(h : type_of% @KotherConjecture.variants.two_by_two_matrix.{u}) {R : Type u} [Ring R]
{m : Type} [Fintype m] [DecidableEq m] {I : TwoSidedIdeal R}
(hm : IsNil (TwoSidedIdeal.matrix m I)) : IsNil (TwoSidedIdeal.matrix (Fin 2 × m) I) := by h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R}, IsNil I → IsNil (TwoSidedIdeal.matrix (Fin 2) I)R:Type uinst✝²:Ring Rm:Typeinst✝¹:Fintype minst✝:DecidableEq mI:TwoSidedIdeal Rhm:IsNil (TwoSidedIdeal.matrix m I)⊢ IsNil (TwoSidedIdeal.matrix (Fin 2 × m) I)
intro M hM h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R}, IsNil I → IsNil (TwoSidedIdeal.matrix (Fin 2) I)R:Type uinst✝²:Ring Rm:Typeinst✝¹:Fintype minst✝:DecidableEq mI:TwoSidedIdeal Rhm:IsNil (TwoSidedIdeal.matrix m I)M:Matrix (Fin 2 × m) (Fin 2 × m) RhM:M ∈ TwoSidedIdeal.matrix (Fin 2 × m) I⊢ IsNilpotent M
have hM' : (Matrix.compRingEquiv (Fin 2) m R).symm M ∈
TwoSidedIdeal.matrix (Fin 2) (TwoSidedIdeal.matrix m I) :=
fun a b c d => hM _ _ h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R}, IsNil I → IsNil (TwoSidedIdeal.matrix (Fin 2) I)R:Type uinst✝²:Ring Rm:Typeinst✝¹:Fintype minst✝:DecidableEq mI:TwoSidedIdeal Rhm:IsNil (TwoSidedIdeal.matrix m I)M:Matrix (Fin 2 × m) (Fin 2 × m) RhM:M ∈ TwoSidedIdeal.matrix (Fin 2 × m) IhM':(compRingEquiv (Fin 2) m R).symm M ∈ TwoSidedIdeal.matrix (Fin 2) (TwoSidedIdeal.matrix m I)⊢ IsNilpotent M
simpa using (h hm _ hM').map (Matrix.compRingEquiv (Fin 2) m R) All goals completed! 🐙
The 2 × 2 matrix formulation of the Köthe conjecture (for rings in universe u) implies
the general matrix formulation (Krempa): one first deduces the case of 2 ^ k × 2 ^ k matrices
by induction and then embeds M_n(R) in a corner of M_{2 ^ k}(R).
@[category research solved, AMS 16]
theorem KotherConjecture.variants.general_matrix_of_two_by_two_matrix
(h : type_of% @KotherConjecture.variants.two_by_two_matrix.{u}) :
type_of% @KotherConjecture.variants.general_matrix.{u, v} := by h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R}, IsNil I → IsNil (TwoSidedIdeal.matrix (Fin 2) I)⊢ ∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)
classical
intro R _ I hI n _ h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R}, IsNil I → IsNil (TwoSidedIdeal.matrix (Fin 2) I)R:Type uinst✝¹:Ring RI:TwoSidedIdeal RhI:IsNil In:Type vinst✝:Fintype n⊢ IsNil (TwoSidedIdeal.matrix n I)
have key : ∀ k, IsNil (TwoSidedIdeal.matrix (Fin (k + 1) → Fin 2) I) := by h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R}, IsNil I → IsNil (TwoSidedIdeal.matrix (Fin 2) I)⊢ ∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I) h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R}, IsNil I → IsNil (TwoSidedIdeal.matrix (Fin 2) I)R:Type uinst✝¹:Ring RI:TwoSidedIdeal RhI:IsNil In:Type vinst✝:Fintype nkey:∀ (k : ℕ), IsNil (TwoSidedIdeal.matrix (Fin (k + 1) → Fin 2) I)⊢ IsNil (TwoSidedIdeal.matrix n I)
intro k h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R}, IsNil I → IsNil (TwoSidedIdeal.matrix (Fin 2) I)R:Type uinst✝¹:Ring RI:TwoSidedIdeal RhI:IsNil In:Type vinst✝:Fintype nk:ℕ⊢ IsNil (TwoSidedIdeal.matrix (Fin (k + 1) → Fin 2) I) h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R}, IsNil I → IsNil (TwoSidedIdeal.matrix (Fin 2) I)R:Type uinst✝¹:Ring RI:TwoSidedIdeal RhI:IsNil In:Type vinst✝:Fintype nkey:∀ (k : ℕ), IsNil (TwoSidedIdeal.matrix (Fin (k + 1) → Fin 2) I)⊢ IsNil (TwoSidedIdeal.matrix n I)
induction k with
| zero => zero h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R}, IsNil I → IsNil (TwoSidedIdeal.matrix (Fin 2) I)R:Type uinst✝¹:Ring RI:TwoSidedIdeal RhI:IsNil In:Type vinst✝:Fintype n⊢ IsNil (TwoSidedIdeal.matrix (Fin (0 + 1) → Fin 2) I) h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R}, IsNil I → IsNil (TwoSidedIdeal.matrix (Fin 2) I)R:Type uinst✝¹:Ring RI:TwoSidedIdeal RhI:IsNil In:Type vinst✝:Fintype nkey:∀ (k : ℕ), IsNil (TwoSidedIdeal.matrix (Fin (k + 1) → Fin 2) I)⊢ IsNil (TwoSidedIdeal.matrix n I) exact isNil_matrix_of_equiv (Equiv.funUnique (Fin 1) (Fin 2)).symm (h hI) All goals completed! 🐙 h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R}, IsNil I → IsNil (TwoSidedIdeal.matrix (Fin 2) I)R:Type uinst✝¹:Ring RI:TwoSidedIdeal RhI:IsNil In:Type vinst✝:Fintype nkey:∀ (k : ℕ), IsNil (TwoSidedIdeal.matrix (Fin (k + 1) → Fin 2) I)⊢ IsNil (TwoSidedIdeal.matrix n I)
| succ k ih => succ h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R}, IsNil I → IsNil (TwoSidedIdeal.matrix (Fin 2) I)R:Type uinst✝¹:Ring RI:TwoSidedIdeal RhI:IsNil In:Type vinst✝:Fintype nk:ℕih:IsNil (TwoSidedIdeal.matrix (Fin (k + 1) → Fin 2) I)⊢ IsNil (TwoSidedIdeal.matrix (Fin (k + 1 + 1) → Fin 2) I) h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R}, IsNil I → IsNil (TwoSidedIdeal.matrix (Fin 2) I)R:Type uinst✝¹:Ring RI:TwoSidedIdeal RhI:IsNil In:Type vinst✝:Fintype nkey:∀ (k : ℕ), IsNil (TwoSidedIdeal.matrix (Fin (k + 1) → Fin 2) I)⊢ IsNil (TwoSidedIdeal.matrix n I)
exact isNil_matrix_of_equiv (Fin.consEquiv fun _ => Fin 2)
(isNil_matrix_prod_of_two_by_two_matrix h ih) h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R}, IsNil I → IsNil (TwoSidedIdeal.matrix (Fin 2) I)R:Type uinst✝¹:Ring RI:TwoSidedIdeal RhI:IsNil In:Type vinst✝:Fintype nkey:∀ (k : ℕ), IsNil (TwoSidedIdeal.matrix (Fin (k + 1) → Fin 2) I)⊢ IsNil (TwoSidedIdeal.matrix n I) h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R}, IsNil I → IsNil (TwoSidedIdeal.matrix (Fin 2) I)R:Type uinst✝¹:Ring RI:TwoSidedIdeal RhI:IsNil In:Type vinst✝:Fintype nkey:∀ (k : ℕ), IsNil (TwoSidedIdeal.matrix (Fin (k + 1) → Fin 2) I)⊢ IsNil (TwoSidedIdeal.matrix n I)
have hle : Fintype.card n ≤ 2 ^ (Fintype.card n + 1) :=
Nat.lt_two_pow_self.le.trans (Nat.pow_le_pow_right two_pos (Nat.le_succ _)) h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R}, IsNil I → IsNil (TwoSidedIdeal.matrix (Fin 2) I)R:Type uinst✝¹:Ring RI:TwoSidedIdeal RhI:IsNil In:Type vinst✝:Fintype nkey:∀ (k : ℕ), IsNil (TwoSidedIdeal.matrix (Fin (k + 1) → Fin 2) I)hle:Fintype.card n ≤ 2 ^ (Fintype.card n + 1)⊢ IsNil (TwoSidedIdeal.matrix n I)
have e : n ⊕ Fin (2 ^ (Fintype.card n + 1) - Fintype.card n) ≃
(Fin (Fintype.card n + 1) → Fin 2) :=
Fintype.equivOfCardEq (by h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R}, IsNil I → IsNil (TwoSidedIdeal.matrix (Fin 2) I)R:Type uinst✝¹:Ring RI:TwoSidedIdeal RhI:IsNil In:Type vinst✝:Fintype nkey:∀ (k : ℕ), IsNil (TwoSidedIdeal.matrix (Fin (k + 1) → Fin 2) I)hle:Fintype.card n ≤ 2 ^ (Fintype.card n + 1)⊢ Fintype.card (n ⊕ Fin (2 ^ (Fintype.card n + 1) - Fintype.card n)) = Fintype.card (Fin (Fintype.card n + 1) → Fin 2) h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R}, IsNil I → IsNil (TwoSidedIdeal.matrix (Fin 2) I)R:Type uinst✝¹:Ring RI:TwoSidedIdeal RhI:IsNil In:Type vinst✝:Fintype nkey:∀ (k : ℕ), IsNil (TwoSidedIdeal.matrix (Fin (k + 1) → Fin 2) I)hle:Fintype.card n ≤ 2 ^ (Fintype.card n + 1)e:n ⊕ Fin (2 ^ (Fintype.card n + 1) - Fintype.card n) ≃ (Fin (Fintype.card n + 1) → Fin 2)⊢ IsNil (TwoSidedIdeal.matrix n I) simp h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R}, IsNil I → IsNil (TwoSidedIdeal.matrix (Fin 2) I)R:Type uinst✝¹:Ring RI:TwoSidedIdeal RhI:IsNil In:Type vinst✝:Fintype nkey:∀ (k : ℕ), IsNil (TwoSidedIdeal.matrix (Fin (k + 1) → Fin 2) I)hle:Fintype.card n ≤ 2 ^ (Fintype.card n + 1)⊢ Fintype.card n + (2 ^ (Fintype.card n + 1) - Fintype.card n) = 2 ^ (Fintype.card n + 1) h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R}, IsNil I → IsNil (TwoSidedIdeal.matrix (Fin 2) I)R:Type uinst✝¹:Ring RI:TwoSidedIdeal RhI:IsNil In:Type vinst✝:Fintype nkey:∀ (k : ℕ), IsNil (TwoSidedIdeal.matrix (Fin (k + 1) → Fin 2) I)hle:Fintype.card n ≤ 2 ^ (Fintype.card n + 1)e:n ⊕ Fin (2 ^ (Fintype.card n + 1) - Fintype.card n) ≃ (Fin (Fintype.card n + 1) → Fin 2)⊢ IsNil (TwoSidedIdeal.matrix n I); omega All goals completed! 🐙 h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R}, IsNil I → IsNil (TwoSidedIdeal.matrix (Fin 2) I)R:Type uinst✝¹:Ring RI:TwoSidedIdeal RhI:IsNil In:Type vinst✝:Fintype nkey:∀ (k : ℕ), IsNil (TwoSidedIdeal.matrix (Fin (k + 1) → Fin 2) I)hle:Fintype.card n ≤ 2 ^ (Fintype.card n + 1)e:n ⊕ Fin (2 ^ (Fintype.card n + 1) - Fintype.card n) ≃ (Fin (Fintype.card n + 1) → Fin 2)⊢ IsNil (TwoSidedIdeal.matrix n I)) h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R}, IsNil I → IsNil (TwoSidedIdeal.matrix (Fin 2) I)R:Type uinst✝¹:Ring RI:TwoSidedIdeal RhI:IsNil In:Type vinst✝:Fintype nkey:∀ (k : ℕ), IsNil (TwoSidedIdeal.matrix (Fin (k + 1) → Fin 2) I)hle:Fintype.card n ≤ 2 ^ (Fintype.card n + 1)e:n ⊕ Fin (2 ^ (Fintype.card n + 1) - Fintype.card n) ≃ (Fin (Fintype.card n + 1) → Fin 2)⊢ IsNil (TwoSidedIdeal.matrix n I)
exact isNil_matrix_of_sum (isNil_matrix_of_equiv e.symm (key _)) All goals completed! 🐙The formulation of the Köthe conjecture in terms of the Köthe radical of matrix rings implies the general matrix formulation.
@[category research solved, AMS 16]
theorem KotherConjecture.variants.general_matrix_of_matrixOver_KotherRadical
(h : type_of% @KotherConjecture.variants.matrixOver_KotherRadical.{u, v}) :
type_of% @KotherConjecture.variants.general_matrix.{u, v} := by h:∀ {R : Type u} [inst : Ring R] (n : Type v) [inst_1 : Fintype n], TwoSidedIdeal.matrix n (Nil* R) = Nil* Matrix n n R⊢ ∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)
classical
intro R _ I hI n _ h:∀ {R : Type u} [inst : Ring R] (n : Type v) [inst_1 : Fintype n], TwoSidedIdeal.matrix n (Nil* R) = Nil* Matrix n n RR:Type uinst✝¹:Ring RI:TwoSidedIdeal RhI:IsNil In:Type vinst✝:Fintype n⊢ IsNil (TwoSidedIdeal.matrix n I)
refine (isNil_kotheRadical (Matrix n n R)).mono ?_ h:∀ {R : Type u} [inst : Ring R] (n : Type v) [inst_1 : Fintype n], TwoSidedIdeal.matrix n (Nil* R) = Nil* Matrix n n RR:Type uinst✝¹:Ring RI:TwoSidedIdeal RhI:IsNil In:Type vinst✝:Fintype n⊢ ↑(TwoSidedIdeal.matrix n I) ⊆ ↑(Nil* Matrix n n R)
rw [← h n h:∀ {R : Type u} [inst : Ring R] (n : Type v) [inst_1 : Fintype n], TwoSidedIdeal.matrix n (Nil* R) = Nil* Matrix n n RR:Type uinst✝¹:Ring RI:TwoSidedIdeal RhI:IsNil In:Type vinst✝:Fintype n⊢ ↑(TwoSidedIdeal.matrix n I) ⊆ ↑(TwoSidedIdeal.matrix n (Nil* R)) h:∀ {R : Type u} [inst : Ring R] (n : Type v) [inst_1 : Fintype n], TwoSidedIdeal.matrix n (Nil* R) = Nil* Matrix n n RR:Type uinst✝¹:Ring RI:TwoSidedIdeal RhI:IsNil In:Type vinst✝:Fintype n⊢ ↑(TwoSidedIdeal.matrix n I) ⊆ ↑(TwoSidedIdeal.matrix n (Nil* R))] h:∀ {R : Type u} [inst : Ring R] (n : Type v) [inst_1 : Fintype n], TwoSidedIdeal.matrix n (Nil* R) = Nil* Matrix n n RR:Type uinst✝¹:Ring RI:TwoSidedIdeal RhI:IsNil In:Type vinst✝:Fintype n⊢ ↑(TwoSidedIdeal.matrix n I) ⊆ ↑(TwoSidedIdeal.matrix n (Nil* R))
exact TwoSidedIdeal.le_iff.mp (TwoSidedIdeal.matrix_monotone n (le_sSup hI)) All goals completed! 🐙The general matrix formulation of the Köthe conjecture implies the formulation in terms of the Köthe radical of matrix rings.
@[category research solved, AMS 16]
theorem KotherConjecture.variants.matrixOver_KotherRadical_of_general_matrix
(h : type_of% @KotherConjecture.variants.general_matrix.{u, v}) :
type_of% @KotherConjecture.variants.matrixOver_KotherRadical.{u, v} := by h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)⊢ ∀ {R : Type u} [inst : Ring R] (n : Type v) [inst_1 : Fintype n], TwoSidedIdeal.matrix n (Nil* R) = Nil* Matrix n n R
classical
intro R _ n _ h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype n⊢ TwoSidedIdeal.matrix n (Nil* R) = Nil* Matrix n n R
refine le_antisymm (le_sSup (h (isNil_kotheRadical R) n)) ?_ h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype n⊢ (Nil* Matrix n n R) ≤ TwoSidedIdeal.matrix n (Nil* R)
intro N hN i j h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:n⊢ (Nil* R).ringCon (N i j) (0 i j)
have : Nonempty n := ⟨i⟩ h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty n⊢ (Nil* R).ringCon (N i j) (0 i j)
-- Every two-sided ideal of `Matrix n n R` is of the form `M_n(J)`.
obtain ⟨J, hJ⟩ :
∃ J : TwoSidedIdeal R, KotheRadical (Matrix n n R) = TwoSidedIdeal.matrix n J :=
⟨TwoSidedIdeal.equivMatrix.symm _,
((TwoSidedIdeal.equivMatrix (n := n)).apply_symm_apply _).symm⟩ h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n J⊢ (Nil* R).ringCon (N i j) (0 i j)
have hJnil : IsNil J := by h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)⊢ ∀ {R : Type u} [inst : Ring R] (n : Type v) [inst_1 : Fintype n], TwoSidedIdeal.matrix n (Nil* R) = Nil* Matrix n n R h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n JhJnil:IsNil J⊢ (Nil* R).ringCon (N i j) (0 i j)
intro r hr h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n Jr:Rhr:r ∈ J⊢ IsNilpotent r h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n JhJnil:IsNil J⊢ (Nil* R).ringCon (N i j) (0 i j)
have hmem : Matrix.single i i r ∈ Nil* (Matrix n n R) := by h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)⊢ ∀ {R : Type u} [inst : Ring R] (n : Type v) [inst_1 : Fintype n], TwoSidedIdeal.matrix n (Nil* R) = Nil* Matrix n n R h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n Jr:Rhr:r ∈ Jhmem:single i i r ∈ Nil* Matrix n n R⊢ IsNilpotent r h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n JhJnil:IsNil J⊢ (Nil* R).ringCon (N i j) (0 i j)
rw [hJ, h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n Jr:Rhr:r ∈ J⊢ single i i r ∈ TwoSidedIdeal.matrix n J h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n Jr:Rhr:r ∈ J⊢ ∀ (i_1 j : n), single i i r i_1 j ∈ J h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n Jr:Rhr:r ∈ Jhmem:single i i r ∈ Nil* Matrix n n R⊢ IsNilpotent r h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n JhJnil:IsNil J⊢ (Nil* R).ringCon (N i j) (0 i j) TwoSidedIdeal.mem_matrix h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n Jr:Rhr:r ∈ J⊢ ∀ (i_1 j : n), single i i r i_1 j ∈ J h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n Jr:Rhr:r ∈ J⊢ ∀ (i_1 j : n), single i i r i_1 j ∈ J h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n Jr:Rhr:r ∈ Jhmem:single i i r ∈ Nil* Matrix n n R⊢ IsNilpotent r h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n JhJnil:IsNil J⊢ (Nil* R).ringCon (N i j) (0 i j)] h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n Jr:Rhr:r ∈ J⊢ ∀ (i_1 j : n), single i i r i_1 j ∈ J h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n Jr:Rhr:r ∈ Jhmem:single i i r ∈ Nil* Matrix n n R⊢ IsNilpotent r h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n JhJnil:IsNil J⊢ (Nil* R).ringCon (N i j) (0 i j)
intro a b h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n Jr:Rhr:r ∈ Ja:nb:n⊢ single i i r a b ∈ J h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n Jr:Rhr:r ∈ Jhmem:single i i r ∈ Nil* Matrix n n R⊢ IsNilpotent r h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n JhJnil:IsNil J⊢ (Nil* R).ringCon (N i j) (0 i j)
by_cases hab : i = a ∧ i = b pos h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n Jr:Rhr:r ∈ Ja:nb:nhab:i = a ∧ i = b⊢ single i i r a b ∈ Jneg h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n Jr:Rhr:r ∈ Ja:nb:nhab:¬(i = a ∧ i = b)⊢ single i i r a b ∈ J h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n Jr:Rhr:r ∈ Jhmem:single i i r ∈ Nil* Matrix n n R⊢ IsNilpotent r h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n JhJnil:IsNil J⊢ (Nil* R).ringCon (N i j) (0 i j)
· pos h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n Jr:Rhr:r ∈ Ja:nb:nhab:i = a ∧ i = b⊢ single i i r a b ∈ J h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n Jr:Rhr:r ∈ Jhmem:single i i r ∈ Nil* Matrix n n R⊢ IsNilpotent r h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n JhJnil:IsNil J⊢ (Nil* R).ringCon (N i j) (0 i j) obtain ⟨rfl, rfl⟩ := hab pos h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n Jr:Rhr:r ∈ J⊢ single i i r i i ∈ J h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n Jr:Rhr:r ∈ Jhmem:single i i r ∈ Nil* Matrix n n R⊢ IsNilpotent r h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n JhJnil:IsNil J⊢ (Nil* R).ringCon (N i j) (0 i j)
simpa using hr All goals completed! 🐙 h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n Jr:Rhr:r ∈ Jhmem:single i i r ∈ Nil* Matrix n n R⊢ IsNilpotent r h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n JhJnil:IsNil J⊢ (Nil* R).ringCon (N i j) (0 i j)
· neg h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n Jr:Rhr:r ∈ Ja:nb:nhab:¬(i = a ∧ i = b)⊢ single i i r a b ∈ J h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n Jr:Rhr:r ∈ Jhmem:single i i r ∈ Nil* Matrix n n R⊢ IsNilpotent r h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n JhJnil:IsNil J⊢ (Nil* R).ringCon (N i j) (0 i j) rw [Matrix.single_apply_of_ne _ _ _ _ _ hab neg h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n Jr:Rhr:r ∈ Ja:nb:nhab:¬(i = a ∧ i = b)⊢ 0 ∈ J neg h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n Jr:Rhr:r ∈ Ja:nb:nhab:¬(i = a ∧ i = b)⊢ 0 ∈ J h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n Jr:Rhr:r ∈ Jhmem:single i i r ∈ Nil* Matrix n n R⊢ IsNilpotent r h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n JhJnil:IsNil J⊢ (Nil* R).ringCon (N i j) (0 i j)]neg h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n Jr:Rhr:r ∈ Ja:nb:nhab:¬(i = a ∧ i = b)⊢ 0 ∈ J h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n Jr:Rhr:r ∈ Jhmem:single i i r ∈ Nil* Matrix n n R⊢ IsNilpotent r h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n JhJnil:IsNil J⊢ (Nil* R).ringCon (N i j) (0 i j)
exact J.zero_mem h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n Jr:Rhr:r ∈ Jhmem:single i i r ∈ Nil* Matrix n n R⊢ IsNilpotent r h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n JhJnil:IsNil J⊢ (Nil* R).ringCon (N i j) (0 i j) h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n Jr:Rhr:r ∈ Jhmem:single i i r ∈ Nil* Matrix n n R⊢ IsNilpotent r h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n JhJnil:IsNil J⊢ (Nil* R).ringCon (N i j) (0 i j)
obtain ⟨k, hk⟩ := isNil_kotheRadical (Matrix n n R) _ hmem h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n Jr:Rhr:r ∈ Jhmem:single i i r ∈ Nil* Matrix n n Rk:ℕhk:single i i r ^ k = 0⊢ IsNilpotent r h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n JhJnil:IsNil J⊢ (Nil* R).ringCon (N i j) (0 i j)
have hpow : ∀ k, Matrix.single i i r ^ (k + 1) = Matrix.single i i (r ^ (k + 1)) := by h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)⊢ ∀ {R : Type u} [inst : Ring R] (n : Type v) [inst_1 : Fintype n], TwoSidedIdeal.matrix n (Nil* R) = Nil* Matrix n n R h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n Jr:Rhr:r ∈ Jhmem:single i i r ∈ Nil* Matrix n n Rk:ℕhk:single i i r ^ k = 0hpow:∀ (k : ℕ), single i i r ^ (k + 1) = single i i (r ^ (k + 1))⊢ IsNilpotent r h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n JhJnil:IsNil J⊢ (Nil* R).ringCon (N i j) (0 i j)
intro k h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n Jr:Rhr:r ∈ Jhmem:single i i r ∈ Nil* Matrix n n Rk✝:ℕhk:single i i r ^ k = 0k:ℕ⊢ single i i r ^ (k + 1) = single i i (r ^ (k + 1)) h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n Jr:Rhr:r ∈ Jhmem:single i i r ∈ Nil* Matrix n n Rk:ℕhk:single i i r ^ k = 0hpow:∀ (k : ℕ), single i i r ^ (k + 1) = single i i (r ^ (k + 1))⊢ IsNilpotent r h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n JhJnil:IsNil J⊢ (Nil* R).ringCon (N i j) (0 i j)
induction k with
| zero => zero h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n Jr:Rhr:r ∈ Jhmem:single i i r ∈ Nil* Matrix n n Rk:ℕhk:single i i r ^ k = 0⊢ single i i r ^ (0 + 1) = single i i (r ^ (0 + 1)) h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n Jr:Rhr:r ∈ Jhmem:single i i r ∈ Nil* Matrix n n Rk:ℕhk:single i i r ^ k = 0hpow:∀ (k : ℕ), single i i r ^ (k + 1) = single i i (r ^ (k + 1))⊢ IsNilpotent r h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n JhJnil:IsNil J⊢ (Nil* R).ringCon (N i j) (0 i j) simp All goals completed! 🐙 h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n Jr:Rhr:r ∈ Jhmem:single i i r ∈ Nil* Matrix n n Rk:ℕhk:single i i r ^ k = 0hpow:∀ (k : ℕ), single i i r ^ (k + 1) = single i i (r ^ (k + 1))⊢ IsNilpotent r h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n JhJnil:IsNil J⊢ (Nil* R).ringCon (N i j) (0 i j)
| succ k ih => succ h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n Jr:Rhr:r ∈ Jhmem:single i i r ∈ Nil* Matrix n n Rk✝:ℕhk:single i i r ^ k = 0k:ℕih:single i i r ^ (k + 1) = single i i (r ^ (k + 1))⊢ single i i r ^ (k + 1 + 1) = single i i (r ^ (k + 1 + 1)) h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n Jr:Rhr:r ∈ Jhmem:single i i r ∈ Nil* Matrix n n Rk:ℕhk:single i i r ^ k = 0hpow:∀ (k : ℕ), single i i r ^ (k + 1) = single i i (r ^ (k + 1))⊢ IsNilpotent r h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n JhJnil:IsNil J⊢ (Nil* R).ringCon (N i j) (0 i j) rw [pow_succ, succ h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n Jr:Rhr:r ∈ Jhmem:single i i r ∈ Nil* Matrix n n Rk✝:ℕhk:single i i r ^ k = 0k:ℕih:single i i r ^ (k + 1) = single i i (r ^ (k + 1))⊢ single i i r ^ (k + 1) * single i i r = single i i (r ^ (k + 1 + 1)) h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n Jr:Rhr:r ∈ Jhmem:single i i r ∈ Nil* Matrix n n Rk:ℕhk:single i i r ^ k = 0hpow:∀ (k : ℕ), single i i r ^ (k + 1) = single i i (r ^ (k + 1))⊢ IsNilpotent r h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n JhJnil:IsNil J⊢ (Nil* R).ringCon (N i j) (0 i j) ih, succ h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n Jr:Rhr:r ∈ Jhmem:single i i r ∈ Nil* Matrix n n Rk✝:ℕhk:single i i r ^ k = 0k:ℕih:single i i r ^ (k + 1) = single i i (r ^ (k + 1))⊢ single i i (r ^ (k + 1)) * single i i r = single i i (r ^ (k + 1 + 1)) h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n Jr:Rhr:r ∈ Jhmem:single i i r ∈ Nil* Matrix n n Rk:ℕhk:single i i r ^ k = 0hpow:∀ (k : ℕ), single i i r ^ (k + 1) = single i i (r ^ (k + 1))⊢ IsNilpotent r h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n JhJnil:IsNil J⊢ (Nil* R).ringCon (N i j) (0 i j) Matrix.single_mul_single_same, succ h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n Jr:Rhr:r ∈ Jhmem:single i i r ∈ Nil* Matrix n n Rk✝:ℕhk:single i i r ^ k = 0k:ℕih:single i i r ^ (k + 1) = single i i (r ^ (k + 1))⊢ single i i (r ^ (k + 1) * r) = single i i (r ^ (k + 1 + 1)) h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n Jr:Rhr:r ∈ Jhmem:single i i r ∈ Nil* Matrix n n Rk:ℕhk:single i i r ^ k = 0hpow:∀ (k : ℕ), single i i r ^ (k + 1) = single i i (r ^ (k + 1))⊢ IsNilpotent r h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n JhJnil:IsNil J⊢ (Nil* R).ringCon (N i j) (0 i j) ← pow_succ succ h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n Jr:Rhr:r ∈ Jhmem:single i i r ∈ Nil* Matrix n n Rk✝:ℕhk:single i i r ^ k = 0k:ℕih:single i i r ^ (k + 1) = single i i (r ^ (k + 1))⊢ single i i (r ^ (k + 1 + 1)) = single i i (r ^ (k + 1 + 1)) h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n Jr:Rhr:r ∈ Jhmem:single i i r ∈ Nil* Matrix n n Rk:ℕhk:single i i r ^ k = 0hpow:∀ (k : ℕ), single i i r ^ (k + 1) = single i i (r ^ (k + 1))⊢ IsNilpotent r h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n JhJnil:IsNil J⊢ (Nil* R).ringCon (N i j) (0 i j)] h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n Jr:Rhr:r ∈ Jhmem:single i i r ∈ Nil* Matrix n n Rk:ℕhk:single i i r ^ k = 0hpow:∀ (k : ℕ), single i i r ^ (k + 1) = single i i (r ^ (k + 1))⊢ IsNilpotent r h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n JhJnil:IsNil J⊢ (Nil* R).ringCon (N i j) (0 i j) h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n Jr:Rhr:r ∈ Jhmem:single i i r ∈ Nil* Matrix n n Rk:ℕhk:single i i r ^ k = 0hpow:∀ (k : ℕ), single i i r ^ (k + 1) = single i i (r ^ (k + 1))⊢ IsNilpotent r h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n JhJnil:IsNil J⊢ (Nil* R).ringCon (N i j) (0 i j)
refine ⟨k + 1, ?_⟩ h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n Jr:Rhr:r ∈ Jhmem:single i i r ∈ Nil* Matrix n n Rk:ℕhk:single i i r ^ k = 0hpow:∀ (k : ℕ), single i i r ^ (k + 1) = single i i (r ^ (k + 1))⊢ r ^ (k + 1) = 0 h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n JhJnil:IsNil J⊢ (Nil* R).ringCon (N i j) (0 i j)
have := congrFun (congrFun (hpow k) i) i h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis✝:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n Jr:Rhr:r ∈ Jhmem:single i i r ∈ Nil* Matrix n n Rk:ℕhk:single i i r ^ k = 0hpow:∀ (k : ℕ), single i i r ^ (k + 1) = single i i (r ^ (k + 1))this:(single i i r ^ (k + 1)) i i = single i i (r ^ (k + 1)) i i⊢ r ^ (k + 1) = 0 h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n JhJnil:IsNil J⊢ (Nil* R).ringCon (N i j) (0 i j)
rw [pow_succ, h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis✝:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n Jr:Rhr:r ∈ Jhmem:single i i r ∈ Nil* Matrix n n Rk:ℕhk:single i i r ^ k = 0hpow:∀ (k : ℕ), single i i r ^ (k + 1) = single i i (r ^ (k + 1))this:(single i i r ^ k * single i i r) i i = single i i (r ^ (k + 1)) i i⊢ r ^ (k + 1) = 0 h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis✝:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n Jr:Rhr:r ∈ Jhmem:single i i r ∈ Nil* Matrix n n Rk:ℕhk:single i i r ^ k = 0hpow:∀ (k : ℕ), single i i r ^ (k + 1) = single i i (r ^ (k + 1))this:0 i i = single i i (r ^ (k + 1)) i i⊢ r ^ (k + 1) = 0 h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n JhJnil:IsNil J⊢ (Nil* R).ringCon (N i j) (0 i j) hk, h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis✝:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n Jr:Rhr:r ∈ Jhmem:single i i r ∈ Nil* Matrix n n Rk:ℕhk:single i i r ^ k = 0hpow:∀ (k : ℕ), single i i r ^ (k + 1) = single i i (r ^ (k + 1))this:(0 * single i i r) i i = single i i (r ^ (k + 1)) i i⊢ r ^ (k + 1) = 0 h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis✝:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n Jr:Rhr:r ∈ Jhmem:single i i r ∈ Nil* Matrix n n Rk:ℕhk:single i i r ^ k = 0hpow:∀ (k : ℕ), single i i r ^ (k + 1) = single i i (r ^ (k + 1))this:0 i i = single i i (r ^ (k + 1)) i i⊢ r ^ (k + 1) = 0 h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n JhJnil:IsNil J⊢ (Nil* R).ringCon (N i j) (0 i j) zero_mul h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis✝:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n Jr:Rhr:r ∈ Jhmem:single i i r ∈ Nil* Matrix n n Rk:ℕhk:single i i r ^ k = 0hpow:∀ (k : ℕ), single i i r ^ (k + 1) = single i i (r ^ (k + 1))this:0 i i = single i i (r ^ (k + 1)) i i⊢ r ^ (k + 1) = 0 h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis✝:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n Jr:Rhr:r ∈ Jhmem:single i i r ∈ Nil* Matrix n n Rk:ℕhk:single i i r ^ k = 0hpow:∀ (k : ℕ), single i i r ^ (k + 1) = single i i (r ^ (k + 1))this:0 i i = single i i (r ^ (k + 1)) i i⊢ r ^ (k + 1) = 0 h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n JhJnil:IsNil J⊢ (Nil* R).ringCon (N i j) (0 i j)] at this h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis✝:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n Jr:Rhr:r ∈ Jhmem:single i i r ∈ Nil* Matrix n n Rk:ℕhk:single i i r ^ k = 0hpow:∀ (k : ℕ), single i i r ^ (k + 1) = single i i (r ^ (k + 1))this:0 i i = single i i (r ^ (k + 1)) i i⊢ r ^ (k + 1) = 0 h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n JhJnil:IsNil J⊢ (Nil* R).ringCon (N i j) (0 i j)
simpa using this.symm h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n JhJnil:IsNil J⊢ (Nil* R).ringCon (N i j) (0 i j) h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n RhN:N ∈ Nil* Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n JhJnil:IsNil J⊢ (Nil* R).ringCon (N i j) (0 i j)
rw [hJ h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhN:N ∈ TwoSidedIdeal.matrix n JhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n JhJnil:IsNil J⊢ (Nil* R).ringCon (N i j) (0 i j) h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhN:N ∈ TwoSidedIdeal.matrix n JhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n JhJnil:IsNil J⊢ (Nil* R).ringCon (N i j) (0 i j)] at hN h:∀ {R : Type u} [inst : Ring R] {I : TwoSidedIdeal R},
IsNil I → ∀ (n : Type v) [inst_1 : Fintype n], IsNil (TwoSidedIdeal.matrix n I)R:Type uinst✝¹:Ring Rn:Type vinst✝:Fintype nN:Matrix n n Ri:nj:nthis:Nonempty nJ:TwoSidedIdeal RhN:N ∈ TwoSidedIdeal.matrix n JhJ:(Nil* Matrix n n R) = TwoSidedIdeal.matrix n JhJnil:IsNil J⊢ (Nil* R).ringCon (N i j) (0 i j)
exact TwoSidedIdeal.le_iff.mp (le_sSup hJnil) (hN i j) All goals completed! 🐙
The Amitsur Conjecture: If J is a nil ideal in R, then J[x] is a nil ideal of the polynomial ring R[x].
This is known to be false, see Agata Smoktunowicz, Polynomial rings over nil rings need not be nil.
@[category research solved, AMS 16]
theorem amitsur_conjecture : ¬ ∀ (R : Type) [Ring R] (J : TwoSidedIdeal R), IsNil J →
IsNil (TwoSidedIdeal.map (Polynomial.C) J) := by ⊢ ¬∀ (R : Type) [inst : Ring R] (J : TwoSidedIdeal R), IsNil J → IsNil (TwoSidedIdeal.map C J)
sorry All goals completed! 🐙end Koethe