Appendix A. Jargon. A.1 Strange technical terms

Similar documents
One-to-one functions and onto functions

Sets and Functions. (As we will see, in describing a set the order in which elements are listed is irrelevant).

Math 31 Lesson Plan. Day 2: Sets; Binary Operations. Elizabeth Gillaspy. September 23, 2011

/633 Introduction to Algorithms Lecturer: Michael Dinitz Topic: Matroids and Greedy Algorithms Date: 10/31/16

Proof Techniques (Review of Math 271)

Math 3361-Modern Algebra Lecture 08 9/26/ Cardinality

Writing proofs for MATH 51H Section 2: Set theory, proofs of existential statements, proofs of uniqueness statements, proof by cases

At the start of the term, we saw the following formula for computing the sum of the first n integers:

Writing proofs for MATH 61CM, 61DM Week 1: basic logic, proof by contradiction, proof by induction

Functions and one-to-one

CS 360, Winter Morphology of Proof: An introduction to rigorous proof techniques

Chapter 3. Cartesian Products and Relations. 3.1 Cartesian Products

Basics of Proofs. 1 The Basics. 2 Proof Strategies. 2.1 Understand What s Going On

Chapter 6. Relations. 6.1 Relations

Math 13, Spring 2013, Lecture B: Midterm

Section 3.1: Direct Proof and Counterexample 1

Quadratic Equations Part I

Abstract & Applied Linear Algebra (Chapters 1-2) James A. Bernhard University of Puget Sound

Math 38: Graph Theory Spring 2004 Dartmouth College. On Writing Proofs. 1 Introduction. 2 Finding A Solution

CS1800: Strong Induction. Professor Kevin Gold

Descriptive Statistics (And a little bit on rounding and significant digits)

Lecture 5 : Proofs DRAFT

This chapter covers propositional logic and predicate logic at a basic level. Some deeper issues will be covered later.

Show Your Work! Point values are in square brackets. There are 35 points possible. Some facts about sets are on the last page.

CHAPTER 3: THE INTEGERS Z

Notes from How to Prove it: A Structured Approach by Daniel J. Velleman

Some Writing Examples

ABOUT THE CLASS AND NOTES ON SET THEORY

Induction 1 = 1(1+1) = 2(2+1) = 3(3+1) 2

Math 300: Foundations of Higher Mathematics Northwestern University, Lecture Notes

MA103 STATEMENTS, PROOF, LOGIC

2.2 Graphs of Functions

ADVICE ON MATHEMATICAL WRITING

CM10196 Topic 2: Sets, Predicates, Boolean algebras

Solving recurrences. Frequently showing up when analysing divide&conquer algorithms or, more generally, recursive algorithms.

What is proof? Lesson 1

Introduction to Metalogic

Lecture 6: Finite Fields

In this initial chapter, you will be introduced to, or more than likely be reminded of, a

Introducing Proof 1. hsn.uk.net. Contents

MITOCW Lec 11 MIT 6.042J Mathematics for Computer Science, Fall 2010

Section 0.6: Factoring from Precalculus Prerequisites a.k.a. Chapter 0 by Carl Stitz, PhD, and Jeff Zeager, PhD, is available under a Creative

Homework 3 Solutions, Math 55

Test of Mathematics for University Admission. Notes on Logic and Proof. October 2018

Proof strategies, or, a manual of logical style

Boolean Algebra and Digital Logic

Functions. If x 2 D, then g(x) 2 T is the object that g assigns to x. Writing the symbols. g : D! T

This chapter covers asymptotic analysis of function growth and big-o notation.

Example. How to Guess What to Prove

Summer HSSP Lecture Notes Week 1. Lane Gunderman, Victor Lopez, James Rowan

3 The language of proof

Lecture 3: Sizes of Infinity

Theorem. For every positive integer n, the sum of the positive integers from 1 to n is n(n+1)

Proof by contrapositive, contradiction

Another Proof By Contradiction: 2 is Irrational

STRATEGIES OF PROBLEM SOLVING

Sec$on Summary. Definition of sets Describing Sets

Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes

Direct Proof and Counterexample I:Introduction

LECTURE 1. Logic and Proofs

We have seen that the symbols,,, and can guide the logical

Day 6. Tuesday May 29, We continue our look at basic proofs. We will do a few examples of different methods of proving.

Direct Proof and Counterexample I:Introduction. Copyright Cengage Learning. All rights reserved.

Equivalent Forms of the Axiom of Infinity

Introduction to Logic and Axiomatic Set Theory

