Maximum on the natural numbers

module elementary-number-theory.maximum-natural-numbers where

Imports

open import elementary-number-theory.addition-natural-numbers
open import elementary-number-theory.inequality-natural-numbers
open import elementary-number-theory.natural-numbers

open import foundation.coproduct-types
open import foundation.dependent-pair-types
open import foundation.identity-types
open import foundation.unit-type

open import order-theory.least-upper-bounds-posets

open import univalent-combinatorics.standard-finite-types

Idea

We define the operation of maximum (least upper bound) for the natural numbers.

Definition

Maximum of natural numbers

max-ℕ : ℕ → (ℕ → ℕ)
max-ℕ 0 n = n
max-ℕ (succ-ℕ m) 0 = succ-ℕ m
max-ℕ (succ-ℕ m) (succ-ℕ n) = succ-ℕ (max-ℕ m n)

ap-max-ℕ : {x x' y y' : ℕ} → x ＝ x' → y ＝ y' → max-ℕ x y ＝ max-ℕ x' y'
ap-max-ℕ p q = ap-binary max-ℕ p q

max-ℕ' : ℕ → (ℕ → ℕ)
max-ℕ' x y = max-ℕ y x

Maximum of elements of standard finite types

max-Fin-ℕ : (n : ℕ) → (Fin n → ℕ) → ℕ
max-Fin-ℕ zero-ℕ f = zero-ℕ
max-Fin-ℕ (succ-ℕ n) f = max-ℕ (f (inr star)) (max-Fin-ℕ n (λ k → f (inl k)))

Properties

Maximum is a least upper bound

leq-max-ℕ :
  (k m n : ℕ) → m ≤-ℕ k → n ≤-ℕ k → (max-ℕ m n) ≤-ℕ k
leq-max-ℕ zero-ℕ zero-ℕ zero-ℕ H K = star
leq-max-ℕ (succ-ℕ k) zero-ℕ zero-ℕ H K = star
leq-max-ℕ (succ-ℕ k) zero-ℕ (succ-ℕ n) H K = K
leq-max-ℕ (succ-ℕ k) (succ-ℕ m) zero-ℕ H K = H
leq-max-ℕ (succ-ℕ k) (succ-ℕ m) (succ-ℕ n) H K = leq-max-ℕ k m n H K

leq-left-leq-max-ℕ :
  (k m n : ℕ) → (max-ℕ m n) ≤-ℕ k → m ≤-ℕ k
leq-left-leq-max-ℕ k zero-ℕ zero-ℕ H = star
leq-left-leq-max-ℕ k zero-ℕ (succ-ℕ n) H = star
leq-left-leq-max-ℕ k (succ-ℕ m) zero-ℕ H = H
leq-left-leq-max-ℕ (succ-ℕ k) (succ-ℕ m) (succ-ℕ n) H =
  leq-left-leq-max-ℕ k m n H

leq-right-leq-max-ℕ :
  (k m n : ℕ) → (max-ℕ m n) ≤-ℕ k → n ≤-ℕ k
leq-right-leq-max-ℕ k zero-ℕ zero-ℕ H = star
leq-right-leq-max-ℕ k zero-ℕ (succ-ℕ n) H = H
leq-right-leq-max-ℕ k (succ-ℕ m) zero-ℕ H = star
leq-right-leq-max-ℕ (succ-ℕ k) (succ-ℕ m) (succ-ℕ n) H =
  leq-right-leq-max-ℕ k m n H

is-least-upper-bound-max-ℕ :
  (m n : ℕ) → is-least-binary-upper-bound-Poset ℕ-Poset m n (max-ℕ m n)
is-least-upper-bound-max-ℕ m n =
  prove-is-least-binary-upper-bound-Poset
    ( ℕ-Poset)
    { m}
    { n}
    { max-ℕ m n}
    ( leq-left-leq-max-ℕ (max-ℕ m n) m n (refl-leq-ℕ (max-ℕ m n)),
      leq-right-leq-max-ℕ (max-ℕ m n) m n (refl-leq-ℕ (max-ℕ m n)))
    ( λ x (H , K) → leq-max-ℕ x m n H K)

