Shawn Zhong

Shawn Zhong

钟万祥
  • Tutorials
  • Mathematics
    • Math 240
    • Math 375
    • Math 431
    • Math 514
    • Math 521
    • Math 541
    • Math 632
    • Abstract Algebra
    • Linear Algebra
    • Category Theory
  • Computer Sciences
    • CS/ECE 252
    • CS/ECE 352
    • Learn Haskell
  • AP Notes
    • AP Microecon
    • AP Macroecon
    • AP Statistics
    • AP Chemistry
    • AP Physics E&M
    • AP Physics Mech
    • CLEP Psycho

Shawn Zhong

钟万祥
  • Tutorials
  • Mathematics
    • Math 240
    • Math 375
    • Math 431
    • Math 514
    • Math 521
    • Math 541
    • Math 632
    • Abstract Algebra
    • Linear Algebra
    • Category Theory
  • Computer Sciences
    • CS/ECE 252
    • CS/ECE 352
    • Learn Haskell
  • AP Notes
    • AP Microecon
    • AP Macroecon
    • AP Statistics
    • AP Chemistry
    • AP Physics E&M
    • AP Physics Mech
    • CLEP Psycho

Onetone Blog

Home / Onetone Blog / Page 32

2.5 Cardinality of Sets

  • Feb 21, 2018
  • Shawn
  • Math 240
  • No comments yet
