September 2010 S M T W T F S « Aug 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 Categories
- Mathematics (42)
- Arithmetic (2)
- Combinatorics and Probability (12)
- Lotteries (2)
- Markov Chains (10)
- Cryptography (3)
- Differential Equations (6)
- General Applied Statistics (1)
- Group Theory (1)
- Linear Algebra (6)
- Music (1)
- Textbooks (26)
- Munkres's Topology (26)
- Set Theory and Logic (25)
- Functions (5)
- Relations (15)
- Equivalence Relations (5)
- Order Relations (10)
- The Integers and the Real Numbers (5)
- Set Theory and Logic (25)
- Munkres's Topology (26)
- Poetry (8)
- Love (1)
- Mexico (1)
- Guadalajara (1)
- Miscellaneous (4)
- Nature (4)
- Mathematics (42)
Tags
Beale Beale cipher Beale cypher book cipher book cypher chance cipher cryptography cypher Differential Equations equivalence classes Equivalence Relations Functions gamble gambler gambling game of chance game of luck games games of chance games of luck induction integers lottery lotto luck lucky Markov chain Markov chains Markov transition matrix Mexican Mexican lottery Mexico money multiplication National Lottery Order Relations outcomes Poetry probability real numbers Relations SIR SIR model swine fluArchives
Category Archives: Set Theory and Logic
1.4 Exercise 5
I had often wondered how to go about proving closure of addition and multiplication of the integers. After this problem I wondered no more! It’s pretty neat that we can show (by using induction) that by adding any two integers … Continue reading
1.4 Exercise 4
“(a) Prove by induction that given , every nonempty subset of has a largest element. (b) Explain why you cannot conclude from (a) that every nonempty subset of has a largest element.” (Taken from Topology by James R. Munkres, Second … Continue reading
1.4 Exercise 3
To get acquainted with the set of positive integers and how this set is related to “proving things by induction,” this problem is a great primer! “(a) Show that if is a collection of inductive sets, then the intersection of … Continue reading
1.4 Exercise 2
Another one of those really really long problems, but oh well… after this one the exercises seem more interesting. As before, I’m doing five by five until the end. “Prove the following laws of inequalities for , using axioms (I)-(VI) … Continue reading
1.4 Exercise 1
Omigod, this was a kilometric problem, and kind of boring too. I guess once in a lifetime every mathematician (or schoolboy) should go ahead and get his hands dirty proving identities only using axioms. Here goes, although I’ll complete this … Continue reading
1.3 Exercise 15
Yes, after months, I’m back ;-). This was an interesting problem to me because it explores a bit more deeply the concept of the LUBP. “Assume that the real line has the least upper bound property. (a) Show that the … Continue reading
Posted in Munkres's Topology, Order Relations, Relations, Set Theory and Logic
Tagged Order Relations, Relations
Leave a comment
1.3 Exercise 14
Rather than merely repeating the proof of 1.3.13 to show the converse, we can impose the “opposite” or symmetric order relation on the set to show that if it has the GLBP then it has the LUBP too. “If is … Continue reading
Posted in Munkres's Topology, Order Relations, Relations, Set Theory and Logic
Tagged Order Relations, Relations
Leave a comment
1.3 Exercise 13
This theorem (and its converse) is needed everywhere in analysis and topology, and it is very important. “Prove the following: Theorem. If an ordered set has the least upper bound property, then it has the greatest lower bound property.” (Taken … Continue reading
1.3 Exercise 12
This problem, although cool because it exposes us to out-of-the-ordinary order relations on the Cartesian plane, was a little long, I felt. Nevertheless, it shows that we can create order relations with smallest elements, with elements with no immediate predecessors, … Continue reading
Posted in Munkres's Topology, Order Relations, Relations, Set Theory and Logic
Tagged Order Relations, Relations
Leave a comment
1.3 Exercise 11
“Show that an element in an ordered set has at most one immediate successor and at most one immediate predecessor. Show that a subset of an ordered set has at most one smallest element and at most one largest element.” … Continue reading
Posted in Order Relations, Relations, Set Theory and Logic, Textbooks
Tagged Order Relations, Relations
Leave a comment