Eigenstate Thermalization Hypothesis for Wigner Matrices

We prove that any deterministic matrix is approximately the identity in the eigenbasis of a large random Wigner matrix with very high probability and with an optimal error inversely proportional to the square root of the dimension. Our theorem thus rigorously verifies the Eigenstate Thermalisation Hypothesis by Deutsch (Phys Rev A 43:2046–2049, 1991) for the simplest chaotic quantum system, the Wigner ensemble. In mathematical terms, we prove the strong form of Quantum Unique Ergodicity (QUE) with an optimal convergence rate for all eigenvectors simultaneously, generalizing previous probabilistic QUE results in Bourgade and Yau (Commun Math Phys 350:231–278, 2017) and Bourgade et al. (Commun Pure Appl Math 73:1526–1596, 2020).

Spectral gap in random bipartite biregular graphs and applications

We prove an analogue of Alon’s spectral gap conjecture for random bipartite, biregular graphs. We use the Ihara–Bass formula to connect the non-backtracking spectrum to that of the adjacency matrix, employing the moment method to show there exists a spectral gap for the non-backtracking matrix. A by-product of our main theorem is that random rectangular zero-one matrices with fixed row and column sums are full rank with high probability. Finally, we illustrate applications to community detection, coding theory, and deterministic matrix completion.

Modal logic with non-deterministic semantics: Part I—Propositional case

Dugundji proved in 1940 that most parts of standard modal systems cannot be characterized by a single finite deterministic matrix. In the eighties, Ivlev proposed a semantics of four-valued non-deterministic matrices (which he called quasi-matrices), in order to characterize a hierarchy of weak modal logics without the necessitation rule. In a previous paper, we extended some systems of Ivlev’s hierarchy, also proposing weaker six-valued systems in which the (T) axiom was replaced by the deontic (D) axiom. In this paper, we propose even weaker systems, by eliminating both axioms, which are characterized by eight-valued non-deterministic matrices. In addition, we prove completeness for those new systems. It is natural to ask if a characterization by finite ordinary (deterministic) logical matrices would be possible for all those Ivlev-like systems. We will show that finite deterministic matrices do not characterize any of them.