Matrix Multiplication

Line Integrals and Path Independence

Math101, Sections 2 and 3, Spring 2008 Review Sheet for Exam #2:

An analogy from Calculus: limits

Notes on Quadratic Extension Fields

Study skills for mathematicians

Reading and Writing. Mathematical Proofs. Slides by Arthur van Goetham

HOW TO CREATE A PROOF. Writing proofs is typically not a straightforward, algorithmic process such as calculating

Section 2.1: Introduction to the Logic of Quantified Statements

August 27, Review of Algebra & Logic. Charles Delman. The Language and Logic of Mathematics. The Real Number System. Relations and Functions

Discrete Mathematics. Kenneth A. Ribet. January 31, 2013

6.042/18.062J Mathematics for Computer Science. Induction I

Mathematical Notation

CITS2211 Discrete Structures (2017) Cardinality and Countability

Preparing for the CS 173 (A) Fall 2018 Midterm 1

A Guide to Proof-Writing

Fall 2017 Test II review problems

One sided tests. An example of a two sided alternative is what we ve been using for our two sample tests:

Why write proofs? Why not just test and repeat enough examples to confirm a theory?

Foundations of Advanced Mathematics, version 0.8. Jonathan J. White

Introduction to Estimation Theory

Examples: P: it is not the case that P. P Q: P or Q P Q: P implies Q (if P then Q) Typical formula:

WORKSHEET ON NUMBERS, MATH 215 FALL. We start our study of numbers with the integers: N = {1, 2, 3,...}

Math 144 Summer 2012 (UCR) Pro-Notes June 24, / 15

Homework 1 (revised) Solutions

Lecture 8: A Crash Course in Linear Algebra

Chapter 20. Countability The rationals and the reals. This chapter covers infinite sets and countability.

Algebra. Here are a couple of warnings to my students who may be here to get a copy of what happened on a day that you missed.

Discrete Mathematics. W. Ethan Duckworth. Fall 2017, Loyola University Maryland

CS173 Strong Induction and Functions. Tandy Warnow

Mathematical induction

Some Review Problems for Exam 1: Solutions

Propositional logic ( ): Review from Mat 1348

Basic Proof Techniques

Notes on ordinals and cardinals

Transcription:

Appendix A Jargon Mathematicians write in a dialect of English that differs from everyday English and from formal scientific English. To read and write mathematics fluently, you need to be aware of the differences. A.1 Strange technical terms Many technical terms, abbreviations, and shorthand symbols are easy to track down. Perhaps they belong to an obvious topic area. Perhaps they are used so heavily that no one forgets what they mean. Perhaps they are easily found on Wikipedia. But others seem to appear mysteriously out of nowhere. abuse of notation The author is using a notation that doesn t technically comply with the rules of mathematical writing, but is very convenient or conventional. For example, using if in a a definition where we really mean if and only if. Or writing f(2,3) for the result of applying f to the pair (2,3). Strictly we should have written f((2,3)), but no one except a computer program would ever do that.! This is the unique existence quantifier.!x, P(x) means that there is exactly one x for which P(x) holds. By symmetry A variant wording for without loss of generality. 245

APPENDIX A. JARGON 246 IH Inductive hypothesis, as in a proof by induction. QED Short for quod erat demonstrandum. This is just the Latin translation of which is what we needed to show. The Latin and the English versions are both polite ways to tell your reader that the proof is finished. tuple A generalization of pair, triple, etc to larger numbers of items. A k-tuple is an ordered sequence of k items. One occasionally hears 2-tuple in place of pair. NTS Need to show, as in we need to show that all horses have four legs. WLOG, WOLOG, without loss of generality We re stipulating an extra fact or relationship, but claiming that it doesn t actually add any new information to the problem. For example, if we have two real variables x and y, with identical properties so far, it s ok to stipulate that x y because we re simply fixing which of the two names refers to the smaller number. A.2 Odd uses of normal words In addition to the obvious technical terms (e.g. rational number ), some words are used rather differently in mathematics than in everyday English. Clearly See obviously. Consider The author is about to pull an example or constant or the like out of thin air. Typically, this part of the proof was constructed backwards, and the reasons for this step will not become apparent until later in the proof. Distinct Not equal. For example, if x and y are chosen to be distinct elements of a set A, then x and y aren t allowed to have the same value. General Shorhand for general purpose, i.e. works for all inputs or in all circumstances.