Associativity of `max-ℕ`

associative-max-ℕ :
  (x y z : ℕ) → max-ℕ (max-ℕ x y) z ＝ max-ℕ x (max-ℕ y z)
associative-max-ℕ zero-ℕ y z = refl
associative-max-ℕ (succ-ℕ x) zero-ℕ zero-ℕ = refl
associative-max-ℕ (succ-ℕ x) zero-ℕ (succ-ℕ z) = refl
associative-max-ℕ (succ-ℕ x) (succ-ℕ y) zero-ℕ = refl
associative-max-ℕ (succ-ℕ x) (succ-ℕ y) (succ-ℕ z) =
  ap succ-ℕ (associative-max-ℕ x y z)

Unit laws for `max-ℕ`

left-unit-law-max-ℕ : (x : ℕ) → max-ℕ 0 x ＝ x
left-unit-law-max-ℕ x = refl

right-unit-law-max-ℕ : (x : ℕ) → max-ℕ x 0 ＝ x
right-unit-law-max-ℕ zero-ℕ = refl
right-unit-law-max-ℕ (succ-ℕ x) = refl

Commutativity of `max-ℕ`

commutative-max-ℕ : (x y : ℕ) → max-ℕ x y ＝ max-ℕ y x
commutative-max-ℕ zero-ℕ zero-ℕ = refl
commutative-max-ℕ zero-ℕ (succ-ℕ y) = refl
commutative-max-ℕ (succ-ℕ x) zero-ℕ = refl
commutative-max-ℕ (succ-ℕ x) (succ-ℕ y) = ap succ-ℕ (commutative-max-ℕ x y)

`max-ℕ` is idempotent

idempotent-max-ℕ : (x : ℕ) → max-ℕ x x ＝ x
idempotent-max-ℕ zero-ℕ = refl
idempotent-max-ℕ (succ-ℕ x) = ap succ-ℕ (idempotent-max-ℕ x)

Successor diagonal laws for `max-ℕ`

left-successor-diagonal-law-max-ℕ : (x : ℕ) → max-ℕ (succ-ℕ x) x ＝ succ-ℕ x
left-successor-diagonal-law-max-ℕ zero-ℕ = refl
left-successor-diagonal-law-max-ℕ (succ-ℕ x) =
  ap succ-ℕ (left-successor-diagonal-law-max-ℕ x)

right-successor-diagonal-law-max-ℕ : (x : ℕ) → max-ℕ x (succ-ℕ x) ＝ succ-ℕ x
right-successor-diagonal-law-max-ℕ zero-ℕ = refl
right-successor-diagonal-law-max-ℕ (succ-ℕ x) =
  ap succ-ℕ (right-successor-diagonal-law-max-ℕ x)

Addition distributes over `max-ℕ`

left-distributive-add-max-ℕ :
  (x y z : ℕ) → x +ℕ (max-ℕ y z) ＝ max-ℕ (x +ℕ y) (x +ℕ z)
left-distributive-add-max-ℕ zero-ℕ y z =
  ( left-unit-law-add-ℕ (max-ℕ y z)) ∙
  ( ap-max-ℕ (inv (left-unit-law-add-ℕ y)) (inv (left-unit-law-add-ℕ z)))
left-distributive-add-max-ℕ (succ-ℕ x) y z =
  ( left-successor-law-add-ℕ x (max-ℕ y z)) ∙
  ( ( ap succ-ℕ (left-distributive-add-max-ℕ x y z)) ∙
    ( ap-max-ℕ
      ( inv (left-successor-law-add-ℕ x y))
      ( inv (left-successor-law-add-ℕ x z))))

right-distributive-add-max-ℕ :
  (x y z : ℕ) → (max-ℕ x y) +ℕ z ＝ max-ℕ (x +ℕ z) (y +ℕ z)
right-distributive-add-max-ℕ x y z =
  ( commutative-add-ℕ (max-ℕ x y) z) ∙
  ( ( left-distributive-add-max-ℕ z x y) ∙
    ( ap-max-ℕ (commutative-add-ℕ z x) (commutative-add-ℕ z y)))