DOCSLIB.ORG

The Mathematical Landscape a Guided Tour

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
The Mathematical Landscape a Guided Tour Claremont Colleges Scholarship @ Claremont CMC Senior Theses CMC Student Scholarship 2011 The aM thematical Landscape Antonio Collazo Claremont McKenna College Recommended Citation Collazo, Antonio, "The aM thematical Landscape" (2011). CMC Senior Theses. Paper 116. http://scholarship.claremont.edu/cmc_theses/116 This Open Access Senior Thesis is brought to you by Scholarship@Claremont. It has been accepted for inclusion in this collection by an authorized administrator. For more information, please contact [email protected]. Claremont McKenna College The Mathematical Landscape A guided tour Submitted To Professor Asuman G. Aksoy and Dean Gregory Hess By Antonio Collazo For Senior Thesis Spring 2011 April 25, 2011 Abstract The intent of this paper is to present the reader will enough information to spark a curiosity in to the subject. By no means, is the following a complete formulation of any of the topics covered. I want to give the reader a tour of the mathematical landscape, hoping maybe to see them again. There is plenty of further details to explore in each section, I have just touched the tip the iceberg. The work is basically in four sections: Numbers, Geometry, Functions, Sets and Logic, which are the basic building block of Math. The first sections are a exposition into the mathematical objects and their algebras. The last section dives into the foundation of math, sets and logic, and develops the \language" of Math. My hope is that after this, the read will have the necessarily (maybe not sufficient) information needed to talk the language of Math. Antonio Collazo What is Mathematics? Take a random sample from our population, and ask them \What is Mathematics?" Their answer, most likely, is that Mathematics is about numbers; some will add that Mathematics is the study of numbers and their arithmetic. This view of math has been held, incorrectly, by society for almost 2500 years; dating back to the Greeks. However, to fully appreciate the beauty and the power of Math, one must dismiss this view as a definition of math. A clever joke goes: \What is Mathematics? Well, mathematics is what a Mathematician does?" This is clearly does no better in a our search for a definition for math, it just moves the burden from defining Math to defining what a mathematician does; equally as formidable. So then, what is a useful definition of math? I propose that Mathematics is the study of Structures and their Relationships. But, this definition again moves the burden from defining Math, to defining two things: Structures and Relationships. The rest of the section will discuss definitions for these two terms; from which the section's title can be answered. Also, I hope I can convince the reader that this definition does encompass the true essence of math, in a way that the \old definition" could not. For instance, if Math is \numbers", then where does geometry settle in? The \old" definition plainly states that geometry is not Mathematics, for it's is not the study of numbers; yet, this is unsatisfying situation. If geometry isn't a Math, then what? However, by way of the proposed definition: Geometry is the study of the structure of Shapes: triangles, squares, polygons, etc, and their relationships: congruent, similarity, length, area, etc. More specifically, Geometry, as defined by the Erlanger Program, is the study of shapes, and the invariant properties under a group of transformations. Either way, there is a clear notion of the structure and of the relationships being studied, thus geometry is a math. The true power of Math is that all one needs to do Math is some thinking, maybe a pencil and paper. Although most mathematicians, will argue no math worth doing is done without a pencil. To which I do not argue, insofar as convergent thinking practice is a necessary component to creative thinking. However, the ability to endure a race through the landscapes of your mind, is a powerful and necessary tool for math. This is the other component of creativity: divergent thinking. As an exercise of such thinking, lets construct an abstract notion of numbers. 2 The Mathematical Landscape Antonio Collazo Natural Numbers, N What is the common pattern in this collection of objects: three sheep, three cows, three dogs? Although there are several answers to the question, as in a collection of four-legged animals (mammals) or animals found on farm, all have in common the number three. The recognition of this pattern is the creation of an abstract concept of a number. Three is property that each element in the collection satisfies. However, the collection: three ties and three shirts, also has the common pattern of three; yet, none of the elements in the collection are the same in anyway. This abstract notion of a number devoid of anything else but the pattern mentioned above. We find some other patterns that hold for this abstract notion of a number. For instance, if we take three cows and then get two more cows, we will have five cows. The same holds true for dogs or sheeps instead of cows, and so suppose that this pattern is a pattern of Numbers. When we take a number then add another number the result is also a number. This is called closure, written x + y 2 N 8x; y 2 N. The property of associativity can also be inferred by similar reasoning. Given three numbers, it does not matter if I add the first two and then add the third, or if I add the last two and then the first. Much more precisely stated, (a + b) + c = a + (b + c). Effectively this property states that there is no ambiguity in writing a + b + c, since it does not matter which addition is done first. One also can test that a + b = a + b, which the Commutativity law. Consider a bag of marbles and some containers, the above mentioned properties can easily be verified. Suppose, one marble represents the number one. The addition 3 + 4 can be visualized by putting three marbles in a container, then putting four marbles in the same container. The resulting number of marbles in the container is the answer to the calculation. The commutativity law is easily verified, putting three then four is the same as putting four then three marbles into the container. Associativity is also easily checked, (2 + 4) + 7 = 2 + (4 + 7) represents putting two then four marbles in one container, then putting seven marbles into that container. Which is the same as putting four then seven marbles into a container, then putting two more marbles in. There is an equally as appealing representation of multiplication using the bags of marbles and containers. If there are three cups, each with four marbles, then how many marbles are there? Twelve, but how did I calculate that? I could pour all the marbles 3 Antonio Collazo in one cup, and then count them one-by-one; however we could define a new operation: multiplication to be answer to this question. 3 × 4 = 12. Using the same ideas as with addition, we want to consider if this new operation has the properties of closure, associativity, and commutativity. Each can be verified by similar means, for instance commutativity: there are the same amount of marbles if there are two containers each with five marbles, and if there are five containers each with two marbles. The next logical question is how do addition and multiplication relate? Symbolically, what is 2 × (4 + 6)? Pictorially, how many marbles are there if I double the amount of marbles in a container with four marbles and a container with six marbles? Notice, this question is not incalculable, even without a formal law of how multiplication and addition interact. 4+6 = 10 and then 2∗10 = 20. Yet, there is value in recognizing the pattern of the Distributive Law a×(b+c) = a×b+a×c. Note that 2×4+6 = 8+6 = 14 6= 2×(4+6) = 20, the parenthesis are important in defining the order of operations. Collecting terms, we have inferred that Numbers obey the above mentioned properties, at least in every case we've tried. There is no guarantee, however intuitive it seems, that under the evidence presented the numbers must obey these properties. Here is the first rather disappointing/unsatisfying step, although we will find this dissatisfaction can never truly be overcome. We assume that Numbers must obey these properties. Any system must have some terms and relationships that must be assumed rather deduced; if not, the resulting is circular logic. i.e.: All men are male. All males are men. (Although one could argue the need a certain maturity factored needed to socially be a \man"). A more sufficient treatment of why this is so will be handled later. The main point is that any system must start with some rules that must be assumed to be true; and consequently, the system developed from these assumed rules is dependent on the validity of these rules to be valid. I.e.: if one of the assumed axioms is invalid, then so is the developed system and if all of the assumed axioms are valid then so is the developed system. In this light, the dissatisfaction in just plainly assuming these properties subsides, insofar as the validity of theses assumed rules is plainly obvious. In the case of the above mentioned properties, the assumed axioms are sufficiently self-evident that one can rest assured that any system developed from the properties will have some valid value. To be more specific the \numbers" just described are the Natural Numbers, denoted N.
Load more

