Michaelmas Term

Pigeonhole Principle Infinite sets Composition of functions Equivalence Relation

Let me be a number. Then for all : if there is an injection from A set which has an infinite number of elements. To prove, use contradiction i.e. a bijection from a finite set from an infinite set leads to a contradiciton (gf)(x) = g(f(x))

It is an equivalence relation if it is Reflexive Symmetric Transitive Formally, a relation R on a set X is a subset of the Cartesian product X X Equivalence Class Suppose R is an equivalence relation on a set X and for

Well ordering principle of integers Greatest common divisor Euclidian algorithm The Fundamental Theorem of Arithmetic Congruence modulo m Congruence classes modulo m Invertible elements in Zm Rational Numbers

[ ] . Each [x] is a subset of X If S is a non empty set of integers with a lower bound, then S has a least member. Suppose a, b are two integers, at least one of which is not 0. The gcd(a,b) is the unique positive integer such that d divides both a and b and d is greater than every other common divisor of a and b. if c|a and c|b then c d Standard method for computing gcd(a,b) Every integer n2 can be expressed as a product of one or more prime numbers. Furthermore, there is essentially only one such way of expressing n: the only way in which two such expressions for n can differ is in the ordering of the prime factors. aRb => m|(a-b). If aRb then we write These are the equivalence classes of the above equivalence relation, denoted [x]m An element x is invertible if there is some y such that xy = yx = 1. If x is invertible, we can cancel it from modular equations. X is invertible if and only if gcd(x, m) = 1 i.e. they are coprime. Can be defined as an equivalence relation from Natural numbers. (m, n)R(m, n) => mn = mn (which implies m/n = m/n) Multiplication and addition of rationals can be defined as operation on these equivalence classes. Can be defined as an equivalence relation from Natural numbers (a, b)R(c,d) => a +d = b + c (which implies a-b = c-d, but we want to only use addition) They can be constructed, but is outside the scope of MA103. Not rational it cannot be written as a/b where a,b are natural numbers. Uses the cantor diagonal argument. Z^n = r^n(cos n + isin n) e^(i) = cos + i sin There is a bijection between the set and the Natural numbers a+bi conjugate: a-bi

Integers

Real numbers Irrational Numbers Countability of Rationals DeMoivres Theorum Eulers formula Countable Complex conjugate

Lent Term

Upper Bound Lower Bound Supremum Infimum Maximum Minimum Least upper bound property Archimidean Property Interval Absolute Value Triangle Inequality Symmetric Absolute Value Sequence Limit of a sequence Bounded sequence Monotonically increasing Sandwich theorem Harmonic Numbers Subsequence Fact BolzanoWeierstrass theorem Continuity Restriction Intermediate Value Theorem Extreme Value Theorem Least Upper Bound Greatest Lower Bound Any non-empty subset of supremum. that is bounded above, has a

A set consisting of all the real numbers between two given real numbers, or of all the real numbers one side or the other of a given real number. (9 different forms) | | | | | | | | | | | |

A sequence is, fundamentally, just a function f: | | | ||

If Lim a = lim b and a<c<b Then Lim a = lim c = Lim b 1 + + 1/3 + . Let (an) be a sequence and let (nk) be a strictly increasing sequence of natural numbers. Then (ank) is a subsequence of (an) Every sequence has a monotone subsequence Every bounded sequence has a convergent subsequence. Let I be an interval in | | | | Restriction of the domain of a function to a smaller interval. [ ] [ ] Let [a,b] be any closed and bounded interval and let f : [a,b] R be a continuous function. Then there exists

Group

Finite Group Subgroup Abelian Group GL(n,R) The order of a group Order of an element of a group Finite order Infinite order Cyclic Group Homomorphism Isomorphism Coset Lagranges theorem Vector Space

[ ]] [ ]] | A group is a set G together with a law of composition (a,b) a*b : G x G G which is Associative (G1), Contains an Identity (G2) and each element has an inverse which is in the group (G3). A group is a finite group if the set G has finite cardinality. The order of a finite group (G, *) is the cardinality of G. A group is said to be an infinite group if it is not finite. A subset H of the set G is a subgroup if it is closed, it contains the identity, and it has invesrses. An abelian group has all the properties of a group, AND the group operation is commutative. This is the group comprising of nxn matricies with real entries. The order of a group is the cardinality of the set G on which the law of composition acts. It is the size of the set S. The least m such that am=e. If there exists such an m [ord(a)=min{m|am=e} The negation of finite order A group is cyclic if there exists an element a in G such that G = <a>, the set generated by taking powers of a. Let (G,*) and (G,*) be groups. A homomorphism is a function: A homomorphism that is also bijective. Given a subgroup H of a group G, the relation R on G given by aRb if b=a*h for some h in H. If a is in G, then the equivalence class of a = {a*h|h is in H} is a left coset Let H be a subgroup of a finite group G. Then the order of H divides the order of G. A vector space is a set along with two functions, +:VxV V, called vector addition, and another function, called scalar multiplication, such that (V,+) is an abelian group. The following hold: 1.v=v a(bv)=(ab)v (a+b)v=av+bv a(v+u)=av+au Let U e a subset of V, U is a subspace if: 0 is in U v and n are in U then v+n is in U av is in U v1,v2vn are in V and a1 a2an are in R then a1v1 + a2v2.anvn is a linear combination of v1vn always a finite set of vectors. Lin(empty set) = 0

Supace of a vector space

Linear Combination Span

For all else, the linear span is All possible combinations of vectors from S. Linearly dependent Basis Dimension of V Finite Dimensional Space Infinite Dimensional Space Linear Transformation Kernel Image A set of vectors B is a basis of V if: Lin(B)=V B is linearly independent If there exists a basis of V with n elements, then n is the dimension of V A space which has a basis with a finite number of elements Not finite dimensional T(u+v)=T(u)+T(v) T(au)=aT(u) {u|T(u)=0} Also the range, column space. {v|there exists u with T(u)=v} {v|T(u)=v} {T(u)|u is in U} Dim(ker) Dim(im)

Nullity Rank