Lemmas 15 and 17, Proposition 31: PERs, modest reflection and products
OpenLaarakkerOttenVanDenBerg2026.V2.model_category_resultsAt every ambient universe level, the category of PERs over natural numbers is equivalent to the category of K1 modest assemblies; the specified modest-reflection functor is left adjoint to the inclusion into assemblies; and a dependent assembly product is modest whenever each codomain fiber is modest, even if its domain assembly is large. The equivalence and adjunction are actual categorical structures.
import Definitions.Def_LaarakkerOttenVanDenBerg2026_ModelRevision2
namespace LaarakkerOttenVanDenBerg2026.V2
open CategoryTheory
universe u
/-- PER–modest equivalence, modest reflection, and modest dependent products. -/
theorem model_category_results :
Nonempty (PER ≌ Modest.{u}) ∧
Nonempty (modestReflection.{u} ⊣ modestInclusion.{u}) ∧
∀ (A : Assembly.{u}) (B : A.Carrier → Assembly.{u}),
(∀ a, Assembly.IsModest (B a)) → Assembly.IsModest (Assembly.pi A B) := by
sorry
end LaarakkerOttenVanDenBerg2026.V2Read-back
What the Lean code literally says, in plain math · Codex / GPT-6 (independent fresh-context read-back)
For every universe level , the header asserts three conjuncts. An assembly consists of a carrier in , a relation saying which natural numbers realize which elements, and a realizer for every element. Its morphisms are functions for which there exists a natural-number index such that, for every realizer of an input , the Kleene partial recursive application is defined and its result realizes the output; the tracker is asserted to exist, not stored as extra morphism data. A modest assembly additionally satisfies: any one natural number realizes at most one element. A partial equivalence relation is a symmetric, transitive relation on natural numbers, not necessarily reflexive on all numbers; its underlying set is the quotient of by , a number realizes its own supported class, and its morphisms are functions between these quotients with the same existence-of-a-tracker condition. First, there exists a categorical equivalence between this category of partial equivalence relations and the category of modest assemblies with carrier in ; the header does not select a particular equivalence functor or equivalence witness. Second, the specified modest-reflection functor is left adjoint to the specified inclusion of modest assemblies into assemblies. The reflection sends an assembly to its carrier quotient by the equivalence relation generated by pairs of elements sharing a realizer, and realizes a quotient class exactly when it realizes some representative; it sends a tracked function to . Inclusion forgets the modesty proof and leaves morphisms unchanged. The adjunction assertion therefore includes a natural hom-set equivalence between tracked maps from this reflection of to a modest and tracked maps from to the underlying assembly of , although the header does not select the adjunction witness. Third, for every assembly at this universe level and every family of assemblies at the same level, if every fiber is modest, then the specified dependent-product assembly is modest. Its carrier consists exactly of dependent functions admitting one uniform tracker, and realizes such a function exactly when, for every and every realizer of , is defined with a result realizing . Modesty of is not required. Empty carriers, partial equivalence relations with empty support, empty fibers, and infinite carriers or index families are all allowed. When is empty, the tracking condition is vacuous and its dependent product contains the single empty function. None of these assertions quantifies over the abstract type-theory packages or states their consistency. This is a readback of the asserted header; its proof body is a placeholder, so no proof is certified here.