APPENDIX A. JARGON 247 Graph Might be a picture showing the relationship between two variables, or it might be a diagram with nodes and links between them. Obviously Perhaps it really is obvious. Or perhaps the author didn t feel like working out the details (or forgot them in the heat of lecture). Or, infamously, perhaps he just wants to intimidate the audience. Or The connective or and its variations (e.g. either...or ) leave open the possibility that both statements are true. If a mathematician means to exclude the possibility that both are true ( exclusive or ), they say so explicitly. In everyday English, you need to use context to determine whether an or was meant to be inclusive or exclusive. Has the form E.g. if x is rational, then x has the form p where p,q Z q and q 0. Means that the definition of this type of object forces the object to have this specific internal structure. Plainly See obviously. Proper For example, proper subset or proper subgraph. Used to exclude the possibility of equality. Very similar to strict. Recall The author is about to tell you something basic that you probably ought to know, but he realizes that some of you have gaps in your background or have forgotten things. He s trying to avoid offending some of the audience by suggesting they don t know something so basic, while not embarrassing everyone else by making them confess that they don t. Similarly You can easily fill in these details by adapting a previous part of the proof, and you ll just get bored if I spell them out. Occasionally misused in a manner similar to obviously. Strict A strict relationship is one that excludes the possibility of equality. So strictly less than means that the two items can t be equal. A strictly increasing function never stays on the same value. Compare proper. Suppose not A stereotypical way to start a proof by contradiction. It s shorthand for Suppose that the claim is not true.

APPENDIX A. JARGON 248 Unique There is only one item with the specified properties. There is a unique real number whose square is zero. Vacuously true The claim is true, but only because it s impossible to satisfy the hypothesis. Recall that in math, an if/then statement is considered true if its hypothesis is true. Vacuously true statements often occur when definitions are applied to examples that are very small (e.g. the empty set) or lacking some important feature (e.g. a graph with no edges, a function whose domain is the empty set). Well-defined A mathematical object is well-defined if its definition isn t buggy. The term usually appears in a context where the definition might look ok at first glance but could have a subtle bug. A.3 Constructions Mathematicians also use certain syntactic constructions in ways that aren t quite the same as in normal English. If/then statements An if/then statement with a false hypothesis is considered true in mathematics. In normal English, such statements are rare and it s not clear if they are true, false, or perhaps neither. Imperatives A mathematical construction is often written as a recipe that the author and reader are carrying out together. E.g. We can find a real number x such that x 2 < 47. The picture behind this is that the author is helping you do the mathematics, not doing it by himself while you watch. Verbs in the imperative form are sometimes actions that the reader should do by himself (e.g. prove XX onaproblem set) but sometimes commands that the reader should do by following explicit instructions from the author. E.g. define f : N N by f(n) = 2n tells you to define a function, but you are being told exactly how to do it. On a problem set, this would be background information, not a question you need to answer. Two variables If a mathematician sets up two variables with different names, e.g. x and y, he leaves open the possibility that they might be equal. If

APPENDIX A. JARGON 249 they are intended to have different values, they will be explicitly specified as distinct. In normal English, giving two things different names suggests very strongly that they are different objects. No resetting Do not change the value of a variable inthe middle of a proof. Instead, use a fresh variable name. For example, suppose you know that p = 3jk + 1 in a proof about divisibility. To simplify the form of the equation, it s tempting to reset j to be three times its original value, so that you have p = jk+1. This isn t done in standard mathematical writing. Instead, use a fresh variable name, e.g. s = 3j and then p = sk +1. Variable names can be re-used when the context changes (e.g. you ve started a new proof). When working through a series of examples, e.g. a bunch of example functions to be discussed, rotate variable names, so that the new definition appears after the reader has had time to forget the old definition. Variable names Variable names are single-letter, e.g. f but not foo. The letter can be adorned with a wide variety of accents, subscripts, and superscripts, however. A.4 Unexpectedly normal Mathematicians are, of course, underlyingly speakers of normal English. So, sometimes, they apply the normal rules of conversational English even when these aren t part of the formal mathematical system. names of variables Inprinciple, any letter canbeused asthenameforany variable you need in a proof, with or without accent marks of various sorts. However, there are strong conventions favoring certain names. E.g. x is a real number, n is an integer, f is a function, and T is a set. Observe what names authors use in your specific topic area and don t stray too far from their conventions. topics of equations Proofs are conversations about particular objects (e.g. polynomials, summations). Therefore, equations and other statements

APPENDIX A. JARGON 250 are often about some specific topic object, whose properties are being described. When this is the case, the topic belongs on the lefthand side, just like the subject of a normal sentence.