Danila Fedorin
781d7947e0
- Spa.Lattice.IterProd: k-fold product, recursive Lattice instance,
fixed height k*hA + hB, bot = build of bottoms
- Spa.Lattice.FiniteMap: spine-pinned assoc lists ({l // l.map fst = ks});
with = the 1100-line Map.agda collapses into positional 'combine'.
Same lemma inventory (membership, locate, updating, GeneralizedUpdate,
valuesAt, Provenance-union, le_of_mem_mem) — Nodup is now an explicit
hypothesis where the Agda Map carried it intrinsically. Fixed height
|ks|*hB still via transport along the IterProd isomorphism, which no
longer needs Unique ks (representation is canonical).
Co-Authored-By: Claude Fable 5 <noreply@anthropic.com>
36 lines
1.1 KiB
Lean4
36 lines
1.1 KiB
Lean4
/-
|
||
Port of `Lattice/Unit.agda`.
|
||
|
||
The lattice structure itself (`_⊔_`, `_⊓_`, all semilattice/lattice laws) is
|
||
lifted into mathlib: `PUnit.instLinearOrder` provides `Lattice PUnit`.
|
||
What remains is the fixed-height structure: the unit lattice has height 0.
|
||
-/
|
||
import Spa.Lattice
|
||
|
||
namespace Spa
|
||
|
||
/-- Chains in a subsingleton order are bounded by any `n` (Agda: the `bounded`
|
||
field of `Lattice/Unit.agda`'s `fixedHeight`, generalized). -/
|
||
theorem boundedChains_of_subsingleton (α : Type*) [Preorder α] [Subsingleton α]
|
||
(n : ℕ) : BoundedChains α n := fun c => by
|
||
by_contra hc
|
||
push_neg at hc
|
||
exact (c.step ⟨0, by omega⟩).ne (Subsingleton.elim _ _)
|
||
|
||
/-- Agda: `Lattice/Unit.agda`'s `fixedHeight`. -/
|
||
def punitFixedHeight : FixedHeight PUnit 0 where
|
||
bot := PUnit.unit
|
||
top := PUnit.unit
|
||
longestChain := RelSeries.singleton _ PUnit.unit
|
||
head_longestChain := rfl
|
||
last_longestChain := rfl
|
||
length_longestChain := rfl
|
||
bounded := boundedChains_of_subsingleton PUnit 0
|
||
|
||
/-- Agda: `Lattice/Unit.agda`'s `isFiniteHeightLattice`. -/
|
||
instance : FiniteHeightLattice PUnit where
|
||
height := 0
|
||
fixedHeight := punitFixedHeight
|
||
|
||
end Spa
|