Cardinality • The cardinality of a set A is equal to the cardinality of a set B, denoted |A|=|B|, • if and only if there is a one-to-one correspondence (i.e., a bijection) from A to B • If there is a one-to-one function (i.e., an injection) from A to B, then • the cardinality of A is less than or equal to the cardinality of B and we write |A|≤|B| • When |A|≤|B| and A and B have different cardinality, • we say that the cardinality of A is less than the cardinality of B and write |A||B| Countable and Uncountable • A set that is either finite or has the same cardinality as Z+ is called countable. • A set that is not countable is uncountable. • The set of real numbers R is an uncountable set. • When an infinite set is countable (countably infinite) its cardinality is ℵ_0 • (where ℵ is aleph, the 1st letter of the Hebrew alphabet). • We write |S|=ℵ_0 and say that S has cardinality “aleph null.” Showing that a Set is Countable • An infinite set is countable iff it is possible to list the elements of the set in a sequence. • A 1-1 correspondence f from the set of positive integers to a set S can be expressed • in terms of a sequence a_1,a_2,…,a_n where a_1=f(1), a_2=f(2),…,a_n=f(n) • Example 1: The set of positive even integers E is countable set. ○ Let f(x)=2x ○ ■8(1&2&3&4&…@↕&↕&↕&↕&↕@2&4&6&8&…) ○ Then f is a bijection from N to E since f is both one-to-one and onto. ○ To show that it is one-to-one, suppose that f(n)=f(m). ○ Then 2n=2m, and so n=m. ○ To see that it is onto, suppose that t is an even positive integer. ○ Then t=2k for some positive integer k and f(k)=t. • Example 2: The set of integers Z is countable. ○ Can list in a sequence: 0, 1, − 1, 2, − 2, 3, − 3,… ○ Or can define a bijection from N to Z: § f(2n)=−n § f(2n+1)=n+1 • Example 3: The positive rational numbers are countable. § A rational number can be expressed as p/1 where p,q∈Z and q≠0. ○ Note: § p and q such that q≠0. ○ The positive rational numbers are countable since they can be arranged in a sequence • Example 4: Union of countable sets is countable ○ A={a_1,a_2,…,a_n,…} ○ B={b_1,b_2,…,b_n,…} ○ A∪B={a_1,b_1,a_2,b_2,…,a_n,b_n,…} • Example 5: The set of all rationals is countable ○ Q={0}∪Q+∪Q− ○ f(−p/q)=p/q is a bijiection from Q− to Q+ • Example 6: The set of finite string S over a finite alphabet A is counitable infinite ○ A={a,b} ○ List all strings with length § 0: λ § 1: a, b § 2: aa,ab,ba,bb § 3: aaa,aab,aba,abb,baa,bab,bba,bbb § ⋯ • Example 7: Show that the set of all Java program is countable ○ Just list all the strings Hilbert’s Grand Hotel • The Grand Hotel has countably infinite number of rooms, each occupied by a guest. • We can always accommodate a new guest at this hotel. • How is this possible? • Because the rooms of Grand Hotel are countable • We can list them as Room 1, Room 2, Room 3, and so on. • When a new guest arrives, we move the guest in Room n to Room n+1 • This frees up Room 1, which we assign to the new guest, and all the current guests still have rooms. • The hotel can also accommodate a countable number of new guests, all the guests on a countable number of buses where each bus contains a countable number of guests The Real Numbers are Uncountable • The method is called the Cantor diagnalization argument • Suppose R is countable. Then the real numbers between 0 and 1 are also countable • The real numbers between 0 and 1 can be listed in order r1 , r2 , r3 ,… . • Let the decimal representation of this listing be ○ r_1=0.d_11 d_12 d_13… ○ r_2=0.d_21 d_22 d_23… ○ r_3=0.d_31 d_32 d_33… • Form a new real number with the decimal expansion r=0.s_1 s_2 s_3… where ○ s_n={■8(4&d_nn=4@3&d_nn≠3)┤ • r is not equal to any of the r_1,r_2,r_3,… • Because it differs from r_i in its i-th position after the decimal point. • Therefore there is a real number between 0 and 1 that is not on the list • since every real number has a unique decimal expansion. • Hence, all the real numbers between 0 and 1 cannot be listed • so the set of real numbers between 0 and 1 is uncountable. • Since a set with an uncountable subset is uncountable • the set of real numbers is uncountable. Computability • We say that a function is computable if there is a computer program in some programming language that finds the values of this function. • If a function is not computable we say it is uncomputable. • There are uncomputable functions. • We have shown that the set of Java programs is countable. • We can show that the set of functions f:N→N is uncountable • Therefore there must be uncomputable functions
Read More >>

Math 521 – 2/19

  • Feb 19, 2018
  • Shawn
  • Math 521
  • No comments yet
Metric Space • Definition ○ A set X of points is called a metric space if ○ there exists a metric or distance function d(p,q):X×X→R such that § Positivity □ d(p,q)0 if p,q∈X and p≠q □ d(p,p)=0 for all p∈X § Symmetry □ d(p,q)=d(q,p) for all p,q∈X § Triangle Inequality □ d(p,q)≤d(p,r)+d(r,q) for all p,q,r∈X • Example 1 ○ X=Rk ○ d(p ⃗,q ⃗ )=|p ⃗−q ⃗ | ○ If k=1, this is just standard numerical absolute value ○ and d is distance on the number line • Example 2 (Taxicab metric) ○ X=R2 ○ d((p_1,p_2 ),(q_1,q_2 ))=|p_1−q_1 |+|p_2−q_2 | where p_1,p_2,q_1,q_2∈R ○ Is this a true metric space? ○ Positivity § Clearly d((p_1,p_2 ),(q_1,q_2 ))≥0 since it is a sum of absolute values § Suppose d((p_1,p_2 ),(q_1,q_2 ))=0 □ |p_1−q_1 |+|p_2−q_2 |=0 □ |p_1−q_1 |=−|p_2−q_2 | □ {█(|p_1−q_1 |=0@|p_2−q_2 |=0)┤⇒{█(p_1=q_1@p_2=q_2 )┤ □ i.e. (p_1,p_2 )=(q_1,q_2 ) § Suppose (p_1,p_2 )=(q_1,q_2 ) □ d((p_1,p_2 ),(q_1,q_2 ))=|p_1−q_1 |+|p_2−q_2 |=|0|+|0|=0 § Thus d((p_1,p_2 ),(q_1,q_2 ))=0 iff (p_1,p_2 )=(q_1,q_2 ) ○ Symmetry § d((p_1,p_2 ),(q_1,q_2 ))=|p_1−q_1 |+|p_2−q_2 | § =|q_1−p_1 |+|q_2−p_2 |=d((q_1,q_2 ),(p_1,p_2 )) ○ Triangular Inequality § d((p_1,p_2 ),(r_1,r_2 ))+d((r_1,r_2 ),(q_1,q_2 )) § =|p_1−r_1 |+|p_2−r_2 |+|r_1−q_1 |+|r_2−q_2 | § =(|p_1−r_1 |+|r_1−q_1 |)+(|p_2−r_2 |+|r_2−q_2 |) § ≥|p_1−r_2+r_1−q_1 |+|p_2−r_2+r_2−q_2 | by Triangle Inequality of R § =|p_1−q_1 |+|p_2−q_2 | § =d((p_1,p_2 ),(q_1,q_2 )) Definition 2.17 • Interval ○ Segment (a,b) is {x∈Raxb} (open interval) ○ Interval [a,b] is {x∈Ra≤x≤b} (closed interval) ○ We can also have half-open intervals: (a,b] and [a,b) • k-cell ○ If a_ib_i for i=1,2,…,k ○ The set of points x ⃗=(x_1,x_2,…,x_k ) in Rk ○ that satisfy a_i≤x_i≤b_i (1≤i≤k) is called a k-cell • Ball ○ If x ⃗∈Rk and r0 ○ the open ball with center x ⃗ with radius r is {y ⃗∈Rk│|x ⃗−y ⃗ |r} ○ the closed ball with center x ⃗ with radius r is {y ⃗∈Rk│|x ⃗−y ⃗ |≤r} • Convex ○ We call a set E⊂Rk convex if ○ λx ⃗+(1−λ) y ⃗∈E, ∀x ⃗,y ⃗∈E, 0λ1 ○ i.e. All points along a straight line from x ⃗ to y ⃗ and between x ⃗ and y ⃗ is in E • Example: Balls are convex ○ Given an open ball with center x ⃗ and radius r ○ If y ⃗,z ⃗∈B, then |y ⃗−x ⃗ |r and |z ⃗−x ⃗ |r ○ |λz ⃗+(1−λ) y ⃗−x ⃗ | ○ =|λz ⃗+(1−λ) y ⃗−(λ+1−λ) x ⃗ | ○ =|λz ⃗−λx ⃗+(1−λ) y ⃗−(1−λ) x ⃗ | ○ ≤|λz ⃗−λx ⃗ |+|(1−λ) y ⃗−(1−λ) x ⃗ | by Triangle Inequality ○ =λ|z ⃗−x ⃗ |+(1−λ)|y ⃗−x ⃗ | ○ λr+(1−λ)r=r ○ Thus |λz ⃗+(1−λ) y ⃗−x ⃗ |r ○ i.e. λz ⃗+(1−λ) y ⃗∈B Definition 2.18 (a) Neighborhood (b) Limit point (c) Isolated point (d) Closed (e) Interior point (f) Open (g) Complement (h) Perfect (i) Bounded (j) Dense
Read More >>

Math 521 – 2/16

  • Feb 19, 2018
  • Shawn
  • Math 521
  • No comments yet
Set-Theoretic Operations • Set theoretic union ○ ⋃24_(n=1)^∞▒A_n =A_1∪A_2∪A_3∪⋯ • Set theoretic intersection ○ ⋂24_(n=1)^∞▒A_n =A_1∩A_2∩A_3∩⋯ • Indexing set ○ ⋃8_(α∈A)▒E_α , where ○ A is an indexing set ○ E_α is a specific set that depends on A • Example ○ Let A={x∈R0x≤1} ○ Let E_α={x∈R0xa} ○ Then⋃8_(α∈A)▒E_α =(0,1) and ⋂8_(α∈A)▒E_α =∅ Theorem 2.12 • Statement ○ Let {E_n }_(n∈N be a sequence of countable sets, then ○ S=⋃24_(n=1)^∞▒E_n is also countable • Proof ○ Just like the proof that Q is countable ○ E_n={〖x_n〗_k }={〖x_n〗_1,〖x_n〗_2,〖x_n〗_3,…} ○ ■(x_11&x_12&x_13&x_14&…&@x_21&x_22&x_23&⋱&&@x_31&x_32&⋱&&&@x_41&⋱&&&&@⋮&&&&&) ○ Go along the diagonal, we have ○ S={x_11,x_21,x_12,x_31,x_22,x_13…} • Corollary ○ Suppose A is at most countable ○ If for α∈A, B_α is at most countable, then ○ T=⋃8_(α∈A)▒B_α is also at most countable Theorem 2.13 • Statement ○ Let A be a countable set ○ Let B_n be the set of all n-tuples (a_1,a_2,…a_n ) where a_k∈A for 1≤k≤n ○ And a_k may not be distinct, then B_n is countable • Proof ○ We proof by induction on n ○ Base case: n=2 § ■((a_1,a_1 )&(a_1,a_2 )&(a_1,a_3 )&(a_1,a_4 )&…&@(a_2,a_1 )&(a_2,a_2 )&(a_2,a_3 )&⋱&&@(a_3,a_1 )&(a_3,a_2 )&⋱&&&@(a_4,a_1 )&⋱&&&&@⋮&&&&&) § Here a_i are all the elements of A with possible repetition ○ Now assume for n=m (m≥2) § The set of m-tuples (a_1,a_2,…a_m ) are countable § Now we treat the (m+1)\-tuples as ordered pairs § (a_1,a_2,…a_(m+1) )=((a_1,a_2,…a_m ),a_(m+1) ) § By n=2 case, the set of (m+1)\-tuples is still countable Theorem 2.14 • Statement ○ Let A be the set of all sequqnecse whose digits are 0 and 1 ○ Then A is uncountable • Proof: Cantor
Read More >>

Math 541 – 2/14

  • Feb 15, 2018
  • Shawn
  • Math 541
  • No comments yet
Homomorphism • Definition ○ Let G,H be groups ○ A function f:G→H is a homomorphism if ○ f(g_1 g_2 )=f(g_1 )f(g_2 ), ∀g_1,g_2∈G ○ One says f "respects", or "preserves" the group operation • Trivial Examples ○ Let G be a group ○ The identity map of G→G is a homomorphism § f(g_1 )f(g_2 )=1⋅1=1=f(g_1 g_2 ) ○ The map G→G given by g↦1 is a homomorphism § This only works if we send every element of G to 1 § If x∈G∖{1}, and f:G→G is given by g↦x,∀g § f(g_1 g_2 )=f(g_1 )(g_2 ) § i.e. x=x^2 § Thus x=1 § This is impossible since x∈G∖{1} • Example 1 ○ Let f:R→R∗ be given by f(x)=e^x ○ f is a homomorphism ○ f(x_1+x_2 )=e^(x_1+x_2 )=e^(x_1 ) e^(x_2 )=f(x_1 )f(x_2 ) • Example 2 ○ Let G be a group, and let x∈G ○ The map f:G→G, g↦xgx^(−1) is a homomorphism ○ f(g_1 g_2 )=xg_1 g_2 x^(−1)=xg_(1 ) x^(−1) xg_2 x^(−1)=f(g_1 )f(g_2 ) ○ This homomorphism is called conjugation by x • Example 3 ○ Let n∈Z ○ Is f:Z→Z, x↦x+n a homomorphism? ○ Answer: Only when n=0 ○ f(0+0)=f(0) ○ i.e. n+n=n ○ Thus n=0 • Example 4 ○ Let n∈{0,1,2,3,…} ○ Is α:Z→Z, x↦x^n a homomorphism? ○ Answer: Only when n=1 ○ When x=0 § α(x)=1 § 1 is not the identity (0 is) § So this doesn’t work ○ For n≥2 § α(x_1+x_2 )=α(x_1 )+α(x_2 ) § (x_1+x_2 )^n=x_1^n+x_2^n § This is not always true § For instance, when x_1=x_2=1, 2^n≠2 for n≥2 • Example 5 ○ Let n∈Z ○ Is β:Z→Z, x↦nx a homomorphism? ○ Answer: Yes ○ β(x_1+x_2 )=n(x_1+x_2 )=nx_1+nx_2=β(x_1 )+β(x_2 ) • Example 6 ○ The previous examples is a special case of the following: ○ Let G be a group, and n∈Z ○ Define β:G→G, g↦g^n ○ Then β is homomorphism ∀n∈Z iff G is abelian ○ Proof: homomorphism ⇒ abelian § Say n=−1 § Let g_1,g_2∈G § β(g_1,g_2 )=β(g_1 )β(g_2 ) § (g_1 g_2 )^(−1)=g_1^(−1) g_2^(−1) § g_2^(−1) g_1^(−1)=g_1^(−1) g_2^(−1) § (g_2^(−1) g_1^(−1) )^(−1)=(g_1^(−1) g_2^(−1) )^(−1) § (g_1^(−1) )^(−1) (g_2^(−1) )^(−1)=(g_2^(−1) )^(−1) (g_1^(−1) )^(−1) § g_1 g_2=g_2 g_1 § Thus G is abelian ○ Proof: abelian ⇒ homomorphism § (Homework) Isomorphism • Definition ○ Let G,H be groups ○ A homomorphism α:G→H is a isomorphism if ○ there is a homomorphism β:H→G s.t. ○ αβ=id_H and βα=id_G ○ In this case, we say G and H are isomorphic • Fact ○ L:G→H is an isomorphism iff it is a bijective homomorphism ○ Proof: isomorphism ⇒ bijective homomorphism § Clear ○ Proof: bijective homomorphism ⇒ isomorphism § Need to show α^(−1) is a homormorphism § (Homework) • Example ○ R(0)≔{r∈Rr0} is a group under multiplication ○ Define f:R→R(0) where f(x)=e^x ○ Then f is a homomorphism ○ Moreover, f is an isomorphism ○ The inverse of f is ln • Observation ○ If G,H are isomorphic groups, then |G|=|H| Proposition 16 • Statement ○ If f:G→H is an isomorphism, then ○ G is abelian iff H is abelian ○ ∀g∈G, |g|=|f(g)| ○ Note |g|=inf⁡{n∈Z(0)│g^n=1}
Read More >>

Math 521 – 2/14

  • Feb 15, 2018
  • Shawn
  • Math 521
  • No comments yet
Finite and Countable • Definition ○ Let J_n={1,2,3,…,n} and N={1,2,3,…} ○ For any set A, we say ○ A is finite if A~J_n for some n (∅~J_0 so ∅ is finite) ○ A is infinite if A≁J_n for all n ○ A is countable if A~N ○ A is uncountable if A is neither finite nor countable ○ A is at most coutable if A is finite or countable • Examples ○ N is clearly countable § N={1,2,3,…} ○ Z is countable § Z={0,1,−1,2,−2,3,−3,…} § Define f:N→Z by § f(n)≔{■8(n/2&n is even@(1−n)/2&n is odd)┤ § f is injective □ If f(n)=f(m) □ then n/2=m/2 or (1−n)/2=(1−m)/2 □ Either way, n=m § f is surjective □ Given k∈Z, □ If k0, k=f(2k) □ If k≤0, k=f(−2k+1) § Thus f is bijective ○ Q is countable § There are "less" rational numbers q=m/n (m,n∈Z,n≠0) than § there are ordered pairs of integers (m,n) □ 1/2=15/30 but (1,2)≠(15,30) □ We can also ignore negatives and zeros □ because integers are in 1-1 correspondence with N § Idea: Write ordered pairs of integers in a 2 dimension array § Putting this all together, we have § Q={0,±1,±2,±1/2,±1/3,±3,±4,±3/2,±2/3,±1/4,…} Sequence • Definition ○ A sequence is a function defined on N ○ Notationally, this is often written {x_n } ○ Meaning f(x)=x_n for all n∈N • Example ○ {1/n}={1, 1/2,1/3,…} Theorem 2.8 • Statement ○ Every infinite subset of a countable set is countable • Proof ○ Suppose E⊂A, A is countable and E is infinite ○ Since A is countable, its element will be a sequqnce ○ (order given by the bijective function f:N→A) ○ So, A={x_n } as a set ○ Let n_1 be the smallest n∈N such that x_(n_1 )∈E ○ Let n_2 be the next smallest n∈N such that 〖x_n〗_2∈E ○ So E={x_(n_k ) }={x_(n_1 ),x_(n_2 ),x_(n_3 ),…} (A sequence indexed by k∈N) ○ Now consider g:N→E given by g(k)=x_(n_k ) ○ g is clearly one-to-one and onto by construction ○ So E is countable • Example ○ If A={1, 1/2,1/3,…} and E={1, 1/4,1/9,1/16} ○ Then A={1/n}={1, 1/2,1/3,…} ○ and E={1/n_k }={1, 1/4,1/9,1/16} where n_k=k^2 for k∈N ○ f:A→E by f(k)=1/k^2
Read More >>
  • 1
  • …
  • 30
  • 31
  • 32
  • 33
  • 34
  • …
  • 87

Search

  • Home Page
  • Tutorials
  • Mathematics
    • Math 240 – Discrete Math
    • Math 375 – Linear Algebra
    • Math 431 – Intro to Probability
    • Math 514 – Numerical Analysis
    • Math 521 – Analysis I
    • Math 541 – Abstract Algebra
    • Math 632 – Stochastic Processes
    • Abstract Algebra @ 万门大学
    • Linear Algebra @ 万门大学
    • Category Theory
  • Computer Sciences
    • CS/ECE 252 – Intro to Computer Engr.
    • CS/ECE 352 – Digital System Fund.
    • Learn Haskell
  • Course Notes
    • AP Macroeconomics
    • AP Microeconomics
    • AP Chemistry
    • AP Statistics
    • AP Physics C: E&M
    • AP Physics C: Mechanics
    • CLEP Psychology
  • 2048 Game
  • HiMCM 2016
  • 登峰杯 MCM

WeChat Account

Categories

  • Notes (418)
    • AP (115)
      • AP Macroeconomics (20)
      • AP Microeconomics (23)
      • AP Physics C E&M (25)
      • AP Physics C Mechanics (28)
      • AP Statistics (19)
    • Computer Sciences (2)
    • Mathematics (300)
      • Abstract Algebra (29)
      • Category Theory (7)
      • Linear Algebra (29)
      • Math 240 (42)
      • Math 375 (71)
      • Math 514 (18)
      • Math 521 (39)
      • Math 541 (39)
      • Math 632 (26)
  • Projects (2)
  • Tutorials (11)

Archives

  • October 2019
  • May 2019
  • April 2019
  • March 2019
  • February 2019
  • December 2018
  • November 2018
  • October 2018
  • September 2018
  • July 2018
  • May 2018
  • April 2018
  • March 2018
  • February 2018
  • January 2018
  • December 2017
  • November 2017
  • October 2017
  • September 2017
  • August 2017
  • July 2017
  • June 2017

WeChat Account

Links

RobeZH's thoughts on Algorithms - Ziyi Zhang
Copyright © 2018.      
TOP