DOCSLIB.ORG

Naïve Set Theory Basic Notations for Sets • for Sets, We'll Use Variabl

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Naïve Set Theory Basic Notations for Sets • for Sets, We'll Use Variabl Today’s topics Introduction to Set Theory (§1.6) • Sets • A set is a new type of structure, representing an unordered – Indirect, by cases, and direct collection (group, plurality) of zero or more distinct – Rules of logical inference (different) objects. – Correct & fallacious proofs • Set theory deals with operations between, relations among, and statements about sets. • Reading: Sections 1.6-1.7 • Sets are ubiquitous in computer software systems. • Upcoming • All of mathematics can be defined in terms of some form – Functions of set theory (using predicate logic). CompSci 102 © Michael Frank CompSci 102 © Michael Frank 4.1 4.2 Naïve set theory Basic notations for sets • Basic premise: Any collection or class of objects • For sets, we’ll use variables S, T, U, … (elements) that we can describe (by any means whatsoever) constitutes a set. • We can denote a set S in writing by listing • But, the resulting theory turns out to be logically all of its elements in curly braces: inconsistent! – {a, b, c} is the set of whatever 3 objects are – This means, there exist naïve set theory propositions p such that you can prove that both p and ¬p follow logically from the denoted by a, b, c. axioms of the theory! • Set builder notation: For any proposition – The conjunction of the axioms is a contradiction! – This theory is fundamentally uninteresting, because any possible P(x) over any universe of discourse, statement in it can be (very trivially) “proved” by contradiction! {x|P(x)} is the set of all x such that P(x). • More sophisticated set theories fix this problem. CompSci 102 © Michael Frank CompSci 102 © Michael Frank 4.3 4.4 Basic properties of sets Definition of Set Equality • Sets are inherently unordered: • Two sets are declared to be equal if and only if they contain exactly the same elements. – No matter what objects a, b, and c denote, • In particular, it does not matter how the set is defined or {a, b, c} = {a, c, b} = {b, a, c} = denoted. {b, c, a} = {c, a, b} = {c, b, a}. • For example: The set {1, 2, 3, 4} = • All elements are distinct (unequal); {x | x is an integer where x>0 and x<5 } = multiple listings make no difference! {x | x is a positive integer whose square multiple listings make no difference! is >0 and <25} – If a=b, then {a, b, c} = {a, c} = {b, c} = {a, a, b, a, b, c, c, c, c}. – This set contains (at most) 2 elements! CompSci 102 © Michael Frank CompSci 102 © Michael Frank 4.5 4.6 Infinite Sets Venn Diagrams • Conceptually, sets may be infinite (i.e., not finite, John Venn without end, unending). 1834-1923 • Symbols for some special infinite sets: N = {0, 1, 2, …} The Natural numbers. Z = {…, -2, -1, 0, 1, 2, …} The Zntegers. R = The “Real” numbers, such as 374.1828471929498181917281943125… • “Blackboard Bold” or double-struck font (,,) is also often used for these special number sets. • Infinite sets come in different sizes! More on this after module #4 (functions). CompSci 102 © Michael Frank CompSci 102 © Michael Frank 4.7 4.8 Basic Set Relations: Member of The Empty Set • xS (“x is in S”) is the proposition that • (“null”, “the empty set”) is the unique object x is an lement or member of set S. set that contains no elements whatsoever. – e.g. 3N, “a”{x | x is a letter of the alphabet} • = {} = {x|False} – Can define set equality in terms of relation: • No matter the domain of discourse, S,T: S=T ( x: x S x T) we have the axiom ¬x: x. “Two sets are equal iff they have all the same members.” • xS : ¬(xS) “x is not in S” CompSci 102 © Michael Frank CompSci 102 © Michael Frank 4.9 4.10 Subset and Superset Relations Proper (Strict) Subsets & Supersets • ST (“S is a subset of T”) means that every • ST (“S is a proper subset of T”) means element of S is also an element of T. that ST but T / S . Similar for ST. • ST x (xS xT) Example: • S, SS. {1,2} {1,2,3} • ST (“S is a superset of T”) means TS. S • Note S=T ST ST. T • S / T means ¬(ST), i.e. x(xS xT) Venn Diagram equivalent of ST CompSci 102 © Michael Frank CompSci 102 © Michael Frank 4.11 4.12 Sets Are Objects, Too! Cardinality and Finiteness • The objects that are elements of a set may • |S| (read “the cardinality of S”) is a measure themselves be sets. of how many different elements S has. • E.g. let S={x | x {1,2,3}} • E.g., ||=0, |{1,2,3}| = 3, |{a,b}| = 2, then S={, |{{1,2,3},{4,5}}| = ____ {1}, {2}, {3}, • If |S|N, then we say S is finite. {1,2}, {1,3}, {2,3}, Otherwise, we say S is infinite. {1,2,3}} {1,2,3}} • What are some infinite sets we’ve seen? • Note that 1 {1} {{1}} !!!! CompSci 102 © Michael Frank CompSci 102 © Michael Frank 4.13 4.14 The Power Set Operation Review: Set Notations So Far • The power set P(S) of a set S is the set of • Variable objects x, y, z; sets S, T, U. all subsets of S. P(S) : {x | xS}. • Literal set {a, b, c} and set-builder {x|P(x)}. • E.g. P({a,b}) = {, {a}, {b}, {a,b}}. • relational operator, and the empty set . S • Sometimes P(S) is written 2S. • Set relations =, , , , , , etc. Note that for finite S, |P(S)| = 2|S|. Note that for finite S, |P(S)| = 2 . • Venn diagrams. • It turns out S:|P(S)|>|S|, e.g. |P(N)| > |N|. • Cardinality |S| and infinite sets N, Z, R. There are different sizes of infinite sets! • Power sets P(S). CompSci 102 © Michael Frank CompSci 102 © Michael Frank 4.15 4.16 Naïve Set Theory is Inconsistent Ordered n-tuples • There are some naïve set descriptions that lead to pathological structures that are not well-defined. • These are like sets, except that duplicates – (That do not have self-consistent properties.) matter, and the order makes a difference. • These “sets” mathematically cannot exist. • For nN, an ordered n-tuple or a sequence • E.g. let S = {x | x x }. Is S S? • E.g. let S = {x | xx }. Is SS? or list of length n is written (a , a , …, a ). • Therefore, consistent set theories must restrict the 1 2 n language that can be used to describe sets. Its first element is a1, etc. Contrast with • For purposes of this class, don’t worry about it! • Note that (1, 2) (2, 1) (2, 1, 1). sets’ {} • Empty sequence, singlets, pairs, triples, Bertrand Russell quadruples, quintuples, …, n-tuples. 1872-1970 CompSci 102 © Michael Frank CompSci 102 © Michael Frank 4.17 4.18 Cartesian Products of Sets Review of §1.6 • For sets A, B, their Cartesian product • Sets S, T, U… Special sets N, Z, R. AB : {(a, b) | aA bB }. • Set notations {a,b,...}, {x|P(x)}… • E.g. {a,b}{1,2} = {(a,1),(a,2),(b,1),(b,2)} • Set relation operators xS, S T, ST, S=T, • Note that for finite A, B, |AB|=|A||B|. ST, ST. (These form propositions.) • Note that the Cartesian product is not • Finite vs. infinite sets. commutative: i.e., ¬AB: AB=BA. • Set operations |S|, P(S), ST. • Extends to A1 A2 … An... • Next up: §1.5: More set ops: , , . René Descartes CompSci 102 © Michael Frank CompSci 102 © Michael Frank (1596-1650)4.19 4.20 Start §1.7: The Union Operator Union Examples • For sets A, B, theirnion AB is the set • {a,b,c}{2,3} = {a,b,c,2,3} containing all elements that are either in A, • {2,3,5}{3,5,7} = {2,3,5,3,5,7} ={2,3,5,7} or (“”) in B (or, of course, in both). Think “The United • Formally, A,B: AB = {x | xA xB}. States of America • Note that AB is a superset of both A and includes every person who worked B (in fact, it is the smallest such superset): in any U.S. state A, B: (AB A) (AB B) last year.” (This is how the IRS sees it...) CompSci 102 © Michael Frank CompSci 102 © Michael Frank 4.21 4.22 The Intersection Operator Intersection Examples • For sets A, B, their intersection AB is the • {a,b,c}{2,3} = ___ set containing all elements that are • {2,4,6}{3,4,5} = ______{4} simultaneously in A and (“”) in B. Think “The • Formally, A,B: AB={x | xA xB}. intersection of • Note that AB is a subset of both A and B University Ave. and W 13th St. is just (in fact it is the largest such subset): that part of the road A, B: (AB A) (AB B) surface that lies on both streets.” CompSci 102 © Michael Frank CompSci 102 © Michael Frank 4.23 4.24 Disjointedness Inclusion-Exclusion Principle Help, I’ve • Two sets A, B are called been • How many elements are in AB? disjointed! disjoint (i.e., unjoined) |AB| = |A| + |B| |AB| iff their intersection is • Example: How many students are on our empty. (AB=) class email list? Consider set E = I M, • Example: the set of even I = {s | s turned in an information sheet} integers is disjoint with M = {s | s sent the TAs their email address} the set of odd integers. • Some students did both! |E| = |IM| = |I| + |M| |IM| CompSci 102 © Michael Frank CompSci 102 © Michael Frank 4.25 4.26 Set Difference Set Difference Examples • For sets A, B, the difference of A and B, • {1,2,3,4,5,6} {2,3,5,7,9,11} = written AB, is the set of all elements that ___________{1,4,6} are in A but not B.
Load more

