Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Aether Catalog definitions — Bridges_CategoricalTropicalUltrametric

Definition
Bridges_CategoricalTropicalUltrametric

by raver1975 · Sep 16, 2026 · Mathlib c5ea003 (Lean v4.30.0)

aether-catalogbridges

Definition bundle for the Aether Catalog module Bridges.CategoricalTropicalUltrametric, transplanted by skeleton subtraction; supplies the types and constants the catalog's theorems import.

Definition code
-- Def bundle generated from Bridges/CategoricalTropicalUltrametric.lean by skeleton subtraction
import Mathlib
/-
  # Categorical Tropical–Ultrametric Equivalence
  ## via Valuation Reconstruction and Functorial Bound Transfer

  Bridge: connects tropical algebra ↔ ultrametric analysis ↔ certified robustness ↔
  post-quantum lattice-style metrics.

  **Core principle**: tropical valuation data on an ordered idempotent semiring can be
  reconstructed into an ultrametric seminorm, and quantitative bounds proven in the
  tropical world transfer functorially to ultrametric certified bounds relevant to
  quantum/cryptographic/ML settings.

  The most important mathematical message: **valuation reconstruction is not just a
  dictionary — it is a quantitative functor**.
-/


open Function

universe u

noncomputable section

namespace CategoricalTropicalUltrametric

/-! ## §1. Tropical Valuation Objects

Bridge: connects tropical algebra to ultrametric geometry and certified robustness. -/

/-- A tropical valuation object: a linearly ordered additive-idempotent commutative monoid
    with a compatible multiplicative structure. The key axiom `add_eq_max'` encodes the
    tropical "addition = max" principle. -/
structure TropicalValuationObject (R : Type u) where
  le : R → R → Prop
  le_refl : ∀ a, le a a
  le_antisymm : ∀ {a b}, le a b → le b a → a = b
  le_trans : ∀ {a b c}, le a b → le b c → le a c
  le_total : ∀ a b, le a b ∨ le b a
  zero : R
  one : R
  add : R → R → R
  mul : R → R → R
  max_op : R → R → R
  add_eq_max' : ∀ a b, add a b = max_op a b
  max_comm : ∀ a b, max_op a b = max_op b a
  max_assoc : ∀ a b c, max_op (max_op a b) c = max_op a (max_op b c)
  max_idem : ∀ a, max_op a a = a
  max_le_left : ∀ a b, le a (max_op a b)
  max_le_right : ∀ a b, le b (max_op a b)
  max_least : ∀ {a b c}, le a c → le b c → le (max_op a b) c
  mul_comm : ∀ a b, mul a b = mul b a
  mul_assoc : ∀ a b c, mul (mul a b) c = mul a (mul b c)
  mul_one : ∀ a, mul a one = a
  mul_zero : ∀ a, mul a zero = zero
  add_zero : ∀ a, add a zero = a

/-- Bundled tropical valuation object. -/
structure TropObj where
  α : Type u
  trop : TropicalValuationObject α

/-! ## §2. Ultrametric Seminorm Objects

Bridge: connects nonarchimedean analysis to tropical reconstruction and
post-quantum security. -/

/-- An ultrametric seminorm object: a type equipped with a seminorm into ℕ
    satisfying the ultrametric (strong) triangle inequality. Using ℕ as codomain
    gives clean arithmetic and direct computational constants. -/
structure UltraNormObj where
  α : Type u
  add_op : α → α → α
  neg_op : α → α
  zero_val : α
  sub_op : α → α → α
  sub_def : ∀ x y, sub_op x y = add_op x (neg_op y)
  mul_op : α → α → α
  norm : α → ℕ
  norm_zero : norm zero_val = 0
  norm_neg : ∀ x, norm (neg_op x) = norm x
  norm_add : ∀ x y, norm (add_op x y) ≤ max (norm x) (norm y)
  norm_mul : ∀ x y, norm (mul_op x y) = norm x * norm y

/-! ## §3. Morphisms -/

/-- A morphism of tropical objects: preserves addition (= max), multiplication,
    constants, and monotonicity. -/
structure TropHom (X Y : TropObj) where
  toFun : X.α → Y.α
  map_zero' : toFun X.trop.zero = Y.trop.zero
  map_one' : toFun X.trop.one = Y.trop.one
  map_add' : ∀ x y, toFun (X.trop.add x y) = Y.trop.add (toFun x) (toFun y)
  map_mul' : ∀ x y, toFun (X.trop.mul x y) = Y.trop.mul (toFun x) (toFun y)
  monotone' : ∀ x y, X.trop.le x y → Y.trop.le (toFun x) (toFun y)

