Aether Catalog definitions — Bridges_ComposableTransfer
DefinitionBridges_ComposableTransferaether-catalogbridges
Definition bundle for the Aether Catalog module Bridges.ComposableTransfer, transplanted by skeleton subtraction; supplies the types and constants the catalog's theorems import.
Definition code
-- Def bundle generated from Bridges/ComposableTransfer.lean by skeleton subtraction
import Mathlib
import Definitions.Def_Bridges_TheoryMorphisms
/-
Copyright (c) 2025 Harmonic. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
# Composable Theorem Transfer: A Calculus of Transportable Guarantees
This file establishes the foundational infrastructure for **compositional
transfer of certified properties** across chains of theory morphisms.
The key insight is that proof-bearing predicates propagate functorially
through `TheoryHom` composition, turning isolated correspondences into
a reusable calculus of cross-domain theorem transport.
## Main definitions
* `PreservesProperty` — a theory morphism preserves `P ⇒ Q` if
`∀ x, P x → Q (φ.toFun x)`
* `CertifiedTransfer` — bundles a morphism with its preservation witness
## Main results
* `TheoryHom.preserves_comp` — composition of morphisms preserves
composed predicates: if φ preserves P⇒Q and ψ preserves Q⇒R,
then φ;ψ preserves P⇒R
* `TheoryHom.transport_theorem_comp` — the `Set.MapsTo` variant:
composed morphisms map certified source sets into certified target sets
* `CertifiedTransfer.comp` — bundled composition of certified transfers
* Concrete instantiations with the catalog theories (Height, Cell,
Dimension, Stability, Capacity)
## Design philosophy
This file elevates the theory morphism framework from a collection of
isolated bridges into a **calculus of transportable guarantees**. Once a
property is certified in one domain, it can be exported, composed, and
reinterpreted in another without reproving from scratch. This is the
formal seed of a "science of scientific analogy."
-/
open Set Function
/-! ## §1. Predicate Preservation -/
/-- A theory morphism `φ : TheoryHom T₁ T₂` **preserves** predicate `P` to `Q`
if every object satisfying `P` maps to an object satisfying `Q`. -/
def PreservesProperty {T₁ T₂ : ResearchTheory}
(φ : TheoryHom T₁ T₂) (P : T₁.Carrier → Prop) (Q : T₂.Carrier → Prop) : Prop :=
∀ x, P x → Q (φ.toFun x)
/-! ## §2. The Composition Theorem -/
/-- **Compositional predicate transport**: if `φ` preserves `P ⇒ Q` and
`ψ` preserves `Q ⇒ R`, then their composition preserves `P ⇒ R`.
This is the central theorem: certified properties propagate functorially
through chains of theory morphisms. -/
theorem TheoryHom.preserves_comp
{T₁ T₂ T₃ : ResearchTheory}
(φ : TheoryHom T₁ T₂)
(ψ : TheoryHom T₂ T₃)
(P : T₁.Carrier → Prop)
(Q : T₂.Carrier → Prop)
(R : T₃.Carrier → Prop)
(hφ : PreservesProperty φ P Q)
(hψ : PreservesProperty ψ Q R) :
PreservesProperty (TheoryHom.comp φ ψ) P R :=
fun x hPx => hψ (φ.toFun x) (hφ x hPx)
/-! ## §3. Bundled Certified Transfer -/
/-- A **certified transfer** bundles a theory morphism with its
predicate preservation witness. This is the fundamental unit
of composable theorem transport. -/
structure CertifiedTransfer
(T₁ T₂ : ResearchTheory)
(P : T₁.Carrier → Prop)
(Q : T₂.Carrier → Prop) where
/-- The underlying theory morphism -/
hom : TheoryHom T₁ T₂
/-- The preservation certificate -/
preserves : PreservesProperty hom P Q
/-- **Composition of certified transfers**: the core combinator that
makes theorem transport reusable. -/
def CertifiedTransfer.comp
{T₁ T₂ T₃ : ResearchTheory}
{P : T₁.Carrier → Prop}
{Q : T₂.Carrier → Prop}
{R : T₃.Carrier → Prop}
(ct₁ : CertifiedTransfer T₁ T₂ P Q)
(ct₂ : CertifiedTransfer T₂ T₃ Q R) :
CertifiedTransfer T₁ T₃ P R where
hom := TheoryHom.comp ct₁.hom ct₂.hom
preserves := TheoryHom.preserves_comp ct₁.hom ct₂.hom P Q R ct₁.preserves ct₂.preserves
/-! ## §4. Depth-Based Certified Properties -/
/-- An object has **certified depth at least n**. -/
def HasDepthAtLeast (T : ResearchTheory) (n : ℕ) (x : T.Carrier) : Prop :=
n ≤ T.Inv x
/-! ## §5. Catalog Instantiations -/
/-- A height value is **arithmetically significant** if it is at least 2. -/
def ArithmeticallySignificant (x : HeightTheory.Carrier) : Prop :=
2 ≤ HeightTheory.Inv x
/-- A cell parameter has **nontrivial complexity** if its invariant exceeds 2. -/
def NontrivialCellComplexity (x : CellTheory.Carrier) : Prop :=
2 ≤ CellTheory.Inv x
/-! ## §6. Transport of Existential Witnesses -/
/-! ## §7. Predicate Lifting and Pushforward -/
/-- **Pushforward predicate**: given a morphism φ and a source predicate P,
define the pushforward predicate on the target. -/
def TheoryHom.pushforward
{T₁ T₂ : ResearchTheory}
(φ : TheoryHom T₁ T₂)
(P : T₁.Carrier → Prop) : T₂.Carrier → Prop :=
fun y => ∃ x, P x ∧ φ.toFun x = y
/-! ## §8. Concrete Three-Theory Chain -/
/-! ## §9. Generic Predicate Transport Backup Theorem -/
/-! ## §10. Certified Transfer Chains -/
#check @TheoryHom.preserves_comp
#check @CertifiedTransfer.comp