Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Aether Catalog definitions — Bridges_PrimeSpectrum

Definition
Bridges_PrimeSpectrum

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

aether-catalogbridges

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

Definition code
-- Def bundle generated from Bridges/PrimeSpectrum.lean by skeleton subtraction
import Mathlib

universe u v
/-
  Bridge: connects ideal-lattice equivalences and prime-spectrum invariance
  to post_quantum_security lattice semantics and algebraic geometry.

  Defines PrimeClosureLatticeIso, proves prime preservation/reflection,
  and builds the induced prime-spectrum equivalence.
-/

namespace ClosureMorita

/-! ## 1. Prime Closure Lattice Isomorphism -/

/-- An order isomorphism of ideal lattices that preserves and reflects primality.
Bridge: connects ideal-lattice geometry to post_quantum_security —
lattice-based cryptographic hardness is invariant under prime-preserving
ideal equivalences. -/
structure PrimeClosureLatticeIso
    (R : Type u) (S : Type v) [CommSemiring R] [CommSemiring S] where
  toOrderIso : Ideal R ≃o Ideal S
  preservesPrime :
    ∀ I : Ideal R, I.IsPrime → (toOrderIso I).IsPrime
  reflectsPrime :
    ∀ J : Ideal S, J.IsPrime → (toOrderIso.symm J).IsPrime

/-! ## 2. Prime Preservation and Reflection -/




/-! ## 3. Prime Spectrum Type and Equivalence -/

/-- The prime spectrum of a commutative semiring: the type of prime ideals.
Bridge: connects algebraic geometry's Spec functor to lattice-based
post_quantum_security analysis. -/
def ClosurePrimeSpectrum (R : Type u) [CommSemiring R] :=
  { I : Ideal R // I.IsPrime }

/-- The induced equivalence on prime spectra from a PrimeClosureLatticeIso.
Bridge: connects prime spectrum bijection to post_quantum_security —
Morita-equivalent semirings have equivalent prime spectra, ensuring
lattice-hardness invariance. -/
noncomputable def ClosurePrimeSpectrum.equivOfPrimeClosureLatticeIso
    {R S : Type*} [CommSemiring R] [CommSemiring S]
    (e : PrimeClosureLatticeIso R S) :
    ClosurePrimeSpectrum R ≃ ClosurePrimeSpectrum S where
  toFun := fun ⟨I, hI⟩ => ⟨e.toOrderIso I, e.preservesPrime I hI⟩
  invFun := fun ⟨J, hJ⟩ => ⟨e.toOrderIso.symm J, e.reflectsPrime J hJ⟩
  left_inv := fun x => Subtype.ext (OrderIso.symm_apply_apply e.toOrderIso x.1)
  right_inv := fun x => Subtype.ext (OrderIso.apply_symm_apply e.toOrderIso x.1)



/-! ## 4. Closure-Preserving Ideal Lattice Equivalence -/

 -- placeholder compatibility


end ClosureMorita

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