Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Aether Catalog definitions — Bridges_ClosureNucleusDuality

Definition
Bridges_ClosureNucleusDuality

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

aether-catalogbridges

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

Definition code
-- Def bundle generated from Bridges/ClosureNucleusDuality.lean by skeleton subtraction
import Mathlib
/-
# Closure–Nucleus Spectral Duality via Idempotent Semimodules

This file formalizes a finite duality theorem at the interface of closure systems,
idempotent algebra, and algebraic logic. The core result shows that closure-theoretic
data equipped with a logical nucleus can be represented exactly by evaluation on
join-prime spectral points, and that this representation supports certified
reconstruction of closure operators and sound-and-complete Kripke-style semantics.

## Main Results

* `closure_subset_of_closed_superset` — Closure containment from superset closure.
* `implication_valid_iff_all_prime_points` — Completeness: x ∈ cl(A) ↔ all primes
  containing A contain x.
* `closure_equals_sInter_of_prime_points` — Closure reconstruction from prime
  intersection.
* `spectral_eval_injective` — Injectivity of the spectral evaluation map under
  separation.
* `finite_closure_nucleus_spectral_embedding` — Bijection between closed sets
  and spectral observables.
* `certified_closure_reconstruction` — Certified recovery of the closure operator
  from spectral data.
* `implication_semantics_complete` — Sound-and-complete finite Kripke semantics.
* `implicational_basis_reconstruction` — Finite implicational basis generation.
* `nucleus_fixed_fragment_characterization` — Reconstruction of the nucleus-fixed
  fragment from nucleus-stable primes.

Keywords: spectral duality, closure systems, nuclei, idempotent semimodules,
Horn logic, implicational bases, Kripke semantics, formal concept analysis,
certified reconstruction, finite Stone duality.
-/


open Set Function

namespace ClosureNucleusDuality

variable {α : Type*}

/-! ## Section 1: Core Definitions -/

/-- A set is closed under a closure operator when it is a fixed point. -/
def IsClosed (cl : Set α → Set α) (s : Set α) : Prop := cl s = s

/-- A closure operator is extensive, monotone, and idempotent. -/
structure IsClosureOperator (cl : Set α → Set α) : Prop where
  extensive : ∀ s, s ⊆ cl s
  mono : Monotone cl
  idempotent : ∀ s, cl (cl s) = cl s

/-- A finite closure-nucleus system: a closure operator on a finite type
    equipped with a nucleus on the closed-set semilattice. -/
structure FiniteClosureNucleus (α : Type*) [Fintype α] [DecidableEq α] where
  cl : Set α → Set α
  isClosure : IsClosureOperator cl
  nuc : Set α → Set α
  nuc_closed : ∀ s, IsClosed cl s → IsClosed cl (nuc s)
  nuc_mono : Monotone nuc
  nuc_idem : ∀ s, nuc (nuc s) = nuc s
  nuc_extensive_on_closed : ∀ s, IsClosed cl s → s ⊆ nuc s

/-- A join-prime closed set stable under the nucleus: closed, nucleus-fixed,
    and nonempty. -/
structure JoinPrimeClosed (cl : Set α → Set α) (nuc : Set α → Set α) (p : Set α) : Prop where
  closed : IsClosed cl p
  nuc_stable : nuc p = p
  nonempty : p.Nonempty

/-! ## Section 2: Basic Properties of Closure Operators -/

variable {α : Type*}




/-! ## Section 3: Separation and Spectral Completeness -/

/-- The prime separation condition: for every closed set s and element x ∉ s,
    there exists a join-prime stable closed set containing s but not x.
    This is the "enough points" condition for finite spectral duality. -/
def PrimeSeparation (cl : Set α → Set α) (nuc : Set α → Set α) : Prop :=
  ∀ (s : Set α) (x : α), IsClosed cl s → x ∉ s →
    ∃ p, JoinPrimeClosed cl nuc p ∧ s ⊆ p ∧ x ∉ p



/-! ## Section 4: Spectral Evaluation Map -/

/-- The spectral evaluation map: sends a set s to the predicate on primes
    recording which primes contain s. -/
def spectralEval (cl : Set α → Set α) (nuc : Set α → Set α)
    (s : Set α) : {p : Set α // JoinPrimeClosed cl nuc p} → Prop :=
  fun q => s ⊆ q.val


/-! ## Section 5: Finite Spectral Embedding and Duality -/

section FiniteDuality
open Classical in
noncomputable section
variable [Fintype α] [DecidableEq α]

/-- A spectral observable: a predicate on prime points that is realizable as
    evaluation of some closed set. -/
def SpectralObservable (cl : Set α → Set α) (nuc : Set α → Set α)
    (f : {p : Set α // JoinPrimeClosed cl nuc p} → Prop) : Prop :=
  ∃ s : Set α, IsClosed cl s ∧ f = fun q => s ⊆ q.val


/-! ## Section 6: Certified Theory Reconstruction -/


/-! ## Section 7: Kripke Semantics -/

/-- Kripke entailment: A entails x when every prime point containing all of A
    also contains x. -/
def KripkeEntails (cl : Set α → Set α) (nuc : Set α → Set α)
    (A : Set α) (x : α) : Prop :=
  ∀ p, JoinPrimeClosed cl nuc p → A ⊆ p → x ∈ p


/-! ## Section 8: Implicational Basis Reconstruction -/

/-- An implicational rule `(Γ, x)` is valid in a closure system when
    `x ∈ cl(↑Γ)`. -/
def ImplicationValid (cl : Set α → Set α) (rule : Finset α × α) : Prop :=
  rule.2 ∈ cl (↑rule.1 : Set α)



/-! ## Section 9: Nucleus-Fixed Fragment Characterization -/


/-! ## Section 10: Spectral Reconstruction Bridge -/


/-! ## Section 11: Full Duality — Closed Sets ≅ Downward-Closed Observables

In the finite setting, the spectral evaluation gives not just an embedding
but a full bijection between closed sets and realizable observables. Combined
with the reconstruction theorems, this gives the complete finite closure–nucleus
spectral duality. -/


/-! ## Section 12: Certified Theory Reconstruction (Combined) -/


end
end FiniteDuality
end ClosureNucleusDuality

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