Univalence at Finite Resolution: Tolerance, Vietoris complexes and the underivability of fixation

Author: Kriger, Boris (Information Physics Institute; Institute of Integrative and Interdisciplinary Research), ORCID 0009-0001-0034-2903 Description: Homotopy type theory posits, through the univalence axiom, that equivalent things are identical. It also posits that identity is layered: paths, paths between paths, and so on. This paper asks where that structure comes from for a system that can tell things apart only down to a smallest resolvable difference. Any discriminating system is modeled as a set of descriptions with a graded difference and a constant pixel. Indiscernibility at the pixel is reflexive and symmetric but not transitive, so it is a tolerance relation in the sense of Poincaré and Zeeman. Two ways of turning it into identity are compared. Forcing transitivity collapses every connected description space to a point, and the resulting quotient is the zero-truncation of a richer object. Keeping the chains of indiscernible steps yields the Vietoris complex of the tolerance. Its realization is a homotopy type: edges are swaps between indiscernible descriptions, and higher simplices are higher orders of identification. Four results are proved: An interleaving theorem. Description spaces that a system cannot separate at its resolution have equivalent tolerance types within stable windows of pixels. This is univalence derived from finite discrimination rather than postulated. A fixation theorem. On a connected space, no definite valuation respects indiscernibility at any pixel. Fixation therefore cannot be derived from discrimination, and its minimal price is the edge connectivity of the tolerance graph. An exhaustion theorem. Enumerating discernible alternatives terminates in totally bounded spaces, with explicit bounds for pure quantum states. A homological ceiling on orders of identification. By the theorems of Hausmann, Latschev and Adamaszek–Adams, fine pixels recover the homotopy type of a manifold. Coarse pixels on the circle produce odd spheres, and this is verified computationally. The quantum pixel shrinks as N^(−1/2) under the Helstrom bound. A measured photon indistinguishability of 0.9956 ± 0.0045 corresponds to an angle that cannot be told apart from zero at the experiment’s own resolution. Within the four-primitive theory of description (difference, identity, conditionality, taking), the fixation theorem shows that taking cannot be reduced to difference and identity. Keywords: univalence; homotopy type theory; tolerance space; indiscernibility; Vietoris–Rips complex; identity of indiscernibles; sorites; quantum state discrimination; Helstrom bound; finite resolution; measurement; fixation; orders of orthogonality; swap-attribution; DICT primitives Related identifiers (relation “cites”): https://doi.org/10.13140/RG.2.2.33499.12320 (Ineliminable Minimal Projection Theory and the DICT Primitives of Description) https://doi.org/10.5281/zenodo.20137134 (ICAST, Volume IV) https://doi.org/10.5281/zenodo.20100022 (Orders of Orthogonality) https://doi.org/10.5281/zenodo.20100782 (Volumetric Duality) https://doi.org/10.5281/zenodo.20100879 (Topological Duality) https://doi.org/10.5281/zenodo.20112021 (The Structural Theory of Wisdom) https://doi.org/10.5281/zenodo.20483632 (The Information Substrate Theory, Volume VII) https://doi.org/10.13140/RG.2.2.26532.64648 (The Retrospective Drift Theorem) https://doi.org/10.13140/RG.2.2.14764.22406 (Role Without Referent) Resource type: Publication / Preprint Communities: IIIR · Information Physics Institute Notes: Prepared for submission to Foundations of Science. The code that reproduces all figures and computations is in Appendix C.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-16
DOI
https://doi.org/10.5281/zenodo.24273196
Primary Topic
Homotopy and Cohomology in Algebraic Topology
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Univalence at Finite Resolution: Tolerance, Vietoris complexes and the underivability of fixation

Boris Kriger
1 links
Zenodo (CERN European Organization for Nuclear Research)
Homotopy and Cohomology in Algebraic Topology
article

Univalence at Finite Resolution: Tolerance, Vietoris complexes and the underivability of fixation

Boris Kriger
article en

Abstract

Author: Kriger, Boris (Information Physics Institute; Institute of Integrative and Interdisciplinary Research), ORCID 0009-0001-0034-2903 Description: Homotopy type theory posits, through the univalence axiom, that equivalent things are identical. It also posits that identity is layered: paths, paths between paths, and so on. This paper asks where that structure comes from for a system that can tell things apart only down to a smallest resolvable difference. Any discriminating system is modeled as a set of descriptions with a graded difference and a constant pixel. Indiscernibility at the pixel is reflexive and symmetric but not transitive, so it is a tolerance relation in the sense of Poincaré and Zeeman. Two ways of turning it into identity are compared. Forcing transitivity collapses every connected description space to a point, and the resulting quotient is the zero-truncation of a richer object. Keeping the chains of indiscernible steps yields the Vietoris complex of the tolerance. Its realization is a homotopy type: edges are swaps between indiscernible descriptions, and higher simplices are higher orders of identification. Four results are proved: An interleaving theorem. Description spaces that a system cannot separate at its resolution have equivalent tolerance types within stable windows of pixels. This is univalence derived from finite discrimination rather than postulated. A fixation theorem. On a connected space, no definite valuation respects indiscernibility at any pixel. Fixation therefore cannot be derived from discrimination, and its minimal price is the edge connectivity of the tolerance graph. An exhaustion theorem. Enumerating discernible alternatives terminates in totally bounded spaces, with explicit bounds for pure quantum states. A homological ceiling on orders of identification. By the theorems of Hausmann, Latschev and Adamaszek–Adams, fine pixels recover the homotopy type of a manifold. Coarse pixels on the circle produce odd spheres, and this is verified computationally. The quantum pixel shrinks as N^(−1/2) under the Helstrom bound. A measured photon indistinguishability of 0.9956 ± 0.0045 corresponds to an angle that cannot be told apart from zero at the experiment’s own resolution. Within the four-primitive theory of description (difference, identity, conditionality, taking), the fixation theorem shows that taking cannot be reduced to difference and identity. Keywords: univalence; homotopy type theory; tolerance space; indiscernibility; Vietoris–Rips complex; identity of indiscernibles; sorites; quantum state discrimination; Helstrom bound; finite resolution; measurement; fixation; orders of orthogonality; swap-attribution; DICT primitives Related identifiers (relation “cites”): https://doi.org/10.13140/RG.2.2.33499.12320 (Ineliminable Minimal Projection Theory and the DICT Primitives of Description) https://doi.org/10.5281/zenodo.20137134 (ICAST, Volume IV) https://doi.org/10.5281/zenodo.20100022 (Orders of Orthogonality) https://doi.org/10.5281/zenodo.20100782 (Volumetric Duality) https://doi.org/10.5281/zenodo.20100879 (Topological Duality) https://doi.org/10.5281/zenodo.20112021 (The Structural Theory of Wisdom) https://doi.org/10.5281/zenodo.20483632 (The Information Substrate Theory, Volume VII) https://doi.org/10.13140/RG.2.2.26532.64648 (The Retrospective Drift Theorem) https://doi.org/10.13140/RG.2.2.14764.22406 (Role Without Referent) Resource type: Publication / Preprint Communities: IIIR · Information Physics Institute Notes: Prepared for submission to Foundations of Science. The code that reproduces all figures and computations is in Appendix C.

Zenodo (CERN European Organization for Nuclear Research)
Homotopy and Cohomology in Algebraic Topology
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon