While this submission is a draft, it cannot be used by other submissions.

Proof of `Computable bounds on the syntactic nullary and unary sorts`

groundedproofs/Lax369799Proofs/QuantitativeProfiles.lean · lax-369799

What this proof establishes

no assumptions

Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.

Read the Lean proof on GitHub

Description

Regularization is a subalgebra followed by a quotient, so it cannot increase a sort. Bounded entries have rank at most n times the fibre bound. Initial and root profiles give two subsets of the explicitly bounded entry type; their quotient surjects onto the contextual classes.