DOCSLIB.ORG

Cryptomorphisms MAA Short Course Lecture Notes

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Cryptomorphisms MAA Short Course Lecture Notes Cryptomorphisms ∗ MAA Short Course Lecture Notes Jenny McNulty Department of Mathematical Sciences, The University of Montana Missoula, MT 59812-1032, USA [email protected] January, 2011 1 Introduction One of the most attractive features of matroids is the plethora of equivalent definitions. Borrowing from linear algebra, we can define a matroid in terms of independent sets or equivalently in terms of bases. Graph theory motivates alternate formulations of matroids in terms of circuits and cocircuits, while open and closed sets, closure and hyperplanes come from geometry. We will tie these disparate concepts together using the rank function. There are many additional ways to define a matroid; we'll discuss some of them here, but leave the rest for you to explore. A central idea of this topic is that we can convert from one axiom system to another. We'll describe a method, called a cryptomorphism, for converting from one system to an- other. A cryptomorphism is an \equivalent way to define matroids, yet not straight- forward" 1 While this variety of axiom systems (that is to say the number of cryptomorphic definitions a matroid) gives matroid theory much of its power, it can often contribute to the difficulty in learning the subject. We suggest the reader keep the prototypes in mind while learning the formal definitions and refer often to the cryptomorphism charts. 2 From Independent Sets to Bases and Back Again We begin with the formal definition of a matroid. Independent Definition 1. A matroid M is a pair (E; I) in which E is a finite set and I is a family of sets subsets of E satisfying (I1) I 6= ;; Non- triviality (I2) If J 2 I and I ⊆ J, then I 2 I; Closed un- (I3) If I;J 2 I with jIj < jJj; then there is some element x 2 J − I with I [ fxg 2 I: der subsets Augmentation ∗These notes are adapted from the text \Matroid Theory" by G. Gordon and J. McNulty. 1G. Birkhoff coined the term crypto-isomorphism in 1967 [1], since then the term has been shortened to cryptomorphism. 1 The family I forms the independent sets of the matroid. The three properties (I1), (I2), and (I3) listed above are not the only properties the independent sets of a matroid satisfy. For instance, it's easy to see that properties (I1) and (I2) together imply ; 2 I. The next proposition points out that one can define a matroid in many ways - even just restricting oneself to independent sets. Proposition 2. Let E be a finite set and let I be a family of subsets of E. Then the family I forms the independent sets of a matroid iff: (I10) ; 2 I; (I2) If J 2 I and I ⊆ J, then I 2 I; (I30) If I;J 2 I with jJj = jIj + 1; then there is some element x 2 J − I with I [ fxg 2 I: Definition 3. If M is a matroid with independent sets I, then B is a basis of the matroid M if B is a maximal independent set. Bases Let's see how we can define a matroid directly in terms of bases. Here are 3 things that are always true for the bases B of a matroid: (B1) B= 6 ;. Non- triviality (B2) If B ;B 2 B and B ⊆ B , then B = B : 1 2 1 2 1 2 Clutter (B3) If B1;B2 2 B and x 2 B1 − B2, then there is an element y 2 B2 − B1 so that Basis Ex- B1 − x [ fyg 2 B: change These properties that the collection B of bases satisfy is actually all we need to define a matroid in terms of bases. That is, these properties can be taken as an equivalent axiom system for a matroid. Just as the axiom system for independent sets mirrors the properties of linear independence in vectors, the axiom system for bases is motivated by properties satisfied by the collection of bases of a (finite-dimensional) vector space. Here's an alternate version of (B2): 0 (B2 ) If B1;B2 2 B, then jB1j = jB2j Equicardinal The next proposition, will be useful when we work through the details of the crypto- morphism between independent sets and bases. Proposition 4. Let E be a finite set and let B be a family of subsets of E. The family B satisfies (B1), (B2), (B3) if and only if B satisfies (B1), (B20), (B3). We are finally ready to discuss our first cryptomorphism. This involves the following steps: 1. Given the independent sets I in a matroid, define a collection of subsets B to be the maximal independent sets; 2. Next, prove that the collection B satisfies the properties (B1), (B20), and (B3); 3. Reverse the procedure: Given the collection of bases B of a matroid, define a collection of subsets I to be all subsets of the bases in B; 2 4. Now, prove the collection I you just defined satisfies the properties (I1), (I2), and (I3) (or, equivalently, (I10), (I2), and (I30)). We're still not done. When we define I in terms of B and also define B in terms of I, we are actually dealing with functions on the set of all families of subsets of E. Let f and g be these cryptomorphic functions with f(I) = B and g(B) = I (so f; g : 22E ! 22E ). We have to show these two cryptomorphisms compose correctly: 5. Show f(g(B)) = B, and now g(f(I)) = I. Maximal Bases . Independent Sets Subsets . Figure 1: Cryptomorphism between Independent Sets and Bases Theorem 5. Let E be a finite set and let B be a family of subsets of E satisfying (B1), (B2), (B3). Then, (E; B) is cryptomorphic to the matroid M = (E; I) and B is the collection of bases of a matroid. Example 6. Let M be the matroid on the six element set E = fa; b; c; d; e; fg with bases B = face; ade; bce; bde; cdeg. e f a b c d Figure 2: The matroid from Example 6. Some curious features of this matroid are the behavior of the elements e and f. Note that e is in every basis of the matroid. Equivalently, it can be added to any independent set it's not in to create another independent set. Such an element is called an isthmus or coloop of the matroid. On the other hand, the element f is in no basis { in fact, f is in no independent set at all. This element is called a loop. Both isthmus and loop are terms borrowed from graph theory. A set which is not independent is called dependent and a minimal dependent set is called a circuit. In the example, we list the collection C of all circuits: C = ff; ab; acd; bcdg. Listing the circuits is often an efficient way to describe a matroid. Definition 7. Let M be a matroid on the ground set E. An isthmus is an element x 2 E that is in every basis. A loop is an element x 2 E that is not in any basis. Isthmus Loop In summary, if we are given a matroid M = (E; I) defined in terms of independent we sets, can easily find the bases, the dependent sets and the circuits. Moreover, if we are given any one of these collections we can find the others { see Figure 3. For example we can define circuits C in terms of independent sets I and vice versa as: 3 •I!C: The circuits C are the minimal subsets of E that are not independent. •C!I: The independent sets I are all the subsets of E that don't contain a circuit C 2 C. The three key properties the family C satisfies are: (C1) ; 62 C; Non- triviality (C2) If C ;C 2 C and C ⊆ C , then C = C , 1 2 1 2 1 2 Clutter (C3) If C1;C2 2 C with C1 =6 C2; and x 2 C1 \ C2, then C3 ⊆ C1 [ C2 − x for some C3 2 C: Circuit Elimination Theorem 8. Let E be a finite set and let C be a family of subsets of E satisfying (C1), (C2), (C3). Then, (E; C) is cryptomorphic to the matroid M = (E; I) and C is the collection of circuits of M. Maximal Bases Independent Sets Subsets Not Not . Minimal . Dependent Sets Circuits . Supersets Figure 3: Cryptomorphism between Independent Sets, Bases, Dependent Sets and Circuits 3 Rank, Flats, Hyperplanes and Closure In this section, we define several additional matroid concepts having a geometric flavor. For each new term we define, we'll relate it to previously defined matroid concepts and describe the new term for geometries and graphs. As before, we can define a matroid directly in terms of these new concepts. The example we will use throughout this section is the matroid M on the six element set E = fa; b; c; d; e; fg with bases B = face; ade; bce; bde; cdeg { this is the same matroid we met in Example 6. In Figure 4, we draw the geometry corresponding to M and we also give a graphic representation. Example 9. In the picture of the matroid M on the left of Figure 4, the bases of M correspond to the collections of three points that are not collinear. Note that the isthmus e is in every such set. For the graph G on the right of Figure 4, note the bases correspond to the spanning trees of G, and this time, the edge corresponding to the isthmus e is an isthmus of G.
Load more

Recommended publications
  • GALOIS THEORY for ARBITRARY FIELD EXTENSIONS Contents 1
    GALOIS THEORY FOR ARBITRARY FIELD EXTENSIONS PETE L. CLARK Contents 1. Introduction 1 1.1. Kaplansky's Galois Connection and Correspondence 1 1.2. Three flavors of Galois extensions 2 1.3. Galois theory for algebraic extensions 3 1.4. Transcendental Extensions 3 2. Galois Connections 4 2.1. The basic formalism 4 2.2. Lattice Properties 5 2.3. Examples 6 2.4. Galois Connections Decorticated (Relations) 8 2.5. Indexed Galois Connections 9 3. Galois Theory of Group Actions 11 3.1. Basic Setup 11 3.2. Normality and Stability 11 3.3. The J -topology and the K-topology 12 4. Return to the Galois Correspondence for Field Extensions 15 4.1. The Artinian Perspective 15 4.2. The Index Calculus 17 4.3. Normality and Stability:::and Normality 18 4.4. Finite Galois Extensions 18 4.5. Algebraic Galois Extensions 19 4.6. The J -topology 22 4.7. The K-topology 22 4.8. When K is algebraically closed 22 5. Three Flavors Revisited 24 5.1. Galois Extensions 24 5.2. Dedekind Extensions 26 5.3. Perfectly Galois Extensions 27 6. Notes 28 References 29 Abstract. 1. Introduction 1.1. Kaplansky's Galois Connection and Correspondence. For an arbitrary field extension K=F , define L = L(K=F ) to be the lattice of 1 2 PETE L. CLARK subextensions L of K=F and H = H(K=F ) to be the lattice of all subgroups H of G = Aut(K=F ). Then we have Φ: L!H;L 7! Aut(K=L) and Ψ: H!F;H 7! KH : For L 2 L, we write c(L) := Ψ(Φ(L)) = KAut(K=L): One immediately verifies: L ⊂ L0 =) c(L) ⊂ c(L0);L ⊂ c(L); c(c(L)) = c(L); these properties assert that L 7! c(L) is a closure operator on the lattice L in the sense of order theory.
    [Show full text]
  • Some Order Dualities in Logic, Games and Choices Bernard Monjardet
    Some order dualities in logic, games and choices Bernard Monjardet To cite this version: Bernard Monjardet. Some order dualities in logic, games and choices. International Game Theory Review, World Scientific Publishing, 2007, 9 (1), pp.1-12. 10.1142/S0219198907001242. halshs- 00202326 HAL Id: halshs-00202326 https://halshs.archives-ouvertes.fr/halshs-00202326 Submitted on 9 Jan 2008 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. 1 SOME ORDER DUALITIES IN LOGIC, GAMES AND CHOICES B. MONJARDET CERMSEM, Université Paris I, Maison des Sciences Économiques, 106-112 bd de l’Hôpital 75647 Paris Cedex 13, France and CAMS, EHESS. [email protected] 20 February 2004 Abstract We first present the concept of duality appearing in order theory, i.e. the notions of dual isomorphism and of Galois connection. Then we describe two fundamental dualities, the duality extension/intention associated with a binary relation between two sets, and the duality between implicational systems and closure systems. Finally we present two "concrete" dualities occuring in social choice and in choice functions theories. Keywords: antiexchange closure operator, closure system, Galois connection, implicational system, Galois lattice, path-independent choice function, preference aggregation rule, simple game.
    [Show full text]
  • The Poset of Closure Systems on an Infinite Poset: Detachability and Semimodularity Christian Ronse
    The poset of closure systems on an infinite poset: Detachability and semimodularity Christian Ronse To cite this version: Christian Ronse. The poset of closure systems on an infinite poset: Detachability and semimodularity. Portugaliae Mathematica, European Mathematical Society Publishing House, 2010, 67 (4), pp.437-452. 10.4171/PM/1872. hal-02882874 HAL Id: hal-02882874 https://hal.archives-ouvertes.fr/hal-02882874 Submitted on 31 Aug 2020 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. Portugal. Math. (N.S.) Portugaliae Mathematica Vol. xx, Fasc. , 200x, xxx–xxx c European Mathematical Society The poset of closure systems on an infinite poset: detachability and semimodularity Christian Ronse Abstract. Closure operators on a poset can be characterized by the corresponding clo- sure systems. It is known that in a directed complete partial order (DCPO), in particular in any finite poset, the collection of all closure systems is closed under arbitrary inter- section and has a “detachability” or “anti-matroid” property, which implies that the collection of all closure systems is a lower semimodular complete lattice (and dually, the closure operators form an upper semimodular complete lattice). After reviewing the history of the problem, we generalize these results to the case of an infinite poset where closure systems do not necessarily constitute a complete lattice; thus the notions of lower semimodularity and detachability are extended accordingly.
    [Show full text]
  • Geometry (Lines) SOL 4.14?
    Geometry (Lines) lines, segments, rays, points, angles, intersecting, parallel, & perpendicular Point “A point is an exact location in space. It has no length or width.” Points have names; represented with a Capital Letter. – Example: A a Lines “A line is a collection of points going on and on infinitely in both directions. It has no endpoints.” A straight line that continues forever It can go – Vertically – Horizontally – Obliquely (diagonally) It is identified because it has arrows on the ends. It is named by “a single lower case letter”. – Example: “line a” A B C D Line Segment “A line segment is part of a line. It has two endpoints and includes all the points between those endpoints. “ A straight line that stops It can go – Vertically – Horizontally – Obliquely (diagonally) It is identified by points at the ends It is named by the Capital Letter End Points – Example: “line segment AB” or “line segment AD” C B A Ray “A ray is part of a line. It has one endpoint and continues on and on in one direction.” A straight line that stops on one end and keeps going on the other. It can go – Vertically – Horizontally – Obliquely (diagonally) It is identified by a point at one end and an arrow at the other. It can be named by saying the endpoint first and then say the name of one other point on the ray. – Example: “Ray AC” or “Ray AB” C Angles A B Two Rays That Have the Same Endpoint Form an Angle. This Endpoint Is Called the Vertex.
    [Show full text]
  • Unsteadiness in Flow Over a Flat Plate at Angle-Of-Attack at Low Reynolds Numbers∗
    Unsteadiness in Flow over a Flat Plate at Angle-of-Attack at Low Reynolds Numbers∗ Kunihiko Taira,† William B. Dickson,‡ Tim Colonius,§ Michael H. Dickinson¶ California Institute of Technology, Pasadena, California, 91125 Clarence W. Rowleyk Princeton University, Princeton, New Jersey, 08544 Flow over an impulsively started low-aspect-ratio flat plate at angle-of-attack is inves- tigated for a Reynolds number of 300. Numerical simulations, validated by a companion experiment, are performed to study the influence of aspect ratio, angle of attack, and plan- form geometry on the interaction of the leading-edge and tip vortices and resulting lift and drag coefficients. Aspect ratio is found to significantly influence the wake pattern and the force experienced by the plate. For large aspect ratio plates, leading-edge vortices evolved into hairpin vortices that eventually detached from the plate, interacting with the tip vor- tices in a complex manner. Separation of the leading-edge vortex is delayed to some extent by having convective transport of the spanwise vorticity as observed in flow over elliptic, semicircular, and delta-shaped planforms. The time at which lift achieves its maximum is observed to be fairly constant over different aspect ratios, angles of attack, and planform geometries during the initial transient. Preliminary results are also presented for flow over plates with steady actuation near the leading edge. I. Introduction In recent years, flows around flapping insect wings have been investigated and, in particular, it has been observed that the leading-edge vortex (LEV) formed during stroke reversal remains stably attached throughout the wing stroke, greatly enhancing lift.1, 2 Such LEVs are found to be stable over a wide range of angles of attack and for Reynolds number over a range of Re ≈ O(102) − O(104).
    [Show full text]
  • Points, Lines, and Planes a Point Is a Position in Space. a Point Has No Length Or Width Or Thickness
    Points, Lines, and Planes A Point is a position in space. A point has no length or width or thickness. A point in geometry is represented by a dot. To name a point, we usually use a (capital) letter. A A (straight) line has length but no width or thickness. A line is understood to extend indefinitely to both sides. It does not have a beginning or end. A B C D A line consists of infinitely many points. The four points A, B, C, D are all on the same line. Postulate: Two points determine a line. We name a line by using any two points on the line, so the above line can be named as any of the following: ! ! ! ! ! AB BC AC AD CD Any three or more points that are on the same line are called colinear points. In the above, points A; B; C; D are all colinear. A Ray is part of a line that has a beginning point, and extends indefinitely to one direction. A B C D A ray is named by using its beginning point with another point it contains. −! −! −−! −−! In the above, ray AB is the same ray as AC or AD. But ray BD is not the same −−! ray as AD. A (line) segment is a finite part of a line between two points, called its end points. A segment has a finite length. A B C D B C In the above, segment AD is not the same as segment BC Segment Addition Postulate: In a line segment, if points A; B; C are colinear and point B is between point A and point C, then AB + BC = AC You may look at the plus sign, +, as adding the length of the segments as numbers.
    [Show full text]
  • Arxiv:1301.2793V2 [Math.LO] 18 Jul 2014 Uaeacnetof Concept a Mulate Fpwrbet Uetepwre Xo) N/Rmk S Ff of Use Make And/Or Axiom), Presupp Principles
    ON TARSKI’S FIXED POINT THEOREM GIOVANNI CURI To Orsola Abstract. A concept of abstract inductive definition on a complete lattice is formulated and studied. As an application, a constructive version of Tarski’s fixed point theorem is obtained. Introduction The fixed point theorem referred to in this paper is the one asserting that every monotone mapping on a complete lattice L has a least fixed point. The proof, due to A. Tarski, of this result, is a simple and most significant example of a proof that can be carried out on the base of intuitionistic logic (e.g. in the intuitionistic set theory IZF, or in topos logic), and that yet is widely regarded as essentially non-constructive. The reason for this fact is that Tarski’s construction of the fixed point is highly impredicative: if f : L → L is a monotone map, its least fixed point is given by V P , with P ≡ {x ∈ L | f(x) ≤ x}. Impredicativity here is found in the fact that the fixed point, call it p, appears in its own construction (p belongs to P ), and, indirectly, in the fact that the complete lattice L (and, as a consequence, the collection P over which the infimum is taken) is assumed to form a set, an assumption that seems only reasonable in an intuitionistic setting in the presence of strong impredicative principles (cf. Section 2 below). In concrete applications (e.g. in computer science and numerical analysis) the monotone operator f is often also continuous, in particular it preserves suprema of non-empty chains; in this situation, the least fixed point can be constructed taking the supremum of the ascending chain ⊥,f(⊥),f(f(⊥)), ..., given by the set of finite iterations of f on the least element ⊥.
    [Show full text]
  • CLOSURE OPERATORS I Dikran DIKRANJAN Eraldo GIULI
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector Topology and its Applications 27 (1987) 129-143 129 North-Holland CLOSURE OPERATORS I Dikran DIKRANJAN Institute of Mathematics, Bulgarian Academy of Sciences, Sojia, Bulgaria Eraldo GIULI* Department of Pure and Applied Mathematics, University of L’Aquila, 67100-L’Aquila, Italy Received 8 June 1986 Revised 24 September 1986 Closure operators in an (E, M)-category X are introduced as concrete endofunctors of the comma category whose objects are the elements of M. Various kinds of closure operators are studied. There is a Galois equivalence between the conglomerate of idempotent and weakly hereditary closure operators of X and the conglomerate of subclasses of M which are part of a factorization system. There is a one-to-one correspondence between the class of regular closure operators and the class of strongly epireflective subcategories of X. Every closure operator admits an idempotent hull and a weakly hereditary core. Various examples of additive closure operators in Top are given. For abelian categories standard closure operators are considered. It is shown that there is a one-to-one correspondence between the class of standard closure operators and the class of preradicals. Idempotenf weakly hereditary, standard closure operators correspond to idempotent radicals ( = torsion theories). AMS (MOS) Subj. Class.: 18A32, 18B30, 18E40, 54A05, 54B30, 18A40, A-regular morphism weakly hereditary core sequential closure (pre)-radical Introduction Closure operators have always been one of the main concepts in topology. For example, Herrlich [21] characterized coreflections in the category Top of topological spaces by means of Kuratowski closure operators finer than the ordinary closure.
    [Show full text]
  • CLOSURE OPERATORS on ALGEBRAS 3 Extended Power Algebra (P>0A, Ω, ∪) Is a Semilattice Ordered ✵-Algebra
    CLOSURE OPERATORS ON ALGEBRAS A. PILITOWSKA1 AND A. ZAMOJSKA-DZIENIO2,∗ Abstract. We study connections between closure operators on an algebra (A, Ω) and congruences on the extended power algebra defined on the same algebra. We use these connections to give an alternative description of the lattice of all subvarieties of semilattice ordered algebras. 1. Introduction In this paper we study closure operators on algebras. M. Novotn´y [12] and J. Fuchs [4] introduced the notion of admissible closure operators for monoids and applied them to study some Galois connections in language theory. In [10] M. Kuˇril and L. Pol´ak used such operators to describe the varieties of semilattice ordered semigroups. In this paper we use a similar approach but apply it to arbitrary alge- bras. In particular, we use concepts from the theory of (extended) power algebras (see e.g. C. Brink [2]). This allows us to generalize and simplify methods presented in [10]. In a natural way one can ”lift” any operation defined on a set A to an operation on the set of all non-empty subsets of A and obtain from any algebra (A, Ω) its power algebra of subsets. Power algebras of non-empty subsets with the additional operation of set-theoretical union are known as extended power algebras. Extended power algebras play a crucial rˆole in the theory of semilattice ordered algebras. The main aim of this paper is to investigate how congruences on the extended power algebra on (A, Ω) and closure operators defined on (A, Ω) are related. The correspondence obtained allows us to give an alternative (partially simpler) descrip- tion of the subvariety lattice of semilattice ordered algebras, comparing to [16].
    [Show full text]
  • Completion and Closure Cahiers De Topologie Et Géométrie Différentielle Catégoriques, Tome 41, No 2 (2000), P
    CAHIERS DE TOPOLOGIE ET GÉOMÉTRIE DIFFÉRENTIELLE CATÉGORIQUES DAVID HOLGATE Completion and closure Cahiers de topologie et géométrie différentielle catégoriques, tome 41, no 2 (2000), p. 101-119 <http://www.numdam.org/item?id=CTGDC_2000__41_2_101_0> © Andrée C. Ehresmann et les auteurs, 2000, tous droits réservés. L’accès aux archives de la revue « Cahiers de topologie et géométrie différentielle catégoriques » implique l’accord avec les conditions générales d’utilisation (http://www.numdam.org/conditions). Toute utilisation commerciale ou impression systématique est constitutive d’une infraction pénale. Toute copie ou impression de ce fichier doit contenir la présente mention de copyright. Article numérisé dans le cadre du programme Numérisation de documents anciens mathématiques http://www.numdam.org/ CAHIERS DE TOPOLOGIE ET Volume XLI-2 (2000) GEOMETRIE DIFFERENTIELLE CATEGORIQUES COMPLETION AND CLOSURE by David HOLGATE RESUME. La fermeture (ou, de fagon synonyme la densite) a tou- jours jou6 un role important dans la th6orie des compl6tions. S’ap- puyant sur des id6es de Birkhoff, une fermeture est extraite de ma- niere canonique d’un processus de completion r6flexive dans une categorie. Cette fermeture caract6rise la compl6tude et la compl6- tion elle-meme. La fermeture n’a pas seulement de bonnes propri6t6s internes, mais c’est la plus grande parmi les fermetures qui d6crivent la completion. Le theoreme principal montre que, equivalent aux descriptions fermeture/densite naturelle d’une completion, est le simple fait mar- quant que les r6flecteurs de completion sont exactement ceux qui pr6servent les plongements. De tels r6flecteurs peuvent 6tre deduits de la fermeture elle-m6me. Le role de la pr6servation de la ferme- ture et du plongement jette alors une nouvelle lumi6re sur les exem- ples de completion.
    [Show full text]
  • The Mass of an Asymptotically Flat Manifold
    The Mass of an Asymptotically Flat Manifold ROBERT BARTNIK Australian National University Abstract We show that the mass of an asymptotically flat n-manifold is a geometric invariant. The proof is based on harmonic coordinates and, to develop a suitable existence theory, results about elliptic operators with rough coefficients on weighted Sobolev spaces are summarised. Some relations between the mass. xalar curvature and harmonic maps are described and the positive mass theorem for ,c-dimensional spin manifolds is proved. Introduction Suppose that (M,g) is an asymptotically flat 3-manifold. In general relativity the mass of M is given by where glJ, denotes the partial derivative and dS‘ is the normal surface element to S,, the sphere at infinity. This expression is generally attributed to [3]; for a recent review of this and other expressions for the mass and other physically interesting quantities see (41. However, in all these works the definition depends on the choice of coordinates at infinity and it is certainly not clear whether or not this dependence is spurious. Since it is physically quite reasonable to assume that a frame at infinity (“observer”) is given, this point has not received much attention in the literature (but see [15]). It is our purpose in this paper to show that, under appropriate decay conditions on the metric, (0.1) generalises to n-dimensions for n 2 3 and gives an invariant of the metric structure (M,g). The decay conditions roughly stated (for n = 3) are lg - 61 = o(r-’12), lag1 = o(f312), etc, and thus include the usual falloff conditions.
    [Show full text]
  • Closure Operators on Dcpos 3
    CLOSURE OPERATORS ON DCPOS FRANCE DACAR Department of Knowledge Technologies, Joˇzef Stefan Institute, Jamova 39, 1000 Ljubljana, Slove- nia e-mail address: [email protected] URL: https://kt.ijs.si/france_dacar/ Abstract. We examine collective properties of closure operators on posets that are at least dcpos. The first theorem sets the tone of the paper: it tells how a set of preclosure maps on a dcpo determines the least closure operator above it, and pronounces the related induction principle and its sibling, the obverse induction principle. Using this theorem we prove that the poset of closure operators on a dcpo is a complete lattice, and then provide a constructive proof of the Tarski’s theorem for dcpos. We go on to construct the joins in the complete lattice of Scott-continuous closure operators on a dcpo, and to prove that the complete lattice of nuclei on a preframe is a frame, giving some constructions in the special case of the frame of all nuclei on a frame. In the rather drawn-out proof of the Hofmann–Mislove–Johnstone theorem we show off the utility of the obverse induction, applying it in the proof of the clinching lemma. After that we shift a viewpoint and prove some results, analogous to the results about dcpos, for posets in which certain special subposets have enough maximal elements; these results specialize to dcpos, but at the price of using the axiom of choice. We conclude by pointing out two convex geometries associated with closure operators on a dcpo. 1. Overview of the paper The central theme of the paper are the properties of the poset Cl(P ) of all closure operators on a poset P that is at least a dcpo, and of subposets of Cl(P ) consisting of some special kind of closure operators, for instance of the subposet ScCl(P ) of all Scott-continuous closure operators.
    [Show full text]