{-# OPTIONS --safe --cubical-compatible --guardedness --exact-split --double-check #-}
module Physics.Newton.Poisson where
open import Data.Rational using (ℚ; 0ℚ; 1ℚ; _+_; _*_; -_)
open import Data.Rational.Properties using
(+-assoc; +-identityˡ; +-identityʳ; +-inverseʳ; +-comm; *-assoc
; *-comm; *-zeroˡ; *-zeroʳ; *-identityˡ; *-distribˡ-+; *-distribʳ-+
; neg-distrib-+; neg-distribʳ-*)
open import Relation.Binary.PropositionalEquality using
(_≡_; refl; sym; cong; cong₂; module ≡-Reasoning)
open import Base.RationalRing using (neg-involutive)
record Obs : Set where
constructor obs
field
c : ℚ
a : ℚ
b : ℚ
open Obs
obs-add : Obs → Obs → Obs
obs-add (obs c a b) (obs c' a' b') = obs (c + c') (a + a') (b + b')
obs-scale : ℚ → Obs → Obs
obs-scale r (obs c a b) = obs (r * c) (r * a) (r * b)
obs-neg : Obs → Obs
obs-neg (obs c a b) = obs (- c) (- a) (- b)
obs-zero : Obs
obs-zero = obs 0ℚ 0ℚ 0ℚ
obs-one : Obs
obs-one = obs 1ℚ 0ℚ 0ℚ
qO : Obs
qO = obs 0ℚ 1ℚ 0ℚ
pO : Obs
pO = obs 0ℚ 0ℚ 1ℚ
obs-bracket : Obs → Obs → Obs
obs-bracket (obs _ a b) (obs _ a' b') = obs (a * b' + - (b * a')) 0ℚ 0ℚ
infix 6 obs-bracket
obs-bracket-self : ∀ f → obs-bracket f f ≡ obs-zero
obs-bracket-self (obs _ a b) =
cong (λ x → obs x 0ℚ 0ℚ) lemma
where
lemma : a * b + - (b * a) ≡ 0ℚ
lemma = let open ≡-Reasoning in begin
a * b + - (b * a)
≡⟨ cong (λ x → a * b + - x) (*-comm b a) ⟩
a * b + - (a * b)
≡⟨ +-inverseʳ (a * b) ⟩
0ℚ ∎
obs-bracket-skew : ∀ f g → obs-bracket g f ≡ obs-neg (obs-bracket f g)
obs-bracket-skew (obs _ a b) (obs _ a' b') =
cong (λ x → obs x 0ℚ 0ℚ) lemma
where
lemma : a' * b + - (b' * a) ≡ - (a * b' + - (b * a'))
lemma = let open ≡-Reasoning in begin
a' * b + - (b' * a)
≡⟨ cong₂ (λ x y → x + - y) (*-comm a' b) (*-comm b' a) ⟩
b * a' + - (a * b')
≡⟨ +-comm (b * a') (- (a * b')) ⟩
- (a * b') + b * a'
≡⟨ cong (λ x → - (a * b') + x) (sym (neg-involutive (b * a'))) ⟩
- (a * b') + - (- (b * a'))
≡⟨ sym (neg-distrib-+ (a * b') (- (b * a'))) ⟩
- (a * b' + - (b * a')) ∎
obs-bracket-qp : obs-bracket qO pO ≡ obs-one
obs-bracket-qp = refl
bracket-qq : obs-bracket qO qO ≡ obs-zero
bracket-qq = obs-bracket-self qO
bracket-pp : obs-bracket pO pO ≡ obs-zero
bracket-pp = obs-bracket-self pO
obs-bracket-addˡ : ∀ f g h →
obs-bracket (obs-add f g) h ≡ obs-add (obs-bracket f h) (obs-bracket g h)
obs-bracket-addˡ (obs _ af bf) (obs _ ag bg) (obs _ ah bh) =
cong (λ x → obs x 0ℚ 0ℚ) lemma
where
lemma : (af + ag) * bh + - ((bf + bg) * ah)
≡ (af * bh + - (bf * ah)) + (ag * bh + - (bg * ah))
lemma = let open ≡-Reasoning in begin
(af + ag) * bh + - ((bf + bg) * ah)
≡⟨ cong₂ (λ x y → x + - y) (*-distribʳ-+ bh af ag)
(*-distribʳ-+ ah bf bg) ⟩
(af * bh + ag * bh) + - (bf * ah + bg * ah)
≡⟨ cong ((af * bh + ag * bh) +_)
(neg-distrib-+ (bf * ah) (bg * ah)) ⟩
(af * bh + ag * bh) + (- (bf * ah) + - (bg * ah))
≡⟨ swap4 (af * bh) (ag * bh) (- (bf * ah)) (- (bg * ah)) ⟩
(af * bh + - (bf * ah)) + (ag * bh + - (bg * ah)) ∎
where
swap4 : ∀ w x y z → (w + x) + (y + z) ≡ (w + y) + (x + z)
swap4 w x y z = let open ≡-Reasoning in begin
(w + x) + (y + z)
≡⟨ +-assoc w x (y + z) ⟩
w + (x + (y + z))
≡⟨ cong (w +_) (sym (+-assoc x y z)) ⟩
w + ((x + y) + z)
≡⟨ cong (λ t → w + (t + z)) (+-comm x y) ⟩
w + ((y + x) + z)
≡⟨ cong (w +_) (+-assoc y x z) ⟩
w + (y + (x + z))
≡⟨ sym (+-assoc w y (x + z)) ⟩
(w + y) + (x + z) ∎
obs-bracket-addʳ : ∀ f g h →
obs-bracket f (obs-add g h) ≡ obs-add (obs-bracket f g) (obs-bracket f h)
obs-bracket-addʳ f g h = let open ≡-Reasoning in begin
obs-bracket f (obs-add g h)
≡⟨ obs-bracket-skew (obs-add g h) f ⟩
obs-neg (obs-bracket (obs-add g h) f)
≡⟨ cong obs-neg (obs-bracket-addˡ g h f) ⟩
obs-neg (obs-add (obs-bracket g f) (obs-bracket h f))
≡⟨ neg-add (obs-bracket g f) (obs-bracket h f) ⟩
obs-add (obs-neg (obs-bracket g f)) (obs-neg (obs-bracket h f))
≡⟨ cong₂ obs-add (sym (obs-bracket-skew g f)) (sym (obs-bracket-skew h f)) ⟩
obs-add (obs-bracket f g) (obs-bracket f h) ∎
where
neg-add : ∀ u v → obs-neg (obs-add u v) ≡ obs-add (obs-neg u) (obs-neg v)
neg-add (obs c a b) (obs c' a' b') = let open ≡-Reasoning in begin
obs (- (c + c')) (- (a + a')) (- (b + b'))
≡⟨ cong (λ x → obs x (- (a + a')) (- (b + b')))
(neg-distrib-+ c c') ⟩
obs (- c + - c') (- (a + a')) (- (b + b'))
≡⟨ cong₂ (obs (- c + - c'))
(neg-distrib-+ a a') (neg-distrib-+ b b') ⟩
obs (- c + - c') (- a + - a') (- b + - b') ∎
obs-bracket-scaleˡ : ∀ r f g →
obs-bracket (obs-scale r f) g ≡ obs-scale r (obs-bracket f g)
obs-bracket-scaleˡ r f@(obs _ a b) g@(obs _ a' b') =
let open ≡-Reasoning in begin
obs-bracket (obs-scale r f) g
≡⟨ cong (λ x → obs x 0ℚ 0ℚ) lemma ⟩
obs (r * (a * b' + - (b * a'))) 0ℚ 0ℚ
≡⟨ cong₂ (obs (r * (a * b' + - (b * a'))))
(sym (*-zeroʳ r)) (sym (*-zeroʳ r)) ⟩
obs (r * (a * b' + - (b * a'))) (r * 0ℚ) (r * 0ℚ) ∎
where
lemma : (r * a) * b' + - ((r * b) * a')
≡ r * (a * b' + - (b * a'))
lemma = let open ≡-Reasoning in begin
(r * a) * b' + - ((r * b) * a')
≡⟨ cong₂ (λ x y → x + - y) (*-assoc r a b') (*-assoc r b a') ⟩
r * (a * b') + - (r * (b * a'))
≡⟨ cong (r * (a * b') +_) (neg-distribʳ-* r (b * a')) ⟩
r * (a * b') + r * (- (b * a'))
≡⟨ sym (*-distribˡ-+ r (a * b') (- (b * a'))) ⟩
r * (a * b' + - (b * a')) ∎
obs-bracket-scaleʳ : ∀ r f g →
obs-bracket f (obs-scale r g) ≡ obs-scale r (obs-bracket f g)
obs-bracket-scaleʳ r f g = let open ≡-Reasoning in begin
obs-bracket f (obs-scale r g)
≡⟨ obs-bracket-skew (obs-scale r g) f ⟩
obs-neg (obs-bracket (obs-scale r g) f)
≡⟨ cong obs-neg (obs-bracket-scaleˡ r g f) ⟩
obs-neg (obs-scale r (obs-bracket g f))
≡⟨ neg-scale r (obs-bracket g f) ⟩
obs-scale r (obs-neg (obs-bracket g f))
≡⟨ cong (obs-scale r) (sym (obs-bracket-skew g f)) ⟩
obs-scale r (obs-bracket f g) ∎
where
neg-scale : ∀ r u → obs-neg (obs-scale r u) ≡ obs-scale r (obs-neg u)
neg-scale r (obs c a b) = let open ≡-Reasoning in begin
obs (- (r * c)) (- (r * a)) (- (r * b))
≡⟨ cong (λ x → obs x (- (r * a)) (- (r * b)))
(neg-distribʳ-* r c) ⟩
obs (r * - c) (- (r * a)) (- (r * b))
≡⟨ cong₂ (obs (r * - c))
(neg-distribʳ-* r a) (neg-distribʳ-* r b) ⟩
obs (r * - c) (r * - a) (r * - b) ∎
central-kill : ∀ k h → obs-bracket (obs k 0ℚ 0ℚ) h ≡ obs-zero
central-kill k (obs _ a b) = cong (λ x → obs x 0ℚ 0ℚ) lemma
where
lemma : 0ℚ * b + - (0ℚ * a) ≡ 0ℚ
lemma = let open ≡-Reasoning in begin
0ℚ * b + - (0ℚ * a)
≡⟨ cong₂ (λ x y → x + - y) (*-zeroˡ b) (*-zeroˡ a) ⟩
0ℚ + - 0ℚ
≡⟨ +-inverseʳ 0ℚ ⟩
0ℚ ∎
nested-zero : ∀ f g h → obs-bracket (obs-bracket f g) h ≡ obs-zero
nested-zero (obs _ af bf) (obs _ ag bg) h =
central-kill (af * bg + - (bf * ag)) h
add-zeroˡ : ∀ u → obs-add obs-zero u ≡ u
add-zeroˡ (obs c a b) = let open ≡-Reasoning in begin
obs (0ℚ + c) (0ℚ + a) (0ℚ + b)
≡⟨ cong (λ x → obs x (0ℚ + a) (0ℚ + b)) (+-identityˡ c) ⟩
obs c (0ℚ + a) (0ℚ + b)
≡⟨ cong₂ (obs c) (+-identityˡ a) (+-identityˡ b) ⟩
obs c a b ∎
jacobi-identity : ∀ f g h →
obs-add (obs-add (obs-bracket (obs-bracket f g) h)
(obs-bracket (obs-bracket g h) f))
(obs-bracket (obs-bracket h f) g) ≡ obs-zero
jacobi-identity f g h = let open ≡-Reasoning in begin
obs-add (obs-add (obs-bracket (obs-bracket f g) h)
(obs-bracket (obs-bracket g h) f))
(obs-bracket (obs-bracket h f) g)
≡⟨ cong₂ (λ x y → obs-add (obs-add x (obs-bracket (obs-bracket g h) f)) y)
(nested-zero f g h) (nested-zero h f g) ⟩
obs-add (obs-add obs-zero (obs-bracket (obs-bracket g h) f)) obs-zero
≡⟨ cong (λ x → obs-add (obs-add obs-zero x) obs-zero) (nested-zero g h f) ⟩
obs-add (obs-add obs-zero obs-zero) obs-zero
≡⟨ cong (λ x → obs-add x obs-zero) (add-zeroˡ obs-zero) ⟩
obs-add obs-zero obs-zero
≡⟨ add-zeroˡ obs-zero ⟩
obs-zero ∎
ham-vec : Obs → Obs → Obs
ham-vec H f = obs-bracket f H
eom-q : ∀ H → ham-vec H qO ≡ obs (b H) 0ℚ 0ℚ
eom-q (obs _ a b) = let open ≡-Reasoning in begin
obs (1ℚ * b + - (0ℚ * a)) 0ℚ 0ℚ
≡⟨ cong (λ x → obs x 0ℚ 0ℚ) lemma ⟩
obs b 0ℚ 0ℚ ∎
where
lemma : 1ℚ * b + - (0ℚ * a) ≡ b
lemma = let open ≡-Reasoning in begin
1ℚ * b + - (0ℚ * a)
≡⟨ cong (λ x → 1ℚ * b + - x) (*-zeroˡ a) ⟩
1ℚ * b + - 0ℚ
≡⟨ cong (λ x → x + - 0ℚ) (*-identityˡ b) ⟩
b + - 0ℚ
≡⟨ +-identityʳ b ⟩
b ∎
eom-p : ∀ H → ham-vec H pO ≡ obs (- a H) 0ℚ 0ℚ
eom-p (obs _ a b) = let open ≡-Reasoning in begin
obs (0ℚ * b + - (1ℚ * a)) 0ℚ 0ℚ
≡⟨ cong (λ x → obs x 0ℚ 0ℚ) lemma ⟩
obs (- a) 0ℚ 0ℚ ∎
where
lemma : 0ℚ * b + - (1ℚ * a) ≡ - a
lemma = let open ≡-Reasoning in begin
0ℚ * b + - (1ℚ * a)
≡⟨ cong (λ x → 0ℚ * b + - x) (*-identityˡ a) ⟩
0ℚ * b + - a
≡⟨ cong (λ x → x + - a) (*-zeroˡ b) ⟩
0ℚ + - a
≡⟨ +-identityˡ (- a) ⟩
- a ∎
energy-conserved : ∀ H → ham-vec H H ≡ obs-zero
energy-conserved H = obs-bracket-self H
H-const-force : Obs
H-const-force = obs 0ℚ (- (1ℚ + 1ℚ)) 1ℚ
const-force-qdot : ham-vec H-const-force qO ≡ obs-one
const-force-qdot = refl
const-force-pdot : ham-vec H-const-force pO ≡ obs (1ℚ + 1ℚ) 0ℚ 0ℚ
const-force-pdot = refl
const-force-energy : ham-vec H-const-force H-const-force ≡ obs-zero
const-force-energy = energy-conserved H-const-force