mirror of
https://github.com/GTBarkley/comm_alg.git
synced 2024-12-26 07:38:36 -06:00
update: Finally, the proof of dim_eq_zero_iff_field is complete
This commit is contained in:
parent
edeaf1829c
commit
dedb9711c7
1 changed files with 20 additions and 19 deletions
|
@ -9,11 +9,6 @@ import Mathlib.Order.ConditionallyCompleteLattice.Basic
|
||||||
|
|
||||||
namespace Ideal
|
namespace Ideal
|
||||||
|
|
||||||
example (x : Nat) : List.Chain' (· < ·) [x] := by
|
|
||||||
constructor
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
variable {R : Type _} [CommRing R] (I : PrimeSpectrum R)
|
variable {R : Type _} [CommRing R] (I : PrimeSpectrum R)
|
||||||
noncomputable def height : ℕ∞ := Set.chainHeight {J : PrimeSpectrum R | J < I}
|
noncomputable def height : ℕ∞ := Set.chainHeight {J : PrimeSpectrum R | J < I}
|
||||||
noncomputable def krullDim (R : Type) [CommRing R] : WithBot ℕ∞ := ⨆ (I : PrimeSpectrum R), height I
|
noncomputable def krullDim (R : Type) [CommRing R] : WithBot ℕ∞ := ⨆ (I : PrimeSpectrum R), height I
|
||||||
|
@ -52,30 +47,36 @@ lemma dim_field_eq_zero {K : Type _} [Field K] : krullDim K = 0 := by
|
||||||
unfold krullDim
|
unfold krullDim
|
||||||
simp [field_prime_height_zero]
|
simp [field_prime_height_zero]
|
||||||
|
|
||||||
|
noncomputable
|
||||||
|
instance : CompleteLattice (WithBot ℕ∞) :=
|
||||||
|
inferInstanceAs <| CompleteLattice (WithBot (WithTop ℕ))
|
||||||
|
|
||||||
lemma isField.dim_zero {D: Type _} [CommRing D] [IsDomain D] (h: krullDim D = 0) : IsField D := by
|
lemma isField.dim_zero {D: Type _} [CommRing D] [IsDomain D] (h: krullDim D = 0) : IsField D := by
|
||||||
unfold krullDim at h
|
unfold krullDim at h
|
||||||
simp [height] at h
|
simp [height] at h
|
||||||
by_contra x
|
by_contra x
|
||||||
rw [Ring.not_isField_iff_exists_prime] at x
|
rw [Ring.not_isField_iff_exists_prime] at x
|
||||||
obtain ⟨P, ⟨h1, primeP⟩⟩ := x
|
obtain ⟨P, ⟨h1, primeP⟩⟩ := x
|
||||||
have PgtBot : P > ⊥ := Ne.bot_lt h1
|
let P' : PrimeSpectrum D := PrimeSpectrum.mk P primeP
|
||||||
have pos_height : ↑(Set.chainHeight {J | J < P}) > 0 := by
|
have h2 : P' ≠ ⊥ := by
|
||||||
have : ⊥ ∈ {J | J < P} := PgtBot
|
by_contra a
|
||||||
have : {J | J < P}.Nonempty := Set.nonempty_of_mem this
|
have : P = ⊥ := by rwa [PrimeSpectrum.ext_iff] at a
|
||||||
-- have : {J | J < P} ≠ ∅ := Set.Nonempty.ne_empty this
|
contradiction
|
||||||
|
have PgtBot : P' > ⊥ := Ne.bot_lt h2
|
||||||
|
have pos_height : ¬ ↑(Set.chainHeight {J | J < P'}) ≤ 0 := by
|
||||||
|
have : ⊥ ∈ {J | J < P'} := PgtBot
|
||||||
|
have : {J | J < P'}.Nonempty := Set.nonempty_of_mem this
|
||||||
rw [←Set.one_le_chainHeight_iff] at this
|
rw [←Set.one_le_chainHeight_iff] at this
|
||||||
exact Iff.mp ENat.one_le_iff_pos this
|
exact not_le_of_gt (Iff.mp ENat.one_le_iff_pos this)
|
||||||
have zero_height : ↑(Set.chainHeight {J | J < P}) = 0 := by
|
have zero_height : (Set.chainHeight {J | J < P'}) ≤ 0 := by
|
||||||
-- Probably need to use Sup_le or something here
|
have : (⨆ (I : PrimeSpectrum D), (Set.chainHeight {J | J < I} : WithBot ℕ∞)) ≤ 0 := h.le
|
||||||
sorry
|
rw [iSup_le_iff] at this
|
||||||
have : ↑(Set.chainHeight {J | J < P}) ≠ 0 := Iff.mp pos_iff_ne_zero pos_height
|
exact Iff.mp WithBot.coe_le_zero (this P')
|
||||||
contradiction
|
contradiction
|
||||||
|
|
||||||
lemma dim_eq_zero_iff_field {D: Type _} [CommRing D] [IsDomain D] : krullDim D = 0 ↔ IsField D := by
|
lemma dim_eq_zero_iff_field {D: Type _} [CommRing D] [IsDomain D] : krullDim D = 0 ↔ IsField D := by
|
||||||
constructor
|
constructor
|
||||||
· exact isField.dim_zero
|
· exact isField.dim_zero
|
||||||
· intro fieldD
|
· intro fieldD
|
||||||
have : Field D := IsField.toField fieldD
|
let h : Field D := IsField.toField fieldD
|
||||||
-- Not exactly sure why this is failing
|
exact dim_field_eq_zero
|
||||||
-- apply @dim_field_eq_zero D _
|
|
||||||
sorry
|
|
Loading…
Reference in a new issue