Graph explorer

The Univalence Principle

The Univalence Principle is the statement that equivalent mathematical structures are indistinguishable. We prove a general version of this principle that applies to all set-based, categorical, and higher-categorical structures defined in a non-algebraic and space-based style, as well as models of higher-order theories such as topological spaces. In particular, we formulate a general definition of indiscernibility for objects of any such structure, and a corresponding univalence condition that generalizes Rezk's completeness condition for Segal spaces and ensures that all equivalences of structures are levelwise equivalences. Our work builds on Makkai's First-Order Logic with Dependent Sorts, but is expressed in Voevodsky's Univalent Foundations (UF), extending previous work on the Structure Identity Principle and univalent categories in UF. This enables indistinguishability to be expressed simply as identification, and yields a formal theory that is interpretable in classical homotopy theory, but also in other higher topos models. It follows that Univalent Foundations is a fully equivalence-invariant foundation for higher-categorical mathematics, as intended by Voevodsky.

8 nodes7 linksoverview previewThe Univalence Principle
8 nodes7 links
The Univalence Principle8 visible / 8 total nodes / 13 links
Co-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipAuthorshipAuthorshipAuthorshipAuthorshipTopic signalTopic signalTopic signalWThe Univalence Principlepreprint / 2022ABenedikt AhrensResearcherAPaige Randall NorthResearcherAMichael ShulmanResearcherADimitris TsementzisResearcherTLogic in Computer Science2208 worksTmath.LO1661 worksTmath.CT1150 works
PaperSignal 107 links

The Univalence Principle

preprint / 2022

Open