/-- A morphism of ultrametric objects: preserves additive structure and is
    norm-nonexpansive. -/
structure UltraHom (X Y : UltraNormObj) where
  toFun : X.α → Y.α
  map_zero' : toFun X.zero_val = Y.zero_val
  map_add' : ∀ x y, toFun (X.add_op x y) = Y.add_op (toFun x) (toFun y)
  norm_nonexpansive' : ∀ x, Y.norm (toFun x) ≤ X.norm x

instance (X Y : TropObj) : CoeFun (TropHom X Y) (fun _ => X.α → Y.α) :=
  ⟨TropHom.toFun⟩

instance (X Y : UltraNormObj) : CoeFun (UltraHom X Y) (fun _ => X.α → Y.α) :=
  ⟨UltraHom.toFun⟩

/-- Bridge: extensionality for tropical morphisms — two morphisms agreeing on all
    points are equal. -/
@[ext]
theorem TropHom.ext {X Y : TropObj} {f g : TropHom X Y}
    (h : ∀ x, f.toFun x = g.toFun x) : f = g := by
  cases f; cases g; congr; exact funext h


/-! ## §4. Identity and Composition -/

def TropHom.id (X : TropObj) : TropHom X X where
  toFun := _root_.id
  map_zero' := rfl
  map_one' := rfl
  map_add' := fun _ _ => rfl
  map_mul' := fun _ _ => rfl
  monotone' := fun _ _ h => h

