A logical view on Tao s finitizations in analysis


 Earl Peters
 1 years ago
 Views:
Transcription
1 A logical view on Tao s finitizations in analysis Jaime Gaspar 1,2 (joint work with Ulrich Kohlenbach 1 ) 1 Technische Universität Darmstadt 2 Supported by the Fundação para a Ciência e a Tecnologia
2 Part I Tao s finitizations
3 Finitizations In 2007 and 2008, Terence Tao wrote essays about finitization of statements in analysis. Soft analysis Deals with: infinite objects (sequences, σalgebras,...); qualitative properties (convergence, compactness,...). Hard analysis Deals with: finite objects (finite sets, convergent integrals,...); quantitative properties (cardinality of finite sets, bounds,...). Finitization A finitization of a soft analysis statement is an equivalent hard analysis statement.
4 Example 1 Infinite convergence principle Every monotone bounded sequence of real numbers is convergent. Finite convergence principle Every long enough (length M) bounded monotone sequence has arbitrary highquality (error tolerance ε) long (length F (N)) amounts of stability: ε > 0 F : N N M N (x n ) n=0,...,m [0, 1] monotone N M m, n [N, N + F (N)] ( x m x n ε).
5 Example 2 Let k := {0,..., k 1}. A sequence (A n ) P fin (N) weakly converges to I P inf (N) if for all k N we have A n k = I k for all large enough n N. A function F : P fin (N) N is asymptotically stable near infinite sets (F ASNIS) if stabilizes over all weakly convergent sequences. Infinite pigeonhole principle IPP Every colouring of N with finitely many colours has a infinite colour class. Tao s finitary infinite pigeonhole principle FIPP Every colouring of a large enough initial segment of N with finitely many colours has a big colour class: n N F ASNIS k N f :k n c <n A=f 1 (c) ( A >F (A)).
6 Example 2 IPP Every colouring of N with finitely many colours has a infinite colour class. Tao s FIPP n N F ASNIS k N f : k n c < n A = f 1 (c) ( A > F (A)) Proof of IPP FIPP Assume IPP and, by contradiction, FIPP. We have n N, F ASNIS and a sequence f k : k n such that: ( ) no A k = (f k ) 1 (c) verifies A k > F (A k ). Extend f k to f k : N n. The f k s are in the sequentially compact n N, so (a subsequence of) f k converges to some f : N n. By IPP, f has an infinite colour class f 1 (c). Unfolding f k f we see that A k = (f k ) 1 (c) weakly converges to f 1 (c). Then F stabilizes over (A k ) but A k. So k N ( A k > F (A k )), contradicting ( ).
7 Summary Tao wants to finitize statements in analysis: soft analysis (infinite, qualitative) finitization hard analysis (finite, quantitative) Tao s two prime examples: infinite convergence principle infinite pigeonhole principle finitization almost finitization finite convergence principle Tao s finitary infinite pigeonhole principle Usually argued by contradiction and sequential compactness.
8 Part II Two logical points
9 Gödel functional interpretation PA ω is a Peano arithmetic that deals with N, N N, (N N ) N, N (NN),... The quantifierfree axiom of choice QFAC is x ya(x, y) f xa(x, f (x)) with A(x, y) quantifierfree. Gödel functional interpretation Is a function A A G x ya G (x, y) with A G (x, y) quantifierfree, such that: PA ω + QFAC A PA ω A G (t, y), for suitable terms t extracted from a proof of A; PA ω + QFAC A A G. A G (t, y) is essentially a finitization of A: A G (t, y) is a hard analysis statement; A A G ; PA ω A G (t, y) PA ω (A G with x witnessed by t). Point 1 Gödel functional interpretation finitizes systematically.
10 Sequential compactness vs HeineBorel compactness Sequential compactness Every sequence has a convergent subsequence. HeineBorel compactness Every open cover has a finite subcover. Every continuous function is bounded. Reverse mathematics Seeks to find which axioms are need to prove theorems. The axioms considered are the big five subsystems of second order arithmetic: RCA 0 WKL 0 ACA 0 ATR 0 Π 1 1 CA 0 1st order part PA with Σ 0 1induction PA with Σ 0 1induction PA 2nd order part compactness only computable sets some noncomputable sets HeineBorel compactness all arithmetical sets sequential compactness
11 Sequential compactness vs HeineBorel compactness RCA 0 WKL 0 ACA 0 ATR 0 Π 1 1 CA 0 HeineBorel compactness sequential compactness Assume that we proved that A finitizes into B using sequential compactness. Then, at best, ACA 0 A B. If, for example, ACA 0 A, then ACA 0 A B reduces to ACA 0 B, obscuring the role of A. In this sense our finitization is not meaningful. A finitization of A into B that uses sequential compactness is only meaningful if ACA 0 A, B. A finitization of A into B that uses HeineBorel compactness is already meaningful if WKL 0 A, B. Point 2 We should prefer HeineBorel compactness.
12 Summary Gödel functional interpretation finitizes systematically. We should prefer HeineBorel compactness to sequential compactness.
13 Part III A case study
14 Kohlenbach s finitary infinite pigeonhole principle A function F : P fin (N) N is asymptotically stable (F AS) if stabilizes over all chains A 0 A 1 A 2 in P fin (N). IPP G is essentially Kohlenbach s FIPP: Kohlenbach s finitary infinite pigeonhole principle FIPP Every colouring of a large enough initial segment of N with finitely many colours has a big subset of a colour class: n N F AS k N f :k n c <n A f 1 (c) ( A >F (A)). Tao s finitary infinite pigeonhole principle FIPP Every colouring of a large enough initial segment of N with finitely many colours has a big colour class: n N F ASNIS k N f :k n c <n A=f 1 (c) ( A >F (A)).
15 Kohlenbach s finitary infinite pigeonhole principle IPP Every colouring of N with finitely many colours has a infinite colour class. Kohlenbach s FIPP n N F AS k N f : k n c < n A f 1 (c) ( A > F (A)) Theorem IPP and Kohlenbach s FIPP are equivalent in WKL 0. B(f,i) Proof of IPP FIPP {}}{ Prove f : N n i N c < n A = f 1 (c) i ( A > F (A)): f has a infinite colour class f 1 (c) by IPP; F stabilizes over the chain A i := f 1 (c) i but A i so i ( A i > F (A i )). HeineBorel compactness: φ(f ) := min i B(f, i) is total and continuous on the compact n N, so it has an upperbound k. f only appears in f 1 (c) i with i k, so f k suffices. Theorem IPP and Tao s FIPP are equivalent in ACA 0.
16 Summary Gödel functional interpretation finitizes IPP into Kohlenbach s FIPP. IPP and Kohlenbach s FIPP are provably equivalent in WKL 0 using HeineBorel compactness.
17 Global summary Tao s finitizations Soft analysis hard analysis. Examples:  infinite convergence principle finite convergence principle;  infinite pigeonhole principle IPP Tao s finitary infinite pigeonhole principle FIPP. Contradiction and sequential compactness argument. Two logical points Gödel functional interpretation finitizes systematically. Prefer HeineBorel compactness to sequential compactness. Case study Gödel function interpretation: IPP Kohlenbach s FIPP. HeineBorel compactness: proof of IPP FIPP.
18 References Terence Tao Soft analysis, hard analysis, and the finite convergence principle Terence Tao The correspondence principle and finitary ergodic theory Jaime Gaspar and Ulrich Kohlenbach On Tao s finitary infinite pigeonhole principle To appear in The Journal of Symbolic Logic kohlenbach
PART I. THE REAL NUMBERS
PART I. THE REAL NUMBERS This material assumes that you are already familiar with the real number system and the representation of the real numbers as points on the real line. I.1. THE NATURAL NUMBERS
More informationHandout #1: Mathematical Reasoning
Math 101 Rumbos Spring 2010 1 Handout #1: Mathematical Reasoning 1 Propositional Logic A proposition is a mathematical statement that it is either true or false; that is, a statement whose certainty or
More information{f 1 (U), U F} is an open cover of A. Since A is compact there is a finite subcover of A, {f 1 (U 1 ),...,f 1 (U n )}, {U 1,...
44 CHAPTER 4. CONTINUOUS FUNCTIONS In Calculus we often use arithmetic operations to generate new continuous functions from old ones. In a general metric space we don t have arithmetic, but much of it
More informationRecursion Theory in Set Theory
Contemporary Mathematics Recursion Theory in Set Theory Theodore A. Slaman 1. Introduction Our goal is to convince the reader that recursion theoretic knowledge and experience can be successfully applied
More informationMath212a1010 Lebesgue measure.
Math212a1010 Lebesgue measure. October 19, 2010 Today s lecture will be devoted to Lebesgue measure, a creation of Henri Lebesgue, in his thesis, one of the most famous theses in the history of mathematics.
More informationExtension of measure
1 Extension of measure Sayan Mukherjee Dynkin s π λ theorem We will soon need to define probability measures on infinite and possible uncountable sets, like the power set of the naturals. This is hard.
More informationConsistency, completeness of undecidable preposition of Principia Mathematica. Tanmay Jaipurkar
Consistency, completeness of undecidable preposition of Principia Mathematica Tanmay Jaipurkar October 21, 2013 Abstract The fallowing paper discusses the inconsistency and undecidable preposition of Principia
More information1. Prove that the empty set is a subset of every set.
1. Prove that the empty set is a subset of every set. Basic Topology Written by MenGen Tsai email: b89902089@ntu.edu.tw Proof: For any element x of the empty set, x is also an element of every set since
More informationThis chapter is all about cardinality of sets. At first this looks like a
CHAPTER Cardinality of Sets This chapter is all about cardinality of sets At first this looks like a very simple concept To find the cardinality of a set, just count its elements If A = { a, b, c, d },
More informationRi and. i=1. S i N. and. R R i
The subset R of R n is a closed rectangle if there are n nonempty closed intervals {[a 1, b 1 ], [a 2, b 2 ],..., [a n, b n ]} so that R = [a 1, b 1 ] [a 2, b 2 ] [a n, b n ]. The subset R of R n is an
More informationCHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e.
CHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e. This chapter contains the beginnings of the most important, and probably the most subtle, notion in mathematical analysis, i.e.,
More informationFirstOrder Logics and Truth Degrees
FirstOrder Logics and Truth Degrees George Metcalfe Mathematics Institute University of Bern LATD 2014, Vienna Summer of Logic, 1519 July 2014 George Metcalfe (University of Bern) FirstOrder Logics
More informationCHAPTER 7 GENERAL PROOF SYSTEMS
CHAPTER 7 GENERAL PROOF SYSTEMS 1 Introduction Proof systems are built to prove statements. They can be thought as an inference machine with special statements, called provable statements, or sometimes
More informationNotes on metric spaces
Notes on metric spaces 1 Introduction The purpose of these notes is to quickly review some of the basic concepts from Real Analysis, Metric Spaces and some related results that will be used in this course.
More informationDEGREES OF ORDERS ON TORSIONFREE ABELIAN GROUPS
DEGREES OF ORDERS ON TORSIONFREE ABELIAN GROUPS ASHER M. KACH, KAREN LANGE, AND REED SOLOMON Abstract. We construct two computable presentations of computable torsionfree abelian groups, one of isomorphism
More informationGod created the integers and the rest is the work of man. (Leopold Kronecker, in an afterdinner speech at a conference, Berlin, 1886)
Chapter 2 Numbers God created the integers and the rest is the work of man. (Leopold Kronecker, in an afterdinner speech at a conference, Berlin, 1886) God created the integers and the rest is the work
More informationNotes: Chapter 2 Section 2.2: Proof by Induction
Notes: Chapter 2 Section 2.2: Proof by Induction Basic Induction. To prove: n, a W, n a, S n. (1) Prove the base case  S a. (2) Let k a and prove that S k S k+1 Example 1. n N, n i = n(n+1) 2. Example
More informationThis asserts two sets are equal iff they have the same elements, that is, a set is determined by its elements.
3. Axioms of Set theory Before presenting the axioms of set theory, we first make a few basic comments about the relevant first order logic. We will give a somewhat more detailed discussion later, but
More informationCSG 399 Lecture. The Inductive Approach to Protocol Analysis p.1
The Inductive Approach to Protocol Analysis CSG 399 Lecture The Inductive Approach to Protocol Analysis p.1 Last Time CSP approach: Model system as a CSP process A specification is a property of traces
More informationDegrees that are not degrees of categoricity
Degrees that are not degrees of categoricity Bernard A. Anderson Department of Mathematics and Physical Sciences Gordon State College banderson@gordonstate.edu www.gordonstate.edu/faculty/banderson Barbara
More informationMetric Spaces Joseph Muscat 2003 (Last revised May 2009)
1 Distance J Muscat 1 Metric Spaces Joseph Muscat 2003 (Last revised May 2009) (A revised and expanded version of these notes are now published by Springer.) 1 Distance A metric space can be thought of
More informationSECTION 102 Mathematical Induction
73 0 Sequences and Series 6. Approximate e 0. using the first five terms of the series. Compare this approximation with your calculator evaluation of e 0.. 6. Approximate e 0.5 using the first five terms
More informationOn a conjecture by Palis
1179 2000 103108 103 On a conjecture by Palis (Shuhei Hayashi) Introduction Let $M$ be a smooth compact manifold without boundary and let Diff1 $(M)$ be the set of $C^{1}$ diffeomorphisms with the $C^{1}$
More informationColumbia University in the City of New York New York, N.Y. 10027
Columbia University in the City of New York New York, N.Y. 10027 DEPARTMENT OF MATHEMATICS 508 Mathematics Building 2990 Broadway Fall Semester 2005 Professor Ioannis Karatzas W4061: MODERN ANALYSIS Description
More informationMathematics for Computer Science/Software Engineering. Notes for the course MSM1F3 Dr. R. A. Wilson
Mathematics for Computer Science/Software Engineering Notes for the course MSM1F3 Dr. R. A. Wilson October 1996 Chapter 1 Logic Lecture no. 1. We introduce the concept of a proposition, which is a statement
More informationAutomata and Formal Languages
Automata and Formal Languages Winter 20092010 Yacov HelOr 1 What this course is all about This course is about mathematical models of computation We ll study different machine models (finite automata,
More informationUndergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics
Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics An Introductory Single Variable Real Analysis: A Learning Approach through Problem Solving Marcel B. Finan c All Rights
More informationAN INTRODUCTION TO SET THEORY. Professor William A. R. Weiss
AN INTRODUCTION TO SET THEORY Professor William A. R. Weiss October 2, 2008 2 Contents 0 Introduction 7 1 LOST 11 2 FOUND 19 3 The Axioms of Set Theory 23 4 The Natural Numbers 31 5 The Ordinal Numbers
More information2.3. Proposition. There exists an enumeration operator W a such that χ A = W a (A ) for all A N.
THE ωenumeration DEGREES IVAN N. SOSKOV Abstract. In the present paper we initiate the study of the partial ordering of the ωenumeration degrees. This ordering is a semilattice which extends the semilattice
More informationKolmogorov Complexity and the Incompressibility Method
Kolmogorov Complexity and the Incompressibility Method Holger Arnold 1. Introduction. What makes one object more complex than another? Kolmogorov complexity, or programsize complexity, provides one of
More informationInduction. Margaret M. Fleck. 10 October These notes cover mathematical induction and recursive definition
Induction Margaret M. Fleck 10 October 011 These notes cover mathematical induction and recursive definition 1 Introduction to induction At the start of the term, we saw the following formula for computing
More informationBasic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011
Basic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011 A. Miller 1. Introduction. The definitions of metric space and topological space were developed in the early 1900 s, largely
More informationWHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT?
WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT? introduction Many students seem to have trouble with the notion of a mathematical proof. People that come to a course like Math 216, who certainly
More informationContinuous treelike scales
Carnegie Mellon University Research Showcase @ CMU Department of Mathematical Sciences Mellon College of Science 42010 Continuous treelike scales James Cummings Carnegie Mellon University, jcumming@andrew.cmu.edu
More informationSOME USES OF SET THEORY IN ALGEBRA. Stanford Logic Seminar February 10, 2009
SOME USES OF SET THEORY IN ALGEBRA Stanford Logic Seminar February 10, 2009 Plan I. The Whitehead Problem early history II. Compactness and Incompactness III. Deconstruction P. Eklof and A. Mekler, Almost
More informationTHE SEARCH FOR NATURAL DEFINABILITY IN THE TURING DEGREES
THE SEARCH FOR NATURAL DEFINABILITY IN THE TURING DEGREES ANDREW E.M. LEWIS 1. Introduction This will be a course on the Turing degrees. We shall assume very little background knowledge: familiarity with
More information1 if 1 x 0 1 if 0 x 1
Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or
More informationAN EXPANSION FORMULA FOR FRACTIONAL DERIVATIVES AND ITS APPLICATION. Abstract
AN EXPANSION FORMULA FOR FRACTIONAL DERIVATIVES AND ITS APPLICATION T. M. Atanackovic 1 and B. Stankovic 2 Dedicated to Professor Ivan H. Dimovski on the occasion of his 7th birthday Abstract An expansion
More informationThe fundamental group of the Hawaiian earring is not free (International Journal of Algebra and Computation Vol. 2, No. 1 (1992), 33 37) Bart de Smit
The fundamental group of the Hawaiian earring is not free Bart de Smit The fundamental group of the Hawaiian earring is not free (International Journal of Algebra and Computation Vol. 2, No. 1 (1992),
More informationCODING TRUE ARITHMETIC IN THE MEDVEDEV AND MUCHNIK DEGREES
CODING TRUE ARITHMETIC IN THE MEDVEDEV AND MUCHNIK DEGREES PAUL SHAFER Abstract. We prove that the firstorder theory of the Medvedev degrees, the firstorder theory of the Muchnik degrees, and the thirdorder
More informationAN INTUITIONISTIC EPISTEMIC LOGIC FOR ASYNCHRONOUS COMMUNICATION. Yoichi Hirai. A Master Thesis
AN INTUITIONISTIC EPISTEMIC LOGIC FOR ASYNCHRONOUS COMMUNICATION by Yoichi Hirai A Master Thesis Submitted to the Graduate School of the University of Tokyo on February 10, 2010 in Partial Fulfillment
More informationLecture 13 Linear quadratic Lyapunov theory
EE363 Winter 289 Lecture 13 Linear quadratic Lyapunov theory the Lyapunov equation Lyapunov stability conditions the Lyapunov operator and integral evaluating quadratic integrals analysis of ARE discretetime
More informationProseminar on Semantic Theory Fall 2013 Ling 720. Problem Set on the Formal Preliminaries : Answers and Notes
1. Notes on the Answers Problem Set on the Formal Preliminaries : Answers and Notes In the pages that follow, I have copied some illustrative answers from the problem sets submitted to me. In this section,
More informationProof interpretations: what they are and what they are good for
s: what they are and what they are good for Jaime Gaspar INRIA ParisRocquencourt, πr 2, Univ Paris Diderot, Sorbonne Paris Cité, F78153 Le Chesnay, France Financially supported by the French Fondation
More informationProofs are short works of prose and need to be written in complete sentences, with mathematical symbols used where appropriate.
Advice for homework: Proofs are short works of prose and need to be written in complete sentences, with mathematical symbols used where appropriate. Even if a problem is a simple exercise that doesn t
More informationUniversity of Miskolc
University of Miskolc The Faculty of Mechanical Engineering and Information Science The role of the maximum operator in the theory of measurability and some applications PhD Thesis by Nutefe Kwami Agbeko
More informationx if x 0, x if x < 0.
Chapter 3 Sequences In this chapter, we discuss sequences. We say what it means for a sequence to converge, and define the limit of a convergent sequence. We begin with some preliminary results about the
More informationINCIDENCEBETWEENNESS GEOMETRY
INCIDENCEBETWEENNESS GEOMETRY MATH 410, CSUSM. SPRING 2008. PROFESSOR AITKEN This document covers the geometry that can be developed with just the axioms related to incidence and betweenness. The full
More informationMathematical Induction. Lecture 1011
Mathematical Induction Lecture 1011 Menu Mathematical Induction Strong Induction Recursive Definitions Structural Induction Climbing an Infinite Ladder Suppose we have an infinite ladder: 1. We can reach
More informationAutomata and Rational Numbers
Automata and Rational Numbers Jeffrey Shallit School of Computer Science University of Waterloo Waterloo, Ontario N2L 3G1 Canada shallit@cs.uwaterloo.ca http://www.cs.uwaterloo.ca/~shallit 1/40 Representations
More informationGENERIC COMPUTABILITY, TURING DEGREES, AND ASYMPTOTIC DENSITY
GENERIC COMPUTABILITY, TURING DEGREES, AND ASYMPTOTIC DENSITY CARL G. JOCKUSCH, JR. AND PAUL E. SCHUPP Abstract. Generic decidability has been extensively studied in group theory, and we now study it in
More information3. Mathematical Induction
3. MATHEMATICAL INDUCTION 83 3. Mathematical Induction 3.1. First Principle of Mathematical Induction. Let P (n) be a predicate with domain of discourse (over) the natural numbers N = {0, 1,,...}. If (1)
More informationToday s Topics. Primes & Greatest Common Divisors
Today s Topics Primes & Greatest Common Divisors Prime representations Important theorems about primality Greatest Common Divisors Least Common Multiples Euclid s algorithm Once and for all, what are prime
More informationCartesian Products and Relations
Cartesian Products and Relations Definition (Cartesian product) If A and B are sets, the Cartesian product of A and B is the set A B = {(a, b) :(a A) and (b B)}. The following points are worth special
More informationElementary Number Theory We begin with a bit of elementary number theory, which is concerned
CONSTRUCTION OF THE FINITE FIELDS Z p S. R. DOTY Elementary Number Theory We begin with a bit of elementary number theory, which is concerned solely with questions about the set of integers Z = {0, ±1,
More informationProof of Infinite Number of Fibonacci Primes. Stephen Marshall. 22 May Abstract
Proof of Infinite Number of Fibonacci Primes Stephen Marshall 22 May 2014 Abstract This paper presents a complete and exhaustive proof of that an infinite number of Fibonacci Primes exist. The approach
More informationMITES Physics III Summer Introduction 1. 3 Π = Product 2. 4 Proofs by Induction 3. 5 Problems 5
MITES Physics III Summer 010 Sums Products and Proofs Contents 1 Introduction 1 Sum 1 3 Π Product 4 Proofs by Induction 3 5 Problems 5 1 Introduction These notes will introduce two topics: A notation which
More informationarxiv:0804.4490v1 [math.gm] 28 Apr 2008
Infinite sequences in the framework of classical logic arxiv:0804.4490v1 [math.gm] 28 Apr 2008 V.V. Ivanov N.N. Semenov Institute of Chemical Physics, Russian Academy of Sciences, Kosygin str.4, Moscow,
More informationOn strong fairness in UNITY
On strong fairness in UNITY H.P.Gumm, D.Zhukov Fachbereich Mathematik und Informatik Philipps Universität Marburg {gumm,shukov}@mathematik.unimarburg.de Abstract. In [6] Tsay and Bagrodia present a correct
More informationTuring Degrees and Definability of the Jump. Theodore A. Slaman. University of California, Berkeley. CJuly, 2005
Turing Degrees and Definability of the Jump Theodore A. Slaman University of California, Berkeley CJuly, 2005 Outline Lecture 1 Forcing in arithmetic Coding and decoding theorems Automorphisms of countable
More informationAppendix F: Mathematical Induction
Appendix F: Mathematical Induction Introduction In this appendix, you will study a form of mathematical proof called mathematical induction. To see the logical need for mathematical induction, take another
More informationTheory of Automated Reasoning An Introduction. AnttiJuhani Kaijanaho
Theory of Automated Reasoning An Introduction AnttiJuhani Kaijanaho Intended as compulsory reading for the Spring 2004 course on Automated Reasononing at Department of Mathematical Information Technology,
More informationIntroduction. Appendix D Mathematical Induction D1
Appendix D Mathematical Induction D D Mathematical Induction Use mathematical induction to prove a formula. Find a sum of powers of integers. Find a formula for a finite sum. Use finite differences to
More informationMI314 History of Mathematics: Episodes in NonEuclidean Geometry
MI314 History of Mathematics: Episodes in NonEuclidean Geometry Giovanni Saccheri, Euclides ab omni naevo vindicatus In 1733, Saccheri published Euclides ab omni naevo vindicatus (Euclid vindicated om
More informationSUBGROUPS OF CYCLIC GROUPS. 1. Introduction In a group G, we denote the (cyclic) group of powers of some g G by
SUBGROUPS OF CYCLIC GROUPS KEITH CONRAD 1. Introduction In a group G, we denote the (cyclic) group of powers of some g G by g = {g k : k Z}. If G = g, then G itself is cyclic, with g as a generator. Examples
More informationFinite dimensional topological vector spaces
Chapter 3 Finite dimensional topological vector spaces 3.1 Finite dimensional Hausdorff t.v.s. Let X be a vector space over the field K of real or complex numbers. We know from linear algebra that the
More informationTHE PRIME NUMBER THEOREM
THE PRIME NUMBER THEOREM NIKOLAOS PATTAKOS. introduction In number theory, this Theorem describes the asymptotic distribution of the prime numbers. The Prime Number Theorem gives a general description
More informationProblems on Discrete Mathematics 1
Problems on Discrete Mathematics 1 ChungChih Li 2 Kishan Mehrotra 3 Syracuse University, New York L A TEX at January 11, 2007 (Part I) 1 No part of this book can be reproduced without permission from
More informationCLASSES, STRONG MINIMAL COVERS AND HYPERIMMUNEFREE DEGREES
Π 0 1 CLASSES, STRONG MINIMAL COVERS AND HYPERIMMUNEFREE DEGREES ANDREW E.M. LEWIS Abstract. We investigate issues surrounding an old question of Yates as to the existence of a minimal degree with no
More informationP (A) = lim P (A) = N(A)/N,
1.1 Probability, Relative Frequency and Classical Definition. Probability is the study of random or nondeterministic experiments. Suppose an experiment can be repeated any number of times, so that we
More informationk, then n = p2α 1 1 pα k
Powers of Integers An integer n is a perfect square if n = m for some integer m. Taking into account the prime factorization, if m = p α 1 1 pα k k, then n = pα 1 1 p α k k. That is, n is a perfect square
More informationThere is no degree invariant halfjump
There is no degree invariant halfjump Rod Downey Mathematics Department Victoria University of Wellington P O Box 600 Wellington New Zealand Richard A. Shore Mathematics Department Cornell University
More informationReview. Bayesianism and Reliability. Today s Class
Review Bayesianism and Reliability Models and Simulations in Philosophy April 14th, 2014 Last Class: Difference between individual and social epistemology Why simulations are particularly useful for social
More informationRecent progress in additive prime number theory
Recent progress in additive prime number theory University of California, Los Angeles Mahler Lecture Series Additive prime number theory Additive prime number theory is the study of additive patterns in
More informationarxiv:math/0510680v3 [math.gn] 31 Oct 2010
arxiv:math/0510680v3 [math.gn] 31 Oct 2010 MENGER S COVERING PROPERTY AND GROUPWISE DENSITY BOAZ TSABAN AND LYUBOMYR ZDOMSKYY Abstract. We establish a surprising connection between Menger s classical covering
More informationExample 4.1 (nonlinear pendulum dynamics with friction) Figure 4.1: Pendulum. asin. k, a, and b. We study stability of the origin x
Lecture 4. LaSalle s Invariance Principle We begin with a motivating eample. Eample 4.1 (nonlinear pendulum dynamics with friction) Figure 4.1: Pendulum Dynamics of a pendulum with friction can be written
More informationGROUPS ACTING ON A SET
GROUPS ACTING ON A SET MATH 435 SPRING 2012 NOTES FROM FEBRUARY 27TH, 2012 1. Left group actions Definition 1.1. Suppose that G is a group and S is a set. A left (group) action of G on S is a rule for
More informationFirstOrder Theories
FirstOrder Theories Ruzica Piskac Max Planck Institute for Software Systems, Germany piskac@mpisws.org Seminar on Decision Procedures 2012 Ruzica Piskac FirstOrder Theories 1 / 39 Acknowledgments Theories
More informationCHAPTER 5. Product Measures
54 CHAPTER 5 Product Measures Given two measure spaces, we may construct a natural measure on their Cartesian product; the prototype is the construction of Lebesgue measure on R 2 as the product of Lebesgue
More informationNo: 10 04. Bilkent University. Monotonic Extension. Farhad Husseinov. Discussion Papers. Department of Economics
No: 10 04 Bilkent University Monotonic Extension Farhad Husseinov Discussion Papers Department of Economics The Discussion Papers of the Department of Economics are intended to make the initial results
More informationn k=1 k=0 1/k! = e. Example 6.4. The series 1/k 2 converges in R. Indeed, if s n = n then k=1 1/k, then s 2n s n = 1 n + 1 +...
6 Series We call a normed space (X, ) a Banach space provided that every Cauchy sequence (x n ) in X converges. For example, R with the norm = is an example of Banach space. Now let (x n ) be a sequence
More informationChapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm.
Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm. We begin by defining the ring of polynomials with coefficients in a ring R. After some preliminary results, we specialize
More informationGeorg Cantor and Set Theory
Georg Cantor and Set Theory. Life Father, Georg Waldemar Cantor, born in Denmark, successful merchant, and stock broker in St Petersburg. Mother, Maria Anna Böhm, was Russian. In 856, because of father
More information6.080/6.089 GITCS Feb 12, 2008. Lecture 3
6.8/6.89 GITCS Feb 2, 28 Lecturer: Scott Aaronson Lecture 3 Scribe: Adam Rogal Administrivia. Scribe notes The purpose of scribe notes is to transcribe our lectures. Although I have formal notes of my
More information4. CLASSES OF RINGS 4.1. Classes of Rings class operator Aclosed Example 1: product Example 2:
4. CLASSES OF RINGS 4.1. Classes of Rings Normally we associate, with any property, a set of objects that satisfy that property. But problems can arise when we allow sets to be elements of larger sets
More information1. Let X and Y be normed spaces and let T B(X, Y ).
Uppsala Universitet Matematiska Institutionen Andreas Strömbergsson Prov i matematik Funktionalanalys Kurs: NVP, Frist. 20050314 Skrivtid: 9 11.30 Tillåtna hjälpmedel: Manuella skrivdon, Kreyszigs bok
More information4.1. Definitions. A set may be viewed as any well defined collection of objects, called elements or members of the set.
Section 4. Set Theory 4.1. Definitions A set may be viewed as any well defined collection of objects, called elements or members of the set. Sets are usually denoted with upper case letters, A, B, X, Y,
More information1 Elementary Set Theory
1 Elementary Set Theory Notation: {} enclose a set. {1, 2, 3} = {3, 2, 2, 1, 3} because a set is not defined by order or multiplicity. {0, 2, 4,...} = {x x is an even natural number} because two ways of
More informationHOMEWORK 5 SOLUTIONS. n!f n (1) lim. ln x n! + xn x. 1 = G n 1 (x). (2) k + 1 n. (n 1)!
Math 7 Fall 205 HOMEWORK 5 SOLUTIONS Problem. 2008 B2 Let F 0 x = ln x. For n 0 and x > 0, let F n+ x = 0 F ntdt. Evaluate n!f n lim n ln n. By directly computing F n x for small n s, we obtain the following
More informationFixedPoint Logics and Computation
1 FixedPoint Logics and Computation Symposium on the Unusual Effectiveness of Logic in Computer Science University of Cambridge 2 Mathematical Logic Mathematical logic seeks to formalise the process of
More informationSet theory as a foundation for mathematics
Set theory as a foundation for mathematics Waffle Mathcamp 2011 In school we are taught about numbers, but we never learn what numbers really are. We learn rules of arithmetic, but we never learn why these
More informationMATHEMATICAL INDUCTION. Mathematical Induction. This is a powerful method to prove properties of positive integers.
MATHEMATICAL INDUCTION MIGUEL A LERMA (Last updated: February 8, 003) Mathematical Induction This is a powerful method to prove properties of positive integers Principle of Mathematical Induction Let P
More informationINDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS
INDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS STEVEN P. LALLEY AND ANDREW NOBEL Abstract. It is shown that there are no consistent decision rules for the hypothesis testing problem
More informationDEFINABLE TYPES IN PRESBURGER ARITHMETIC
DEFINABLE TYPES IN PRESBURGER ARITHMETIC GABRIEL CONANT Abstract. We consider the first order theory of (Z, +,
More informationSMALL SKEW FIELDS CÉDRIC MILLIET
SMALL SKEW FIELDS CÉDRIC MILLIET Abstract A division ring of positive characteristic with countably many pure types is a field Wedderburn showed in 1905 that finite fields are commutative As for infinite
More informationFoundations of Logic and Mathematics
Yves Nievergelt Foundations of Logic and Mathematics Applications to Computer Science and Cryptography Birkhäuser Boston Basel Berlin Contents Preface Outline xiii xv A Theory 1 0 Boolean Algebraic Logic
More informationSummary Last Lecture. Automated Reasoning. Outline of the Lecture. Definition sequent calculus. Theorem (Normalisation and Strong Normalisation)
Summary Summary Last Lecture sequent calculus Automated Reasoning Georg Moser Institute of Computer Science @ UIBK Winter 013 (Normalisation and Strong Normalisation) let Π be a proof in minimal logic
More informationContinued Fractions and the Euclidean Algorithm
Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction
More informationMathematical induction. Niloufar Shafiei
Mathematical induction Niloufar Shafiei Mathematical induction Mathematical induction is an extremely important proof technique. Mathematical induction can be used to prove results about complexity of
More informationDivisor graphs have arbitrary order and size
Divisor graphs have arbitrary order and size arxiv:math/0606483v1 [math.co] 20 Jun 2006 Le Anh Vinh School of Mathematics University of New South Wales Sydney 2052 Australia Abstract A divisor graph G
More information