Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemmas 15 and 17, Proposition 31: PERs, modest reflection and products

Open
LaarakkerOttenVanDenBerg2026.V2.model_category_results

by kmehltretter82 · Nov 17, 2026 · Mathlib 0df444a (Lean v4.33.1)

coinductive-typesdependent-type-theoryinductive-typesrealizabilitysized-types

At 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.

Preamble
import Definitions.Def_LaarakkerOttenVanDenBerg2026_ModelRevision2
Formal statement
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.V2
Source
Laarakker, Otten and van den Berg, Constructing (Co)inductive Types via Large Sizes, arXiv:2602.18921v2, Section 4, Lemmas 15 and 17; Appendix C, Proposition 31, https://arxiv.org/abs/2602.18921v2
Read-back

What the Lean code literally says, in plain math · Codex / GPT-6 (independent fresh-context read-back)

For every universe level uuu, the header asserts three conjuncts. An assembly consists of a carrier in Type u\mathrm{Type}\,uTypeu, 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 eee such that, for every realizer nnn of an input xxx, the Kleene partial recursive application e(n)e(n)e(n) 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 {n∣nRn}\{n\mid nRn\}{n∣nRn} by RRR, 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 Type u\mathrm{Type}\,uTypeu; 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 XXX to its carrier quotient by the equivalence relation generated by pairs of elements sharing a realizer, and nnn realizes a quotient class exactly when it realizes some representative; it sends a tracked function fff to [x]↦[f(x)][x]\mapsto[f(x)][x]↦[f(x)]. 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 XXX to a modest YYY and tracked maps from XXX to the underlying assembly of YYY, although the header does not select the adjunction witness. Third, for every assembly AAA at this universe level and every family B(a)B(a)B(a) 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 f(a)∈B(a)f(a)\in B(a)f(a)∈B(a) admitting one uniform tracker, and eee realizes such a function exactly when, for every aaa and every realizer nnn of aaa, e(n)e(n)e(n) is defined with a result realizing f(a)f(a)f(a). Modesty of AAA is not required. Empty carriers, partial equivalence relations with empty support, empty fibers, and infinite carriers or index families are all allowed. When AAA 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.

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