DOCSLIB.ORG

Lawson-Text.Pdf

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Lawson-Text.Pdf In Memoriam WILLIAM HENRY LAWSON 24th April 1915, Ypres CHARLES PEIRCE ECCLESHALL 6th June 1915, Gallipoli Contents Preface xi Prolegomena xv SECTION I IDEAS CHAPTER 1 The nature of mathematics 3 1.1 MATHEMATICS IN HISTORY 3 1.2 MATHEMATICS TODAY 6 1.3 THE SCOPE OF MATHEMATICS 7 1.4 WHAT THEY (PROBABLY) DIDN’T TELL YOU IN SCHOOL 8 1.5 FURTHER READING 9 CHAPTER 2 Proofs 11 2.1 MATHEMATICAL TRUTH 11 2.2 FUNDAMENTAL ASSUMPTIONS OF LOGIC 12 2.3 FIVE EASY PROOFS 12 2.4 AXIOMS 24 2.5 UN PETIT PEU DE PHILOSOPHIE 26 2.6 MATHEMATICAL CREATIVITY 27 2.7 PROVING SOMETHING FALSE 28 2.8 TERMINOLOGY 28 2.9 ADVICE ON PROOFS 29 CHAPTER 3 Foundations 31 3.1 SETS 31 vii viii Contents 3.2 BOOLEAN OPERATIONS 40 3.3 RELATIONS 45 3.4 FUNCTIONS 49 3.5 EQUIVALENCE RELATIONS 61 3.6 ORDER RELATIONS 67 3.7 QUANTIFIERS 69 3.8 PROOF BY INDUCTION 71 3.9 COUNTING 74 3.10 INFINITE NUMBERS 81 CHAPTER 4 Algebra redux 89 4.1 RULES OF THE GAME 90 4.2 ALGEBRAIC AXIOMS FOR REAL NUMBERS 98 4.3 SOLVING QUADRATIC EQUATIONS 104 4.4 BINOMIAL THEOREM 108 4.5 BOOLEAN ALGEBRAS 111 4.6 CHARACTERIZING REAL NUMBERS 118 SECTION II THEORIES CHAPTER 5 Number theory 125 5.1 REMAINDER THEOREM 125 5.2 GREATEST COMMON DIVISORS 132 5.3 FUNDAMENTAL THEOREM OF ARITHMETIC 140 5.4 MODULAR ARITHMETIC 148 5.5 CONTINUED FRACTIONS 155 CHAPTER 6 Complex numbers 165 6.1 COMPLEX NUMBER ARITHMETIC 165 6.2 COMPLEX NUMBER GEOMETRY 172 6.3 EULER’S FORMULA 176 6.4 MAKING SENSE OF COMPLEX NUMBERS 177 CHAPTER 7 Polynomials 179 Contents ix 7.1 TERMINOLOGY 179 7.2 REMAINDER THEOREM 180 7.3 ROOTS OF POLYNOMIALS 183 7.4 FUNDAMENTAL THEOREM OF ALGEBRA 183 7.5 ARBITRARY ROOTS OF COMPLEX NUMBERS 188 7.6 GREATEST COMMON DIVISORS OF POLYNOMIALS 193 7.7 IRREDUCIBLE POLYNOMIALS 194 7.8 PARTIAL FRACTIONS 196 7.9 RADICAL SOLUTIONS 204 7.10 ALGEBRAIC AND TRANSCENDENTAL NUMBERS 214 7.11 MODULAR ARITHMETIC WITH POLYNOMIALS 215 CHAPTER 8 Matrices 219 8.1 MATRIX ARITHMETIC 219 8.2 MATRIX ALGEBRA 231 8.3 SOLVING SYSTEMS OF LINEAR EQUATIONS 238 8.4 DETERMINANTS 247 8.5 INVERTIBLE MATRICES 253 8.6 DIAGONALIZATION 267 8.7 BLANKINSHIP’S ALGORITHM 279 CHAPTER 9 Vectors 283 9.1 VECTORS GEOMETRICALLY 283 9.2 VECTORS ALGEBRAICALLY 296 9.3 GEOMETRIC MEANING OF DETERMINANTS 299 9.4 GEOMETRY WITH VECTORS 301 9.5 LINEAR FUNCTIONS 310 9.6 ALGEBRAIC MEANING OF DETERMINANTS 315 9.7 QUATERNIONS 318 CHAPTER 10 The principal axes theorem 323 10.1 ORTHOGONAL MATRICES 323 10.2 ORTHOGONAL DIAGONALIZATION 331 10.3 CONICS AND QUADRICS 336 x Contents Epilegomena 343 Bibliography 347 Index 355 Preface The aim of this book is to providea bridge between school and university mathemat- ics centred on algebra and geometry. Apart from pro forma proofs by induction at school, mathematics students usually meet the concept of proof for the first time at university. Thus, an important part of this book is an introduction to proof. My own experience is that aside from a few basic ideas, proofs are best learnt by doing and this is the approach I have adopted here. In addition, I have also tried to counter the view of mathematics as nothing more than a collection of methods by emphasizing ideas and their historical origins throughout.Context is important and leads to greater understanding. Mathematics does not divide into watertight compartments. A book on algebra and geometry must therefore also make connections with applications and other parts of mathematics. I have used the examples to introduce applications of algebra to topics such as cryptography and error-correcting codes and to illus- trate connections with calculus. In addition, scattered throughout the book, you will find boxes in smaller type which can be read or omitted according to taste. Some of the boxes describe more complex proofs or results, but many are asides on more advanced material. You do not need to read any of the boxes to understand the book. The book is organized around three topics: linear equations, polynomial equa- tions and quadratic forms. This choice was informed by consulting a range of older textbooks,in particular [26, 27, 56, 122, 71, 84, 15, 96, 126, 4], as well as some more modern ones [7, 25, 33, 40, 44, 47, 53, 94, 110, 116], and augmented by a survey of the first-year mathematics modules on offer in a number of British and Irish uni- versities. The older textbooks have been a revelation. For example, Chrystal’s books [26, 27], now Edwardian antiques, are full of good sense and good mathematics. They can be read with profit today. The two volumes [27] are freely available online. Exercises. One of my undergraduatelecturers used to divide exercises into five-finger exercises and lollipops. I have done the same in this book. The exercises, of which there are about 250, are listed at the end of the section of the chapter to which they refer. If they are not marked with a star ( ), they are five-finger exercises and can be solved simply by reading the section. Those∗ marked with a star are not necessarily hard, but are also not merely routine applications of what you have read. They are there to make you think and to be enjoyable. For further practice in solving problems, the Schaum’s Outline Series of books are an excellent resource and cheap second- hand copies are easy to find. xi xii Preface Prerequisites. If the following topics are familiar then you probably have the back- ground needed to read this book: basic Euclidean and analytic geometry in two and three dimensions; the trigonometric, exponential and logarithm functions; the arith- metic of polynomials and the roots of the quadratic; experience in algebraic manipu- lation. Organization. The book is divided into two sections. Section I consists of Chapters 1to 4. Chapters 1 and 2 set the tone for the whole book and in particular attempt to • explain what proofs are and why they are important. Chapter 3 is a reference chapter of which only Section 3.1, Section 3.8 and the • first few pages of Section 3.4 need be read first. Everything else can be read when needed or when the fancy takes you. Chapter 4 is an essential prerequisite for reading Section II. It is partly revision • but mainly an introduction to properties that are met with time and again in studying algebra and are likely to be unfamiliar. Section II consists of Chapters 5 to 10. This is the mathematical core of the book and the chapters have been written to be read in order. Chapters 5, 6 and 7 are linked thematically by the remainder theorem and Euclid’s algorithm, whereas Chapters 8, 9 and 10 form an introduction to linear algebra. I have organized each chapter so that the more advanced material occurs towards the end. The three themes I had constantly in mind whilst writing these chapters were: 1. The solution of different kinds of algebraic equation. 2. The nature of the solutions. 3. The interplay between geometry and algebra. Wise words from antiquity. Mathematics is, and always has been, difficult. The commentator Proclus in the fifth century records a story about the mathematician Euclid. He was asked by Ptolomy, the ruler of Egypt, if there was not some easier way of learning mathematics than by reading Euclid’s big book on geometry, known as the Elements. Euclid’s reply was correct in every respect but did not contribute to the popularity of mathematicians. There was, he said, no royal road to geometry. In other words: no shortcuts, not even for god-kings. Despite that, I hope my book will make the road a little easier. Acknowledgements. I would like to thank my former colleagues in Wales, Tim Porter and Ronnie Brown, whose Mathematics in context module has influenced my thinking on presenting mathematics. The bibliography contains a list of every book or paper I read in connection with the writing of this one. Of these, I referred to Archbold [4] the most and regard it as an unsung classic. My own copy originally belonged to Ruth Coyte and was passed onto me by her family. This is my chance to Preface xiii thank them for all their kindnesses over the years. The book originated in a course I taught at Heriot-Watt University inherited from my colleagues Richard Szabo and Nick Gilbert. Although the text has been rethought and rewritten, some of the ex- ercises go back to them, and I have had numerous discussions over the years with both of them about what and how we should be teaching. Thanks are particularly due to Lyonell Boulton, Robin Knops and Phil Scott for reading selected chapters, and to Bernard Bainson, John Fountain, Jamie Gabbay, Victoria Gould, Des John- ston and Bruce MacDougall for individual comments. Sonya Gale advised on Greek. At CRC Press, thank you to Sunil Nair and Alexander Edwards for encouraging me to write the book, amongst other things, Amber Conley, Robin Loyd-Starkes, Katy E. Smith and an anonymous copy-editor for producing the book, and Shashi Kumar for technical support. I have benefited at Heriot-Watt University from the technical support of Iain McCrone and Steve Mowbray over many years with some fine-tuning by Dugald Duncan. The TeX-LaTeX Stack Exchange has been an invaluable source of good advice. The pictures were created using Till Tantau’s TikZ and Alain Matthes’ tkz-euclide which are warmly recommended.
Load more

