Closure iso preserves meet prime
ProvedClosureStoneDuality.closure_iso_preserves_meet_primeaether-catalogbridges
Formal statement of ClosureStoneDuality.closure_iso_preserves_meet_prime from the Aether Catalog (Bridges). The mathematical content is given by the Lean statement below; a human-readable write-up is pending.
theorem ClosureStoneDuality.closure_iso_preserves_meet_prime[Fintype X] [DecidableEq X]
[Fintype Y] [DecidableEq Y]
{clX : Set X → Set X} {clY : Set Y → Set Y}
(_hX : IsClosureOperator clX) (_hY : IsClosureOperator clY)
(e : ClosureTableIso clX clY) {P : Set X} (hP : IsMeetPrimeClosed clX P) :
IsMeetPrimeClosed clY (Set.image e.toFun P) := by sorry
Formalization Note Transplanted verbatim from the Aether Catalog source Bridges/ClosureStoneRealizationDuality.lean; the statement is byte-identical to the source declaration, elaborated with autoImplicit disabled in the platform environment.
Preamble
-- Thm stub generated from Bridges/ClosureStoneRealizationDuality.lean
import Mathlib
import Definitions.Def_Bridges_ClosureStoneRealizationDuality
/-
Copyright (c) 2024 Harmonic. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
-/
/-!
# Closure–Stone Realization Duality via Idempotent Consequence Semimodules
This file establishes a finite duality/reconstruction theorem at the
Algebra–EML–Logic interface, bridging:
- finite logical consequence data (closure operators),
- canonical algebraic objects (implicational bases),
- Stone/Priestley-style spectral semantics (prime closed theories).
## Main Results
* `closed_inter` — intersection of closed sets is closed
* `closed_sInter` — arbitrary intersection of closed sets is closed
* `cl_closed` — `cl A` is always closed
* `closure_from_basis_is_closure_operator` — closure from implications is a closure operator
* `exists_finite_implicational_basis` — every finite closure operator has a finite basis
* `closure_table_recovers_basis_and_spectrum` — the main reconstruction theorem
* `closure_iso_preserves_structure` — functorial invariance under isomorphism
## Mathematical Overview
Given a finite type `X` and a closure operator `cl : Set X → Set X`, we construct:
1. The lattice of closed sets (closed under arbitrary intersection)
2. A finite implicational basis that reconstructs `cl` exactly
3. The space of meet-prime closed theories as a finite spectral space
4. A proof that this data is invariant under closure-table isomorphism
This establishes a certified bridge: closure table ≃ canonical basis ≃ prime spectrum.
-/
open Set Finset
open ClosureStoneDuality
variable {X : Type*}
/-! ## Part 1: Closure Operators -/
/-
The intersection of two closed sets is closed.
-/
/-
The intersection of any family of closed sets is closed.
-/
/-
`cl A` is always a closed set.
-/
/-
If A is closed and A ⊇ B, then A ⊇ cl B.
-/
/-
The universe is always closed.
-/
/-! ## Part 2: Implications and Bases -/
/-
The universe satisfies all implications.
-/
/-
ClosureFromBasis is extensive.
-/
/-
ClosureFromBasis is monotone.
-/
/-
ClosureFromBasis result satisfies all implications.
-/
/-
ClosureFromBasis is idempotent.
-/
/-! ## Part 3: Sound and Complete Bases -/
/-
Soundness: if B is sound for cl, then cl A ⊆ implies ClosureFromBasis B A ⊆ cl A
for any A, since cl A satisfies all sound implications.
-/
/-! ## Part 4: Full Basis Construction -/
/-
The full basis is sound.
-/
/-
Any set closed under all full-basis implications is cl-closed.
Key lemma for completeness.
-/
/-
The full basis is complete: ClosureFromBasis (FullBasis cl) = cl.
-/
/-! ## Part 5: Meet-Prime Closed Theories and Spectral Structure -/
/-! ## Part 6: Closure Table Isomorphism -/
variable {Y : Type*}
/-
A closure table isomorphism maps closed sets to closed sets.
-/
/-
A closure table isomorphism preserves meet-primality.
-/Formal statement
theorem ClosureStoneDuality.closure_iso_preserves_meet_prime[Fintype X] [DecidableEq X]
[Fintype Y] [DecidableEq Y]
{clX : Set X → Set X} {clY : Set Y → Set Y}
(_hX : IsClosureOperator clX) (_hY : IsClosureOperator clY)
(e : ClosureTableIso clX clY) {P : Set X} (hP : IsMeetPrimeClosed clX P) :
IsMeetPrimeClosed clY (Set.image e.toFun P) := by sorrySource