496,549 research outputs found

    A hierarchy of topological tensor network states

    Full text link
    We present a hierarchy of quantum many-body states among which many examples of topological order can be identified by construction. We define these states in terms of a general, basis-independent framework of tensor networks based on the algebraic setting of finite-dimensional Hopf C*-algebras. At the top of the hierarchy we identify ground states of new topological lattice models extending Kitaev's quantum double models [26]. For these states we exhibit the mechanism responsible for their non-zero topological entanglement entropy by constructing a renormalization group flow. Furthermore it is shown that those states of the hierarchy associated with Kitaev's original quantum double models are related to each other by the condensation of topological charges. We conjecture that charge condensation is the physical mechanism underlying the hierarchy in general.Comment: 61 page

    Every countable model of set theory embeds into its own constructible universe

    Full text link
    The main theorem of this article is that every countable model of set theory M, including every well-founded model, is isomorphic to a submodel of its own constructible universe. In other words, there is an embedding j:M→LMj:M\to L^M that is elementary for quantifier-free assertions. The proof uses universal digraph combinatorics, including an acyclic version of the countable random digraph, which I call the countable random Q-graded digraph, and higher analogues arising as uncountable Fraisse limits, leading to the hypnagogic digraph, a set-homogeneous, class-universal, surreal-numbers-graded acyclic class digraph, closely connected with the surreal numbers. The proof shows that LML^M contains a submodel that is a universal acyclic digraph of rank OrdMOrd^M. The method of proof also establishes that the countable models of set theory are linearly pre-ordered by embeddability: for any two countable models of set theory, one of them is isomorphic to a submodel of the other. Indeed, they are pre-well-ordered by embedability in order-type exactly ω1+1\omega_1+1. Specifically, the countable well-founded models are ordered by embeddability in accordance with the heights of their ordinals; every shorter model embeds into every taller model; every model of set theory MM is universal for all countable well-founded binary relations of rank at most OrdMOrd^M; and every ill-founded model of set theory is universal for all countable acyclic binary relations. Finally, strengthening a classical theorem of Ressayre, the same proof method shows that if MM is any nonstandard model of PA, then every countable model of set theory---in particular, every model of ZFC---is isomorphic to a submodel of the hereditarily finite sets HFMHF^M of MM. Indeed, HFMHF^M is universal for all countable acyclic binary relations.Comment: 25 pages, 2 figures. Questions and commentary can be made at http://jdh.hamkins.org/every-model-embeds-into-own-constructible-universe. (v2 adds a reference and makes minor corrections) (v3 includes further changes, and removes the previous theorem 15, which was incorrect.
    • …
    corecore