Tropicalization of finitary operations #
This file provides the "big-op" or notation-based finitary operations on tropicalized types. This allows easy conversion between sums to Infs and prods to sums. Results here are important for expressing that evaluation of tropical polynomials are the minimum over a finite piecewise collection of linear functions.
Main declarations #
Implementation notes #
No concrete (semi)ring is used here, only ones with inferrable order/lattice structure, to support
Real, Rat, EReal, and others (ERat is not yet defined).
Minima over List α are defined as producing a value in WithTop α so proofs about lists do not
directly transfer to minima over multisets or finsets.
theorem
Multiset.trop_sum
{R : Type u_1}
[inst : AddCommMonoid R]
(s : Multiset R)
:
Tropical.trop (Multiset.sum s) = Multiset.prod (Multiset.map Tropical.trop s)
theorem
trop_sum
{R : Type u_1}
{S : Type u_2}
[inst : AddCommMonoid R]
(s : Finset S)
(f : S → R)
:
Tropical.trop (Finset.sum s fun i => f i) = Finset.prod s fun i => Tropical.trop (f i)
theorem
Multiset.untrop_prod
{R : Type u_1}
[inst : AddCommMonoid R]
(s : Multiset (Tropical R))
:
Tropical.untrop (Multiset.prod s) = Multiset.sum (Multiset.map Tropical.untrop s)
theorem
untrop_prod
{R : Type u_1}
{S : Type u_2}
[inst : AddCommMonoid R]
(s : Finset S)
(f : S → Tropical R)
:
Tropical.untrop (Finset.prod s fun i => f i) = Finset.sum s fun i => Tropical.untrop (f i)
theorem
List.trop_minimum
{R : Type u_1}
[inst : LinearOrder R]
(l : List R)
:
Tropical.trop (List.minimum l) = List.sum (List.map (Tropical.trop ∘ WithTop.some) l)
theorem
Multiset.trop_inf
{R : Type u_1}
[inst : LinearOrder R]
[inst : OrderTop R]
(s : Multiset R)
:
Tropical.trop (Multiset.inf s) = Multiset.sum (Multiset.map Tropical.trop s)
theorem
Finset.trop_inf
{R : Type u_1}
{S : Type u_2}
[inst : LinearOrder R]
[inst : OrderTop R]
(s : Finset S)
(f : S → R)
:
Tropical.trop (Finset.inf s f) = Finset.sum s fun i => Tropical.trop (f i)
theorem
trop_infₛ_image
{R : Type u_1}
{S : Type u_2}
[inst : ConditionallyCompleteLinearOrder R]
(s : Finset S)
(f : S → WithTop R)
:
Tropical.trop (infₛ (f '' ↑s)) = Finset.sum s fun i => Tropical.trop (f i)
theorem
trop_infᵢ
{R : Type u_1}
{S : Type u_2}
[inst : ConditionallyCompleteLinearOrder R]
[inst : Fintype S]
(f : S → WithTop R)
:
Tropical.trop (⨅ i, f i) = Finset.sum Finset.univ fun i => Tropical.trop (f i)
theorem
Multiset.untrop_sum
{R : Type u_1}
[inst : LinearOrder R]
[inst : OrderTop R]
(s : Multiset (Tropical R))
:
Tropical.untrop (Multiset.sum s) = Multiset.inf (Multiset.map Tropical.untrop s)
theorem
Finset.untrop_sum'
{R : Type u_1}
{S : Type u_2}
[inst : LinearOrder R]
[inst : OrderTop R]
(s : Finset S)
(f : S → Tropical R)
:
Tropical.untrop (Finset.sum s fun i => f i) = Finset.inf s (Tropical.untrop ∘ f)
theorem
untrop_sum_eq_infₛ_image
{R : Type u_1}
{S : Type u_2}
[inst : ConditionallyCompleteLinearOrder R]
(s : Finset S)
(f : S → Tropical (WithTop R))
:
Tropical.untrop (Finset.sum s fun i => f i) = infₛ (Tropical.untrop ∘ f '' ↑s)
theorem
untrop_sum
{R : Type u_1}
{S : Type u_2}
[inst : ConditionallyCompleteLinearOrder R]
[inst : Fintype S]
(f : S → Tropical (WithTop R))
:
Tropical.untrop (Finset.sum Finset.univ fun i => f i) = ⨅ i, Tropical.untrop (f i)
theorem
Finset.untrop_sum
{R : Type u_1}
{S : Type u_2}
[inst : ConditionallyCompleteLinearOrder R]
(s : Finset S)
(f : S → Tropical (WithTop R))
:
Tropical.untrop (Finset.sum s fun i => f i) = ⨅ i, Tropical.untrop (f ↑i)
Note we cannot use i ∈ s∈ s instead of i : s here
as it is simply not true on conditionally complete lattices!