1/17
Looks like no tags are added yet.
Name | Mastery | Learn | Test | Matching | Spaced | Call with Kai |
|---|
No analytics yet
Send a link to your students to track their progress
What are the 3 things that a function consists of?
A set A = dom(f) called the domain of f
A set B = codom(f) called the codomain of f
A rule that assigns to each element a in A a unique element f(a) in B
What is the definition of an identity function?
Let A be a set. The identity function on A is idA : A → A defined idA(a) = a
What is the definition of an inverse function?
Let A, B be sets. Let f: A → B be a bijection. The inverse f-1 : B → A is defined by f-1(b) is the unique a in A such that f(a) = b
Let f : A → B, g : B → C be functions. Suppose f and g are bijections. Then…
g ∘ f : A → C is a bijection
Let f : A → B, g : B → C, h : C → D be functions. Then…
(h ∘ g) ∘ f = h ∘ (g ∘ f)
f ∘ idA = f = idB ∘ f
Let f : A → B, g : B → C be functions. Suppose f is a bijection. Then…
f-1 : B → A is a bijection and f ∘ f-1 = idA, f ∘ f-1 = idB
What is the definition of a permutation?
Let Ω be a set. A permutation of Ω is a bijection f : Ω → Ω. We define sym(Ω) to be the set of permutations of Ω. We mainly consider Ω = {1, 2, …, n} for a natural number n and write Sn for sym({1, 2, …, n})
What is two-row notation?
Let f ∈ Sn. The two-row notation of f is the symbol in the image
What is composition?
Let f, g ∈ Sym(Ω). Then g ∘ f ∈ Sym(Ω)
What is an inversion?
Let f ∈ Sym(Ω). Then f-1 ∈ Sym(Ω)
What is the definition of a power of a permutation?
Let f ∈ Sym(Ω) and r be an integer. We define fr as follows:
For r = 0, f0 = idΩ
For r > 0, fr = f ∘ f ∘ … ∘ f (r times)
For r < 0, let s = -r and set fr = (f-1)s
Let f ∈ Sym(Ω) and r, s be integers. Then…
fr+s = fr ∘ fs
frs = (fr)s
What is a cycle?
Let f ∈ Sym(Ω). We say f is a k-cycle if there exists a distinct a1, …, ak ∈ Ω such that f(a1) = a2, f(a2) = a3, …, f(ak-1) = ak, f(ak) = a and f(b) = b for all other b ∈ Ω. We use the notation f= (a1, a2, …, ak)
How to decompose a a function as a product of disjoint cycles?
Find all the individual cycles in the function (e.g. c1, c2, …)
Thus f = c1 ∘ c2 ∘ …
The cycle shape of f is (r1, r2, …) where r1, r2, … are the length of each cycle in decreasing order
What are some key notes about notation in cycles?
Omit ∘ for composition
Omit 1-cycles
What is the order of a function g?
Let g ∈ Sym(Ω). The order of g is the smallest natural number m s.t. gm = idΩ. It is denoted o(g) = m (o stands for order)
Let g ∈ Sym(Ω) with cycle shape (r1, r2, …, rm). What is o(g)?
o(g) = lcm(r1, r2, …, rm)
Let g ∈ Sym(Ω), m = o(g) and r be an integer. What is gr?
gr = idΩ iff m | r