SinTan1729/comm_alg
1
0
Fork 0
mirror of https://github.com/GTBarkley/comm_alg.git synced 2024-12-26 23:48:36 -06:00
Code Issues Projects Releases Packages Wiki Activity

swapped inequalities in lt_height_iff

Browse source
This commit is contained in:
GTBarkley 2023-06-16 03:53:29 +00:00
parent 24a0460566
commit 7cc1079f7d
1 changed files with 23 additions and 22 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

17
CommAlg/krull.lean
View file

@ -72,12 +72,14 @@ lemma krullDim_eq_height [LocalRing R] : krullDim R = height (closedPoint R) :=
/-- The height of a prime `𝔭` is greater than `n` if and only if there is a chain of primes less than `𝔭` /-- The height of a prime `𝔭` is greater than `n` if and only if there is a chain of primes less than `𝔭`
with length `n + 1`. -/ with length `n + 1`. -/
lemma lt_height_iff' {𝔭 : PrimeSpectrum R} {n : ℕ∞} : lemma lt_height_iff' {𝔭 : PrimeSpectrum R} {n : ℕ∞} :
height 𝔭 > n ↔ ∃ c : List (PrimeSpectrum R), c.Chain' (· < ·) ∧ (∀ 𝔮 ∈ c, 𝔮 < 𝔭) ∧ c.length = n + 1 := by n < height 𝔭 ↔ ∃ c : List (PrimeSpectrum R), c.Chain' (· < ·) ∧ (∀ 𝔮 ∈ c, 𝔮 < 𝔭) ∧ c.length = n + 1 := by
rcases n with _ | n match n with
. constructor <;> intro h <;> exfalso | ⊤ =>
constructor <;> intro h <;> exfalso
. exact (not_le.mpr h) le_top . exact (not_le.mpr h) le_top
. tauto . tauto
have (m : ℕ∞) : m > some n ↔ m ≥ some (n + 1) := by | (n : ℕ) =>
have (m : ℕ∞) : n < m ↔ (n + 1 : ℕ∞) ≤ m := by
symm symm
show (n + 1 ≤ m ↔ _ ) show (n + 1 ≤ m ↔ _ )
apply ENat.add_one_le_iff apply ENat.add_one_le_iff
@ -95,8 +97,7 @@ height 𝔭 > n ↔ ∃ c : List (PrimeSpectrum R), c.Chain' (· < ·) ∧ (∀
/-- Form of `lt_height_iff''` for rewriting with the height coerced to `WithBot ℕ∞`. -/ /-- Form of `lt_height_iff''` for rewriting with the height coerced to `WithBot ℕ∞`. -/
lemma lt_height_iff'' {𝔭 : PrimeSpectrum R} {n : ℕ∞} : lemma lt_height_iff'' {𝔭 : PrimeSpectrum R} {n : ℕ∞} :
height 𝔭 > (n : WithBot ℕ∞) ↔ ∃ c : List (PrimeSpectrum R), c.Chain' (· < ·) ∧ (∀ 𝔮 ∈ c, 𝔮 < 𝔭) ∧ c.length = n + 1 := by (n : WithBot ℕ∞) < height 𝔭 ↔ ∃ c : List (PrimeSpectrum R), c.Chain' (· < ·) ∧ (∀ 𝔮 ∈ c, 𝔮 < 𝔭) ∧ c.length = n + 1 := by
show (_ < _) ↔ _
rw [WithBot.coe_lt_coe] rw [WithBot.coe_lt_coe]
exact lt_height_iff' exact lt_height_iff'
@ -158,7 +159,7 @@ lemma dim_le_zero_iff : krullDim R ≤ 0 ↔ ∀ I : PrimeSpectrum R, IsMaximal
rw [hcontr] at h rw [hcontr] at h
exact h h𝔪.1 exact h h𝔪.1
use 𝔪p use 𝔪p
show (_ : WithBot ℕ∞) > (0 : ℕ∞) show (0 : ℕ∞) < (_ : WithBot ℕ∞)
rw [lt_height_iff''] rw [lt_height_iff'']
use [I] use [I]
constructor constructor
@ -169,7 +170,7 @@ lemma dim_le_zero_iff : krullDim R ≤ 0 ↔ ∀ I : PrimeSpectrum R, IsMaximal
rwa [hI'] rwa [hI']
. simp . simp
. contrapose! h . contrapose! h
change (_ : WithBot ℕ∞) > (0 : ℕ∞) at h change (0 : ℕ∞) < (_ : WithBot ℕ∞) at h
rw [lt_height_iff''] at h rw [lt_height_iff''] at h
obtain ⟨c, _, hc2, hc3⟩ := h obtain ⟨c, _, hc2, hc3⟩ := h
norm_cast at hc3 norm_cast at hc3