From 6acd0e87fa8ab2a3230626b37f1cd02181810a1a Mon Sep 17 00:00:00 2001 From: Greg Brown Date: Mon, 4 Apr 2022 15:51:22 +0100 Subject: Add some more ordered division ring properties. --- .../StrictTotal/Properties/DivisionRing.agda | 106 +++++++++++++++++++++ .../Ordered/StrictTotal/Properties/Field.agda | 21 ++++ 2 files changed, 127 insertions(+) (limited to 'src/Helium/Algebra/Ordered/StrictTotal') diff --git a/src/Helium/Algebra/Ordered/StrictTotal/Properties/DivisionRing.agda b/src/Helium/Algebra/Ordered/StrictTotal/Properties/DivisionRing.agda index 03e8ecd..ab8a37b 100644 --- a/src/Helium/Algebra/Ordered/StrictTotal/Properties/DivisionRing.agda +++ b/src/Helium/Algebra/Ordered/StrictTotal/Properties/DivisionRing.agda @@ -21,8 +21,21 @@ open DivisionRing divisionRing ; 00∧y>0⇒x*y>0 ) +open import Function using (_∘_) +open import Relation.Binary.Reasoning.StrictPartialOrder strictPartialOrder + open import Algebra.Properties.Ring Unordered.ring public renaming (-0#≈0# to -0≈0) +open import Helium.Algebra.Properties.AlmostGroup *-almostGroup public + renaming + ( x≉0⇒∙-cancelˡ to x≉0⇒*-cancelˡ + ; x≉0⇒∙-cancelʳ to x≉0⇒*-cancelʳ + ; ⁻¹-anti-homo-∙ to ⁻¹-anti-homo-* + ; identityˡ-unique to *-identityˡ-unique + ; identityʳ-unique to *-identityʳ-unique + ; inverseˡ-unique to *-inverseˡ-unique + ; inverseʳ-unique to *-inverseʳ-unique + ) open import Algebra.Properties.Semiring.Mult.TCOptimised Unordered.semiring public open import Algebra.Properties.Semiring.Exp.TCOptimised Unordered.semiring public open import Helium.Relation.Binary.Properties.StrictTotalOrder strictTotalOrder public @@ -98,3 +111,96 @@ open import Helium.Algebra.Ordered.StrictTotal.Properties.Ring ring public ; x>1∧n≢0⇒x^n>1; 0≤x<1∧n≢0⇒x^n<1 ; x≥1⇒x^n≥1; 0≤x≤1⇒x^n≤1 ) + +-------------------------------------------------------------------------------- +---- Properties of _⁻¹ + +---- Miscellaneous + +x≉0⇒x⁻¹≉0 : ∀ {x} → (x≉0 : x ≉ 0#) → x≉0 ⁻¹ ≉ 0# +x≉0⇒x⁻¹≉0 {x} x≉0 x⁻¹≈0 = x≉0 (begin-equality + x ≈˘⟨ *-identityˡ x ⟩ + 1# * x ≈˘⟨ *-congʳ (⁻¹-inverseʳ x≉0) ⟩ + x * x≉0 ⁻¹ * x ≈⟨ *-congʳ (*-congˡ x⁻¹≈0) ⟩ + x * 0# * x ≈⟨ *-congʳ (zeroʳ x) ⟩ + 0# * x ≈⟨ zeroˡ x ⟩ + 0# ∎) + +---- Preserves signs + +x>0⇒x⁻¹>0 : ∀ {x} → (x>0 : x > 0#) → (<⇒≉ x>0 ∘ Eq.sym) ⁻¹ > 0# +x>0⇒x⁻¹>0 {x} x>0 = ≰⇒> (λ x⁻¹≤0 → <⇒≱ (x0) (begin + 1# ≈˘⟨ ⁻¹-inverseʳ (<⇒≉ x>0 ∘ Eq.sym) ⟩ + x * (<⇒≉ x>0 ∘ Eq.sym) ⁻¹ ≤⟨ x≥0∧y≤0⇒x*y≤0 (<⇒≤ x>0) x⁻¹≤0 ⟩ + 0# ∎)) + +x<0⇒x⁻¹<0 : ∀ {x} → (x<0 : x < 0#) → (<⇒≉ x<0) ⁻¹ < 0# +x<0⇒x⁻¹<0 {x} x<0 = ≰⇒> (λ x⁻¹≥0 → <⇒≱ (x0⇒x>0 : ∀ {x} {x≉0 : x ≉ 0#} → x≉0 ⁻¹ > 0# → x > 0# +x⁻¹>0⇒x>0 {x} {x≉0} x⁻¹>0 = begin-strict + 0# <⟨ x>0⇒x⁻¹>0 x⁻¹>0 ⟩ + (<⇒≉ x⁻¹>0 ∘ Eq.sym) ⁻¹ ≈⟨ ⁻¹-involutive x≉0 (<⇒≉ x⁻¹>0 ∘ Eq.sym) ⟩ + x ∎ + +x⁻¹<0⇒x<0 : ∀ {x} {x≉0 : x ≉ 0#} → x≉0 ⁻¹ < 0# → x < 0# +x⁻¹<0⇒x<0 {x} {x≉0} x⁻¹<0 = begin-strict + x ≈˘⟨ ⁻¹-involutive x≉0 (<⇒≉ x⁻¹<0) ⟩ + (<⇒≉ x⁻¹<0) ⁻¹ <⟨ x<0⇒x⁻¹<0 x⁻¹<0 ⟩ + 0# ∎ + +---- Preserves size + +x>1⇒x⁻¹<1 : ∀ {x} → (x>1 : x > 1#) → (<⇒≉ (≤-<-trans 0≤1 x>1) ∘ Eq.sym) ⁻¹ < 1# +x>1⇒x⁻¹<1 {x} x>1 = ≰⇒> + ( <-irrefl (Eq.sym (⁻¹-inverseʳ (<⇒≉ (≤-<-trans 0≤1 x>1) ∘ Eq.sym))) + ∘ x>1∧y≥1⇒x*y>1 x>1 + ) + +01 : ∀ {x} (0 1# +01 {x} 0 + ( <-irrefl (⁻¹-inverseʳ (<⇒≉ 01⇒x<1 : ∀ {x} {x≉0 : x ≉ 0#} → x≉0 ⁻¹ > 1# → x < 1# +x⁻¹>1⇒x<1 {x} {x≉0} x⁻¹>1 = ≰⇒> + ( <-irrefl (Eq.sym (⁻¹-inverseˡ x≉0)) + ∘ x>1∧y≥1⇒x*y>1 x⁻¹>1 + ) + +01 : ∀ {x} {x≉0 : x ≉ 0#} → 0# < x≉0 ⁻¹ → x≉0 ⁻¹ < 1# → x > 1# +01 {x} {x≉0} 0 + ( <-irrefl (⁻¹-inverseˡ x≉0) + ∘ 0≤x<1∧y≤1⇒x*y<1 (<⇒≤ 0 y≉0 ⁻¹ +-- ⁻¹-anti-mono-< {x} {y} x≉0 y≉0 x1∧n≢0⇒x^n>1; 0≤x<1∧n≢0⇒x^n<1 ; x≥1⇒x^n≥1; 0≤x≤1⇒x^n≤1 + + ; x>0⇒x⁻¹>0 ; x<0⇒x⁻¹<0 + + ; x⁻¹>0⇒x>0 ; x⁻¹<0⇒x<0 + + ; x>1⇒x⁻¹<1; 01 + + ; x⁻¹>1⇒x<1; 01 + + ; -‿⁻¹-comm + ; x≉0⇒x⁻¹≉0 ) -- cgit v1.2.3