Topological methods to solve equations over groups


 Augustus Stephens
 1 years ago
 Views:
Transcription
1 Topological methods to solve equations over groups Andreas Thom TU Dresden, Germany July 26, 2016 in Buenos Aires XXI Coloquio Latinoamericano de Álgebra
2 How to solve a polynomial equation?
3 How to solve a polynomial equation? Even though not every nonconstant polynomial p(t) Q[t] has a root in Q, there always exists a finite field extension Q K, such that p(t) = 0 can be solved in K,
4 How to solve a polynomial equation? Even though not every nonconstant polynomial p(t) Q[t] has a root in Q, there always exists a finite field extension Q K, such that p(t) = 0 can be solved in K, i.e., there exists α K with p(α) = 0.
5 How to solve a polynomial equation? Even though not every nonconstant polynomial p(t) Q[t] has a root in Q, there always exists a finite field extension Q K, such that p(t) = 0 can be solved in K, i.e., there exists α K with p(α) = Consider a simple quotient Q[t]/ p(t) K and and convince yourself that Q K. The image α of t will solve the equation p(t) = 0 in K.
6 How to solve a polynomial equation? Even though not every nonconstant polynomial p(t) Q[t] has a root in Q, there always exists a finite field extension Q K, such that p(t) = 0 can be solved in K, i.e., there exists α K with p(α) = Consider a simple quotient Q[t]/ p(t) K and and convince yourself that Q K. The image α of t will solve the equation p(t) = 0 in K. 2. Embed Q C, study the continuous map p : C C, and use a topological argument to see that there exists α C, such that p(α) = 0.
7 How to solve a polynomial equation? Even though not every nonconstant polynomial p(t) Q[t] has a root in Q, there always exists a finite field extension Q K, such that p(t) = 0 can be solved in K, i.e., there exists α K with p(α) = Consider a simple quotient Q[t]/ p(t) K and and convince yourself that Q K. The image α of t will solve the equation p(t) = 0 in K. 2. Embed Q C, study the continuous map p : C C, and use a topological argument to see that there exists α C, such that p(α) = 0. The second argument was essentially already present in Gauss first proof in 1799.
8 How to solve a polynomial equation? Even though not every nonconstant polynomial p(t) Q[t] has a root in Q, there always exists a finite field extension Q K, such that p(t) = 0 can be solved in K, i.e., there exists α K with p(α) = Consider a simple quotient Q[t]/ p(t) K and and convince yourself that Q K. The image α of t will solve the equation p(t) = 0 in K. 2. Embed Q C, study the continuous map p : C C, and use a topological argument to see that there exists α C, such that p(α) = 0. The second argument was essentially already present in Gauss first proof in However, the right language was not developed until 1930.
9 Equations over groups
10 Equations over groups Definition Let Γ be a group and let g 1,..., g n Γ, ε 1,..., ε n Z.
11 Equations over groups Definition Let Γ be a group and let g 1,..., g n Γ, ε 1,..., ε n Z. We say that the equation w(t) = g 1 t ε 1 g 2 t ε 2 g 3... g n t εn has a solution in Γ if there exists h Γ such that w(h) = e.
12 Equations over groups Definition Let Γ be a group and let g 1,..., g n Γ, ε 1,..., ε n Z. We say that the equation w(t) = g 1 t ε 1 g 2 t ε 2 g 3... g n t εn has a solution in Γ if there exists h Γ such that w(h) = e. The equation has a solution over Γ if there is an extension Γ Λ and there is some h Λ such that w(h) = e in Λ.
13 Equations over groups Definition Let Γ be a group and let g 1,..., g n Γ, ε 1,..., ε n Z. We say that the equation w(t) = g 1 t ε 1 g 2 t ε 2 g 3... g n t εn has a solution in Γ if there exists h Γ such that w(h) = e. The equation has a solution over Γ if there is an extension Γ Λ and there is some h Λ such that w(h) = e in Λ. The study of equations like this goes back to: Bernhard H. Neumann, Adjunction of elements to groups, J. London Math. Soc. 18 (1943), 411.
14 Example If a, b Γ, then w(t) = atbt 1 cannot be solved over Γ unless the orders of a and b agree.
15 Example If a, b Γ, then w(t) = atbt 1 cannot be solved over Γ unless the orders of a and b agree. Indeed, if such a t exists, then a 1 = tbt 1.
16 Example If a, b Γ, then w(t) = atbt 1 cannot be solved over Γ unless the orders of a and b agree. Indeed, if such a t exists, then a 1 = tbt 1. Example The equation w(t) = tat 1 ata 1 t 1 a 2 cannot be solved over Z/pZ = a.
17 Example If a, b Γ, then w(t) = atbt 1 cannot be solved over Γ unless the orders of a and b agree. Indeed, if such a t exists, then a 1 = tbt 1. Example The equation w(t) = tat 1 ata 1 t 1 a 2 cannot be solved over Z/pZ = a. Indeed, if w(t) = 1, then a 2 = (tat 1 )a(tat 1 ) 1 and a conjugate of a (namely tat 1 ) would conjugate a to a 2.
18 Example If a, b Γ, then w(t) = atbt 1 cannot be solved over Γ unless the orders of a and b agree. Indeed, if such a t exists, then a 1 = tbt 1. Example The equation w(t) = tat 1 ata 1 t 1 a 2 cannot be solved over Z/pZ = a. Indeed, if w(t) = 1, then a 2 = (tat 1 )a(tat 1 ) 1 and a conjugate of a (namely tat 1 ) would conjugate a to a 2. But the automorphism of Z/pZ which sends 1 to 2 has order dividing p 1 and hence the order is coprime to p.
19 Definition We say that the equation w(t) = g 1 t ε 1 g 2 t ε 2 g 3... g n t εn nonsingular if n i=1 ε i 0. is
20 Definition We say that the equation w(t) = g 1 t ε 1 g 2 t ε 2 g 3... g n t εn is nonsingular if n i=1 ε i 0. It is called nontrivial if it is not conjugate to w(t) = g 1.
21 Definition We say that the equation w(t) = g 1 t ε 1 g 2 t ε 2 g 3... g n t εn is nonsingular if n i=1 ε i 0. It is called nontrivial if it is not conjugate to w(t) = g 1. Conjecture (Levin) Any nontrivial equation can be solved over Γ, if Γ is torsionfree.
22 Definition We say that the equation w(t) = g 1 t ε 1 g 2 t ε 2 g 3... g n t εn is nonsingular if n i=1 ε i 0. It is called nontrivial if it is not conjugate to w(t) = g 1. Conjecture (Levin) Any nontrivial equation can be solved over Γ, if Γ is torsionfree. Conjecture (KervaireLaudenbach) If w(t) is nonsingular, then w(t) has a solution over Γ.
23 Definition We say that the equation w(t) = g 1 t ε 1 g 2 t ε 2 g 3... g n t εn is nonsingular if n i=1 ε i 0. It is called nontrivial if it is not conjugate to w(t) = g 1. Conjecture (Levin) Any nontrivial equation can be solved over Γ, if Γ is torsionfree. Conjecture (KervaireLaudenbach) If w(t) is nonsingular, then w(t) has a solution over Γ. Theorem (Klyachko) If Γ is torsionfree and w(t) is nonsingular, then w(t) can be solved over Γ. Anton A. Klyachko, A funny property of sphere and equations over groups, Comm. Algebra 21 (1993), no. 7,
24 Definition We say that the equation w(t) = g 1 t ε 1 g 2 t ε 2 g 3... g n t εn is nonsingular if n i=1 ε i 0. It is called nontrivial if it is not conjugate to w(t) = g 1. Conjecture (Levin) Any nontrivial equation can be solved over Γ, if Γ is torsionfree. Conjecture (KervaireLaudenbach) If w(t) is nonsingular, then w(t) has a solution over Γ. Theorem (Klyachko) If Γ is torsionfree and w(t) is nonsingular, then w(t) can be solved over Γ. Anton A. Klyachko, A funny property of sphere and equations over groups, Comm. Algebra 21 (1993), no. 7, We will focus on the second conjecture.
25 The algebraic/combinatorial approach Why is this complicated?
26 The algebraic/combinatorial approach Why is this complicated? Just consider: Γ Γ t w(t).
27 The algebraic/combinatorial approach Why is this complicated? Just consider: Γ Γ t w(t). But nobody can show easily that this homomorphism is injective.
28 The algebraic/combinatorial approach Why is this complicated? Just consider: Γ Γ t w(t). But nobody can show easily that this homomorphism is injective. In fact, injectivity is equivalent to existence of a solution over Γ.
29 The algebraic/combinatorial approach Why is this complicated? Just consider: Γ Γ t w(t). But nobody can show easily that this homomorphism is injective. In fact, injectivity is equivalent to existence of a solution over Γ. The KervaireLaudenbach conjecture was motivated originally from 3dimensional topology, where certain geometric operations on knot complements amount to the attachment of an arc and a disc.
30 The algebraic/combinatorial approach Why is this complicated? Just consider: Γ Γ t w(t). But nobody can show easily that this homomorphism is injective. In fact, injectivity is equivalent to existence of a solution over Γ. The KervaireLaudenbach conjecture was motivated originally from 3dimensional topology, where certain geometric operations on knot complements amount to the attachment of an arc and a disc. The resulting effect on fundamental groups is exactly Γ Γ t w(t).
31 Topological methods Theorem (GerstenhaberRothaus, 1962) Any nonsingular equation in U(n) can be solved in U(n).
32 Topological methods Theorem (GerstenhaberRothaus, 1962) Any nonsingular equation in U(n) can be solved in U(n). Proof. Consider the word map w : U(n) U(n), w(t) = g 1 t ε 1... g n t εn.
33 Topological methods Theorem (GerstenhaberRothaus, 1962) Any nonsingular equation in U(n) can be solved in U(n). Proof. Consider the word map w : U(n) U(n), w(t) = g 1 t ε 1... g n t εn. Since U(n) is connected, each g i can be moved continuously to 1 n.
34 Topological methods Theorem (GerstenhaberRothaus, 1962) Any nonsingular equation in U(n) can be solved in U(n). Proof. Consider the word map w : U(n) U(n), w(t) = g 1 t ε 1... g n t εn. Since U(n) is connected, each g i can be moved continuously to 1 n. Thus, this map is homotopic to t t i ε i,
35 Topological methods Theorem (GerstenhaberRothaus, 1962) Any nonsingular equation in U(n) can be solved in U(n). Proof. Consider the word map w : U(n) U(n), w(t) = g 1 t ε 1... g n t εn. Since U(n) is connected, each g i can be moved continuously to 1 n. Thus, this map is homotopic to t t i ε i, which has nontrivial degree as a map of topological manifolds.
36 Topological methods Theorem (GerstenhaberRothaus, 1962) Any nonsingular equation in U(n) can be solved in U(n). Proof. Consider the word map w : U(n) U(n), w(t) = g 1 t ε 1... g n t εn. Since U(n) is connected, each g i can be moved continuously to 1 n. Thus, this map is homotopic to t t i ε i, which has nontrivial degree as a map of topological manifolds. Indeed, a generic matrix has exactly d n preimages with d := i ε i.
37 Topological methods Theorem (GerstenhaberRothaus, 1962) Any nonsingular equation in U(n) can be solved in U(n). Proof. Consider the word map w : U(n) U(n), w(t) = g 1 t ε 1... g n t εn. Since U(n) is connected, each g i can be moved continuously to 1 n. Thus, this map is homotopic to t t i ε i, which has nontrivial degree as a map of topological manifolds. Indeed, a generic matrix has exactly d n preimages with d := i ε i. Hence, the map w must be surjective.
38 Topological methods Theorem (GerstenhaberRothaus, 1962) Any nonsingular equation in U(n) can be solved in U(n). Proof. Consider the word map w : U(n) U(n), w(t) = g 1 t ε 1... g n t εn. Since U(n) is connected, each g i can be moved continuously to 1 n. Thus, this map is homotopic to t t i ε i, which has nontrivial degree as a map of topological manifolds. Indeed, a generic matrix has exactly d n preimages with d := i ε i. Hence, the map w must be surjective. Each preimage of 1 n gives a solution of the equation w(t) = 1 n.
39 Corollary Any nonsingular equation with coefficients in a finite group Γ can be solved over Γ.
40 Corollary Any nonsingular equation with coefficients in a finite group Γ can be solved over Γ. In fact, they can be solved in a finite extension Γ Λ.
41 Corollary Any nonsingular equation with coefficients in a finite group Γ can be solved over Γ. In fact, they can be solved in a finite extension Γ Λ. Proof. Embed Γ in U(n), solve the equation there to get a solution u.
42 Corollary Any nonsingular equation with coefficients in a finite group Γ can be solved over Γ. In fact, they can be solved in a finite extension Γ Λ. Proof. Embed Γ in U(n), solve the equation there to get a solution u. Now, Λ = Γ, u U(n) is residually finite my Mal cev s theorem. Thus, there exists a finite quotient of Λ which contains Γ.
43 Corollary Any nonsingular equation with coefficients in a finite group Γ can be solved over Γ. In fact, they can be solved in a finite extension Γ Λ. Proof. Embed Γ in U(n), solve the equation there to get a solution u. Now, Λ = Γ, u U(n) is residually finite my Mal cev s theorem. Thus, there exists a finite quotient of Λ which contains Γ. The same holds for locally residually finite groups, but the general situation remained unclear back in the 60s.
44 Corollary Any nonsingular equation with coefficients in a finite group Γ can be solved over Γ. In fact, they can be solved in a finite extension Γ Λ. Proof. Embed Γ in U(n), solve the equation there to get a solution u. Now, Λ = Γ, u U(n) is residually finite my Mal cev s theorem. Thus, there exists a finite quotient of Λ which contains Γ. The same holds for locally residually finite groups, but the general situation remained unclear back in the 60s.
45 Definition We say that Γ is algebraically closed if any nonsingular equation has a solution in Γ.
46 Definition We say that Γ is algebraically closed if any nonsingular equation has a solution in Γ. Proposition The class of algebraically closed groups is closed under products and quotients.
47 Definition We say that Γ is algebraically closed if any nonsingular equation has a solution in Γ. Proposition The class of algebraically closed groups is closed under products and quotients. Corollary (Pestov) Any group Γ that embeds into an abstract quotient of n U(n) (these are called hyperlinear) satisfies Kervaire s Conjecture.
48 Definition We say that Γ is algebraically closed if any nonsingular equation has a solution in Γ. Proposition The class of algebraically closed groups is closed under products and quotients. Corollary (Pestov) Any group Γ that embeds into an abstract quotient of n U(n) (these are called hyperlinear) satisfies Kervaire s Conjecture. Remark Every sofic group can be embedded into a quotient of n U(n).
49 Sofic groups Definition Let Sym(n) be the permutation group on n letters. We set: d(σ, τ) = 1 {i {0,..., n} σ(i) τ(i)} n to be the normalized Hamming distance on permutations σ, τ Sym(n).
50 Sofic groups Definition Let Sym(n) be the permutation group on n letters. We set: d(σ, τ) = 1 {i {0,..., n} σ(i) τ(i)} n to be the normalized Hamming distance on permutations σ, τ Sym(n). Definition A group Γ is called sofic, if for every finite subset F Γ and every ɛ (0, 1) there exists n N and a map φ: Γ Sym(n), such that:
51 Sofic groups Definition Let Sym(n) be the permutation group on n letters. We set: d(σ, τ) = 1 {i {0,..., n} σ(i) τ(i)} n to be the normalized Hamming distance on permutations σ, τ Sym(n). Definition A group Γ is called sofic, if for every finite subset F Γ and every ɛ (0, 1) there exists n N and a map φ: Γ Sym(n), such that: 1. d(φ(gh), φ(g)φ(h)) ɛ, g, h F,
52 Sofic groups Definition Let Sym(n) be the permutation group on n letters. We set: d(σ, τ) = 1 {i {0,..., n} σ(i) τ(i)} n to be the normalized Hamming distance on permutations σ, τ Sym(n). Definition A group Γ is called sofic, if for every finite subset F Γ and every ɛ (0, 1) there exists n N and a map φ: Γ Sym(n), such that: 1. d(φ(gh), φ(g)φ(h)) ɛ, g, h F, 2. d(1 n, φ(g)) 1/2, g F \ {e}.
53 Sofic groups Examples Examples of sofic groups: residually finite groups,
54 Sofic groups Examples Examples of sofic groups: residually finite groups, free groups are residually finite, Theorem (Mal cev): Every finitely generated subgroup of GL n C is residually finite.
55 Sofic groups Examples Examples of sofic groups: residually finite groups, free groups are residually finite, Theorem (Mal cev): Every finitely generated subgroup of GL n C is residually finite. amenable groups,
56 Sofic groups Examples Examples of sofic groups: residually finite groups, free groups are residually finite, Theorem (Mal cev): Every finitely generated subgroup of GL n C is residually finite. amenable groups, inverse and direct limits of sofic groups,
57 Sofic groups Examples Examples of sofic groups: residually finite groups, free groups are residually finite, Theorem (Mal cev): Every finitely generated subgroup of GL n C is residually finite. amenable groups, inverse and direct limits of sofic groups, free and direct products of sofic groups,
58 Sofic groups Examples Examples of sofic groups: residually finite groups, free groups are residually finite, Theorem (Mal cev): Every finitely generated subgroup of GL n C is residually finite. amenable groups, inverse and direct limits of sofic groups, free and direct products of sofic groups, subgroups of sofic groups,
59 Sofic groups Examples Examples of sofic groups: residually finite groups, free groups are residually finite, Theorem (Mal cev): Every finitely generated subgroup of GL n C is residually finite. amenable groups, inverse and direct limits of sofic groups, free and direct products of sofic groups, subgroups of sofic groups, extension with sofic normal subgroup and amenable quotient.
60 Sofic groups Examples Examples of sofic groups: residually finite groups, free groups are residually finite, Theorem (Mal cev): Every finitely generated subgroup of GL n C is residually finite. amenable groups, inverse and direct limits of sofic groups, free and direct products of sofic groups, subgroups of sofic groups, extension with sofic normal subgroup and amenable quotient. Remark There is no group known to be nonsofic.
61 Now, Sym(n) U(n) and one easily sees that a sofic group Γ is a subgroup of the quotient group n U(n), N
62 Now, Sym(n) U(n) and one easily sees that a sofic group Γ is a subgroup of the quotient group n U(n), N where N = (u n) n n 1 U(n) lim n ω n for some suitable ultrafilter ω βn. n δ ij u ij 2 = 0 i,j=1
63 Now, Sym(n) U(n) and one easily sees that a sofic group Γ is a subgroup of the quotient group n U(n), N where N = (u n) n n 1 U(n) lim n ω n for some suitable ultrafilter ω βn. n δ ij u ij 2 = 0 i,j=1 Remark Connes Embedding Conjecture also implies that every group has such an embedding.
64 More Magical realism with sofic groups
65 More Magical realism with sofic groups... uses fantastical and unreal elements. Miracles happen naturally.
66 More Magical realism with sofic groups... uses fantastical and unreal elements. Miracles happen naturally. Conjecture (Kaplansky) Let Γ be a group and k be a field. If a, b kγ satisfy ab = 1, then also ba = 1.
67 More Magical realism with sofic groups... uses fantastical and unreal elements. Miracles happen naturally. Conjecture (Kaplansky) Let Γ be a group and k be a field. If a, b kγ satisfy ab = 1, then also ba = 1. Known to hold if char(k) = 0.
68 More Magical realism with sofic groups... uses fantastical and unreal elements. Miracles happen naturally. Conjecture (Kaplansky) Let Γ be a group and k be a field. If a, b kγ satisfy ab = 1, then also ba = 1. Known to hold if char(k) = 0. Known for any field if Γ is sofic. (ElekSzabo)
69 More Magical realism with sofic groups... uses fantastical and unreal elements. Miracles happen naturally. Conjecture (Kaplansky) Let Γ be a group and k be a field. If a, b kγ satisfy ab = 1, then also ba = 1. Known to hold if char(k) = 0. Known for any field if Γ is sofic. (ElekSzabo) Idea: If Γ can be modelled by permutations, then kγ can be modelled by M n (k). Hence, ab = 1 implies ba = 1.
70 More variables
71 More variables Question Can you solve the equation over some group? w(s, t) = g 1 sg 2 tg 3 s 1 g 4 t 1 = 1
72 More variables Question Can you solve the equation over some group? w(s, t) = g 1 sg 2 tg 3 s 1 g 4 t 1 = 1 Consider the augmentation ε: Γ F n F n. An equation w Γ F n is nonsingular, if ε(w) 1.
73 More variables Question Can you solve the equation over some group? w(s, t) = g 1 sg 2 tg 3 s 1 g 4 t 1 = 1 Consider the augmentation ε: Γ F n F n. An equation w Γ F n is nonsingular, if ε(w) 1. Conjecture If w Γ F n is nonsingular, then w has a solution over Γ.
74 More variables Question Can you solve the equation over some group? w(s, t) = g 1 sg 2 tg 3 s 1 g 4 t 1 = 1 Consider the augmentation ε: Γ F n F n. An equation w Γ F n is nonsingular, if ε(w) 1. Conjecture If w Γ F n is nonsingular, then w has a solution over Γ. Theorem (with Anton Klyachko) If w Γ F 2 satisfies ε(w) [[F 2, F 2 ], F 2 ] and Γ is hyperlinear, then w has a solution over Γ.
75 Theorem (with Klyachko) Let p be prime. Any w SU(p) F 2 with ε(w) F p 2 [[F 2, F 2 ], F 2 ] can be solved in SU(p).
76 Theorem (with Klyachko) Let p be prime. Any w SU(p) F 2 with ε(w) F p 2 [[F 2, F 2 ], F 2 ] can be solved in SU(p). Instead of degree theory, we are making use of the cohomology ring of SU(p) and PU(p).
77 Theorem (with Klyachko) Let p be prime. Any w SU(p) F 2 with ε(w) F p 2 [[F 2, F 2 ], F 2 ] can be solved in SU(p). Instead of degree theory, we are making use of the cohomology ring of SU(p) and PU(p). The key insight is: 1. The commutator map c : PU(p) 2 PU(p) lifts to SU(p).
78 Theorem (with Klyachko) Let p be prime. Any w SU(p) F 2 with ε(w) F p 2 [[F 2, F 2 ], F 2 ] can be solved in SU(p). Instead of degree theory, we are making use of the cohomology ring of SU(p) and PU(p). The key insight is: 1. The commutator map c : PU(p) 2 PU(p) lifts to SU(p). (Indeed, the analogous commutator map c : SU(p) 2 SU(p) factorized through PU(p) 2.)
79 Theorem (with Klyachko) Let p be prime. Any w SU(p) F 2 with ε(w) F p 2 [[F 2, F 2 ], F 2 ] can be solved in SU(p). Instead of degree theory, we are making use of the cohomology ring of SU(p) and PU(p). The key insight is: 1. The commutator map c : PU(p) 2 PU(p) lifts to SU(p). (Indeed, the analogous commutator map c : SU(p) 2 SU(p) factorized through PU(p) 2.) 2. The generator of the topdimensional cohomology group H (SU(p), Z/pZ) is mapped nontrivially to H (PU(p) 2, Z/pZ)
80 Theorem (with Klyachko) Let p be prime. Any w SU(p) F 2 with ε(w) F p 2 [[F 2, F 2 ], F 2 ] can be solved in SU(p). Instead of degree theory, we are making use of the cohomology ring of SU(p) and PU(p). The key insight is: 1. The commutator map c : PU(p) 2 PU(p) lifts to SU(p). (Indeed, the analogous commutator map c : SU(p) 2 SU(p) factorized through PU(p) 2.) 2. The generator of the topdimensional cohomology group H (SU(p), Z/pZ) is mapped nontrivially to H (PU(p) 2, Z/pZ) = H (PU(p), Z/pZ) H (PU(p), Z/pZ).
81 Theorem (with Klyachko) Let p be prime. Any w SU(p) F 2 with ε(w) F p 2 [[F 2, F 2 ], F 2 ] can be solved in SU(p). Instead of degree theory, we are making use of the cohomology ring of SU(p) and PU(p). The key insight is: 1. The commutator map c : PU(p) 2 PU(p) lifts to SU(p). (Indeed, the analogous commutator map c : SU(p) 2 SU(p) factorized through PU(p) 2.) 2. The generator of the topdimensional cohomology group H (SU(p), Z/pZ) is mapped nontrivially to H (PU(p) 2, Z/pZ) = H (PU(p), Z/pZ) H (PU(p), Z/pZ). 3. Thus, c : PU(p) 2 SU(p) is not homotopic to a nonsurjective map.
82 Theorem (Borel) with x i = 2i 1 and H (SU(n), Z/pZ) = Λ Z/pZ (x 2, x 3,..., x n )
83 Theorem (Borel) H (SU(n), Z/pZ) = Λ Z/pZ (x 2, x 3,..., x n ) with x i = 2i 1 and (x i ) = x i x i.
84 Theorem (BaumBrowder) Let p be an odd prime number. Then, H (PU(p), Z/pZ) = (Z/pZ)[y]/(y p ) Z Λ Z/pZ (y 1, y 2,..., y p 1 ) with y = 2, y i = 2i 1.
85 Theorem (BaumBrowder) Let p be an odd prime number. Then, H (PU(p), Z/pZ) = (Z/pZ)[y]/(y p ) Z Λ Z/pZ (y 1, y 2,..., y p 1 ) with y = 2, y i = 2i 1. The comultiplication takes the form (y) = y y, and
86 Theorem (BaumBrowder) Let p be an odd prime number. Then, H (PU(p), Z/pZ) = (Z/pZ)[y]/(y p ) Z Λ Z/pZ (y 1, y 2,..., y p 1 ) with y = 2, y i = 2i 1. The comultiplication takes the form (y) = y y, and i 1 ( ) j 1 (y i ) = y i y i + y j y i j. i 1 j=1
87 Theorem (BaumBrowder) Let p be an odd prime number. Then, H (PU(p), Z/pZ) = (Z/pZ)[y]/(y p ) Z Λ Z/pZ (y 1, y 2,..., y p 1 ) with y = 2, y i = 2i 1. The comultiplication takes the form (y) = y y, and i 1 ( ) j 1 (y i ) = y i y i + y j y i j. i 1 j=1 In particular, the comultiplication is not cocommutative.
88 Larsen s Conjecture For w F 2 \ {1}, what about the equation w(s, t) = g?
89 Larsen s Conjecture For w F 2 \ {1}, what about the equation w(s, t) = g? It can always be solved over Γ, but can it be solved in PU(n) or SU(n)?
90 Larsen s Conjecture For w F 2 \ {1}, what about the equation w(s, t) = g? It can always be solved over Γ, but can it be solved in PU(n) or SU(n)? Conjecture (Larsen) Let w F 2. If n N w, then the word map w : PU(n) 2 PU(n) is surjective.
91 Larsen s Conjecture For w F 2 \ {1}, what about the equation w(s, t) = g? It can always be solved over Γ, but can it be solved in PU(n) or SU(n)? Conjecture (Larsen) Let w F 2. If n N w, then the word map w : PU(n) 2 PU(n) is surjective. Theorem (with Abdul Elkasapy) If w [[F 2, F 2 ], [F 2, F 2 ]] and n is not divisible a prime in some finite set P w, then Larsen s Conjecture holds for w.
92 Larsen s Conjecture For w F 2 \ {1}, what about the equation w(s, t) = g? It can always be solved over Γ, but can it be solved in PU(n) or SU(n)? Conjecture (Larsen) Let w F 2. If n N w, then the word map w : PU(n) 2 PU(n) is surjective. Theorem (with Abdul Elkasapy) If w [[F 2, F 2 ], [F 2, F 2 ]] and n is not divisible a prime in some finite set P w, then Larsen s Conjecture holds for w. Corollary Engel words w(s, t) = [...[[s, t], t],..., t] are always surjective on groups PU(n).
93 Remark Maybe, for fixed w F 2 \ {1} and n large enough, w : PU(n) 2 PU(n) is not even homotopic to a nonsurjective map?
94 Remark Maybe, for fixed w F 2 \ {1} and n large enough, w : PU(n) 2 PU(n) is not even homotopic to a nonsurjective map? Maybe at least not homotopically trivial?
95 Remark Maybe, for fixed w F 2 \ {1} and n large enough, w : PU(n) 2 PU(n) is not even homotopic to a nonsurjective map? Maybe at least not homotopically trivial? Theorem For any n N, ε > 0, there exists a word w F 2 \ {1} such that w(u, v) 1 n ε, u, v U(n). This solved a longstanding open problem in noncommutative harmonic analysis in the negative.
96 Thank you for your attention!
Low Dimensional Representations of the Loop Braid Group LB 3
Low Dimensional Representations of the Loop Braid Group LB 3 Liang Chang Texas A&M University UT Dallas, June 1, 2015 Supported by AMS MRC Program Joint work with Paul Bruillard, Cesar Galindo, SeungMoon
More information2 Complex Functions and the CauchyRiemann Equations
2 Complex Functions and the CauchyRiemann Equations 2.1 Complex functions In onevariable calculus, we study functions f(x) of a real variable x. Likewise, in complex analysis, we study functions f(z)
More informationTHE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS
THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS KEITH CONRAD 1. Introduction The Fundamental Theorem of Algebra says every nonconstant polynomial with complex coefficients can be factored into linear
More informationAppendix A. Appendix. A.1 Algebra. Fields and Rings
Appendix A Appendix A.1 Algebra Algebra is the foundation of algebraic geometry; here we collect some of the basic algebra on which we rely. We develop some algebraic background that is needed in the text.
More informationThe determinant of a skewsymmetric matrix is a square. This can be seen in small cases by direct calculation: 0 a. 12 a. a 13 a 24 a 14 a 23 a 14
4 Symplectic groups In this and the next two sections, we begin the study of the groups preserving reflexive sesquilinear forms or quadratic forms. We begin with the symplectic groups, associated with
More informationI. GROUPS: BASIC DEFINITIONS AND EXAMPLES
I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called
More informationChapter 13: Basic ring theory
Chapter 3: Basic ring theory Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 42, Spring 24 M. Macauley (Clemson) Chapter 3: Basic ring
More informationGroup Theory. Contents
Group Theory Contents Chapter 1: Review... 2 Chapter 2: Permutation Groups and Group Actions... 3 Orbits and Transitivity... 6 Specific Actions The Right regular and coset actions... 8 The Conjugation
More informationGROUPS ACTING ON A SET
GROUPS ACTING ON A SET MATH 435 SPRING 2012 NOTES FROM FEBRUARY 27TH, 2012 1. Left group actions Definition 1.1. Suppose that G is a group and S is a set. A left (group) action of G on S is a rule for
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS Systems of Equations and Matrices Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a
More informationALGEBRAIC QUANTUM PERMUTATION GROUPS
ALGEBRAIC QUANTUM PERMUTATION GROUPS JULIEN BICHON Abstract. We discuss some algebraic aspects of quantum permutation groups, working over arbitrary fields. If K is any characteristic zero field, we show
More information3 1. Note that all cubes solve it; therefore, there are no more
Math 13 Problem set 5 Artin 11.4.7 Factor the following polynomials into irreducible factors in Q[x]: (a) x 3 3x (b) x 3 3x + (c) x 9 6x 6 + 9x 3 3 Solution: The first two polynomials are cubics, so if
More informationMath 231b Lecture 35. G. Quick
Math 231b Lecture 35 G. Quick 35. Lecture 35: Sphere bundles and the Adams conjecture 35.1. Sphere bundles. Let X be a connected finite cell complex. We saw that the Jhomomorphism could be defined by
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS 1. SYSTEMS OF EQUATIONS AND MATRICES 1.1. Representation of a linear system. The general system of m equations in n unknowns can be written a 11 x 1 + a 12 x 2 +
More informationPOLYNOMIAL RINGS AND UNIQUE FACTORIZATION DOMAINS
POLYNOMIAL RINGS AND UNIQUE FACTORIZATION DOMAINS RUSS WOODROOFE 1. Unique Factorization Domains Throughout the following, we think of R as sitting inside R[x] as the constant polynomials (of degree 0).
More informationLinear Maps. Isaiah Lankham, Bruno Nachtergaele, Anne Schilling (February 5, 2007)
MAT067 University of California, Davis Winter 2007 Linear Maps Isaiah Lankham, Bruno Nachtergaele, Anne Schilling (February 5, 2007) As we have discussed in the lecture on What is Linear Algebra? one of
More information1. LINEAR EQUATIONS. A linear equation in n unknowns x 1, x 2,, x n is an equation of the form
1. LINEAR EQUATIONS A linear equation in n unknowns x 1, x 2,, x n is an equation of the form a 1 x 1 + a 2 x 2 + + a n x n = b, where a 1, a 2,..., a n, b are given real numbers. For example, with x and
More informationGroup Theory (MA343): Lecture Notes Semester I Dr Rachel Quinlan School of Mathematics, Statistics and Applied Mathematics, NUI Galway
Group Theory (MA343): Lecture Notes Semester I 20132014 Dr Rachel Quinlan School of Mathematics, Statistics and Applied Mathematics, NUI Galway November 21, 2013 Contents 1 What is a group? 2 1.1 Examples...........................................
More informationMath 313 Lecture #10 2.2: The Inverse of a Matrix
Math 1 Lecture #10 2.2: The Inverse of a Matrix Matrix algebra provides tools for creating many useful formulas just like real number algebra does. For example, a real number a is invertible if there is
More informationCONSEQUENCES OF THE SYLOW THEOREMS
CONSEQUENCES OF THE SYLOW THEOREMS KEITH CONRAD For a group theorist, Sylow s Theorem is such a basic tool, and so fundamental, that it is used almost without thinking, like breathing. Geoff Robinson 1.
More informationA homotopytheoretic view of Bott Taubes integrals
Stanford University November 8, 2009 Intro We will construct cohomology classes in spaces of knots K where K = Emb(S 1, R n ) or Emb(R, R n ) (n 3). Connected components of K correspond to isotopy classes
More informationMatrix Norms. Tom Lyche. September 28, Centre of Mathematics for Applications, Department of Informatics, University of Oslo
Matrix Norms Tom Lyche Centre of Mathematics for Applications, Department of Informatics, University of Oslo September 28, 2009 Matrix Norms We consider matrix norms on (C m,n, C). All results holds for
More informationLecture Notes: Matrix Inverse. 1 Inverse Definition
Lecture Notes: Matrix Inverse Yufei Tao Department of Computer Science and Engineering Chinese University of Hong Kong taoyf@cse.cuhk.edu.hk Inverse Definition We use I to represent identity matrices,
More informationLifting abelian schemes: theorems of SerreTate and Grothendieck
Lifting abelian schemes: theorems of SerreTate and Grothendieck Gabriel Dospinescu Remark 0.1. J ai décidé d écrire ces notes en anglais, car il y a trop d accents auxquels il faut faire gaffe... 1 The
More informationMATH10212 Linear Algebra. Systems of Linear Equations. Definition. An ndimensional vector is a row or a column of n numbers (or letters): a 1.
MATH10212 Linear Algebra Textbook: D. Poole, Linear Algebra: A Modern Introduction. Thompson, 2006. ISBN 0534405967. Systems of Linear Equations Definition. An ndimensional vector is a row or a column
More information(x + a) n = x n + a Z n [x]. Proof. If n is prime then the map
22. A quick primality test Prime numbers are one of the most basic objects in mathematics and one of the most basic questions is to decide which numbers are prime (a clearly related problem is to find
More informationProblem Set 7  Fall 2008 Due Tuesday, Oct. 28 at 1:00
18.781 Problem Set 7  Fall 2008 Due Tuesday, Oct. 28 at 1:00 Throughout this assignment, f(x) always denotes a polynomial with integer coefficients. 1. (a) Show that e 32 (3) = 8, and write down a list
More informationPYTHAGOREAN TRIPLES PETE L. CLARK
PYTHAGOREAN TRIPLES PETE L. CLARK 1. Parameterization of Pythagorean Triples 1.1. Introduction to Pythagorean triples. By a Pythagorean triple we mean an ordered triple (x, y, z) Z 3 such that x + y =
More informationModule MA3411: Abstract Algebra Galois Theory Appendix Michaelmas Term 2013
Module MA3411: Abstract Algebra Galois Theory Appendix Michaelmas Term 2013 D. R. Wilkins Copyright c David R. Wilkins 1997 2013 Contents A Cyclotomic Polynomials 79 A.1 Minimum Polynomials of Roots of
More informationa 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.
Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given
More informationON THE EMBEDDING OF BIRKHOFFWITT RINGS IN QUOTIENT FIELDS
ON THE EMBEDDING OF BIRKHOFFWITT RINGS IN QUOTIENT FIELDS DOV TAMARI 1. Introduction and general idea. In this note a natural problem arising in connection with socalled BirkhoffWitt algebras of Lie
More information4.5 Linear Dependence and Linear Independence
4.5 Linear Dependence and Linear Independence 267 32. {v 1, v 2 }, where v 1, v 2 are collinear vectors in R 3. 33. Prove that if S and S are subsets of a vector space V such that S is a subset of S, then
More informationArkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan
Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan 3 Binary Operations We are used to addition and multiplication of real numbers. These operations combine two real numbers
More information1 Valuations of the field of rational numbers
1 Valuations of the field of rational numbers We will begin by reviewing the construction of real numbers from rational numbers. Recall that the field of rational numbers Q is a totally ordered field by
More informationOn the existence of Gequivariant maps
CADERNOS DE MATEMÁTICA 12, 69 76 May (2011) ARTIGO NÚMERO SMA# 345 On the existence of Gequivariant maps Denise de Mattos * Departamento de Matemática, Instituto de Ciências Matemáticas e de Computação,
More informationZERODIVISOR GRAPHS OF POLYNOMIALS AND POWER SERIES OVER COMMUTATIVE RINGS
ZERODIVISOR GRAPHS OF POLYNOMIALS AND POWER SERIES OVER COMMUTATIVE RINGS M. AXTELL, J. COYKENDALL, AND J. STICKLES Abstract. We recall several results of zero divisor graphs of commutative rings. We
More information4. Matrix inverses. left and right inverse. linear independence. nonsingular matrices. matrices with linearly independent columns
L. Vandenberghe EE133A (Spring 2016) 4. Matrix inverses left and right inverse linear independence nonsingular matrices matrices with linearly independent columns matrices with linearly independent rows
More informationNonzero degree tangential maps between dual symmetric spaces
ISSN 14722739 (online) 14722747 (printed) 709 Algebraic & Geometric Topology Volume 1 (2001) 709 718 Published: 30 November 2001 ATG Nonzero degree tangential maps between dual symmetric spaces Boris
More informationIntroduction to finite fields
Introduction to finite fields Topics in Finite Fields (Fall 2013) Rutgers University Swastik Kopparty Last modified: Monday 16 th September, 2013 Welcome to the course on finite fields! This is aimed at
More informationPrimality  Factorization
Primality  Factorization Christophe Ritzenthaler November 9, 2009 1 Prime and factorization Definition 1.1. An integer p > 1 is called a prime number (nombre premier) if it has only 1 and p as divisors.
More informationAllen Back. Oct. 29, 2009
Allen Back Oct. 29, 2009 Notation:(anachronistic) Let the coefficient ring k be Q in the case of toral ( (S 1 ) n) actions and Z p in the case of Z p tori ( (Z p )). Notation:(anachronistic) Let the coefficient
More informationIdeal Class Group and Units
Chapter 4 Ideal Class Group and Units We are now interested in understanding two aspects of ring of integers of number fields: how principal they are (that is, what is the proportion of principal ideals
More informationCOBORDISM IN ALGEBRA AND TOPOLOGY
COBORDISM IN ALGEBRA AND TOPOLOGY ANDREW RANICKI (Edinburgh) http://www.maths.ed.ac.uk/ aar Dedicated to Robert Switzer and Desmond Sheiham Göttingen, 13th May, 2005 1 Cobordism There is a cobordism equivalence
More informationComputer Algebra for Computer Engineers
p.1/14 Computer Algebra for Computer Engineers Preliminaries Priyank Kalla Department of Electrical and Computer Engineering University of Utah, Salt Lake City p.2/14 Notation R: Real Numbers Q: Fractions
More informationA NOTE ON FINITE FIELDS
A NOTE ON FINITE FIELDS FATEMEH Y. MOKARI The main goal of this note is to study finite fields and their Galois groups. Since I define finite fields as subfields of algebraic closure of prime fields of
More informationThe Euler class groups of polynomial rings and unimodular elements in projective modules
The Euler class groups of polynomial rings and unimodular elements in projective modules Mrinal Kanti Das 1 and Raja Sridharan 2 1 HarishChandra Research Institute, Allahabad. Chhatnag Road, Jhusi, Allahabad
More informationVector Spaces II: Finite Dimensional Linear Algebra 1
John Nachbar September 2, 2014 Vector Spaces II: Finite Dimensional Linear Algebra 1 1 Definitions and Basic Theorems. For basic properties and notation for R N, see the notes Vector Spaces I. Definition
More informationby the matrix A results in a vector which is a reflection of the given
Eigenvalues & Eigenvectors Example Suppose Then So, geometrically, multiplying a vector in by the matrix A results in a vector which is a reflection of the given vector about the yaxis We observe that
More informationName: Section Registered In:
Name: Section Registered In: Math 125 Exam 3 Version 1 April 24, 2006 60 total points possible 1. (5pts) Use Cramer s Rule to solve 3x + 4y = 30 x 2y = 8. Be sure to show enough detail that shows you are
More informationIRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL. 1. Introduction
IRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL R. DRNOVŠEK, T. KOŠIR Dedicated to Prof. Heydar Radjavi on the occasion of his seventieth birthday. Abstract. Let S be an irreducible
More informationTheta Functions. Lukas Lewark. Seminar on Modular Forms, 31. Januar 2007
Theta Functions Lukas Lewark Seminar on Modular Forms, 31. Januar 007 Abstract Theta functions are introduced, associated to lattices or quadratic forms. Their transformation property is proven and the
More informationIntroduction to Algebraic Geometry. Bézout s Theorem and Inflection Points
Introduction to Algebraic Geometry Bézout s Theorem and Inflection Points 1. The resultant. Let K be a field. Then the polynomial ring K[x] is a unique factorisation domain (UFD). Another example of a
More informationJeanPierre Serre: the first Abel prize recipient (2003).
JeanPierre Serre: the first Abel prize recipient (2003). 1 2 born 15 September 1926 Appli PhD in 1951 ( Homologie singulière des espaces fibrés. cations ) supervisor: Henri Cartan (Sorbonne, Paris) 1956
More informationContinued Fractions and the Euclidean Algorithm
Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction
More informationAssignment 8: Selected Solutions
Section 4.1 Assignment 8: Selected Solutions 1. and 2. Express each permutation as a product of disjoint cycles, and identify their parity. (1) (1,9,2,3)(1,9,6,5)(1,4,8,7)=(1,4,8,7,2,3)(5,9,6), odd; (2)
More informationMATH10040 Chapter 2: Prime and relatively prime numbers
MATH10040 Chapter 2: Prime and relatively prime numbers Recall the basic definition: 1. Prime numbers Definition 1.1. Recall that a positive integer is said to be prime if it has precisely two positive
More informationSec 4.1 Vector Spaces and Subspaces
Sec 4. Vector Spaces and Subspaces Motivation Let S be the set of all solutions to the differential equation y + y =. Let T be the set of all 2 3 matrices with real entries. These two sets share many common
More informationMATH 4330/5330, Fourier Analysis Section 11, The Discrete Fourier Transform
MATH 433/533, Fourier Analysis Section 11, The Discrete Fourier Transform Now, instead of considering functions defined on a continuous domain, like the interval [, 1) or the whole real line R, we wish
More informationOn the greatest and least prime factors of n! + 1, II
Publ. Math. Debrecen Manuscript May 7, 004 On the greatest and least prime factors of n! + 1, II By C.L. Stewart In memory of Béla Brindza Abstract. Let ε be a positive real number. We prove that 145 1
More informationLinear Codes. In the V[n,q] setting, the terms word and vector are interchangeable.
Linear Codes Linear Codes In the V[n,q] setting, an important class of codes are the linear codes, these codes are the ones whose code words form a subvector space of V[n,q]. If the subspace of V[n,q]
More informationMA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES
MA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES 2016 47 4. Diophantine Equations A Diophantine Equation is simply an equation in one or more variables for which integer (or sometimes rational) solutions
More informationit is easy to see that α = a
21. Polynomial rings Let us now turn out attention to determining the prime elements of a polynomial ring, where the coefficient ring is a field. We already know that such a polynomial ring is a UF. Therefore
More informationMathematics Course 111: Algebra I Part IV: Vector Spaces
Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 19967 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are
More informationMatrix Representations of Linear Transformations and Changes of Coordinates
Matrix Representations of Linear Transformations and Changes of Coordinates 01 Subspaces and Bases 011 Definitions A subspace V of R n is a subset of R n that contains the zero element and is closed under
More informationGROUPS SUBGROUPS. Definition 1: An operation on a set G is a function : G G G.
Definition 1: GROUPS An operation on a set G is a function : G G G. Definition 2: A group is a set G which is equipped with an operation and a special element e G, called the identity, such that (i) the
More informationREPRESENTATION THEORY WEEK 12
REPRESENTATION THEORY WEEK 12 1. Reflection functors Let Q be a quiver. We say a vertex i Q 0 is +admissible if all arrows containing i have i as a target. If all arrows containing i have i as a source,
More information11 Ideals. 11.1 Revisiting Z
11 Ideals The presentation here is somewhat different than the text. In particular, the sections do not match up. We have seen issues with the failure of unique factorization already, e.g., Z[ 5] = O Q(
More informationFinite Fields and ErrorCorrecting Codes
Lecture Notes in Mathematics Finite Fields and ErrorCorrecting Codes KarlGustav Andersson (Lund University) (version 1.01316 September 2015) Translated from Swedish by Sigmundur Gudmundsson Contents
More informationFACTORING IN QUADRATIC FIELDS. 1. Introduction. This is called a quadratic field and it has degree 2 over Q. Similarly, set
FACTORING IN QUADRATIC FIELDS KEITH CONRAD For a squarefree integer d other than 1, let 1. Introduction K = Q[ d] = {x + y d : x, y Q}. This is called a quadratic field and it has degree 2 over Q. Similarly,
More informationGalois representations with open image
Galois representations with open image Ralph Greenberg University of Washington Seattle, Washington, USA May 7th, 2011 Introduction This talk will be about representations of the absolute Galois group
More informationElementary Number Theory We begin with a bit of elementary number theory, which is concerned
CONSTRUCTION OF THE FINITE FIELDS Z p S. R. DOTY Elementary Number Theory We begin with a bit of elementary number theory, which is concerned solely with questions about the set of integers Z = {0, ±1,
More informationThe Dirichlet Unit Theorem
Chapter 6 The Dirichlet Unit Theorem As usual, we will be working in the ring B of algebraic integers of a number field L. Two factorizations of an element of B are regarded as essentially the same if
More information1 Eigenvalues and Eigenvectors
Math 20 Chapter 5 Eigenvalues and Eigenvectors Eigenvalues and Eigenvectors. Definition: A scalar λ is called an eigenvalue of the n n matrix A is there is a nontrivial solution x of Ax = λx. Such an x
More informationTHE SIGN OF A PERMUTATION
THE SIGN OF A PERMUTATION KEITH CONRAD 1. Introduction Throughout this discussion, n 2. Any cycle in S n is a product of transpositions: the identity (1) is (12)(12), and a kcycle with k 2 can be written
More informationDeriving character tables: Where do all the numbers come from?
3.4. Characters and Character Tables 3.4.1. Deriving character tables: Where do all the numbers come from? A general and rigorous method for deriving character tables is based on five theorems which in
More informationThe fundamental group of the Hawaiian earring is not free (International Journal of Algebra and Computation Vol. 2, No. 1 (1992), 33 37) Bart de Smit
The fundamental group of the Hawaiian earring is not free Bart de Smit The fundamental group of the Hawaiian earring is not free (International Journal of Algebra and Computation Vol. 2, No. 1 (1992),
More informationNilpotent Lie and Leibniz Algebras
This article was downloaded by: [North Carolina State University] On: 03 March 2014, At: 08:05 Publisher: Taylor & Francis Informa Ltd Registered in England and Wales Registered Number: 1072954 Registered
More informationGENERATING SETS KEITH CONRAD
GENERATING SETS KEITH CONRAD 1 Introduction In R n, every vector can be written as a unique linear combination of the standard basis e 1,, e n A notion weaker than a basis is a spanning set: a set of vectors
More informationIntroduction to Topology
Introduction to Topology Tomoo Matsumura November 30, 2010 Contents 1 Topological spaces 3 1.1 Basis of a Topology......................................... 3 1.2 Comparing Topologies.......................................
More informationFinite dimensional C algebras
Finite dimensional C algebras S. Sundar September 14, 2012 Throughout H, K stand for finite dimensional Hilbert spaces. 1 Spectral theorem for selfadjoint opertors Let A B(H) and let {ξ 1, ξ 2,, ξ n
More informationSolving Linear Systems, Continued and The Inverse of a Matrix
, Continued and The of a Matrix Calculus III Summer 2013, Session II Monday, July 15, 2013 Agenda 1. The rank of a matrix 2. The inverse of a square matrix Gaussian Gaussian solves a linear system by reducing
More informationCHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY
January 10, 2010 CHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY The set of polynomials over a field F is a ring, whose structure shares with the ring of integers many characteristics.
More informationU.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009. Notes on Algebra
U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009 Notes on Algebra These notes contain as little theory as possible, and most results are stated without proof. Any introductory
More informationTOPOLOGY OF SINGULAR FIBERS OF GENERIC MAPS
TOPOLOGY OF SINGULAR FIBERS OF GENERIC MAPS OSAMU SAEKI Dedicated to Professor Yukio Matsumoto on the occasion of his 60th birthday Abstract. We classify singular fibers of C stable maps of orientable
More informationZero: If P is a polynomial and if c is a number such that P (c) = 0 then c is a zero of P.
MATH 11011 FINDING REAL ZEROS KSU OF A POLYNOMIAL Definitions: Polynomial: is a function of the form P (x) = a n x n + a n 1 x n 1 + + a x + a 1 x + a 0. The numbers a n, a n 1,..., a 1, a 0 are called
More informationADDITIVE GROUPS OF RINGS WITH IDENTITY
ADDITIVE GROUPS OF RINGS WITH IDENTITY SIMION BREAZ AND GRIGORE CĂLUGĂREANU Abstract. A ring with identity exists on a torsion Abelian group exactly when the group is bounded. The additive groups of torsionfree
More informationUnique Factorization
Unique Factorization Waffle Mathcamp 2010 Throughout these notes, all rings will be assumed to be commutative. 1 Factorization in domains: definitions and examples In this class, we will study the phenomenon
More informationFactoring of Prime Ideals in Extensions
Chapter 4 Factoring of Prime Ideals in Extensions 4. Lifting of Prime Ideals Recall the basic AKLB setup: A is a Dedekind domain with fraction field K, L is a finite, separable extension of K of degree
More informationMATH 131 SOLUTION SET, WEEK 12
MATH 131 SOLUTION SET, WEEK 12 ARPON RAKSIT AND ALEKSANDAR MAKELOV 1. Normalisers We first claim H N G (H). Let h H. Since H is a subgroup, for all k H we have hkh 1 H and h 1 kh H. Since h(h 1 kh)h 1
More informationChapter 7: Products and quotients
Chapter 7: Products and quotients Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 42, Spring 24 M. Macauley (Clemson) Chapter 7: Products
More informationDIVISORS AND LINE BUNDLES
DIVISORS AND LINE BUNDLES TONY PERKINS 1. Cartier divisors An analytic hypersurface of M is a subset V M such that for each point x V there exists an open set U x M containing x and a holomorphic function
More informationFINITE FIELDS KEITH CONRAD
FINITE FIELDS KEITH CONRAD This handout discusses finite fields: how to construct them, properties of elements in a finite field, and relations between different finite fields. We write Z/(p) and F p interchangeably
More informationABSTRACT ALGEBRA. Romyar Sharifi
ABSTRACT ALGEBRA Romyar Sharifi Contents Introduction 7 Part 1. A First Course 11 Chapter 1. Set theory 13 1.1. Sets and functions 13 1.2. Relations 15 1.3. Binary operations 19 Chapter 2. Group theory
More informationLecture 13  Basic Number Theory.
Lecture 13  Basic Number Theory. Boaz Barak March 22, 2010 Divisibility and primes Unless mentioned otherwise throughout this lecture all numbers are nonnegative integers. We say that A divides B, denoted
More informationTROPICAL CRYPTOGRAPHY
TROPICAL CRYPTOGRAPHY DIMA GRIGORIEV AND VLADIMIR SHPILRAIN Abstract. We employ tropical algebras as platforms for several cryptographic schemes that would be vulnerable to linear algebra attacks were
More informationThe Chebotarev Density Theorem
The Chebotarev Density Theorem Hendrik Lenstra 1. Introduction Consider the polynomial f(x) = X 4 X 2 1 Z[X]. Suppose that we want to show that this polynomial is irreducible. We reduce f modulo a prime
More informationWintersemester 2015/2016. University of Heidelberg. Geometric Structures on Manifolds. Geometric Manifolds. by Stephan Schmitt
Wintersemester 2015/2016 University of Heidelberg Geometric Structures on Manifolds Geometric Manifolds by Stephan Schmitt Contents Introduction, first Definitions and Results 1 Manifolds  The Group way....................................
More informationAn Introduction to Braid Theory
An Introduction to Braid Theory Maurice Chiodo November 4, 2005 Abstract In this paper we present an introduction to the theory of braids. We lay down some clear definitions of a braid, and proceed to
More informationChapter 17. Orthogonal Matrices and Symmetries of Space
Chapter 17. Orthogonal Matrices and Symmetries of Space Take a random matrix, say 1 3 A = 4 5 6, 7 8 9 and compare the lengths of e 1 and Ae 1. The vector e 1 has length 1, while Ae 1 = (1, 4, 7) has length
More informationSets of Fibre Homotopy Classes and Twisted Order Parameter Spaces
Communications in Mathematical Physics ManuscriptNr. (will be inserted by hand later) Sets of Fibre Homotopy Classes and Twisted Order Parameter Spaces Stefan BechtluftSachs, Marco Hien Naturwissenschaftliche
More information