{-# OPTIONS --safe --cubical-compatible --guardedness --exact-split --double-check #-}
module Real.Interval.Atan.Order where
open import Real.Interval.Mul.Order using (l-0)
open import Data.Nat using (ℕ)
open import Data.Product using (_,_; proj₁; proj₂)
open import Data.Rational using (ℚ; 0ℚ; 1ℚ; _≤_; _<_; _+_) renaming (-_ to neg)
open import Data.Rational.Properties using
(≤-refl; ≤-reflexive; ≤-trans; ≤-<-trans; <-≤-trans; <⇒≤; +-identityˡ
; +-mono-≤; neg-antimono-<; <-asym)
open import Relation.Binary.PropositionalEquality using (_≡_; sym; subst)
open import Real.CauchyToInterval using (M; centre-cauchy→realI)
open import Real.IntervalEquiv using (l; u; centre; centre-l; centre-u)
open import Real.Interval using (embedℚ; δ; δ-pos)
open import Real.Interval.Arith using (0ℝ; 1ℝ)
open import Real.Interval.Atan.Core using
(atanTerm; atanTerm-zero; atanTerm-nonNeg; atanTerm-dec; altSum; altSum-bounds
; atanSeq; atanq)
open import Real.Interval.Equiv using (_≈ℝ_)
open import Real.Interval.Node using (l-dyadic; u-dyadic)
open import Real.Interval.OrderLe using (≤ℝ-antisym)
open import Real.Interval.OrderComplete.Base using (_≤ℝ_)
l-embedℚ : (q : ℚ) (n : ℕ) → l (embedℚ q) n ≡ neg (δ n) + q
l-embedℚ q n = l-dyadic q n
u-embedℚ : (q : ℚ) (n : ℕ) → u (embedℚ q) n ≡ δ n + q
u-embedℚ q n = u-dyadic q n
altSum-zero : (q : ℚ) (0≤q : 0ℚ ≤ q) (q≤1 : q ≤ 1ℚ) (d : ℕ)
→ 0ℚ ≤ altSum (atanTerm q) d
altSum-zero q 0≤q q≤1 d =
proj₁ (altSum-bounds (atanTerm q) (atanTerm-dec q 0≤q q≤1)
(atanTerm-nonNeg q 0≤q) d)
altSum-le-q : (q : ℚ) (0≤q : 0ℚ ≤ q) (q≤1 : q ≤ 1ℚ) (d : ℕ)
→ altSum (atanTerm q) d ≤ q
altSum-le-q q 0≤q q≤1 d =
≤-trans (proj₂ (altSum-bounds (atanTerm q) (atanTerm-dec q 0≤q q≤1)
(atanTerm-nonNeg q 0≤q) d))
(≤-reflexive (atanTerm-zero q))
atanq-nonNeg : (q : ℚ) (0≤q : 0ℚ ≤ q) (q≤1 : q ≤ 1ℚ)
→ 0ℝ ≤ℝ atanq q 0≤q q≤1
atanq-nonNeg q 0≤q q≤1 (n , h) =
let
h' : u (atanq q 0≤q q≤1) n < neg (δ n)
h' = subst (λ z → u (atanq q 0≤q q≤1) n < z) (l-0 n) h
u≥0 : 0ℚ ≤ u (atanq q 0≤q q≤1) n
u≥0 = ≤-trans
(subst (λ z → 0ℚ ≤ z)
(sym (centre-cauchy→realI (atanSeq q 0≤q q≤1) n))
(altSum-zero q 0≤q q≤1 (M (atanSeq q 0≤q q≤1) n)))
(centre-u (atanq q 0≤q q≤1) n)
pos : 0ℚ < neg (δ n)
pos = ≤-<-trans u≥0 h'
in <-asym pos (neg-antimono-< (δ-pos n))
atanq-le-r : (q : ℚ) (0≤q : 0ℚ ≤ q) (q≤1 : q ≤ 1ℚ) (r : ℚ) (q≤r : q ≤ r)
→ atanq q 0≤q q≤1 ≤ℝ embedℚ r
atanq-le-r q 0≤q q≤1 r q≤r (n , h) =
let
h' : δ n + r < l (atanq q 0≤q q≤1) n
h' = subst (λ z → z < l (atanq q 0≤q q≤1) n) (u-embedℚ r n) h
c≤q : centre (atanq q 0≤q q≤1) n ≤ q
c≤q = subst (λ z → z ≤ q)
(sym (centre-cauchy→realI (atanSeq q 0≤q q≤1) n))
(altSum-le-q q 0≤q q≤1 (M (atanSeq q 0≤q q≤1) n))
c≤r : centre (atanq q 0≤q q≤1) n ≤ r
c≤r = ≤-trans c≤q q≤r
l≤r : l (atanq q 0≤q q≤1) n ≤ r
l≤r = ≤-trans (centre-l (atanq q 0≤q q≤1) n) c≤r
lt : δ n + r < r
lt = <-≤-trans h' l≤r
r≤ : r ≤ δ n + r
r≤ = subst (λ z → z ≤ δ n + r) (+-identityˡ r)
(+-mono-≤ (<⇒≤ (δ-pos n)) (≤-refl {r}))
rr : r < r
rr = ≤-<-trans r≤ lt
in <-asym rr rr
atanq≤q : (q : ℚ) (0≤q : 0ℚ ≤ q) (q≤1 : q ≤ 1ℚ)
→ atanq q 0≤q q≤1 ≤ℝ embedℚ q
atanq≤q q 0≤q q≤1 = atanq-le-r q 0≤q q≤1 q (≤-refl {q})
atanq≤1 : (q : ℚ) (0≤q : 0ℚ ≤ q) (q≤1 : q ≤ 1ℚ)
→ atanq q 0≤q q≤1 ≤ℝ 1ℝ
atanq≤1 q 0≤q q≤1 = atanq-le-r q 0≤q q≤1 1ℚ q≤1
atanq-zero : (0≤0 : 0ℚ ≤ 0ℚ) (0≤1 : 0ℚ ≤ 1ℚ)
→ atanq 0ℚ 0≤0 0≤1 ≈ℝ 0ℝ
atanq-zero 0≤0 0≤1 =
≤ℝ-antisym (atanq-le-r 0ℚ 0≤0 0≤1 0ℚ (≤-refl {0ℚ}))
(atanq-nonNeg 0ℚ 0≤0 0≤1)