DOCSLIB.ORG

Basic Concepts of Linear Order

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Basic Concepts of Linear Order Basic Concepts of Linear Order Combinatorics for Computer Science (Unit 1) S. Gill Williamson ©S. Gill Williamson 2012 Preface From 1970 to 1990 I ran a graduate seminar on algebraic and algorithmic com- binatorics in the Department of Mathematics, UCSD. From 1972 to 1990 al- gorithmic combinatorics became the principal topic. The seminar notes from 1970 to 1985 were combined and published as a book, Combinatorics for Com- puter Science (CCS), published by Computer Science Press. Each of the "units of study" from the seminar became a chapter in this book. My general goal is to re-create the original presentation of these (largely inde- pendent) units in a form that is convenient for individual selection and study. Here, we isolate Unit 1, corresponding to Chapter 1 of CCS, and reconstruct the original very helpful unit specific index associated with this unit. Theorems, figures, examples, etc., are numbered sequentially: EXERCISE 1.38 and FIGURE 1.62 refer to numbered items 38 and 62 of Unit 1 (or Chap- ter 1 in CCS), etc. CCS contains an extensive bibliography for work prior to 1985. For further references and ongoing research, search the Web, particularly Wikipedia and the mathematics arXiv (arXiv.org). These notes focus on the visualization of algorithms through the use of graph- ical and pictorial methods. This approach is both fun and powerful, preparing you to invent your own algorithms for a wide range of problems. S. Gill Williamson, 2012 http : nwww:cse:ucsd:edun ∼ gill iii iv Table of Contents for Unit 1 Descriptive tools from set theory..............................................................3 relations, equivalence relations, set partitions, image, coimage surjection, injection, bijection, covering relations, Hasse diagrams, exercises and ex- amples. Basic data structures .................................................................................7 exercises, examples, order preserving bijections, hashing tables, linked lists, structural diagrams. Lexicographic order ................................................................................14 colex order, examples lex and colex order, permutations in lex order, in- creasing functions in lex and colex order, Hasse diagrams of products of lex orders, lex bucket sort, tree diagrams for prelex, inlex, postlex orders, length-first lex, tilings of board in lex order, backtracking, 5-queens prob- lem, isomorph rejection, minimal representatitives, soma cube in lex order, dominoe coverings in lex order, examples of isomorph rejection. Ordered partition trees ...........................................................................24 partition trees, local descriptions, partition trees and lex order, partition trees for functions, permutations in direct insertion order, lex order bijec- tions for permutations, partition trees for decreasing functions, binomial coefficients, tree reduction, order isomorphisms for posets, RANK and UN- RANK algorithms. Examples ..................................................................................................37 n-queens problem, orbit refinement, initial and terminal segments of lists. Subject Index ...........................................................................................47 1 2 UNIT 1 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 Index antisymmetric,3 linked list,9 direct access model,9 backtracking direct insertion order tilings, 19 permutations, 28 bucket sort, 15, 16 coded version, 29 card sort, 15, 16 edge labels, 29 cardinality,3 domino covering characteristic function,7 isomorph rejection, 23 chessboard lex minimal sdr, 23 4-queens equivalence orbit refinement, 39 class,4 partition tree, 40 class partition,4 8-queens discussion, 36, 37 equivalence relation n-queens definition,3 not symmetry recursive, 41 examples,5 search on (n∪{∗})n, 41 general discussion of, 43 function keys of solution sets, 38 coimage partition,5 orbits domain,4 linear order, 37 image,4 of positions, 37 injection,5 symmetries of, 37 inverse image,4 symmetry recursive one-line notation,5 examples, 44–46 range,4 A Coimage f 2 B surjection,5 −1 ff (b) j b 2 Bg,5 functions colex order ff j f : A ! Bg = BA, colexicographic order, 14 4 recursive definition, 15 colexicographic order graph theory functions, 14 equivalence relations,5 contents,1 covering relation,6 hashing table,8 Hasse diagram data structure defined,6 47 examples,7 products of, 15 specified in practice,8 A Image f 2 B linked list ff(a) j a 2 Ag,4 doubly linked, 11, 12 integers example,9 bucket notation of linked lists, 12, 13 n = f0; : : : ; n−1g, 32 pointers, 10 divisibility order,6 structural diagram, 10 positive,4,6 underline notation order isomorphism, 29 f1; : : : ; ng = n,4 Sn lex to direct insertion, 30 isomorph rejection poset, 32 cube, 23 predecessor, 30 domino covering, 23 RANK and UNRANK, 32 hexagon, 23 successor, 30 orderly algorithms, 42 order preserving bijection,7 symmetry recursive, 42 ordered partition system of representatives, 42 and words, 23 tetrahedron, 23 defined, 23 refinement, 23 lex order tree, 24 inlex, 18 ordered sets length-first, 18 examples,6 lexicographic order, 14 permutations, 27 partial order postlex, 18 poset,6 prelex, 18 partition lexicographic order block,4 bucket sort, 15, 16 discrete,4 card sort, 15 equivalence relation,4 functions, 14 ordered defined, 23 injective functions, 14 ordered refinement, 23 nondecreasing functions, 14 refinement order,6 one-to-one set,4,6 functions, 14 partition tree prelex order, 16 binary, 26 product sets, 15 complete binary, 26 recursive definition, 15 contraction of (1.42, 1.44), 26 terminal symbols, 16 example, 23 linear order,3 lex order, 25 as ordered partitions, 23 local description, 25 defined,8 permutations direct insertion, lexicographic, 14 28 48 permutations lex order, 27 terminal vertices - leaves, 24 permutations vertices, 24 direct insertion order, 28 tree diagram lex order, 27 D(64) decreasing, 31 random selection, 35 D(nk) decreasing, 30 poset S3 direct insertion, 28, 29 covering relation,6 S3 lex order, 27 order isomorphism defined, 32 23 lex order, 26 preface, iii rd local lex order, 25 prelex order general partition, 24 tree diagram, 17 words RANK and UNRANK 5-queens decreasing functions, 34, 35 lex minimal sdr, 21 defined, 32 problem defined, 20 general disussion, 36 symmetries, 21 random selection, 35 backtracking, 19 recursion domino coverings for D(nk), 31 all 4 × 4, 21, 22 reflexive,3 prelex coding, 21 relations inherited orders, 18 antisymmetric,3 length ≤ d, 18 covering,6 length-first lex (colex), 18 equivalence,3 postlex order, 18 linear,3 prelex order, 18 on matrices,7 SOMA cube, 21 order,3,6 terminal symbol ∗, 18 product,7 tiling orders, 19 reflexive,3 symmetric,3 transitive,3 transitive closure 1.13(5),7 residual tree R(e) of edge, 32 general examples, 33 set partition,4 transitive,3 tree ordered rooted, 24 partition, 24, 26–31 residual, 32 49 NOTES 50 NOTES 51 NOTES 52 NOTES 53.
Load more