Recommended publications
  • Mathematics 144 Set Theory Fall 2012 Version
    MATHEMATICS 144 SET THEORY FALL 2012 VERSION Table of Contents I. General considerations.……………………………………………………………………………………………………….1 1. Overview of the course…………………………………………………………………………………………………1 2. Historical background and motivation………………………………………………………….………………4 3. Selected problems………………………………………………………………………………………………………13 I I. Basic concepts. ………………………………………………………………………………………………………………….15 1. Topics from logic…………………………………………………………………………………………………………16 2. Notation and first steps………………………………………………………………………………………………26 3. Simple examples…………………………………………………………………………………………………………30 I I I. Constructions in set theory.………………………………………………………………………………..……….34 1. Boolean algebra operations.……………………………………………………………………………………….34 2. Ordered pairs and Cartesian products……………………………………………………………………… ….40 3. Larger constructions………………………………………………………………………………………………..….42 4. A convenient assumption………………………………………………………………………………………… ….45 I V. Relations and functions ……………………………………………………………………………………………….49 1.Binary relations………………………………………………………………………………………………………… ….49 2. Partial and linear orderings……………………………..………………………………………………… ………… 56 3. Functions…………………………………………………………………………………………………………… ….…….. 61 4. Composite and inverse function.…………………………………………………………………………… …….. 70 5. Constructions involving functions ………………………………………………………………………… ……… 77 6. Order types……………………………………………………………………………………………………… …………… 80 i V. Number systems and set theory …………………………………………………………………………………. 84 1. The Natural Numbers and Integers…………………………………………………………………………….83 2. Finite induction
    [Show full text]
  • Redalyc.Sets and Pluralities
    Red de Revistas Científicas de América Latina, el Caribe, España y Portugal Sistema de Información Científica Gustavo Fernández Díez Sets and Pluralities Revista Colombiana de Filosofía de la Ciencia, vol. IX, núm. 19, 2009, pp. 5-22, Universidad El Bosque Colombia Available in: http://www.redalyc.org/articulo.oa?id=41418349001 Revista Colombiana de Filosofía de la Ciencia, ISSN (Printed Version): 0124-4620 [email protected] Universidad El Bosque Colombia How to cite Complete issue More information about this article Journal's homepage www.redalyc.org Non-Profit Academic Project, developed under the Open Acces Initiative Sets and Pluralities1 Gustavo Fernández Díez2 Resumen En este artículo estudio el trasfondo filosófico del sistema de lógica conocido como “lógica plural”, o “lógica de cuantificadores plurales”, de aparición relativamente reciente (y en alza notable en los últimos años). En particular, comparo la noción de “conjunto” emanada de la teoría axiomática de conjuntos, con la noción de “plura- lidad” que se encuentra detrás de este nuevo sistema. Mi conclusión es que los dos son completamente diferentes en su alcance y sus límites, y que la diferencia proviene de las diferentes motivaciones que han dado lugar a cada uno. Mientras que la teoría de conjuntos es una teoría genuinamente matemática, que tiene el interés matemático como ingrediente principal, la lógica plural ha aparecido como respuesta a considera- ciones lingüísticas, relacionadas con la estructura lógica de los enunciados plurales del inglés y el resto de los lenguajes naturales. Palabras clave: conjunto, teoría de conjuntos, pluralidad, cuantificación plural, lógica plural. Abstract In this paper I study the philosophical background of the relatively recent (and in the last few years increasingly flourishing) system of logic called “plural logic”, or “logic of plural quantifiers”.
    [Show full text]
  • Chapter 1 Logic and Set Theory
    Chapter 1 Logic and Set Theory To criticize mathematics for its abstraction is to miss the point entirely. Abstraction is what makes mathematics work. If you concentrate too closely on too limited an application of a mathematical idea, you rob the mathematician of his most important tools: analogy, generality, and simplicity. – Ian Stewart Does God play dice? The mathematics of chaos In mathematics, a proof is a demonstration that, assuming certain axioms, some statement is necessarily true. That is, a proof is a logical argument, not an empir- ical one. One must demonstrate that a proposition is true in all cases before it is considered a theorem of mathematics. An unproven proposition for which there is some sort of empirical evidence is known as a conjecture. Mathematical logic is the framework upon which rigorous proofs are built. It is the study of the principles and criteria of valid inference and demonstrations. Logicians have analyzed set theory in great details, formulating a collection of axioms that affords a broad enough and strong enough foundation to mathematical reasoning. The standard form of axiomatic set theory is denoted ZFC and it consists of the Zermelo-Fraenkel (ZF) axioms combined with the axiom of choice (C). Each of the axioms included in this theory expresses a property of sets that is widely accepted by mathematicians. It is unfortunately true that careless use of set theory can lead to contradictions. Avoiding such contradictions was one of the original motivations for the axiomatization of set theory. 1 2 CHAPTER 1. LOGIC AND SET THEORY A rigorous analysis of set theory belongs to the foundations of mathematics and mathematical logic.
    [Show full text]
  • Lecture 7 1 Overview 2 Sequences and Cartesian Products
    COMPSCI 230: Discrete Mathematics for Computer Science February 4, 2019 Lecture 7 Lecturer: Debmalya Panigrahi Scribe: Erin Taylor 1 Overview In this lecture, we introduce sequences and Cartesian products. We also define relations and study their properties. 2 Sequences and Cartesian Products Recall that two fundamental properties of sets are the following: 1. A set does not contain multiple copies of the same element. 2. The order of elements in a set does not matter. For example, if S = f1, 4, 3g then S is also equal to f4, 1, 3g and f1, 1, 3, 4, 3g. If we remove these two properties from a set, the result is known as a sequence. Definition 1. A sequence is an ordered collection of elements where an element may repeat multiple times. An example of a sequence with three elements is (1, 4, 3). This sequence, unlike the statement above for sets, is not equal to (4, 1, 3), nor is it equal to (1, 1, 3, 4, 3). Often the following shorthand notation is used to define a sequence: 1 s = 8i 2 N i 2i Here the sequence (s1, s2, ... ) is formed by plugging i = 1, 2, ... into the expression to find s1, s2, and so on. This sequence is (1/2, 1/4, 1/8, ... ). We now define a new set operator; the result of this operator is a set whose elements are two-element sequences. Definition 2. The Cartesian product of sets A and B, denoted by A × B, is a set defined as follows: A × B = f(a, b) : a 2 A, b 2 Bg.
    [Show full text]
  • Cartesian Powers
    Cartesian Powers sequences subsets functions exponential growth +, -, x, … Analogies between number and set operations Numbers Sets Addition Disjoint union Subtraction Complement Multiplication Cartesian product Exponents ? Cartesian Powers of a Set Cartesian product of a set with itself is a Cartesian power A2 = A x A Cartesian square An ≝ A x A x … x A n’th Cartesian power n X |An| = | A x A x … x A | = |A| x |A| x … x |A| = |A|n Practical and theoretical applications Applications California License Plates California Till 1904 no registration 1905-1912 various registration formats one-time $2 fee 1913 ≤6 digits 106 = 1 million If all OK Sam? 1956 263 x 103 ≈ 17.6 m 1969 263 x 104 ≈ 176 m Binary Strings {0,1}n = { length-n binary strings } n-bit strings 0 1 1 n Set Strings Size {0,1} 0 {0,1}0 Λ 1 00 01 1 {0,1}1 0, 1 2 {0,1}2 2 {0,1}2 00, 01, 10, 11 4 000, 001, 011, 010, 10 11 3 {0,1}3 8 100, 110, 101, 111 001 011 … … … … 010 {0,1}3 n {0,1}n 0…0, …, 1…1 2n 000 111 101 | {0,1}n | =|{0,1}|n = 2n 100 110 Subsets The power set of S, denoted ℙ(S), is the collection of all subsets of S ℙ( {a,b} ) = { {}, {a}, {b}, {a,b} } ℙ({a,b}) and {0,1}2 ℙ({a,b}) a b {0,1}2 Subsets Binary strings {} 00 |ℙ(S)| = ? of S of length |S| ❌ ❌ {b} ❌ ✅ 01 {a} ✅ ❌ 10 |S| 1-1 correspondence between ℙ(S) and {0,1} {a,b} ✅ ✅ 11 |ℙ(S)| = | {0,1}|S| | = 2|S| The size of the power set is the power of the set size Functions A function from A to B maps every element a ∈ A to an element f(a) ∈ B Define a function f: specify f(a) for every a ∈ A f from {1,2,3} to {p, u} specify
    [Show full text]
  • Course 221: Michaelmas Term 2006 Section 1: Sets, Functions and Countability
    Course 221: Michaelmas Term 2006 Section 1: Sets, Functions and Countability David R. Wilkins Copyright c David R. Wilkins 2006 Contents 1 Sets, Functions and Countability 2 1.1 Sets . 2 1.2 Cartesian Products of Sets . 5 1.3 Relations . 6 1.4 Equivalence Relations . 6 1.5 Functions . 8 1.6 The Graph of a Function . 9 1.7 Functions and the Empty Set . 10 1.8 Injective, Surjective and Bijective Functions . 11 1.9 Inverse Functions . 13 1.10 Preimages . 14 1.11 Finite and Infinite Sets . 16 1.12 Countability . 17 1.13 Cartesian Products and Unions of Countable Sets . 18 1.14 Uncountable Sets . 21 1.15 Power Sets . 21 1.16 The Cantor Set . 22 1 1 Sets, Functions and Countability 1.1 Sets A set is a collection of objects; these objects are known as elements of the set. If an element x belongs to a set X then we denote this fact by writing x ∈ X. Sets with small numbers of elements can be specified by listing the elements of the set enclosed within braces. For example {a, b, c, d} is the set consisting of the elements a, b, c and d. Two sets are equal if and only if they have the same elements. The empty set ∅ is the set with no elements. Standard notations N, Z, Q, R and C are adopted for the following sets: • the set N of positive integers; • the set Z of integers; • the set Q of rational numbers; • the set R of real numbers; • the set C of complex numbers.
    [Show full text]
  • Equivalents to the Axiom of Choice and Their Uses A
    EQUIVALENTS TO THE AXIOM OF CHOICE AND THEIR USES A Thesis Presented to The Faculty of the Department of Mathematics California State University, Los Angeles In Partial Fulfillment of the Requirements for the Degree Master of Science in Mathematics By James Szufu Yang c 2015 James Szufu Yang ALL RIGHTS RESERVED ii The thesis of James Szufu Yang is approved. Mike Krebs, Ph.D. Kristin Webster, Ph.D. Michael Hoffman, Ph.D., Committee Chair Grant Fraser, Ph.D., Department Chair California State University, Los Angeles June 2015 iii ABSTRACT Equivalents to the Axiom of Choice and Their Uses By James Szufu Yang In set theory, the Axiom of Choice (AC) was formulated in 1904 by Ernst Zermelo. It is an addition to the older Zermelo-Fraenkel (ZF) set theory. We call it Zermelo-Fraenkel set theory with the Axiom of Choice and abbreviate it as ZFC. This paper starts with an introduction to the foundations of ZFC set the- ory, which includes the Zermelo-Fraenkel axioms, partially ordered sets (posets), the Cartesian product, the Axiom of Choice, and their related proofs. It then intro- duces several equivalent forms of the Axiom of Choice and proves that they are all equivalent. In the end, equivalents to the Axiom of Choice are used to prove a few fundamental theorems in set theory, linear analysis, and abstract algebra. This paper is concluded by a brief review of the work in it, followed by a few points of interest for further study in mathematics and/or set theory. iv ACKNOWLEDGMENTS Between the two department requirements to complete a master's degree in mathematics − the comprehensive exams and a thesis, I really wanted to experience doing a research and writing a serious academic paper.
    [Show full text]
  • Naïve Set Theory Basic Definitions Naïve Set Theory Is the Non-Axiomatic Treatment of Set Theory
    Naïve Set Theory Basic Definitions Naïve set theory is the non-axiomatic treatment of set theory. In the axiomatic treatment, which we will only allude to at times, a set is an undefined term. For us however, a set will be thought of as a collection of some (possibly none) objects. These objects are called the members (or elements) of the set. We use the symbol "∈" to indicate membership in a set. Thus, if A is a set and x is one of its members, we write x ∈ A and say "x is an element of A" or "x is in A" or "x is a member of A". Note that "∈" is not the same as the Greek letter "ε" epsilon. Basic Definitions Sets can be described notationally in many ways, but always using the set brackets "{" and "}". If possible, one can just list the elements of the set: A = {1,3, oranges, lions, an old wad of gum} or give an indication of the elements: ℕ = {1,2,3, ... } ℤ = {..., -2,-1,0,1,2, ...} or (most frequently in mathematics) using set-builder notation: S = {x ∈ ℝ | 1 < x ≤ 7 } or {x ∈ ℝ : 1 < x ≤ 7 } which is read as "S is the set of real numbers x, such that x is greater than 1 and less than or equal to 7". In some areas of mathematics sets may be denoted by special notations. For instance, in analysis S would be written (1,7]. Basic Definitions Note that sets do not contain repeated elements. An element is either in or not in a set, never "in the set 5 times" for instance.
    [Show full text]
  • Worksheet: Cardinality, Countable and Uncountable Sets
    Math 347 Worksheet: Cardinality A.J. Hildebrand Worksheet: Cardinality, Countable and Uncountable Sets • Key Tool: Bijections. • Definition: Let A and B be sets. A bijection from A to B is a function f : A ! B that is both injective and surjective. • Properties of bijections: ∗ Compositions: The composition of bijections is a bijection. ∗ Inverse functions: The inverse function of a bijection is a bijection. ∗ Symmetry: The \bijection" relation is symmetric: If there is a bijection f from A to B, then there is also a bijection g from B to A, given by the inverse of f. • Key Definitions. • Cardinality: Two sets A and B are said to have the same cardinality if there exists a bijection from A to B. • Finite sets: A set is called finite if it is empty or has the same cardinality as the set f1; 2; : : : ; ng for some n 2 N; it is called infinite otherwise. • Countable sets: A set A is called countable (or countably infinite) if it has the same cardinality as N, i.e., if there exists a bijection between A and N. Equivalently, a set A is countable if it can be enumerated in a sequence, i.e., if all of its elements can be listed as an infinite sequence a1; a2;::: . NOTE: The above definition of \countable" is the one given in the text, and it is reserved for infinite sets. Thus finite sets are not countable according to this definition. • Uncountable sets: A set is called uncountable if it is infinite and not countable. • Two famous results with memorable proofs.
    [Show full text]
  • Advanced Calculus 1. Definition: the Cartesian Product a × B
    Advanced Calculus 1. Definition: The Cartesian product A × B of sets A and B is A × B = {(a, b)| a ∈ A, b ∈ B}. This generalizes in the obvious way to higher Cartesian products: A1 × · · · × An = {(a1, . , an)| a1 ∈ A1, . , an ∈ An}. 2. Example: The real line R, the plane R2 = R×R, the n-dimensional real vector space Rn, R × [0, T], Rn × [0, T] etc. 3. Definition: The dot product (or inner or scalar product) of vectors x = (x1, . , xn) n and y = (y1, . , yn) in R is n X x · y = xiyi. i=1 n 4. Definition: The magnitude (or 2-norm) of a vector x = (x1, . , xn) in R is 1 " n # 2 X 1 2 2 |x| = xi = (x · x) . i=1 5. Definition: We write f : A 7→ B if f is a function whose domain is a subset of A and whose range is a subset of B. Let x = (x1, . , xn) n n be a point in R . So, if f(x) = f(x1, . , xn) is a function that has its domain in R , we write f : Rn 7→ R. So, for example, if 2 2 f(x1, x2, x3, x4) = x2x4 sin (x1 + x3), then f : R4 7→ R. We say that f takes R4 to R. 6. This notion is easily generalized to functions from Rn to Rm. Let x ∈ Rn and n f1(x), . , fm(x) be functions taking R to R. Then we can define a function f : Rn 7→ Rm, by f(x) = (f1(x), . , fm(x)). 2 7.
    [Show full text]
  • 06. Naive Set Theory I
    Topics 06. Naive Set Theory I. Sets and Paradoxes of the Infinitely Big II. Naive Set Theory I. Sets and Paradoxes of the Infinitely Big III. Cantor and Diagonal Arguments Recall: Paradox of the Even Numbers Claim: There are just as many even natural numbers as natural numbers natural numbers = non-negative whole numbers (0, 1, 2, ..) Proof: { 0 , 1 , 2 , 3 , 4 , ............ , n , ..........} { 0 , 2 , 4 , 6 , 8 , ............ , 2n , ..........} In general: 2 criteria for comparing sizes of sets: (1) Correlation criterion: Can members of one set be paired with members of the other? (2) Subset criterion: Do members of one set belong to the other? Can now say: (a) There are as many even naturals as naturals in the correlation sense. (b) There are less even naturals than naturals in the subset sense. To talk about the infinitely Moral: notion of sets big, just need to be clear makes this clear about what’s meant by size Bolzano (1781-1848) Promoted idea that notion of infinity was fundamentally set-theoretic: To say something is infinite is “God is infinite in knowledge” just to say there is some set means with infinite members “The set of truths known by God has infinitely many members” SO: Are there infinite sets? “a many thought of as a one” -Cantor Bolzano: Claim: The set of truths is infinite. Proof: Let p1 be a truth (ex: “Plato was Greek”) Let p2 be the truth “p1 is a truth”. Let p3 be the truth “p3 is a truth”. In general, let pn be the truth “pn-1 is a truth”, for any natural number n.
    [Show full text]
  • Axioms of Set Theory and Equivalents of Axiom of Choice Farighon Abdul Rahim Boise State University, [email protected]
    Boise State University ScholarWorks Mathematics Undergraduate Theses Department of Mathematics 5-2014 Axioms of Set Theory and Equivalents of Axiom of Choice Farighon Abdul Rahim Boise State University, [email protected] Follow this and additional works at: http://scholarworks.boisestate.edu/ math_undergraduate_theses Part of the Set Theory Commons Recommended Citation Rahim, Farighon Abdul, "Axioms of Set Theory and Equivalents of Axiom of Choice" (2014). Mathematics Undergraduate Theses. Paper 1. Axioms of Set Theory and Equivalents of Axiom of Choice Farighon Abdul Rahim Advisor: Samuel Coskey Boise State University May 2014 1 Introduction Sets are all around us. A bag of potato chips, for instance, is a set containing certain number of individual chip’s that are its elements. University is another example of a set with students as its elements. By elements, we mean members. But sets should not be confused as to what they really are. A daughter of a blacksmith is an element of a set that contains her mother, father, and her siblings. Then this set is an element of a set that contains all the other families that live in the nearby town. So a set itself can be an element of a bigger set. In mathematics, axiom is defined to be a rule or a statement that is accepted to be true regardless of having to prove it. In a sense, axioms are self evident. In set theory, we deal with sets. Each time we state an axiom, we will do so by considering sets. Example of the set containing the blacksmith family might make it seem as if sets are finite.
    [Show full text]