Recommended publications
  • Phase Transition on the Toeplitz Algebra of the Affine Semigroup Over the Natural Numbers
    University of Wollongong Research Online Faculty of Engineering and Information Faculty of Informatics - Papers (Archive) Sciences 1-1-2010 Phase transition on the Toeplitz algebra of the affine semigroup over the natural numbers Marcelo Laca University of Newcastle, Australia Iain F. Raeburn University of Wollongong, [email protected] Follow this and additional works at: https://ro.uow.edu.au/infopapers Part of the Physical Sciences and Mathematics Commons Recommended Citation Laca, Marcelo and Raeburn, Iain F.: Phase transition on the Toeplitz algebra of the affine semigroup over the natural numbers 2010, 643-688. https://ro.uow.edu.au/infopapers/1749 Research Online is the open access institutional repository for the University of Wollongong. For further information contact the UOW Library: [email protected] Phase transition on the Toeplitz algebra of the affine semigroup over the natural numbers Abstract We show that the group of orientation-preserving affine ansformationstr of the rational numbers is quasi- lattice ordered by its subsemigroup N⋊N×. The associated Toeplitz C∗-algebra T(N⋊N×) is universal for isometric representations which are covariant in the sense of Nica. We give a presentation of T(N⋊N×) in terms of generators and relations, and use this to show that the C∗-algebra QN recently introduced by Cuntz is the boundary quotient of in the sense of Crisp and Laca. The Toeplitz algebra T(N⋊N×) carries a natural dynamics σ, which induces the one considered by Cuntz on the quotient QN, and our main result is the computation of the KMSβ (equilibrium) states of the dynamical system (T(N⋊N×),R,σ) for all values of the inverse temperature β.
    [Show full text]
  • Monoid Kernels and Profinite Topologies on the Free Abelian Group
    BULL. AUSTRAL. MATH. SOC. 20M35, 20E18, 20M07, 20K45 VOL. 60 (1999) [391-402] MONOID KERNELS AND PROFINITE TOPOLOGIES ON THE FREE ABELIAN GROUP BENJAMIN STEINBERG To each pseudovariety of Abelian groups residually containing the integers, there is naturally associated a profinite topology on any finite rank free Abelian group. We show in this paper that if the pseudovariety in question has a decidable membership problem, then one can effectively compute membership in the closure of a subgroup and, more generally, in the closure of a rational subset of such a free Abelian group. Several applications to monoid kernels and finite monoid theory are discussed. 1. INTRODUCTION In the early 1990's, the Rhodes' type II conjecture was positively answered by Ash [2] and independently by Ribes and Zalesskii [10]. The type II submonoid, or G-kernel, of a finite monoid is the set of all elements which relate to 1 under any relational morphism with a finite group. Equivalently, an element is of type II if 1 is in the closure of a certain rational language associated to that element in the profinite topology on a free group. The approach of Ribes and Zalesskii was based on calculating the profinite closure of a rational subset of a free group. They were also able to use this approach to calculate the Gp-kernel of a finite monoid. In both cases, it turns out the the closure of a rational subset of the free group in the appropriate profinite topology is again rational. See [7] for a survey of the type II theorem and its motivation.
    [Show full text]
  • (I) Eu ¿ 0 ; Received by the Editors November 23, 1992 And, in Revised Form, April 19, 1993
    proceedings of the american mathematical society Volume 123, Number 1, January 1995 TRIANGULAR UHF ALGEBRAS OVER ARBITRARYFIELDS R. L. BAKER (Communicated by Palle E. T. Jorgensen) Abstract. Let K be an arbitrary field. Let (qn) be a sequence of posi- tive integers, and let there be given a family \f¥nm\n > m} of unital K- monomorphisms *F„m. Tqm(K) —►Tq„(K) such that *¥np*¥pm= %im when- ever m < n , where Tq„(K) is the if-algebra of all q„ x q„ upper trian- gular matrices over K. A triangular UHF (TUHF) K-algebra is any K- algebra that is A'-isomorphic to an algebraic inductive limit of the form &~ = lim( Tq„(K) ; W„m). The first result of the paper is that if the embeddings ^Vnm satisfy certain natural dimensionality conditions and if £? = lim (TPn(K) ; Onm) is an arbitrary TUHF if-algebra, then 5? is A-isomorphic to ^ , only if the supernatural number, N[{pn)], of (q„) is less than or equal to the super- natural number, N[(p„)], of (pn). Thus, if the embeddings i>„m also satisfy the above dimensionality conditions, then S? is À"-isomorphic to F , only if NliPn)] = N[(qn)] ■ The second result of the paper is a nontrivial "triangular" version of the fact that if p, q are positive integers, then there exists a unital A"-monomorphism <P: Mq{K) —>MP(K), only if q\p . The first result of the paper depends directly on the second result. 1. Introduction Let K be a fixed but arbitrary field. In this paper we investigate a certain class of A.-algebras (i.e., algebras over K) called triangular UHF (TUHF) K- algebras.
    [Show full text]
  • Profinite Surface Groups and the Congruence Kernel Of
    Pro¯nite surface groups and the congruence kernel of arithmetic lattices in SL2(R) P. A. Zalesskii* Abstract Let X be a proper, nonsingular, connected algebraic curve of genus g over the ¯eld C of complex numbers. The algebraic fundamental group ¡ = ¼1(X) in the sense of SGA-1 [1971] is the pro¯nite completion of top the fundamental group ¼1 (X) of a compact oriented 2-manifold. We prove that every projective normal (respectively, caracteristic, accessible) subgroup of ¡ is isomorphic to a normal (respectively, caracteristic, accessible) subgroup of a free pro¯nite group. We use this description to give a complete solution of the congruence subgroup problem for aritmetic lattices in SL2(R). Introduction Let X be a proper, nonsingular, connected algebraic curve of genus g over the ¯eld C of complex numbers. As a topological space X is a compact oriented 2-manifold and is simply a sphere with g handles top added. The group ¦ = ¼1 (X) is called a surface group and has 2g generators ai; bi (i = 1; : : : ; g) subject to one relation [a1; b1][a2; b2] ¢ ¢ ¢ [ag; bg] = 1. The subgroup structure of ¦ is well known. Namely, if H is a subgroup of ¦ of ¯nite index n, then H is again a surface group of genus n(g ¡ 1) + 1. If n is in¯nite, then H is free. The algebraic fundamental group ¡ = ¼1(X) in the sense of SGA-1 [1971] is the pro¯nite completion top of the fundamental group ¼1 (X) in the topological sense (see Exp. 10, p. 272 in [SGA-1]).
    [Show full text]
  • One Dimensional Groups Definable in the P-Adic Numbers
    One dimensional groups definable in the p-adic numbers Juan Pablo Acosta L´opez November 27, 2018 Abstract A complete list of one dimensional groups definable in the p-adic num- bers is given, up to a finite index subgroup and a quotient by a finite subgroup. 1 Introduction The main result of the following is Proposition 8.1. There we give a complete list of all one dimensional groups definable in the p-adics, up to finite index and quotient by finite kernel. This is similar to the list of all groups definable in a real closed field which are connected and one dimensional obtained in [7]. The starting point is the following result. Proposition 1.1. Suppose T is a complete first order theory in a language extending the language of rings, such that T extends the theory of fields. Suppose T is algebraically bounded and dependent. Let G be a definable group. If G arXiv:1811.09854v1 [math.LO] 24 Nov 2018 is definably amenable then there is an algebraic group H and a type-definable subgroup T G of bounded index and a type-definable group morphism T H with finite kernel.⊂ → This is found in Theorem 2.19 of [8]. We just note that algebraic boundedness is seen in greater generality than needed in [5], and it can also be extracted from the proofs in cell decomposition [4]. That one dimensional groups are definably amenable comes from the following result. 1 Proposition 1.2. Suppose G is a definable group in Qp which is one dimen- sional.
    [Show full text]
  • MATHEMATICS Algebra, Geometry, Combinatorics
    MATHEMATICS Algebra, geometry, combinatorics Dr Mark V Lawson November 17, 2014 ii Contents Preface v Introduction vii 1 The nature of mathematics 1 1.1 The scope of mathematics . .1 1.2 Pure versus applied mathematics . .3 1.3 The antiquity of mathematics . .4 1.4 The modernity of mathematics . .6 1.5 The legacy of the Greeks . .8 1.6 The legacy of the Romans . .8 1.7 What they didn't tell you in school . .9 1.8 Further reading and links . 10 2 Proofs 13 2.1 How do we know what we think is true is true? . 14 2.2 Three fundamental assumptions of logic . 16 2.3 Examples of proofs . 17 2.3.1 Proof 1 . 17 2.3.2 Proof 2 . 20 2.3.3 Proof 3 . 22 2.3.4 Proof 4 . 23 2.3.5 Proof 5 . 25 2.4 Axioms . 31 2.5 Mathematics and the real world . 35 2.6 Proving something false . 35 2.7 Key points . 36 2.8 Mathematical creativity . 37 i ii CONTENTS 2.9 Set theory: the language of mathematics . 37 2.10 Proof by induction . 46 3 High-school algebra revisited 51 3.1 The rules of the game . 51 3.1.1 The axioms . 51 3.1.2 Indices . 57 3.1.3 Sigma notation . 60 3.1.4 Infinite sums . 62 3.2 Solving quadratic equations . 64 3.3 *Order . 70 3.4 *The real numbers . 71 4 Number theory 75 4.1 The remainder theorem . 75 4.2 Greatest common divisors .
    [Show full text]
  • Valuations, Orderings, and Milnor K-Theory Mathematical Surveys and Monographs
    http://dx.doi.org/10.1090/surv/124 Valuations, Orderings, and Milnor K-Theory Mathematical Surveys and Monographs Volume 124 Valuations, Orderings, and Milnor K-Theory Ido Efrat American Mathematical Society EDITORIAL COMMITTEE Jerry L. Bona Peter S. Landweber Michael G. Eastwood Michael P. Loss J. T. Stafford, Chair 2000 Mathematics Subject Classification. Primary 12J10, 12J15; Secondary 12E30, 12J20, 19F99. For additional information and updates on this book, visit www.ams.org/bookpages/surv-124 Library of Congress Cataloging-in-Publication Data Efrat, Ido, 1963- Valuations, orderings, and Milnor if-theory / Ido Efrat. p. cm. — (Mathematical surveys and monographs, ISSN 0076-5376 ; v. 124) Includes bibliographical references and index. ISBN 0-8218-4041-X (alk. paper) 1. Valuation theory. 2. Ordered fields. 3. X-theory I. Title. II. Mathematical surveys and monographs ; no. 124. QA247.E3835 2006 515/.78-dc22 2005057091 Copying and reprinting. Individual readers of this publication, and nonprofit libraries acting for them, are permitted to make fair use of the material, such as to copy a chapter for use in teaching or research. Permission is granted to quote brief passages from this publication in reviews, provided the customary acknowledgment of the source is given. Republication, systematic copying, or multiple reproduction of any material in this publication is permitted only under license from the American Mathematical Society. Requests for such permission should be addressed to the Acquisitions Department, American Mathematical Society, 201 Charles Street, Providence, Rhode Island 02904-2294, USA. Requests can also be made by e-mail to [email protected]. © 2006 by the American Mathematical Society.
    [Show full text]
  • P-Adic L-Functions and Modular Forms
    p-adic L-functions and modular forms Alexei PANCHISHKIN Institut Fourier, Université Grenoble-1 B.P.74, 38402 St.Martin d'Hères, FRANCE Lectures for the International Summer School and Conference p-adic Analysis and its Applications August 31th to September 18th, 2009 (Trieste - ITALY) September, 2009 Alexei PANCHISHKIN (Grenoble) p-adic L-functions and modular forms ICTP, September,2009 1 / 1 Abstract 1) Congruences and p-adic numbers. Hensel's lemma. The Tate eld 2) Continuous and p-adic analytic functions. Mahler's criterion. Newton polygons Zeroes of analytic functions. The Weierstrass preparation theorem and its generalizations. 3) Distributions, measures, and the abstract Kummer congruences. The Kubota and Leopoldt p-adic L-functions and the Iwasawa algebra 4) Modular forms and L-functions. Congruences and families of modular forms. 5) Method of canonical projection of modular distributions. Examples of construction of p-adic L-functions Alexei PANCHISHKIN (Grenoble) p-adic L-functions and modular forms ICTP, September,2009 2 / 1 Related topics (for discussions, not included in the text of these materials) 6) Other approaches of constructing p-adic L-functions by Mazur-Tate-Teitelbaum, J.Coates, P.Colmez, H.Hida ... (using modular symbols by Manin-Mazur and their generalizations; Euler systems, work of D.Delbourgo, T.Ochiai, L.Berger, ..., overconvergent modular symbols by R.Pollack, G.Stevens, H.Darmon, ...) 7) Relations to the Iwasawa Theory 8) Applications of p-adic L-functions to Diophantine geometry 9) Open questions and problems in the theory of p-adic L-functions (Basic sources: Coates 60th Birthday Volume, Bourbaki talks by P.Colmez, J.Coates ...) Alexei PANCHISHKIN (Grenoble) p-adic L-functions and modular forms ICTP, September,2009 3 / 1 Lecture N◦1.
    [Show full text]
  • A Finiteness Theorem for Odd Perfect Numbers
    A finiteness theorem for odd perfect numbers Paul Pollack University of Georgia June 23, 2020 1 of 23 Ex: 5 is deficient (s(5) = 1), 12 is abundant (s(12) = 16), and 6 is perfect (s(6) = 6). Three kinds of natural numbers Among simple even numbers, some are superabundant, others are deficient: these two classes are as two extremes opposed one to the other; as for those that occupy the middle point between the two, they are said to be perfect. { Nicomachus (ca. 100 AD), Introductio Arithmetica P Let s(n) = djn;d<n d be the sum of the proper divisors of n. Abundant: s(n) > n. Deficient: s(n) < n. Perfect: s(n) = n. 2 of 23 Three kinds of natural numbers Among simple even numbers, some are superabundant, others are deficient: these two classes are as two extremes opposed one to the other; as for those that occupy the middle point between the two, they are said to be perfect. { Nicomachus (ca. 100 AD), Introductio Arithmetica P Let s(n) = djn;d<n d be the sum of the proper divisors of n. Abundant: s(n) > n. Deficient: s(n) < n. Perfect: s(n) = n. Ex: 5 is deficient (s(5) = 1), 12 is abundant (s(12) = 16), and 6 is perfect (s(6) = 6). 2 of 23 . In the case of those that are found between the too much and the too little, that is in equality, is produced virtue, just measure, propriety, beauty and things of that sort | of which the most exemplary form is that type of number which is called perfect.
    [Show full text]
  • ON CERTAIN P-ADIC BANACH LIMITS of P-ADIC TRIANGULAR MATRIX ALGEBRAS
    International Journal of Pure and Applied Mathematics Volume 85 No. 3 2013, 435-455 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu AP doi: http://dx.doi.org/10.12732/ijpam.v85i3.1 ijpam.eu ON CERTAIN p-ADIC BANACH LIMITS OF p-ADIC TRIANGULAR MATRIX ALGEBRAS R.L. Baker University of Iowa Iowa City, Iowa 52242, USA Abstract: In this paper we investigate the class of p-adic triangular UHF (TUHF) Banach algebras.A p-adic TUHF Banach algebra is any unital p-adic Banach algebra of the form = n, where ( n) is an increasing sequence T T T T of p-adic Banach subalgebras of such that each n contains the identity of T S T T and is isomorphic as an Ωp-algebra to Tpn (Ωp) for some pn, where Tpn (Ωp) is the algebra of upper triangular pn pn matrices over the p-adic field Ωp. The main × result is that the supernatural number associated to a p-adic TUHF Banach algebra is an invariant of the algebra, provided that the algebra satisfies certain local dimensionality conditions. AMS Subject Classification: 12J25, 12J99, 46L99, 46S10 Key Words: p-adic Banach algebras, p-adic Banach limits, p-adic UHF algebras, p-adic Triangular UHF algebras 1. Introduction In the article, Triangular UHF algebras [2], the author of the present paper introduced a very concrete class of non-selfadjoint operator algebras which are currently called standard triangular UHF operator algebras. Briefly: a standard triangular UHF (TUHF) operator algebra is any unital Banach algebra that is isometrically isomorphic to a Banach algebra inductive limit of the form = T lim(Tp ; σp p ).
    [Show full text]
  • MATHEMATICS Algebra, Geometry, Combinatorics
    MATHEMATICS Algebra, geometry, combinatorics Dr Mark V Lawson October 24, 2014 ii Contents 1 The nature of mathematics 1 1.1 What are algebra, geometry and combinatorics? . .1 1.1.1 Algebra . .1 1.1.2 Geometry . .5 1.1.3 Combinatorics . .7 1.2 The scope of mathematics . .8 1.3 Pure versus applied mathematics . .9 1.4 The antiquity of mathematics . 11 1.5 The modernity of mathematics . 12 1.6 The legacy of the Greeks . 14 1.7 The legacy of the Romans . 15 1.8 What they didn't tell you in school . 15 1.9 Further reading and links . 16 2 Proofs 19 2.1 How do we know what we think is true is true? . 20 2.2 Three fundamental assumptions of logic . 22 2.3 Examples of proofs . 23 2.3.1 Proof 1 . 23 2.3.2 Proof 2 . 26 2.3.3 Proof 3 . 28 2.3.4 Proof 4 . 29 2.3.5 Proof 5 . 31 2.4 Axioms . 37 2.5 Mathematics and the real world . 41 2.6 Proving something false . 41 2.7 Key points . 42 2.8 Mathematical creativity . 43 i ii CONTENTS 2.9 Set theory: the language of mathematics . 43 2.10 Proof by induction . 52 3 High-school algebra revisited 57 3.1 The rules of the game . 57 3.1.1 The axioms . 57 3.1.2 Indices . 63 3.1.3 Sigma notation . 66 3.1.4 Infinite sums . 68 3.2 Solving quadratic equations . 70 3.3 Order . 76 3.4 The real numbers .
    [Show full text]
  • Relative Abelian Kernels of Some Classes of Transformation Monoids
    BULL. AUSTRAL. MATH. SOC. 20M05, 20M20, 20K45, 20MO7 VOL. 73 (2006) [375-404] RELATIVE ABELIAN KERNELS OF SOME CLASSES OF TRANSFORMATION MONOIDS E. CORDEIRO, M. DELGADO AND V.H. FERNANDES We consider the symmetric inverse monoid Zn of an n-element chain and its in- verse submonoids VOIn, VOVIn, VOVln and VO1Hn of all order-preserving, order-preserving or order-reversing, orientation-preserving and orientation-preserving or orientation-reversing transformations, respectively, and give descriptions of their Abelian kernels relative to decidable pseudovarieties of Abelian groups. INTRODUCTION The computability of kernels of finite monoids became a popular problem in Finite Semigroup Theory after a paper of Rhodes and Tilson [23]. Independent solutions were given by Ash [3] and Ribes and Zalesskii [24]. Both solutions contains deep results which led to the development of the theory in various directions. See for instance [19, 2]. Com- puting kernels relative to other pseudovarieties had then interested various researchers; for examples, see Ribes and Zalesskii [25], the second author [5] or Steinberg [26]. As computing kernels are directly connected with the Mal'cev product of pseudovarieties of monoids where the second factor is a pseudovariety of groups (see [18]), decidability results can be obtained in this way. The interest of the second author in using in practice the algorithm to compute the Abelian kernel of a finite monoid obtained in [5] led him to work towards a concrete implementation. Having this idea in mind, by detailing some aspects and improving the efficiency of that algorithm (see [6]) a concrete implementation in GAP [27] was then produced.
    [Show full text]