Recommended publications
  • Math. Res. Lett. 20 (2013), No. 6, 1071–1080 the ISOMORPHISM
    Math. Res. Lett. 20 (2013), no. 6, 1071–1080 c International Press 2013 THE ISOMORPHISM RELATION FOR SEPARABLE C*-ALGEBRAS George A. Elliott, Ilijas Farah, Vern I. Paulsen, Christian Rosendal, Andrew S. Toms and Asger Tornquist¨ Abstract. We prove that the isomorphism relation for separable C∗-algebras, the rela- tions of complete and n-isometry for operator spaces, and the relations of unital n-order isomorphisms of operator systems, are Borel reducible to the orbit equivalence relation of a Polish group action on a standard Borel space. 1. Introduction The problem of classifying a collection of objects up to some notion of isomorphism can usually be couched as the study of an analytic equivalence relation on a standard Borel space parametrizing the objects in question. Such relations admit a notion of comparison, Borel reducibility, which allows one to assign a degree of complexity to the classification problem. If X and Y are standard Borel spaces admitting equivalence relations E and F respectively then we say that E is Borel reducible to F , written E ≤B F ,ifthereisaBorelmapΘ:X → Y such that xEy ⇐⇒ Θ(x)F Θ(y). In other words, Θ carries equivalence classes to equivalence classes injectively. We view E as being “less complicated” than F . There are some particularly prominent degrees of complexity in this theory which serve as benchmarks for classification problems in general. For instance, a relation E is classifiable by countable structures (CCS) if it is Borel reducible to the isomorphism relation for countable graphs. Classification problems in functional analysis (our interest here) tend not to be CCS, but may nevertheless be “not too complicated” in that they are Borel reducible to the orbit equivalence relation of a Borel action of a Polish group on a standard Borel space; this property is known as being below a group action.
    [Show full text]
  • Every Linear Order Isomorphic to Its Cube Is Isomorphic to Its Square
    EVERY LINEAR ORDER ISOMORPHIC TO ITS CUBE IS ISOMORPHIC TO ITS SQUARE GARRETT ERVIN Abstract. In 1958, Sierpi´nskiasked whether there exists a linear order X that is isomorphic to its lexicographically ordered cube but is not isomorphic to its square. The main result of this paper is that the answer is negative. More generally, if X is isomorphic to any one of its finite powers Xn, n > 1, it is isomorphic to all of them. 1. Introduction Suppose that (C; ×) is a class of structures equipped with a product. In many cases it is possible to find an infinite structure X 2 C that is isomorphic to its own square. If X2 =∼ X, then by multiplying again we have X3 =∼ X. Determining whether the converse holds for a given class C, that is, whether X3 =∼ X implies X2 =∼ X for all X 2 C, is called the cube problem for C. If the cube problem for C has a positive answer, then C is said to have the cube property. The cube problem is related to three other basic problems concerning the mul- tiplication of structures in a given class (C; ×). 1. Does A × Y =∼ X and B × X =∼ Y imply X =∼ Y for all A; B; X; Y 2 C? Equivalently, does A × B × X =∼ X imply B × X =∼ X for all A; B; X 2 C? 2. Does X2 =∼ Y 2 imply X =∼ Y for all X; Y 2 C? 3. Does A × Y =∼ X and A × X =∼ Y imply X =∼ Y for all A; X; Y 2 C? Equivalently, does A2 × X =∼ X imply A × X =∼ X for all A; X 2 C? The first question is called the Schroeder-Bernstein problem for C, and if it has a positive answer, then C is said to have the Schroeder-Bernstein property.
    [Show full text]
  • Decomposition of an Order Isomorphism Between Matrix-Ordered Hilbert Spaces
    PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 132, Number 7, Pages 1973{1977 S 0002-9939(04)07454-4 Article electronically published on February 6, 2004 DECOMPOSITION OF AN ORDER ISOMORPHISM BETWEEN MATRIX-ORDERED HILBERT SPACES YASUHIDE MIURA (Communicated by David R. Larson) Abstract. The purpose of this note is to show that any order isomorphism between noncommutative L2-spaces associated with von Neumann algebras is decomposed into a sum of a completely positive map and a completely co- positive map. The result is an L2 version of a theorem of Kadison for a Jordan isomorphism on operator algebras. 1. Introduction In the theory of operator algebras, a notion of self-dual cones was studied by A. Connes [1], and he characterized a standard Hilbert space. In [9] L. M. Schmitt and G. Wittstock introduced a matrix-ordered Hilbert space to handle a non- commutative order and characterized it using the face property of the family of self-dual cones. From the point of view of the complete positivity of the maps, we shall consider a decomposition theorem of an order isomorphism on matrix-ordered Hilbert spaces. Let H be a Hilbert space over a complex number field C,andletH+ be a self- dual cone in H.Asetofalln × n matrices is denoted by Mn.PutHn = H⊗Mn(= H 2 N H H+ 2 N H~ H~ 2 N Mn( )) for n . Suppose that ( , n ;n )and( , n, n )arematrix- ordered Hilbert spaces. A linear map A of H into H~ is said to be n-positive (resp. ⊗ H+ ⊂ H~+ n-co-positive) when the multiplicity map An(= A idn)satisfiesAn n n t H+ ⊂ H~+ t · (resp.
    [Show full text]
  • Chapter 8 Ordered Sets
    Chapter VIII Ordered Sets, Ordinals and Transfinite Methods 1. Introduction In this chapter, we will look at certain kinds of ordered sets. If a set \ is ordered in a reasonable way, then there is a natural way to define an “order topology” on \. Most interesting (for our purposes) will be ordered sets that satisfy a very strong ordering condition: that every nonempty subset contains a smallest element. Such sets are called well-ordered. The most familiar example of a well-ordered set is and it is the well-ordering property that lets us do mathematical induction in In this chapter we will see “longer” well ordered sets and these will give us a new proof method called “transfinite induction.” But we begin with something simpler. 2. Partially Ordered Sets Recall that a relation V\ on a set is a subset of \‚\ (see Definition I.5.2 ). If ÐBßCÑ−V, we write BVCÞ An “order” on a set \ is refers to a relation on \ that satisfies some additional conditions. Order relations are usually denoted by symbols such asŸ¡ß£ , , or . Definition 2.1 A relation V\ on is called: transitive ifÀ a +ß ,ß - − \ Ð+V, and ,V-Ñ Ê +V-Þ reflexive ifÀa+−\+V+ antisymmetric ifÀ a +ß , − \ Ð+V, and ,V+ Ñ Ê Ð+ œ ,Ñ symmetric ifÀ a +ß , − \ +V, Í ,V+ (that is, the set V is “symmetric” with respect to thediagonal ? œÖÐBßBÑÀB−\ש\‚\). Example 2.2 1) The relation “œ\ ” on a set is transitive, reflexive, symmetric, and antisymmetric. Viewed as a subset of \‚\, the relation “ œ ” is the diagonal set ? œÖÐBßBÑÀB−\×Þ 2) In ‘, the usual order relation is transitive and antisymmetric, but not reflexive or symmetric.
    [Show full text]
  • The Category of Cofinal Types. I 387
    THE CATEGORYOF COFINAL TYPES. I BY SEYMOUR GINSBURG AND J. R. ISBELL I.1) Introduction. Briefly, this paper introduces a category S£ which we call the category of cofinal types. We construct a concrete representation Sfi of So, and we determine explicitly the part of Sfi corresponding to the cofinal types of bases of open sets in regular topological spaces. These types have a privileged position in^, and we call them canonical types. Succeeding papers in this series will develop further machinery, particularly for the cofinal types of directed sets. The interest of the results depends heavily on the appropriateness of our definitions of convergent functions and equivalence of convergent functions between partially ordered sets (see below, before and after 1.1). In directed sets, a function f: P—>Q is convergent if and only if it takes every cofinal subset to a cofinal subset; in general, P and Q may have branching structure which / must respect. Equivalence of the convergent functions /: P —>Q and g:P—>Q means, except for some trivialities, that every function AC/Ug (i.e., every value h(p) is f{p) or gip)) is convergent. The relation gives us a quotient Sf of the category of all partially ordered sets and convergent functions. Two objects of SS/ become isomorphic in ^if and only if they are cofinally similar. We adapt a construction F from [2] to make several functors F, F°, F* on W such that the quotient category is So. F* induces a dual embedding of So in the category 96* of all complete Boolean algebras and complete homomor- phisms, and a duality between 96* and the full subcategory of canonical types in if.
    [Show full text]
  • Order Isomorphisms of Complete Order-Unit Spaces Cormac Walsh
    Order isomorphisms of complete order-unit spaces Cormac Walsh To cite this version: Cormac Walsh. Order isomorphisms of complete order-unit spaces. 2019. hal-02425988 HAL Id: hal-02425988 https://hal.archives-ouvertes.fr/hal-02425988 Preprint submitted on 31 Dec 2019 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. ORDER ISOMORPHISMS OF COMPLETE ORDER-UNIT SPACES CORMAC WALSH Abstract. We investigate order isomorphisms, which are not assumed to be linear, between complete order unit spaces. We show that two such spaces are order isomor- phic if and only if they are linearly order isomorphic. We then introduce a condition which determines whether all order isomorphisms on a complete order unit space are automatically affine. This characterisation is in terms of the geometry of the state space. We consider how this condition applies to several examples, including the space of bounded self-adjoint operators on a Hilbert space. Our techniques also allow us to show that in a unital C∗-algebra there is an order isomorphism between the space of self-adjoint elements and the cone of positive invertible elements if and only if the algebra is commutative.
    [Show full text]
  • Ordered Sets an Introduction
    Bernd S. W. Schröder Ordered Sets An Introduction Birkhäuser Boston • Basel • Berlin Bernd S. W. Schröder Program of Mathematics and Statistics Lousiana Tech University Ruston, LA 71272 U.S.A. Library of Congress Cataloging-in-Publication Data Schröder, Bernd S. W. (Bernd Siegfried Walter), 1966- Ordered sets : an introduction / Bernd S. W. Schröder. p. cm. Includes bibliographical references and index. ISBN 0-8176-4128-9 (acid-free paper) – ISBN 3-7643-4128-9 (acid-free paper) 1. Ordered sets. I. Title. QA171.48.S47 2002 511.3'2–dc21 2002018231 CIP AMS Subject Classifications: 06-01, 06-02 Printed on acid-free paper. ® ©2003 Birkhäuser Boston Birkhäuser All rights reserved. This work may not be translated or copied in whole or in part without the written permission of the publisher (Birkhäuser Boston, c/o Springer-Verlag New York, Inc., 175 Fifth Avenue, New York, NY 10010, USA), except for brief excerpts in connection with reviews or scholarly analysis. Use in connection with any form of information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed is forbidden. The use of general descriptive names, trade names, trademarks, etc., in this publication, even if the former are not especially identified, is not to be taken as a sign that such names, as understood by the Trade Marks and Merchandise Marks Act, may accordingly be used freely by anyone. ISBN 0-8176-4128-9 SPIN 10721218 ISBN 3-7643-4128-9 Typeset by the author. Printed in the United States of America. 9 8 7 6 5 4 3 2 1 Birkhäuser Boston • Basel • Berlin A member of BertelsmannSpringer Science+Business Media GmbH Contents Table of Contents .
    [Show full text]
  • Order-Isomorphism and a Projection's Diagram of C(X)
    Turk J Math 34 (2010) , 523 – 536. c TUB¨ ITAK˙ doi:10.3906/mat-0812-9 Order-isomorphism and a projection’s diagram of C(X) Ahmed S. Al-Rawashdeh and Sultan M. Al-Suleiman Abstract A mapping between projections of C∗ -algebras preserving the orthogonality, is called an orthoisomor- phism. We define the order-isomorphism mapping on C∗ -algebras, and using Dye’s result, we prove in the case of commutative unital C∗ -algebras that the concepts; order-isomorphism and the orthoisomorphism coincide. Also, we define the equipotence relation on the projections of C(X); indeed, new concepts of finiteness are introduced. The classes of projections are represented by constructing a special diagram, we study the relation between the diagram and the topological space X . We prove that an order-isomorphism, which preserves the equipotence of projections, induces a diagram-isomorphism; also if two diagrams are isomorphic, then the C∗ -algebras are isomorphic. Key Words: Commutative C∗ -algebras; projections order-isomorphism; infinite projections; clopen sub- sets. 1. Introduction The algebra of continuous complex-valued functions on a compact Hausdorff space X , denoted by C(X), is a commutative unital C∗ -algebra. Let us recall the following main theorem, known as the Gelfand-Naimark Theorem. Theorem 1.1 [8] Every commutative, unital C∗ -algebra A is isometrically ∗-isomorphic to C(A),whereA is the compact Hausdorff space of characters of A. Let P(A) denote the set of projections of A. A projection p ∈P(A) is said to be minimal if 0 is the only proper subprojection of p.
    [Show full text]
  • Structurable Equivalence Relations
    Structurable equivalence relations Ruiyuan Chen∗ and Alexander S. Kechrisy Abstract For a class of countable relational structures, a countable Borel equivalence relation E is said to be -structurableK if there is a Borel way to put a structure in on each E-equivalence class. We studyK in this paper the global structure of the classes of -structurableK equivalence relations for various . We show that -structurability interactsK well with several kinds of Borel homomorphismsK and reductions commonlyK used in the classification of countable Borel equivalence relations. We consider the poset of classes of -structurable equivalence relations for various , under inclusion, and show that it is a distributiveK lattice; this implies that the Borel reducibilityK preordering among countable Borel equivalence relations contains a large sublattice. Finally, we consider the effect on -structurability of various model-theoretic properties of . In particular, we characterize the Ksuch that every -structurable equivalence relation is smooth,K answering a question of Marks.K K Contents 1 Introduction 3 2 Preliminaries 7 2.1 Theories and structures..................................7 2.2 Countable Borel equivalence relations..........................8 2.3 Homomorphisms......................................9 2.4 Basic operations...................................... 10 2.5 Special equivalence relations................................ 11 2.6 Fiber products....................................... 12 2.7 Some categorical remarks................................
    [Show full text]
  • On Order–Isomorphisms of Stochastic Orders Generated by Partially Ordered Sets with Applications to the Analysis of Chemical Components of Seaweeds
    MATCH MATCH Commun. Math. Comput. Chem. 69 (2013) 463-486 Communications in Mathematical and in Computer Chemistry ISSN 0340 - 6253 On Order–Isomorphisms of Stochastic Orders Generated by Partially Ordered Sets with Applications to the Analysis of Chemical Components of Seaweeds Mar´ıa Concepci´on L´opez-D´ıaza, Miguel L´opez-D´ıazb∗ aDepartamento de Matem´aticas, Universidad de Oviedo C/ Calvo Sotelo s/n. E-33007 Oviedo, Spain. [email protected] bDepartamento de Estad´ısticae I.O. y D.M., Universidad de Oviedo C/ Calvo Sotelo s/n. E-33007 Oviedo, Spain. [email protected] (Received April 17, 2012) Abstract Given X a set endowed with a partial order , we can consider the class of -preserving real functions on X characterized by x y implies f(x) ≤ f(y). Such a class of functions generates a stochastic order g on the set of probabilities asso- ciated with X by means of P g Q when X fdP ≤ X fdQfor all f -preserving functions. In this paper we analyze if the property of being order-isomorphic is transferred from partially ordered sets to the corresponding generated stochastic orders and conversely. We obtain that if two posets are order-isomorphic, the posets which are generated by means of the class of measurable preserving functions are also order-isomorphic. We prove that the converse is not true in general, and we obtain particular conditions under which the converse holds. The mathematical results in the paper are applied to the comparison of maritime areas with respect to chemical components of seaweeds. Moreover we show how the solution of the above comparison for specific components can lead to the solution of the compar- ison when we consider other components of seaweeds by applying the results on order-isomorphisms.
    [Show full text]
  • Order Isomorphisms Between Cones of JB-Algebras
    Order isomorphisms between cones of JB-algebras Hendrik van Imhoff∗ Mathematical Institute, Leiden University, P.O.Box 9512, 2300 RA Leiden, The Netherlands Mark Roelands† School of Mathematics, Statistics & Actuarial Science, University of Kent, Canterbury, CT2 7NX, United Kingdom April 23, 2019 Abstract In this paper we completely describe the order isomorphisms between cones of atomic JBW-algebras. Moreover, we can write an atomic JBW-algebra as an algebraic direct summand of the so-called engaged and disengaged part. On the cone of the engaged part every order isomorphism is linear and the disengaged part consists only of copies of R. Furthermore, in the setting of general JB-algebras we prove the following. If either algebra does not contain an ideal of codimension one, then every order isomorphism between their cones is linear if and only if it extends to a homeomorphism, between the cones of the atomic part of their biduals, for a suitable weak topology. Keywords: Order isomorphisms, atomic JBW-algebras, JB-algebras. Subject Classification: Primary 46L70; Secondary 46B40. 1 Introduction Fundamental objects in the study of partially ordered vector spaces are the order isomorphisms between, for example, their cones or the entire spaces. By such an order isomorphism we mean an order preserving bijection with an order preserving inverse, which is not assumed to be linear. It is therefore of particular interest to be able to describe these isomorphisms and know for which partially ordered vector spaces the order isomorphisms between their cones are in fact linear. arXiv:1904.09278v2 [math.OA] 22 Apr 2019 Questions regarding the behaviour of order isomorphisms between cones originated from Special Rela- tivity.
    [Show full text]
  • Vector Spaces with an Order Unit
    VECTOR SPACES WITH AN ORDER UNIT VERN I. PAULSEN AND MARK TOMFORDE Abstract. We develop a theory of ordered ∗-vector spaces with an order unit. We prove fundamental results concerning positive linear functionals and states, and we show that the order (semi)norm on the space of self-adjoint elements admits multiple extensions to an order (semi)norm on the entire space. We single out three of these (semi)norms for further study and discuss their significance for operator algebras and operator systems. In addition, we introduce a functorial method for taking an ordered space with an order unit and forming an Archimedean ordered space. We then use this process to describe an appropriate notion of quotients in the category of Archimedean ordered spaces. Contents 1. Introduction 2 2. Ordered real vector spaces 4 2.1. Positive R-linear functionals and states 6 2.2. The order seminorm 9 2.3. The Archimedeanization of an ordered real vector space 12 2.4. Quotients of ordered real vector spaces 15 3. Ordered -vector spaces 18 3.1. Positive∗ C-linear functionals and states 19 3.2. The Archimedeanization of an ordered -vector space 21 3.3. Quotients of ordered -vector spaces∗ 22 4. Seminorms on ordered ∗-vector spaces 24 4.1. The minimal order seminorm∗ 24 k · km arXiv:0712.2613v4 [math.OA] 10 Jun 2009 4.2. The maximal order seminorm 25 k · kM 4.3. The decomposition seminorm dec 28 5. Examples of ordered -vector spacesk · k 31 5.1. Function systems and∗ a complex version of Kadison’s Theorem 31 5.2.
    [Show full text]