------------------------------------------------------------------------ -- Agda Helium -- -- Algebraic properties of ordered fields ------------------------------------------------------------------------ {-# OPTIONS --without-K --safe #-} open import Helium.Algebra.Ordered.StrictTotal.Bundles module Helium.Algebra.Ordered.StrictTotal.Properties.Field {ℓ₁ ℓ₂ ℓ₃} (field′ : Field ℓ₁ ℓ₂ ℓ₃) where open Field field′ renaming ( trans to <-trans ; irrefl to <-irrefl ; asym to <-asym ; 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.CommutativeSemiring.Exp.TCOptimised Unordered.commutativeSemiring public open import Helium.Relation.Binary.Properties.StrictTotalOrder strictTotalOrder public open import Helium.Algebra.Ordered.StrictTotal.Properties.DivisionRing divisionRing public using ( +-mono-<; +-monoˡ-<; +-monoʳ-< ; +-mono-≤; +-monoˡ-≤; +-monoʳ-≤ ; +-cancel-<; +-cancelˡ-<; +-cancelʳ-< ; +-cancel-≤; +-cancelˡ-≤; +-cancelʳ-≤ ; x≥0∧y>0⇒x+y>0 ; x>0∧y≥0⇒x+y>0 ; x≤0∧y<0⇒x+y<0 ; x<0∧y≤0⇒x+y<0 ; x≥0∧y≥0⇒x+y≥0 ; x≤0∧y≤0⇒x+y≤0 ; x≤0∧x+y>0⇒y>0 ; x≤0∧y+x>0⇒y>0 ; x<0∧x+y≥0⇒y>0 ; x<0∧y+x≥0⇒y>0 ; x≥0∧x+y<0⇒y<0 ; x≥0∧y+x<0⇒y<0 ; x>0∧x+y≤0⇒y<0 ; x>0∧y+x≤0⇒y<0 ; x≤0∧x+y≥0⇒y≥0 ; x≤0∧y+x≥0⇒y≥0 ; x≥0∧x+y≤0⇒y≤0 ; x≥0∧y+x≤0⇒y≤0 ; ×-zeroˡ; ×-zeroʳ ; ×-identityˡ ; n≢0⇒×-monoˡ-< ; x>0⇒×-monoʳ-< ; x<0⇒×-anti-monoʳ-< ; ×-monoˡ-≤; x≥0⇒×-monoʳ-≤; x≤0⇒×-anti-monoʳ-≤ ; ×-cancelˡ-<; x≥0⇒×-cancelʳ-<; x≤0⇒×-anti-cancelʳ-< ; n≢0⇒×-cancelˡ-≤ ; x>0⇒×-cancelʳ-≤ ; x<0⇒×-anti-cancelʳ-≤ ; n≢0∧x>0⇒n×x>0; n≢0∧x<0⇒n×x<0 ; x≥0⇒n×x≥0; x≤0⇒n×x≤0 ; n×x>0⇒x>0; n×x<0⇒x<0 ; n≢0∧n×x≥0⇒x≥0; n≢0∧n×x≤0⇒x≤0 ; -‿anti-mono-<; -‿anti-mono-≤ ; -‿anti-cancel-<; -‿anti-cancel-≤ ; x≈0⇒-x≈0 ; x<0⇒-x>0; x>0⇒-x<0; x≤0⇒-x≥0; x≥0⇒-x≤0 ; -x≈0⇒x≈0 ; -x<0⇒x>0; -x>0⇒x<0; -x≤0⇒x≥0; -x≥0⇒x≤0 ; x0⇒*-monoˡ-<; x>0⇒*-monoʳ-<; x<0⇒*-anti-monoˡ-<; x<0⇒*-anti-monoʳ-< ; x≥0⇒*-monoˡ-≤; x≥0⇒*-monoʳ-≤; x≤0⇒*-anti-monoˡ-≤; x≤0⇒*-anti-monoʳ-≤ ; x≥0⇒*-cancelˡ-<; x≥0⇒*-cancelʳ-<; x≤0⇒*-anti-cancelˡ-<; x≤0⇒*-anti-cancelʳ-< ; x>0⇒*-cancelˡ-≤; x>0⇒*-cancelʳ-≤; x<0⇒*-anti-cancelˡ-≤; x<0⇒*-anti-cancelʳ-≤ ; x≈0⇒x*y≈0; x≈0⇒y*x≈0 ; -x*-y≈x*y ; x>0∧y<0⇒x*y<0; x<0∧y>0⇒x*y<0; x<0∧y<0⇒x*y>0 ; x≥0∧y≥0⇒x*y≥0; x≥0∧y≤0⇒x*y≤0; x≤0∧y≥0⇒x*y≤0; x≤0∧y≤0⇒x*y≥0 ; x>1∧y≥1⇒x*y>1; x≥1∧y>1⇒x*y>1; 0≤x<1∧y≤1⇒x*y<1; x≤1∧0≤y<1⇒x*y<1 ; x≥1∧y≥1⇒x*y≥1; 0≤x≤1∧y≤1⇒x*y≤1; x≤1∧0≤y≤1⇒x*y≤1 ; x*x≥0; x*y≈0⇒x≈0⊎y≈0 ; ^-zeroˡ; ^-zeroʳ ; ^-identityʳ ; n≢0⇒0^n≈0 ; x>1⇒^-monoˡ-<; 00⇒x^n>0 ; x≥0⇒x^n≥0 ; x^n≈0⇒x≈0 ; 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 ; 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 ; y>0∧x0∧x≤y⇒x*y⁻¹≤1 ) -------------------------------------------------------------------------------- ---- Properties of _⁻¹ and _^_ ⁻¹-^-comm : ∀ {x} (x≉0 : x ≉ 0#) k → x≉0 ⁻¹ ^ k ≈ (x≉0 ∘ x^n≈0⇒x≈0 x k) ⁻¹ ⁻¹-^-comm {x} x≉0 k = *-inverseˡ-unique (x≉0 ∘ x^n≈0⇒x≈0 x k) (begin-equality x≉0 ⁻¹ ^ k * x ^ k ≈˘⟨ ^-distrib-* _ x k ⟩ (x≉0 ⁻¹ * x) ^ k ≈⟨ ^-congˡ k (⁻¹-inverseˡ x≉0) ⟩ 1# ^ k ≈⟨ ^-zeroˡ k ⟩ 1# ∎)