AFTD Auto-Formalizing Theoretical Domains

poset_tower

deforiginal

Given an unbundled type α equipped with a partial order [PartialOrder α], the function poset_tower (α : Type*) [PartialOrder α] : ℕ → PartOrd is defined by pattern matching on ℕ: poset_tower α 0 = PartOrd.of α, poset_tower α 1 = PartOrd.of α, and for k + 1, poset_tower α (k + 1) = PartOrd.of (poset_tower α k →o α), the bundled partial order PartOrd of order-preserving maps from poset_tower α k to α ordered pointwise.

Statement

def poset_tower (α : Type*) [PartialOrder α] : ℕ → PartOrd
Related work
arXiv:2610.20802 Sec. 5
Verified
25 Oct 2026
Axioms
none listed
Used by 1

Read back from the Lean

Given a type α equipped with a partial order ([PartialOrder α]), poset_tower α is a function from ℕ to PartOrd (the category of partially ordered sets) defined recursively by: - poset_tower α 0 = PartOrd.of α (the partially ordered set α), - poset_tower α 1 = PartOrd.of α (the partially ordered set α), - poset_tower α (k + 1) = PartOrd.of (poset_tower α k →o α) for k ≥ 1, which is the partially ordered set of order homomorphisms (monotone maps) from poset_tower α k to α, ordered pointwise.

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

Lean source view module on GitHub

/-- The sequence of partially ordered sets formed by right-associated iterated exponentiation, where T 0 X = X, T 1 X = X, and T (k + 1) X = X^(T k X). -/
def poset_tower (α : Type*) [PartialOrder α] : ℕ → PartOrd
| 0 => PartOrd.of α
| 1 => PartOrd.of α
| k + 1 => PartOrd.of (poset_tower α k →o α)
See it in the graphDiscuss this resultChallenge it