Searcharxiv⌕ Search

arXiv subjects

Kenan Oggad

Publications and source records attributed to Kenan Oggad.

3 recordsLinked to original sources

What an Observer Reads off a Holographic Screen

What does an observer read off a holographic screen that is an array of qubits rather than a surface? In the generalized holographic principle the interaction between two separable systems acts on such a screen as a weighted sum, up to an overall prefactor, of commuting observables with values plus and minus one. When the weights are nonnegative and the prefactor is one and the joint eigenspaces are lines, everything a probe reads off the spectrum depends only on the list of weights, which we call the profile. On the screen with equal weights summing to one the running dimension read by a diffusion probe falls short of two at unit time by at most twice the reciprocal of the number of qubits; a geometric profile gives instead, through its level count, a plateau of any positive height. An observer correlates sets of qubits; its readout carries a profile at a given weighting when the levels it reads, counted with multiplicity, are those of a screen with one weight per set. We prove that a readout carries a profile at every weighting exactly when the distinct nonzero traces of its qubits are linearly independent over the field with two elements, the trace of a qubit being the list of sets that contain it; such a readout is a partition of the qubits it covers up to an invertible recoding, and a dependent one carries a profile only on finitely many proper linear subspaces of weightings. Refining a grouping without end builds a tower whose boundary is a profinite set and hence a condensed set, on which a strictly positive compatible profile separates the locally constant functions by a distance. Applications certify probabilistic and strong contextuality and give the leading shortfall of the distance between the poles of the fuzzy sphere; in a model of monogamous entanglement the pairs that weight-one threads representing operational ER=EPR can occupy at once are exactly the partial matchings.

quant-ph↗

Quantum Dust from the Curse of Dimensionality

Why do unrelated approaches to quantum gravity nearly all find spacetime two-dimensional at the shortest scales? Each theory answers only within its own dynamics; we highlight a single kinematic route to the same value, one assuming no field equation and living in the geometry of the space of states alone. That route is concentration of measure on the Fubini-Study geometry of pure states, which forces the pairwise distances of a random sample to equalize as the dimension grows, so any finite sample collapses to an equidistant dust whose thresholded metric graph is the complete graph. Handed this dust, a diffusion probe reads it as two-dimensional in the large-sample limit, the value the running spectral dimension takes at the dust's single relaxation scale, a property of the measurement rather than the structure; this convergence on two is not, by itself, evidence that spacetime is two-dimensional. Whether a given two is such an artifact is governed by the Laplacian spectrum near zero, and whether that reading carries across an emergence map is the condition we call spectral faithfulness; a single relaxation scale encodes no spectral dimension that tells one structure from another. The collapse, the probe value, and the eigenvalue-density criterion are machine-checked in Lean 4 against Mathlib, resting on the standard Beta law of overlaps; a power-law tail of small eigenvalues reads a genuine dimension, a single scale above a gap reads two at its own clock, and a gapped two-scale band reads off the universal line. These classes are run on graph-Laplacian proxies, and whether a link-graph reading carries to the physical nonlocal operator is left open. The spectral test reads the eigenvalue density near zero and separates, on a given structure, a measurement artifact from a dimension the structure genuinely expresses.

gr-qc↗

A Classifying Topos for the Spectrum of Equivalences

What makes two computational systems equivalent? Topos theory answers with classifying toposes: a system's semantic content is encoded in the geometric theory it classifies, and two presentations are equivalent when their classifying toposes coincide. Process algebra answers with the linear time-branching time spectrum of van Glabbeek: a hierarchy of behavioral equivalences from trace equivalence to bisimilarity, each determined by which observations can distinguish processes. We show these are aspects of a single structure in which behavioral abstraction is localization. Each labeled transition system receives a geometric theory $\mathbb{T}_M$ whose classifying topos $\mathcal{E}[\mathbb{T}_M]$ determines its provable geometric sequents. Mutual simulation is strictly coarser than bisimulation, strictly coarser than topos equivalence; diamond-only Hennessy-Milner logic characterizes the bisimulation-invariant fragment of geometric logic -- a geometric van Benthem theorem. Grothendieck topologies yield $J_{\mathrm{bisim}} \subsetneq J_{\mathrm{sim}} \subsetneq J_{\mathrm{trace}}$, constructive for trace and bisimulation; a counterexample shows the observation-class approach inadequate for simulation, motivating Caramello's duality. Energy-topology extends this to all 13 named equivalences. Lattice closure yields 30 elements including 17 unnamed hybrids absent because the energy-game framework computes but does not close. $L_{30}$ is indecomposable with $S \to F = \mathrm{IF}$; a Geometric Closure Theorem computes presheaf Heyting implications at a single free extension. The hierarchy, bi-Heyting structure, and Closure Theorem are proved constructively with no known process-algebraic proof. The spectrum is a finite sub-poset of an infinite coframe whose operations (meets, implications, subtractions) yield structure inaccessible from process algebra. Formalized in Lean 4/Mathlib.

cs.LO↗