Zornian Functional Analysis Or: How I Learned to Stop Worrying and Love the Axiom of Choice
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Analysis of Functions of a Single Variable a Detailed Development
ANALYSIS OF FUNCTIONS OF A SINGLE VARIABLE A DETAILED DEVELOPMENT LAWRENCE W. BAGGETT University of Colorado OCTOBER 29, 2006 2 For Christy My Light i PREFACE I have written this book primarily for serious and talented mathematics scholars , seniors or first-year graduate students, who by the time they finish their schooling should have had the opportunity to study in some detail the great discoveries of our subject. What did we know and how and when did we know it? I hope this book is useful toward that goal, especially when it comes to the great achievements of that part of mathematics known as analysis. I have tried to write a complete and thorough account of the elementary theories of functions of a single real variable and functions of a single complex variable. Separating these two subjects does not at all jive with their development historically, and to me it seems unnecessary and potentially confusing to do so. On the other hand, functions of several variables seems to me to be a very different kettle of fish, so I have decided to limit this book by concentrating on one variable at a time. Everyone is taught (told) in school that the area of a circle is given by the formula A = πr2: We are also told that the product of two negatives is a positive, that you cant trisect an angle, and that the square root of 2 is irrational. Students of natural sciences learn that eiπ = 1 and that sin2 + cos2 = 1: More sophisticated students are taught the Fundamental− Theorem of calculus and the Fundamental Theorem of Algebra. -
The Metamathematics of Putnam's Model-Theoretic Arguments
The Metamathematics of Putnam's Model-Theoretic Arguments Tim Button Abstract. Putnam famously attempted to use model theory to draw metaphysical conclusions. His Skolemisation argument sought to show metaphysical realists that their favourite theories have countable models. His permutation argument sought to show that they have permuted mod- els. His constructivisation argument sought to show that any empirical evidence is compatible with the Axiom of Constructibility. Here, I exam- ine the metamathematics of all three model-theoretic arguments, and I argue against Bays (2001, 2007) that Putnam is largely immune to meta- mathematical challenges. Copyright notice. This paper is due to appear in Erkenntnis. This is a pre-print, and may be subject to minor changes. The authoritative version should be obtained from Erkenntnis, once it has been published. Hilary Putnam famously attempted to use model theory to draw metaphys- ical conclusions. Specifically, he attacked metaphysical realism, a position characterised by the following credo: [T]he world consists of a fixed totality of mind-independent objects. (Putnam 1981, p. 49; cf. 1978, p. 125). Truth involves some sort of correspondence relation between words or thought-signs and external things and sets of things. (1981, p. 49; cf. 1989, p. 214) [W]hat is epistemically most justifiable to believe may nonetheless be false. (1980, p. 473; cf. 1978, p. 125) To sum up these claims, Putnam characterised metaphysical realism as an \externalist perspective" whose \favorite point of view is a God's Eye point of view" (1981, p. 49). Putnam sought to show that this externalist perspective is deeply untenable. To this end, he treated correspondence in terms of model-theoretic satisfaction. -
Set-Theoretic Geology, the Ultimate Inner Model, and New Axioms
Set-theoretic Geology, the Ultimate Inner Model, and New Axioms Justin William Henry Cavitt (860) 949-5686 [email protected] Advisor: W. Hugh Woodin Harvard University March 20, 2017 Submitted in partial fulfillment of the requirements for the degree of Bachelor of Arts in Mathematics and Philosophy Contents 1 Introduction 2 1.1 Author’s Note . .4 1.2 Acknowledgements . .4 2 The Independence Problem 5 2.1 Gödelian Independence and Consistency Strength . .5 2.2 Forcing and Natural Independence . .7 2.2.1 Basics of Forcing . .8 2.2.2 Forcing Facts . 11 2.2.3 The Space of All Forcing Extensions: The Generic Multiverse 15 2.3 Recap . 16 3 Approaches to New Axioms 17 3.1 Large Cardinals . 17 3.2 Inner Model Theory . 25 3.2.1 Basic Facts . 26 3.2.2 The Constructible Universe . 30 3.2.3 Other Inner Models . 35 3.2.4 Relative Constructibility . 38 3.3 Recap . 39 4 Ultimate L 40 4.1 The Axiom V = Ultimate L ..................... 41 4.2 Central Features of Ultimate L .................... 42 4.3 Further Philosophical Considerations . 47 4.4 Recap . 51 1 5 Set-theoretic Geology 52 5.1 Preliminaries . 52 5.2 The Downward Directed Grounds Hypothesis . 54 5.2.1 Bukovský’s Theorem . 54 5.2.2 The Main Argument . 61 5.3 Main Results . 65 5.4 Recap . 74 6 Conclusion 74 7 Appendix 75 7.1 Notation . 75 7.2 The ZFC Axioms . 76 7.3 The Ordinals . 77 7.4 The Universe of Sets . 77 7.5 Transitive Models and Absoluteness . -
UNIVERSALLY BAIRE SETS and GENERIC ABSOLUTENESS TREVOR M. WILSON Introduction Generic Absoluteness Principles Assert That Certai
UNIVERSALLY BAIRE SETS AND GENERIC ABSOLUTENESS TREVOR M. WILSON Abstract. We prove several equivalences and relative consistency re- 2 uBλ sults involving notions of generic absoluteness beyond Woodin's (Σ1) generic absoluteness for a limit of Woodin cardinals λ. In particular,e we R 2 uBλ prove that two-step 9 (Π1) generic absoluteness below a measur- able cardinal that is a limite of Woodin cardinals has high consistency 2 uBλ strength, and that it is equivalent with the existence of trees for (Π1) formulas. The construction of these trees uses a general method for building an absolute complement for a given tree T assuming many \failures of covering" for the models L(T;Vα) below a measurable car- dinal. Introduction Generic absoluteness principles assert that certain properties of the set- theoretic universe cannot be changed by the method of forcing. Some pro- perties, such as the truth or falsity of the Continuum Hypothesis, can always be changed by forcing. Accordingly, one approach to formulating generic ab- soluteness principles is to consider properties of a limited complexity such 1 1 as those corresponding to pointclasses in descriptive set theory: Σ2, Σ3, projective, and so on. (Another approach is to limit the class ofe allowede forcing notions. For a survey of results in this area, see [1].) Shoenfield’s 1 absoluteness theorem implies that Σ2 statements are always generically ab- solute. Generic absoluteness principlese for larger pointclasses tend to be equiconsistent with strong axioms of infinity, and they may also relate to the extent of the universally Baire sets. 1 For example, one-step Σ3 generic absoluteness is shown in [3] to be equiconsistent with the existencee of a Σ2-reflecting cardinal and to be equiv- 1 alent with the statement that every ∆2 set of reals is universally Baire. -
The Open Handbook of Formal Epistemology
THEOPENHANDBOOKOFFORMALEPISTEMOLOGY Richard Pettigrew &Jonathan Weisberg,Eds. THEOPENHANDBOOKOFFORMAL EPISTEMOLOGY Richard Pettigrew &Jonathan Weisberg,Eds. Published open access by PhilPapers, 2019 All entries copyright © their respective authors and licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License. LISTOFCONTRIBUTORS R. A. Briggs Stanford University Michael Caie University of Toronto Kenny Easwaran Texas A&M University Konstantin Genin University of Toronto Franz Huber University of Toronto Jason Konek University of Bristol Hanti Lin University of California, Davis Anna Mahtani London School of Economics Johanna Thoma London School of Economics Michael G. Titelbaum University of Wisconsin, Madison Sylvia Wenmackers Katholieke Universiteit Leuven iii For our teachers Overall, and ultimately, mathematical methods are necessary for philosophical progress. — Hannes Leitgeb There is no mathematical substitute for philosophy. — Saul Kripke PREFACE In formal epistemology, we use mathematical methods to explore the questions of epistemology and rational choice. What can we know? What should we believe and how strongly? How should we act based on our beliefs and values? We begin by modelling phenomena like knowledge, belief, and desire using mathematical machinery, just as a biologist might model the fluc- tuations of a pair of competing populations, or a physicist might model the turbulence of a fluid passing through a small aperture. Then, we ex- plore, discover, and justify the laws governing those phenomena, using the precision that mathematical machinery affords. For example, we might represent a person by the strengths of their beliefs, and we might measure these using real numbers, which we call credences. Having done this, we might ask what the norms are that govern that person when we represent them in that way. -
SHEET 14: LINEAR ALGEBRA 14.1 Vector Spaces
SHEET 14: LINEAR ALGEBRA Throughout this sheet, let F be a field. In examples, you need only consider the field F = R. 14.1 Vector spaces Definition 14.1. A vector space over F is a set V with two operations, V × V ! V :(x; y) 7! x + y (vector addition) and F × V ! V :(λ, x) 7! λx (scalar multiplication); that satisfy the following axioms. 1. Addition is commutative: x + y = y + x for all x; y 2 V . 2. Addition is associative: x + (y + z) = (x + y) + z for all x; y; z 2 V . 3. There is an additive identity 0 2 V satisfying x + 0 = x for all x 2 V . 4. For each x 2 V , there is an additive inverse −x 2 V satisfying x + (−x) = 0. 5. Scalar multiplication by 1 fixes vectors: 1x = x for all x 2 V . 6. Scalar multiplication is compatible with F :(λµ)x = λ(µx) for all λ, µ 2 F and x 2 V . 7. Scalar multiplication distributes over vector addition and over scalar addition: λ(x + y) = λx + λy and (λ + µ)x = λx + µx for all λ, µ 2 F and x; y 2 V . In this context, elements of F are called scalars and elements of V are called vectors. Definition 14.2. Let n be a nonnegative integer. The coordinate space F n = F × · · · × F is the set of all n-tuples of elements of F , conventionally regarded as column vectors. Addition and scalar multiplication are defined componentwise; that is, 2 3 2 3 2 3 2 3 x1 y1 x1 + y1 λx1 6x 7 6y 7 6x + y 7 6λx 7 6 27 6 27 6 2 2 7 6 27 if x = 6 . -
Primitive Recursive Functions Are Recursively Enumerable
AN ENUMERATION OF THE PRIMITIVE RECURSIVE FUNCTIONS WITHOUT REPETITION SHIH-CHAO LIU (Received April 15,1900) In a theorem and its corollary [1] Friedberg gave an enumeration of all the recursively enumerable sets without repetition and an enumeration of all the partial recursive functions without repetition. This note is to prove a similar theorem for the primitive recursive functions. The proof is only a classical one. We shall show that the theorem is intuitionistically unprovable in the sense of Kleene [2]. For similar reason the theorem by Friedberg is also intuitionistical- ly unprovable, which is not stated in his paper. THEOREM. There is a general recursive function ψ(n, a) such that the sequence ψ(0, a), ψ(l, α), is an enumeration of all the primitive recursive functions of one variable without repetition. PROOF. Let φ(n9 a) be an enumerating function of all the primitive recursive functions of one variable, (See [3].) We define a general recursive function v(a) as follows. v(0) = 0, v(n + 1) = μy, where μy is the least y such that for each j < n + 1, φ(y, a) =[= φ(v(j), a) for some a < n + 1. It is noted that the value v(n + 1) can be found by a constructive method, for obviously there exists some number y such that the primitive recursive function <p(y> a) takes a value greater than all the numbers φ(v(0), 0), φ(y(Ϋ), 0), , φ(v(n\ 0) f or a = 0 Put ψ(n, a) = φ{v{n), a). -
The Baire Category Theorem in Weak Subsystems of Second-Order Arithmetic Author(S): Douglas K
The Baire Category Theorem in Weak Subsystems of Second-Order Arithmetic Author(s): Douglas K. Brown and Stephen G. Simpson Reviewed work(s): Source: The Journal of Symbolic Logic, Vol. 58, No. 2 (Jun., 1993), pp. 557-578 Published by: Association for Symbolic Logic Stable URL: http://www.jstor.org/stable/2275219 . Accessed: 05/04/2012 09:29 Your use of the JSTOR archive indicates your acceptance of the Terms & Conditions of Use, available at . http://www.jstor.org/page/info/about/policies/terms.jsp JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship. For more information about JSTOR, please contact [email protected]. Association for Symbolic Logic is collaborating with JSTOR to digitize, preserve and extend access to The Journal of Symbolic Logic. http://www.jstor.org THE JOURNAL OF SYMBOLIC LoGic Volume58, Number2, June 1993 THE BAIRE CATEGORY THEOREM IN WEAK SUBSYSTEMS OF SECOND-ORDER ARITHMETIC DOUGLAS K. BROWN AND STEPHEN G. SIMPSON Abstract.Working within weak subsystemsof second-orderarithmetic Z2 we considertwo versionsof theBaire Category theorem which are notequivalent over the base systemRCAo. We showthat one version (B.C.T.I) is provablein RCAo whilethe second version (B.C.T.II) requiresa strongersystem. We introduce two new subsystemsof Z2, whichwe call RCA' and WKL', and show that RCA' sufficesto prove B.C.T.II. Some model theoryof WKL' and its importancein viewof Hilbert'sprogram is discussed,as well as applicationsof our resultsto functionalanalysis. -
Polya Enumeration Theorem
Polya Enumeration Theorem Sasha Patotski Cornell University [email protected] December 11, 2015 Sasha Patotski (Cornell University) Polya Enumeration Theorem December 11, 2015 1 / 10 Cosets A left coset of H in G is gH where g 2 G (H is on the right). A right coset of H in G is Hg where g 2 G (H is on the left). Theorem If two left cosets of H in G intersect, then they coincide, and similarly for right cosets. Thus, G is a disjoint union of left cosets of H and also a disjoint union of right cosets of H. Corollary(Lagrange's theorem) If G is a finite group and H is a subgroup of G, then the order of H divides the order of G. In particular, the order of every element of G divides the order of G. Sasha Patotski (Cornell University) Polya Enumeration Theorem December 11, 2015 2 / 10 Applications of Lagrange's Theorem Theorem n! For any integers n ≥ 0 and 0 ≤ m ≤ n, the number m!(n−m)! is an integer. Theorem (ab)! (ab)! For any positive integers a; b the ratios (a!)b and (a!)bb! are integers. Theorem For an integer m > 1 let '(m) be the number of invertible numbers modulo m. For m ≥ 3 the number '(m) is even. Sasha Patotski (Cornell University) Polya Enumeration Theorem December 11, 2015 3 / 10 Polya's Enumeration Theorem Theorem Suppose that a finite group G acts on a finite set X . Then the number of colorings of X in n colors inequivalent under the action of G is 1 X N(n) = nc(g) jGj g2G where c(g) is the number of cycles of g as a permutation of X . -
Axiomatic Set Teory P.D.Welch
Axiomatic Set Teory P.D.Welch. August 16, 2020 Contents Page 1 Axioms and Formal Systems 1 1.1 Introduction 1 1.2 Preliminaries: axioms and formal systems. 3 1.2.1 The formal language of ZF set theory; terms 4 1.2.2 The Zermelo-Fraenkel Axioms 7 1.3 Transfinite Recursion 9 1.4 Relativisation of terms and formulae 11 2 Initial segments of the Universe 17 2.1 Singular ordinals: cofinality 17 2.1.1 Cofinality 17 2.1.2 Normal Functions and closed and unbounded classes 19 2.1.3 Stationary Sets 22 2.2 Some further cardinal arithmetic 24 2.3 Transitive Models 25 2.4 The H sets 27 2.4.1 H - the hereditarily finite sets 28 2.4.2 H - the hereditarily countable sets 29 2.5 The Montague-Levy Reflection theorem 30 2.5.1 Absoluteness 30 2.5.2 Reflection Theorems 32 2.6 Inaccessible Cardinals 34 2.6.1 Inaccessible cardinals 35 2.6.2 A menagerie of other large cardinals 36 3 Formalising semantics within ZF 39 3.1 Definite terms and formulae 39 3.1.1 The non-finite axiomatisability of ZF 44 3.2 Formalising syntax 45 3.3 Formalising the satisfaction relation 46 3.4 Formalising definability: the function Def. 47 3.5 More on correctness and consistency 48 ii iii 3.5.1 Incompleteness and Consistency Arguments 50 4 The Constructible Hierarchy 53 4.1 The L -hierarchy 53 4.2 The Axiom of Choice in L 56 4.3 The Axiom of Constructibility 57 4.4 The Generalised Continuum Hypothesis in L. -
Measure, Integral and Probability
Marek Capinski´ and Ekkehard Kopp Measure, Integral and Probability Springer-Verlag Berlin Heidelberg NewYork London Paris Tokyo Hong Kong Barcelona Budapest To our children; grandchildren: Piotr, Maciej, Jan, Anna; Luk asz Anna, Emily Preface The central concepts in this book are Lebesgue measure and the Lebesgue integral. Their role as standard fare in UK undergraduate mathematics courses is not wholly secure; yet they provide the principal model for the development of the abstract measure spaces which underpin modern probability theory, while the Lebesgue function spaces remain the main source of examples on which to test the methods of functional analysis and its many applications, such as Fourier analysis and the theory of partial differential equations. It follows that not only budding analysts have need of a clear understanding of the construction and properties of measures and integrals, but also that those who wish to contribute seriously to the applications of analytical methods in a wide variety of areas of mathematics, physics, electronics, engineering and, most recently, finance, need to study the underlying theory with some care. We have found remarkably few texts in the current literature which aim explicitly to provide for these needs, at a level accessible to current under- graduates. There are many good books on modern probability theory, and increasingly they recognize the need for a strong grounding in the tools we develop in this book, but all too often the treatment is either too advanced for an undergraduate audience or else somewhat perfunctory. We hope therefore that the current text will not be regarded as one which fills a much-needed gap in the literature! One fundamental decision in developing a treatment of integration is whether to begin with measures or integrals, i.e. -
The Axiom of Choice and Its Implications
THE AXIOM OF CHOICE AND ITS IMPLICATIONS KEVIN BARNUM Abstract. In this paper we will look at the Axiom of Choice and some of the various implications it has. These implications include a number of equivalent statements, and also some less accepted ideas. The proofs discussed will give us an idea of why the Axiom of Choice is so powerful, but also so controversial. Contents 1. Introduction 1 2. The Axiom of Choice and Its Equivalents 1 2.1. The Axiom of Choice and its Well-known Equivalents 1 2.2. Some Other Less Well-known Equivalents of the Axiom of Choice 3 3. Applications of the Axiom of Choice 5 3.1. Equivalence Between The Axiom of Choice and the Claim that Every Vector Space has a Basis 5 3.2. Some More Applications of the Axiom of Choice 6 4. Controversial Results 10 Acknowledgments 11 References 11 1. Introduction The Axiom of Choice states that for any family of nonempty disjoint sets, there exists a set that consists of exactly one element from each element of the family. It seems strange at first that such an innocuous sounding idea can be so powerful and controversial, but it certainly is both. To understand why, we will start by looking at some statements that are equivalent to the axiom of choice. Many of these equivalences are very useful, and we devote much time to one, namely, that every vector space has a basis. We go on from there to see a few more applications of the Axiom of Choice and its equivalents, and finish by looking at some of the reasons why the Axiom of Choice is so controversial.