Ir para o conteúdo principal

Escrever uma avaliação PREreview

Part I: Predecessor Geometry and the ω-Closure, Transport Invariance, Bisimulation Quotients, and the First Stratified-Univalence Jump

Publicado
Servidor
Zenodo
DOI
10.5281/zenodo.19162526

This preprint isolates a single organizing mechanism for the transfinite progression of Stratified Univalence: iterate a carrier-level closure operator Next and a semantic-stage extension operator Jump, with all dependence funneled through predecessor geometry (bounded bisimulation equivalence of initial segments). For a predecessor structure (A,≺) and a signature Σ of admissible predecessor-indexed diagram shapes internal to A, we construct the free completion NextΣ(A) that adjoins least upper bounds of Σ-diagrams and quotients them by cofinal/bisimulation refinement so that suprema depend only on predecessor geometry. We prove the universal property (initiality) of this completion, develop a coherence package for quotient paths (with an optional 1-truncated groupoid quotient variant), and show well-foundedness is preserved by NextΣand by extensional collapse.

On the semantic side, we define the canonical SU-style stage extension along NextΣ(A) by interpreting each new supremum as the corresponding HIT/QIIT colimit of the old semantics, and we prove cofinal invariance of such colimits under a constructive cofinality criterion (contractible lift fibers). We also construct extensional collapse as the reflective set-quotient by predecessor geometry and show it agrees with global bisimulation, ensuring that all constructions descend to extensional carriers.

The first genuinely nontrivial instance occurs at ω, where Nextω(A) corresponds to adjoining suprema of strict ω-chains and Jump realizes the ω-stage via sequential colimits, explaining the ω-jump/universe-lift phenomenon in predicative settings. Beyond ω, the paper identifies the first remaining bottleneck for Part II: establishing constructive cofinality for tree/contractible-graph refinements (the Σtree_{tree} step).

Você pode escrever uma avaliação PREreview de Part I: Predecessor Geometry and the ω-Closure, Transport Invariance, Bisimulation Quotients, and the First Stratified-Univalence Jump. Uma avaliação PREreview é uma avaliação de um preprint e pode variar de algumas frases a um parecer extenso, semelhante a um parecer de revisão por pares realizado por periódicos.

Antes de começar

Vamos pedir que você faça login com seu ORCID iD. Se você não tiver um iD, pode criar um.

O que é um ORCID iD?

Um ORCID iD é um identificador único que diferencia você de outras pessoas com o mesmo nome ou nome semelhante.

Começar agora