Recommended publications
  • Simple Laws About Nonprominent Properties of Binary Relations
    Simple Laws about Nonprominent Properties of Binary Relations Jochen Burghardt jochen.burghardt alumni.tu-berlin.de Nov 2018 Abstract We checked each binary relation on a 5-element set for a given set of properties, including usual ones like asymmetry and less known ones like Euclideanness. Using a poor man's Quine-McCluskey algorithm, we computed prime implicants of non-occurring property combinations, like \not irreflexive, but asymmetric". We considered the laws obtained this way, and manually proved them true for binary relations on arbitrary sets, thus contributing to the encyclopedic knowledge about less known properties. Keywords: Binary relation; Quine-McCluskey algorithm; Hypotheses generation arXiv:1806.05036v2 [math.LO] 20 Nov 2018 Contents 1 Introduction 4 2 Definitions 8 3 Reported law suggestions 10 4 Formal proofs of property laws 21 4.1 Co-reflexivity . 21 4.2 Reflexivity . 23 4.3 Irreflexivity . 24 4.4 Asymmetry . 24 4.5 Symmetry . 25 4.6 Quasi-transitivity . 26 4.7 Anti-transitivity . 28 4.8 Incomparability-transitivity . 28 4.9 Euclideanness . 33 4.10 Density . 38 4.11 Connex and semi-connex relations . 39 4.12 Seriality . 40 4.13 Uniqueness . 42 4.14 Semi-order property 1 . 43 4.15 Semi-order property 2 . 45 5 Examples 48 6 Implementation issues 62 6.1 Improved relation enumeration . 62 6.2 Quine-McCluskey implementation . 64 6.3 On finding \nice" laws . 66 7 References 69 List of Figures 1 Source code for transitivity check . .5 2 Source code to search for right Euclidean non-transitive relations . .5 3 Timing vs. universe cardinality .
    [Show full text]
  • Simple Laws About Nonprominent Properties of Binary Relations Jochen Burghardt
    Simple Laws about Nonprominent Properties of Binary Relations Jochen Burghardt To cite this version: Jochen Burghardt. Simple Laws about Nonprominent Properties of Binary Relations. 2018. hal- 02948115 HAL Id: hal-02948115 https://hal.archives-ouvertes.fr/hal-02948115 Preprint submitted on 24 Sep 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. Simple Laws about Nonprominent Properties of Binary Relations Jochen Burghardt jochen.burghardt alumni.tu-berlin.de Nov 2018 Abstract We checked each binary relation on a 5-element set for a given set of properties, including usual ones like asymmetry and less known ones like Euclideanness. Using a poor man's Quine-McCluskey algorithm, we computed prime implicants of non-occurring property combinations, like \not irreflexive, but asymmetric". We considered the laws obtained this way, and manually proved them true for binary relations on arbitrary sets, thus contributing to the encyclopedic knowledge about less known properties. Keywords: Binary relation; Quine-McCluskey algorithm; Hypotheses generation Contents 1 Introduction 4 2 Definitions 8 3 Reported law suggestions 10 4 Formal proofs of property laws 21 4.1 Co-reflexivity . 21 4.2 Reflexivity . 23 4.3 Irreflexivity .
    [Show full text]
  • UC Berkeley UC Berkeley Electronic Theses and Dissertations
    UC Berkeley UC Berkeley Electronic Theses and Dissertations Title Propositional Quantification and Comparison in Modal Logic Permalink https://escholarship.org/uc/item/78w732g8 Author DING, YIFENG Publication Date 2021 Peer reviewed|Thesis/dissertation eScholarship.org Powered by the California Digital Library University of California Propositional Quantification and Comparison in Modal Logic by Yifeng Ding A dissertation submitted in partial satisfaction of the requirements for the degree of Doctor of Philosophy in Logic and the Methodology of Science in the Graduate Division of the University of California, Berkeley Committee in charge: Associate Professor Wesley H. Holliday, Chair Professor Shamik Dasgupta Professor Paolo Mancosu Professor Dana S. Scott Professor Seth Yalcin Spring 2021 Propositional Quantification and Comparison in Modal Logic Copyright 2021 by Yifeng Ding 1 Abstract Propositional Quantification and Comparison in Modal Logic by Yifeng Ding Doctor of Philosophy in Logic and the Methodology of Science University of California, Berkeley Associate Professor Wesley H. Holliday, Chair We make the following contributions to modal logics with propositional quantifiers and modal logics with comparative operators in this dissertation: • We define a general notion of normal modal logics with propositional quantifiers. We call them normal Π-logics. Then, as was done by Scrogg's theorem on extensions of the modal logic S5, we study in general the normal Π-logics extending S5. We show that they are all complete with respect to their algebraic semantics based on complete simple monadic algebras. We also show that the lattice formed by these logics is isomorphic to the lattice of the open sets of the disjoint union of two copies of the one-point compactification of N with the natural order topology.
    [Show full text]
  • Solutions 1. Prove That a Binary Relation R Is Transitive Iff R R ⊆ R
    Pencil and Paper Exercises Week 2 — Solutions 1. Prove that a binary relation R is transitive iff R ◦ R ⊆ R. Answer: ⇒: Assume R is a transitive binary relation on A. To be proved: R ◦ R ⊆ R. Proof. Let (x, y) ∈ R ◦ R. We must show that (x, y) ∈ R. From the definition of ◦: ∃z ∈ A :(x, z) ∈ R, (z, y) ∈ R. It follows from this and transitivity of R that (x, y) ∈ R. ⇐: Assume R ◦ R ⊆ R. To be proved: R is transitive. Proof. Let (x, y) ∈ R, (y, z) ∈ R. Then (x, z) ∈ R ◦ R. Since R ◦ R ⊆ R, it follows from this that (x, z) ∈ R. Thus, R is transitive. 2. Give an example of a transitive binary relation R with the property that R◦R 6= R. Answer: The simplest example is a relation consisting of a single pair, say R = {(1, 2)}. This relation is transitive, but R ◦ R = ∅ 6= R. 3. Let R be a binary relation on a set A. Prove that R∪{(x, x) | x ∈ A} is the reflexive closure of R. Answer: Let I = {(x, x) | x ∈ A}. It is clear that R ∪ I is reflexive, and that R ⊆ R ∪ I. To show that R ∪ I is the smallest relation with these two properties, suppose S is reflexive and R ⊆ S. Then by reflexivity of S, I ⊆ S. It follows that R ∪ I ⊆ S. 4. Prove that R ∪ Rˇ is the symmetric closure of R. Answer: Clearly, R ∪ Rˇ is symmetric, and R ⊆ R ∪ Rˇ. Let S be any symmetric relation that includes R.
    [Show full text]
  • You May Not Start to Read the Questions Printed on the Subsequent Pages of This Question Paper Until Instructed That You May Do So by the Invigilator – 2 – PHT0/3
    PHT0/3 PHILOSOPHY TRIPOS Part IA Tuesday 25 May 2004 9 to 12 Paper 3 LOGIC Answer four questions only; at least one from each section. Write the number of the question at the beginning of each answer. Please answer all parts of each numbered question chosen. You may not start to read the questions printed on the subsequent pages of this question paper until instructed that you may do so by the Invigilator – 2 – PHT0/3 SECTION A 1 (a) Explain what is meant by: (i) a symmetric relation (ii) a transitive relation (iii) a reflexive relation (iv) an equivalence relation. (b) Let us say that a relation R is 'Euclidean' iff, for any x and y and z, if Rxy and Rxz then Ryz. (i) Give an example of a Euclidean relation that is neither symmetric nor reflexive. (ii) Show (by an informal argument or otherwise) that any transitive symmetric relation is Euclidean. (iii) Show (by an informal argument or otherwise) that any reflexive Euclidean relation is an equivalence relation. 2 Translate the following sentences into QL= (the language of the predicate calculus with identity), explaining the translation scheme you use. (a) All athletes love Jacques. (b) Some athletes who are philosophers are not logicians. (c) Only an athlete loves a logician. (d) Jacques, the well-known athlete, is not a logician. (e) Whomever Kurt loves admires some logician. (f) All philosophers love Kurt, but some of them also love Jacques. (g) No logician loves everyone loved by Kurt. (h) Only if Kurt is a logician is every student who is a philosopher a logician too.
    [Show full text]
  • Evidence of Evidence in Epistemic Logic
    1 Evidence of Evidence in Epistemic Logic [draft of 24 August 2017; final version to appear in Mattias Skipper Rasmussen and Asbjørn Steglich-Petersen (eds.), Higher-Order Evidence: New Essays, Oxford: Oxford University Press] Timothy Williamson The slogan ‘Evidence of evidence is evidence’ may sound plausible, but what it means is far from clear. It has often been applied to connect evidence in the current situation to evidence in another situation. The relevant link between situations may be diachronic (White 2006: 538): is present evidence of past or future evidence of something present evidence of that thing? Alternatively, the link may be interpersonal (Feldman 2007: 208): is evidence for me of evidence for you of something evidence for me of that thing? Such inter- perspectival links have been discussed because they can destabilize inter-perspectival disagreements. In their own right they have become the topic of a lively recent debate (Fitelson 2012, Feldman 2014, Roche 2014, Tal and Comesaña 2014). This chapter concerns putative intra-perspectival evidential links. Roughly, is present evidence for me of present evidence for me of something present evidence for me of that thing? Unless such a connection holds between a perspective and itself, it is unlikely to hold generally between distinct perspectives. Formally, the single-perspective case is also much simpler to study. Moreover, it concerns issues about the relation between first-order and higher-order evidence, the topic of this volume. The formulations in this chapter have not been tailored for optimal fit with previous discussions. Rather, they are selected because they make an appropriate starting-point, simple, significant, and not too ad hoc.
    [Show full text]
  • Propositional Quantification and Comparison in Modal Logic By
    Propositional Quantification and Comparison in Modal Logic by Yifeng Ding A dissertation submitted in partial satisfaction of the requirements for the degree of Doctor of Philosophy in Logic and the Methodology of Science in the Graduate Division of the University of California, Berkeley Committee in charge: Associate Professor Wesley H. Holliday, Chair Professor Shamik Dasgupta Professor Paolo Mancosu Professor Dana S. Scott Professor Seth Yalcin Spring 2021 Propositional Quantification and Comparison in Modal Logic Copyright 2021 by Yifeng Ding 1 Abstract Propositional Quantification and Comparison in Modal Logic by Yifeng Ding Doctor of Philosophy in Logic and the Methodology of Science University of California, Berkeley Associate Professor Wesley H. Holliday, Chair We make the following contributions to modal logics with propositional quantifiers and modal logics with comparative operators in this dissertation: • We define a general notion of normal modal logics with propositional quantifiers. We call them normal Π-logics. Then, as was done by Scrogg's theorem on extensions of the modal logic S5, we study in general the normal Π-logics extending S5. We show that they are all complete with respect to their algebraic semantics based on complete simple monadic algebras. We also show that the lattice formed by these logics is isomorphic to the lattice of the open sets of the disjoint union of two copies of the one-point compactification of N with the natural order topology. Further, we show how to determine the computability of normal Π-logics extending S5Π. A corollary is that they can be of arbitrarily high Turing-degree. • Regarding the normal Π-logics extending the modal logic KD45, we identify two im- 8 portant axioms: Immod : 8p(p ! p) and 4 : 8p' ! 8p'.
    [Show full text]
  • Typology of Axioms for a Weighted Modal Logic Bénédicte Legastelois, Marie-Jeanne Lesot, Adrien Revault D’Allonnes
    Typology of Axioms for a Weighted Modal Logic Bénédicte Legastelois, Marie-Jeanne Lesot, Adrien Revault d’Allonnes To cite this version: Bénédicte Legastelois, Marie-Jeanne Lesot, Adrien Revault d’Allonnes. Typology of Axioms for a Weighted Modal Logic. International Journal of Approximate Reasoning, Elsevier, 2017, 90, pp.341- 358. 10.1016/j.ijar.2017.06.011. hal-01558038 HAL Id: hal-01558038 https://hal.sorbonne-universite.fr/hal-01558038 Submitted on 29 Sep 2017 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. Typology of axioms for a weighted modal logic ∗ a, a b Bénédicte Legastelois , Marie-Jeanne Lesot , Adrien Revault d’Allonnes a Sorbonne Universités, UPMC Univ. Paris 06, CNRS, LIP6 UMR 7606, 4 place Jussieu 75005 Paris, France b Université Paris 8 – EA 4383 – LIASD, FR-93526, Saint-Denis, France a b s t r a c t This paper introduces and studies extensions of modal logics by investigating the soundness of classical modal axioms in a weighted framework. It discusses the notion of relevant weight values, in a specific weighted Kripke semantics and exploits accessibility relation properties. Different generalisations of the classical axioms are constructed and, from these, a typology of weighted axioms is built, distinguishing between four types, Keywords: depending on their relations to their classical counterparts and to the, possibly equivalent, Modal logics frame conditions.
    [Show full text]
  • Introducing Euclidean Relations to Mizar
    Proceedings of the Federated Conference on DOI: 10.15439/2017F368 Computer Science and Information Systems pp. 245–248 ISSN 2300-5963 ACSIS, Vol. 11 Introducing Euclidean Relations to Mizar Adam Naumowicz, Artur Korniłowicz Institute of Informatics, University of Białystok ul. Ciołkowskiego 1 M, 15-245 Białystok, Poland Email: {adamn, arturk}@math.uwb.edu.pl Abstract—In this paper we present the methodology of imple- property has been analyzed and implemented most recently menting a new enhancement of the Mizar proof checker based on [15]. enabling special processing of Euclidean predicates, i.e. binary Table I presents how many registrations of predicate prop- predicates which fulfill a specific variant of transitivity postulated by Euclid. Typically, every proof step in formal mathematical erties are used in the MML. The data has been collected reasoning is associated with a formula to be proved and a list with Mizar Version 8.1.05 working with the MML Version of references used to justify the formula. With the proposed 5.37.1275.2 enhancement, the Euclidean property of given relations can be Property Occurrences Articles registered during their definition, and so the verification of some reflexivity 138 91 proof steps related to these relations can be automated to avoid irreflexivity 11 10 explicit referencing. symmetry 122 82 asymmetry 6 6 I. INTRODUCTION connectedness 4 4 total 281 119 HE Mizar system [1], [2], [3] is a computer proof- Table I T assistant system used for encoding formal mathematical PREDICATE PROPERTIES OCCURRENCES data
    [Show full text]