def TropHom.comp {X Y Z : TropObj} (g : TropHom Y Z) (f : TropHom X Y) : TropHom X Z where
  toFun x := g.toFun (f.toFun x)
  map_zero' := by rw [f.map_zero', g.map_zero']
  map_one' := by rw [f.map_one', g.map_one']
  map_add' := fun x y => by rw [f.map_add', g.map_add']
  map_mul' := fun x y => by rw [f.map_mul', g.map_mul']
  monotone' := fun x y h => g.monotone' _ _ (f.monotone' _ _ h)

def UltraHom.id (X : UltraNormObj) : UltraHom X X where
  toFun := _root_.id
  map_zero' := rfl
  map_add' := fun _ _ => rfl
  norm_nonexpansive' := fun _ => le_refl _

def UltraHom.comp {X Y Z : UltraNormObj} (g : UltraHom Y Z) (f : UltraHom X Y) :
    UltraHom X Z where
  toFun x := g.toFun (f.toFun x)
  map_zero' := by rw [f.map_zero', g.map_zero']
  map_add' := fun x y => by rw [f.map_add', g.map_add']
  norm_nonexpansive' := fun x =>
    le_trans (g.norm_nonexpansive' (f.toFun x)) (f.norm_nonexpansive' x)

/-! ## §5. Category Laws -/







/-! ## §6. Restricted Subclasses -/

/-- A tropical object is *rigid* if the max-additive structure separates points:
    any element satisfying the same max-equations as another must equal it. -/
class TropRigid (X : TropObj) : Prop where
  max_idempotent_separates : ∀ {x y : X.α}, (∀ z, X.trop.add x z = X.trop.add y z) → x = y

/-- An ultrametric object is *separated* if the norm detects equality:
    `norm x = 0 ↔ x = zero_val`. This is the ultrametric analogue of Hausdorff separation. -/
class UltraSeparated (X : UltraNormObj) : Prop where
  norm_eq_zero_iff : ∀ x, X.norm x = 0 ↔ x = X.zero_val





/-! ## §7. Tropical Valuation Carrier

A bundled field with a tropical valuation — the source for reconstruction. -/

/-- A carrier for valuation reconstruction: a type with ring-like operations and a
    valuation function into ℕ satisfying ultrametric-compatible axioms.
    Bridge: connects ring-theoretic valuation theory to constructive ultrametric norm recovery. -/
structure TropicalValuationCarrier where
  K : Type u
  add_op : K → K → K
  neg_op : K → K
  zero_val : K
  sub_op : K → K → K
  sub_def : ∀ x y, sub_op x y = add_op x (neg_op y)
  mul_op : K → K → K
  one_val : K
  val : K → ℕ
  val_zero : val zero_val = 0
  val_neg : ∀ x, val (neg_op x) = val x
  val_mul : ∀ x y, val (mul_op x y) = val x * val y
  val_add : ∀ x y, val (add_op x y) ≤ max (val x) (val y)

/-! ## §8. Valuation Reconstruction Functor

The key construction: recovering an ultrametric seminorm from tropical valuation data. -/

/-- **valuationReconstruct**: Given a tropical valuation carrier, reconstruct an
    ultrametric seminorm object. The norm is literally the valuation.
    Bridge: connects tropical valuation theory to ultrametric geometry constructively. -/
def valuationReconstruct (X : TropicalValuationCarrier) : UltraNormObj where
  α := X.K
  add_op := X.add_op
  neg_op := X.neg_op
  zero_val := X.zero_val
  sub_op := X.sub_op
  sub_def := X.sub_def
  mul_op := X.mul_op
  norm := X.val
  norm_zero := X.val_zero
  norm_neg := X.val_neg
  norm_add := X.val_add
  norm_mul := X.val_mul

/-! ## §9. Reconstruction Theorems -/





/-! ## §10. Tropicalization Functor -/

/-- The standard tropical valuation object on ℕ: addition is max, multiplication is ·*·. -/
def tropicalization_base : TropicalValuationObject ℕ where
  le := (· ≤ ·)
  le_refl := le_refl
  le_antisymm := fun h1 h2 => Nat.le_antisymm h1 h2
  le_trans := fun h1 h2 => le_trans h1 h2
  le_total := Nat.le_total
  zero := 0
  one := 1
  add := max
  mul := (· * ·)
  max_op := max
  add_eq_max' := fun _ _ => rfl
  max_comm := fun a b => by omega
  max_assoc := fun a b c => by omega
  max_idem := fun a => by omega
  max_le_left := fun a b => le_max_left a b
  max_le_right := fun a b => le_max_right a b
  max_least := fun h1 h2 => max_le h1 h2
  mul_comm := Nat.mul_comm
  mul_assoc := Nat.mul_assoc
  mul_one := Nat.mul_one
  mul_zero := Nat.mul_zero
  add_zero := fun a => by omega

/-- **tropicalization**: Given an ultrametric seminorm object, produce a tropical object
    whose underlying set is ℕ with max as addition. This forgets the ring structure and
    retains only the norm-value semiring.
    Bridge: connects ultrametric analysis to tropical optimization. -/
def tropicalization (_X : UltraNormObj) : TropObj where
  α := ℕ
  trop := tropicalization_base

/-- Action of tropicalization on morphisms: an ultrametric morphism induces a tropical
    morphism on the norm value spaces (the identity on ℕ).
    Bridge: connects ultrametric nonexpansiveness to tropical monotonicity. -/
def tropicalization_map {X Y : UltraNormObj} (_f : UltraHom X Y) :
    TropHom (tropicalization X) (tropicalization Y) where
  toFun := _root_.id
  map_zero' := rfl
  map_one' := rfl
  map_add' := fun _ _ => rfl
  map_mul' := fun _ _ => rfl
  monotone' := fun _ _ h => h



/-! ## §11. Valuation Reconstruction on Morphisms -/

/-- A morphism of valuation carriers preserving all operations and the valuation. -/
structure TropValCarrierHom (X Y : TropicalValuationCarrier) where
  toFun : X.K → Y.K
  map_zero' : toFun X.zero_val = Y.zero_val
  map_add' : ∀ x y, toFun (X.add_op x y) = Y.add_op (toFun x) (toFun y)
  map_neg' : ∀ x, toFun (X.neg_op x) = Y.neg_op (toFun x)
  val_nonexpansive' : ∀ x, Y.val (toFun x) ≤ X.val x

/-- Valuation reconstruction lifts carrier morphisms to ultrametric morphisms. -/
def valuationReconstruct_map {X Y : TropicalValuationCarrier}
    (f : TropValCarrierHom X Y) :
    UltraHom (valuationReconstruct X) (valuationReconstruct Y) where
  toFun := f.toFun
  map_zero' := f.map_zero'
  map_add' := f.map_add'
  norm_nonexpansive' := f.val_nonexpansive'

/-- Identity carrier morphism. -/
def TropValCarrierHom.id (X : TropicalValuationCarrier) : TropValCarrierHom X X where
  toFun := _root_.id
  map_zero' := rfl
  map_add' := fun _ _ => rfl
  map_neg' := fun _ => rfl
  val_nonexpansive' := fun _ => le_refl _

/-- Composition of carrier morphisms. -/
def TropValCarrierHom.comp {X Y Z : TropicalValuationCarrier}
    (g : TropValCarrierHom Y Z) (f : TropValCarrierHom X Y) : TropValCarrierHom X Z where
  toFun x := g.toFun (f.toFun x)
  map_zero' := by rw [f.map_zero', g.map_zero']
  map_add' := fun x y => by rw [f.map_add', g.map_add']
  map_neg' := fun x => by rw [f.map_neg', g.map_neg']
  val_nonexpansive' := fun x =>
    le_trans (g.val_nonexpansive' _) (f.val_nonexpansive' x)



/-! ## §12. Isomorphism Structures -/

/-- Isomorphism of tropical objects. -/
structure TropIso (X Y : TropObj) where
  hom : TropHom X Y
  inv : TropHom Y X
  hom_inv_id : TropHom.comp inv hom = TropHom.id X
  inv_hom_id : TropHom.comp hom inv = TropHom.id Y


/-- Identity isomorphism for tropical objects. -/
def TropIso.refl (X : TropObj) : TropIso X X where
  hom := TropHom.id X
  inv := TropHom.id X
  hom_inv_id := by ext x; rfl
  inv_hom_id := by ext x; rfl


/-! ## §13. Unit/Counit Isomorphisms on Restricted Subclasses -/

/-- Bridge: the unit isomorphism on rigid objects — tropicalization composed with
    valuation reconstruction yields an isomorphic tropical object.
    This is half of the restricted categorical equivalence. -/
def unit_iso_on_rigid_objects
    (X : TropicalValuationCarrier)
    [TropRigid (tropicalization (valuationReconstruct X))] :
    TropIso (tropicalization (valuationReconstruct X))
      (tropicalization (valuationReconstruct X)) :=
  TropIso.refl _





/-! ## §14. Bounded Maps -/



/-! ## §15. Lipschitz Predicates -/

/-- Bridge: tropical Lipschitz condition — a map scales norms by at most a constant factor.
    Connects tropical contraction to cryptographic key-stretch bounds. -/
def TropLipschitzWith (X : TropicalValuationCarrier) (C : ℕ) (f : X.K → X.K) : Prop :=
  ∀ x, X.val (f x) ≤ C * X.val x

/-- Bridge: ultrametric Lipschitz condition — a map between ultrametric objects scales
    norms by at most a constant factor.
    Connects to neural network certified robustness radii. -/
def UltraLipschitzWith (X : UltraNormObj) (C : ℕ) (f : X.α → X.α) : Prop :=
  ∀ x, X.norm (f x) ≤ C * X.norm x

/-! ## §16. Quantitative Bound Transfer Theorems

The conceptual heart of the bridge: tropical bounds transfer to ultrametric bounds
with explicit constants. -/




/-! ## §17. Application-Facing Theorems

Bridge: connects the abstract transfer principle to concrete applications in
quantum computing, cryptography, and machine learning. -/







/-! ## §18. Iterated Lipschitz Rate Theorems

Bridge: connects tropical contraction rates to ultrametric convergence rates via
induction on iteration count. The key result: C-Lipschitz maps have C^n-bounded
n-fold iterates. -/



/-! ## §19. Lipschitz Certified Robustness Transfer

Bridge: the main application theorem connecting tropical certified robustness to
ultrametric certified robustness via the valuation reconstruction functor. -/


/-! ## §20. Sub-norm Bound and Triangle Inequality Variants -/



/-! ## §21. Additional Cross-Domain Theorems -/






/-! ## §22. Functor Composition and Round-Trip Analysis -/

/-- The round-trip tropicalization ∘ valuationReconstruct produces a standard tropical
    object on ℕ. -/
def roundTrip_trop (X : TropicalValuationCarrier) : TropObj :=
  tropicalization (valuationReconstruct X)

/-- The round-trip valuation carrier from an ultrametric object. -/
def roundTrip_carrier (X : UltraNormObj) : TropicalValuationCarrier where
  K := X.α
  add_op := X.add_op
  neg_op := X.neg_op
  zero_val := X.zero_val
  sub_op := X.sub_op
  sub_def := X.sub_def
  mul_op := X.mul_op
  one_val := X.zero_val
  val := X.norm
  val_zero := X.norm_zero
  val_neg := X.norm_neg
  val_mul := X.norm_mul
  val_add := X.norm_add



/-! ## §23. Depth Separation and Layer Bounds -/





/-! ## §24. Separated Self-Distance and Consistency -/



/-! ## §25. Monotonicity and Order Properties -/





-- Verify axioms for key theorems
end CategoricalTropicalUltrametric

end

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me