Alperin s Fusion Theorem for localities
|
|
- Todd Campbell
- 7 years ago
- Views:
Transcription
1 Alperin s Fusion Theorem for localities RÉMI MOLINIER In these notes we give an Alperin s Fusion Theorem for localities. 20D20, 20J15; 20J06 The notion of locality was introduced by Chermak [Ch] to study p-local structures of finite groups and to prove the existence and uniqueness of linking systems associated to saturated fusion systems. In the way he proved that there is a one-to-one correspondance between localities with saturated fusion system F and transporter systems associated to F. Linking systems and transporter systems were introduced by Broto, Levi and Oliver in [BLO2] and Oliver and Ventura in [OV1] respectively. They introduced these categories to study saturated fusion systems, p-completed classifying spaces of finite groups and to develop a theory of classifying spaces for saturated fusion systems. Localities give a more group-like point of view on theses objects which allows us to use tools from group theory. This paper gives also an example where the setup of localities helps to prove results on transporter systems. We present here a version of Alperin s Fusion Theorem for localities which generalizes the Alerin Fusion Theorem for finite groups (a nice version can be found in [St] Theorem 1). Chermak already gave an Alperin s Fusion Theorem for proper localities (i.e. localities which corresponds to linking systems) in [Ch] Proposition Here to be able to work with any locality we have to relax a bit his notion of L-essential subgroups. However, our definition of L-essential corresponds to the original notion of "essential" (See [St] Definition page 97). We use this Theorem to get a generalization of the Alperin Fusion Theorem for transporter systems given by Oliver and Ventura in [OV1]. This may be applied for example with group cohomology. Acknowledgement. The author is eternally grateful to Andy Chermak for so many discussions and teaching him so much about partial groups and localities. 1 Localities and fusion systems 1.1 Partial groups, objective partial groups and localities The notions of partial group and locality are due to Chermak. We present here the definitions and the useful properties but more details can be found in [Ch]. For X a set W(X) will denote the free monoid on X and for two words u, v W(X), u v will denote the concatenation of u and v. We also identify X as the subset of words of length 1 in W(X). Definition 1.1 Let M be a set and D(M) W(M) be a subset such that, 1
2 (i) (ii) M D(M); and u v D(M) u, v D(M) (in particular, D(M)). A mapping Π : D(M) M is a product if (P1) Π restricts to the identity on M; and (P2) if u v w D(M) then u Π(v) w D(M) and Π(u v w) = Π (u Π(v) w). Thee unit of Π is then defined as Π( ). A partial monoid is a triple (M, D(M), Π) where Π is a product defined on D(M). An inversion on M is an involutory bijection x x 1 on M together with the induced mapping u u 1 on W(M) defined by, u = (x 1, x 2,..., x n ) (xn 1, xn 1 1,..., x 1 1 ). A partial group is a tuple (M, D(M), Π, ( ) 1 ) where Π is a product on D(M) and ( ) 1 is an inversion on M satisfying (P3) if u D(M) then (u 1, u) D(M) and Π(u 1 u) = 1. To simplify the notation, we will use M to refer to a partial group (M, D(M), Π, ( ) 1 ) when the rest of the data is understood. For g M we also write D(g) = {x M (g 1, x, g) D}. Example Let M be a partial group. if D(M) = W(M) then M is a group via the binary operation (x, y) M 2 Π(x, y) M. Definition 1.2 Let L be a partial group and a collection of subgroups of L. Define D to be the set of all w = (g 1, g 2,..., g n ) W(L) such that (*) there exists (X 0, X 1,..., X n ) W( ) with (X i 1 ) gi = X i for all i(1 i n). Then, (L, ) is an objective partial group if the following two conditions holds. (O1) D(L) = D. (O2) Whenever X and Y are in and g L such that X g is a subgroup of Y, then every subgroup of Y containing X g is in. Definition 1.3 Let p be a prime, let L be a finite partial group. Let S be a p-subgroup of L, and let be a collection of subgroups of S such that S. Then, (L,, S) is a locality if: (L1) (L, ) is objective; and (L2) S is maximal in the poset (ordered by inclusion) of finite p-subgroups of L. If (L,, S) is a locality and g L, we write S g = {s S (g 1, x, g) D(L) and x g S}. 2
3 Lemma 1.4 Let (L,, S) be a locality. (a) For every X, N L (X) is a subgroup of L. (b) Let g L and let X with X g. Then N L (X) D(g), and c g : N L (X) N L (X g ) is an isomorphism of groups. (c) every p-subgroup of L is conjugate to a subgroup of S. Proof Propositions (a) and (b) correspond to propositions (a) and (b) of [Ch] Lemma 2.7 and are in fact true in an objective partial group. Finally, (c) is proved in [Ch] Proposition 2.22 (b). 1.2 Fusion systems A fusion system over a p-group S is a way to abstract the action of a finite group G S on the subgroups of S by conjugation. For G a finite group and g G, we will denote by c g the homomorphism x G g 1 xg G and for H, K two subgroups of G, Hom G (H, K) will denote the set of all group homomorphisms c g for g G such that c g (H) K and Syl p (G) will denote the collection of Sylow p-subgroup of G. Definition 1.5 Let S be a finite p-group. A fusion system over S is a small category F, where Ob(F) is the set of all subgroups of S and which satisfies the following two properties for all P, Q S: (a) Hom S (P, Q) Mor F (P, Q) Inj(P, Q); (b) each ϕ Mor F (P, Q) is the composite of an F -isomorphism followed by an inclusion. The composition in a fusion system is given by composition of homomorphisms. We usually write Hom F (P, Q) = Mor F (P, Q) to emphasize that the morphisms in F are homomorphisms. The typical example of fusion system is the fusion system of a finite group G. Example Let G be a finite group and S Syl p (G). The fusion system of G over S is the category F S (G) where Ob(F S (G)) is the set of all subgroups of S and for all P, Q S, Mor FS (G)(P, Q) = Hom G (P, Q). The category F S (G) defines a fusion system over S. An other important example is the fusion system of a locality. Example Let (L,, S) be a locality. The fusion system of L over S is the fusion system F S (L) generated by {c g : S g (S g ) g g L}: for P, Q S and ϕ Hom(P, Q), ϕ Hom FS (L)(P, Q) if ϕ is a composite of restrictions of c g : S g (S g ) g for g L. Definition 1.6 Let S be a p-group and F a fusion system over S. (a) Two subgroups P, Q S are F -conjugate if they are isomorphic as objects in F. We denote by P F the set of all subgroups of S F -conjugate to P. 3
4 (b) A subgroup P S is fully normalized (resp. fully centralized) if for every Q P F, N S (P) N S (Q) (resp. C S (P) C S (Q) ). (c) A subgroup P S is receptive in F if it has the following property: for each Q S and ϕ Iso F (Q, P), if we set N ϕ = { g N S (Q) ϕ c g ϕ 1 Aut S (P) }, then there is ϕ Hom F (N ϕ, S) such that ϕ Q = ϕ. Definition 1.7 Let F be a fusion system over a p-group S. Let be a collection of subgroup of S. (a) is F -invariant if for every P and ϕ Hom F (P, S), ϕ(p). (b) is F -closed if it is F -invariant and closed by passing to overgroups in S. For example, if (L,, S) is a locality, is F S (L)-invariant and F S (L)-closed. Definition 1.8 Let F be a fusion system over a p-group S and let be an F -invariant collection of subgroups of S. We say that F is -saturated if (I) If P is fully normalized, then it is also fully centralized and Aut S (P) is a Sylow p-subgroup of Aut F (P); and (II) If P is fully centralized, then it is also receptive. We say that F is saturated if F is -saturated for the set of all subgroups of S. Saturation of a fusion system F over a p-group S can be controlled by a smaller collection of subgroups than all the subgroups of S. Definition 1.9 Let F be a fusion system over a p-group S. (a) A subgroup P S is F -centric if, for every Q P F, C S (Q) = Z(Q). (b) A subgroup P S is F -radical if O p (Out F (P)) = 1. We denote by F c, F r and F cr the collections of, respectively, F -centric, F -radical and, F -centric and F -radical subgroups of S. Theorem 1.10 ([5a1], Theorem 2.2) Let F be a fusion system over a p-group S. Let be an F - closed collection of subgroups of S such that F cr. Suppose that F is -saturated and that each F -isomorphism is a composite of restrictions of F -isomorphisms between members of. Then F is saturated. Proposition 1.11 ([Ch], Proposition 2.17) Let (L,, S) be a locality. Then, F S (L) is -saturated. In particular, if F cr, then F S (L) is saturated. 4
5 2 Alperin s Fusion Theorem Definition 2.1 Let G be a finite group. Let Γ p (G) be the graph whose vertices are the Sylow p-subgroups of G, and those edges are the pairs {S 1, S 2 } of distinct Sylow p-subgroups of G such that S 1 S 2 1. We say that G is p-disconnected if Γ p (G) is disconnected. Let G be a finite group. Then G is acting on Γ p (G) by conjugation, and, by Sylow s Theorem, this action is transitive on vertices. If S is a fixed Sylow p-subgroup of G, let Σ be the connected component of Γ p (G) which contains S and let H be the set-wize stabilizer of Σ in G. If G is p-disconnected then H < G and for every g G H, p does not divide H H g. Recall that a subgroup H of G is strongly p-embedded if H < G and for every g G H, p does not divide H H g. Hence, if G is p-disconnected then G contains a strongly p-embedded subgroup. The converse is also true and we have the following remark. Remark 2.2 A finite group G is p-disconnected if and only if G contains a strongly p-embedded subgroup. Remark 2.3 Let G be a finite group and let Sp (G) be the poset of nontrivial p-subgroup of G. Notice that Γ p (G) is connected if and only if Sp (G) is connected. Thus we could have defined p-disconnected with Sp (G) instead of Γ p (G). But working with Γ p (G) will be more convenient in the proof of Theorem 2.5. Definition 2.4 Let (L,, S) be a locality. (a) A subgroup P is L-radical if O p (N L (P)/P) = 1. (b) A subgroup P is L-essential if N S (P) Syl p (N L (P)) and N L (P)/P is p-disconnected. Denote r and e the subcollections of of, respectively, L-radical and L-essential subgroups of S. Notice that, by Lemma 1.4, if P S then N S (P) Syl p (N L (P)) if and only if P is fully normalized in F S (L). Notice also that for a subgroup P S to be L-essential, we do not require P to be centric in L as required in [Ch] Definition 2.4. If G is a finite group, O p (G) 1 implies that Γ p (G) is connected. Therefore, if (L,, S) is a locality, If P is L-essential then P is L-radical. But the converse is clearly false. Theorem 2.5 Let (L,, S) be a locality. Then, for every g L, there exists Q 1, Q 2,..., Q n e {S} and w = (g 1, g 2,..., g n ) D(L) such that, (i) for every i {1, 2,..., n}, g i N L (Q i ) and S gi = Q i ; and (ii) S w = S g and g = Π(w). Proof We will say that g L admits an essential decomposition if there exists Q 1, Q 2,..., Q n e {S} and w = (g 1, g 2,..., g n ) D(L) such that (i) and (ii) are satisfied. Notice that we have the followings. (1) If g L admits an essential decomposition then g 1 admits an essential decomposition. (2) If (g, h) D(L) with S (g,h) = S gh and, g and h admit an essential decomposition, then, gh admits an essential decomposition. 5
6 Assume Theorem 2.5 is false and, among all g L which does not admit an essential decomposition, choose g with S g as large as possible. Set P = S g, P = P g and F = F S (L). If P = S, then g N L (S) and g admits an essential decomposition with n = 1, Q 1 = S and w = (g). Thus, we can assume that P < S. By Proposition 1.11, F is -saturated. then, there is Q fully normalized and h, h L such that P h = Q and (P ) h = Q. By Lemma 1.4 and Sylow s Theorem (applied in N L (Q)), we can choose h and h such that N S (P) h N S (Q) and N S (P ) h N S (Q). Then, by maximality of P, h and h admit an essential decomposition. The word w = (h 1, g, h ) is in D(L) via Q and g := h 1 gh N L (Q). Then g = hg h 1 and S ( h, g, h 1 ) = S g. Therefore, if g admits an essential decomposition, then, by (1) and (2), g admits an essential decomposition, and we can assume that P is fully normalized and g N L (P). If P e, then g admits an essential decomposition with n = 1, Q 1 = P and w = (g). Thus, P e and Γ p (N L (P))/P is p-connected. In particular, there is a sequence X 0, X 1,..., X r of Sylow p-subgroup of N L (P) with X 0 = N S (P), X r = N S (P) g and with X i adjacent in Γ p (N L (P)) to X i 1 for all i {1, 2,..., r}. Choose u N L (P) such that (X 0 ) u = X r 1 and let v = u 1 g. We have (u, v) D(L), g = uv and P S (u,v) S g = P. Thus, S (u,v) = P and if u and v admit an essential decomposition, by (2), g admits an essential decomposition. Therefore, we can assume that (N S (P) N S (P) g )/P 1. In particular, P < N S (P) N S (P) g S g = P which gives a contradiction. As mention before, for a subgroup P S to be L-essential, we do not require P to be centric. indeed, Theorem 2.5 does not work if we add this requirement. Example Let L = Σ 3 be the symmetric group over 3 letter and p = 2. let S =< (1, 2) > and bethe collection of all the subgroups of S (i.e. = {S, {e}}). Then (L,, S) is a locality where S and {e} are L-essential. But only S is centric and (1, 2, 3) is not the product of elements in N L (S) = S. 3 Application to transporter systems 3.1 Transporter systems and localities We refer the reader to [OV1] Definition 3.1 for the definition of transporter system. The typical example is the following. Example Let G be a finite group S Syl p (G) and an F -invariant collection of subgroups of S. The transporter category of G over S with set of object is the small category T = TS (G) with set of objet and, for P, Q, Mor T (P, Q) = {g G P g Q}. By [OV1] Proposition 3.12, it is a transporter system associated to F S (G). In [Ch] Appendix X, Chermak gives a one-to-one correspondence between localities with fusion system F and transporter systems associated to F. 6
7 Definition 3.1 Let (L, ) be an objective partial group. We define the transporter system of (L, ) as the category T (L) with set of object and with, for P, Q, Mor T (P, Q) = {g L P S g and P g Q}. Proposition 3.2 ([Ch], Lemma X.1) Let (L,, S) be a locality with F S (L) saturated. Then T (L) defines a transporter system associated to F S (L). Proposition 3.3 ([Ch], Proposition X.9) Let F be a saturated fusion system over a p-group S, and T be an associated transporter system. Then there exists a locality (L,, S) such that T = T (L). 3.2 Alperin s Fusion system for transporter systems In the following Definition, we recall the definition of T -radical subgroup from [OV1], and we give the definition of T -essential subgroup. Definition 3.4 Let F be a saturated fusion system and T be an associated transporter system. (i) A subgroup P Ob(T ) is T -radical if O p (Aut T (P)/δ P (P)) = 1. (ii) A subgroup P Ob(T ) is T -essential if N S (P) Syl p (Aut T (G)) and Aut T (P)/P is p-disconnected. Denote T r the full subcategories of T with set of objects the T -radical subgroups of S and T e the full subcategory of T with set of objects S and all the T -essential subgroups of S. Let (L,, S) be a locality. then a subgroup P S is T (L)-radical (resp. T (L)-essential) if and only if P is L-radical (resp. L-essential). The following Theorem gives a generalization of the Alperin Fusion Theorem for transporter systems ([OV1] Proposition 3.10). Theorem 3.5 Let F be a fusion system over a p-group S. If T is a transporter system associated to F, then every morphism in T is a composite of restrictions of automorphisms of S or T -essential subgroups. Proof By Proposition 3.3, there is a locality (L,, S) such that T = T (L). Let P, Q = Ob(T ) and choose g Mor T (P, Q) L. Without lost of generality, we can assume that P = S g and Q = S g g. By Theorem 2.5, there exists Q 1, Q 2,..., Q n e {S} and w = (g 1, g 2,..., g n ) D(L) such that, (i) for every i {1, 2,..., n}, g i N L (Q i ) and S gi = Q i ; and (ii) S w = S g and g = Π(w). We have P = S g = S w S g1 = Q 1 and inductively, for 1 i n 1, P g 1 g i Q i+1 = S gi+1. Thus g is the composite of the restriction of g i Aut T (Q i ) to g i Mor T (P g 1 g i 1, P g 1 g i ), for 1 i n. The following Corollary, which is a direct consequence of Theorem 3.5, may be helpful when computing limits over transporter systems. 7
8 Corollary 3.6 Let F be a fusion system over a p-group S. Let T be a transporter system associated to F and let F : T A be a functor into an abelian category A Then, lim F = lim F. T We can for example use the previous corollary with F = F S (G), where G is a finite group and S Syl p (G), and F = H (, M) for M a Z (p) [G]-module. T e Corollary 3.7 Let G be a finite group and S Syl p (G). Let M a Z (p) [G]-module. Then H (G, M) = lim H (, M). TS e(g) Proof By the Cartan-Eilenberg Theorem ([CE] Chap XII, Theorem 10.1), Then we can apply Corollary 3.6. H (G, M) = lim H (, M). T S (G) A more general version was actually proved by Grodal in [Gr] Corollary 10.4 using deep algebraic topology. The proof we give here is algebraic, more elementary and use directly the p-local structure of G. References [5a1] Carles Broto, Natàlia Castellana, Jesper Grodal, Ran Levi, and Bob Oliver. Subgroup families controlling p-local finite groups. Proc. London Math. Soc. (3), 91(2): , [BLO2] Carles Broto, Ran Levi, and Bob Oliver. The homotopy theory of fusion systems. J. Amer. Math. Soc., 16(4): , [CE] Henri Cartan and Samuel Eilenberg. Homological algebra. Princeton Landmarks in Mathematics. Princeton University Press, Princeton, NJ, With an appendix by David A. Buchsbaum, Reprint of the 1956 original. [Ch] Andrew Chermak. Fusion systems and localities. Acta Math., 211(1):47 139, [Gr] Jesper Grodal. Higher limits via subgroup complexes. Ann. of Math. (2), 155(2): , [OV1] Bob Oliver and Joana Ventura. Extensions of linking systems with p-group kernel. Math. Ann., 338(4): , [St] Bernd Stellmacher. On Alperin s fusion theorem. Beiträge Algebra Geom., 35(1):95 99, Festschrift on the occasion of the 65th birthday of Otto Krötenheerdt. molinier@ksu.edu 8
COMBINATORIAL PROPERTIES OF THE HIGMAN-SIMS GRAPH. 1. Introduction
COMBINATORIAL PROPERTIES OF THE HIGMAN-SIMS GRAPH ZACHARY ABEL 1. Introduction In this survey we discuss properties of the Higman-Sims graph, which has 100 vertices, 1100 edges, and is 22 regular. In fact
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 informationNOTES ON CATEGORIES AND FUNCTORS
NOTES ON CATEGORIES AND FUNCTORS These notes collect basic definitions and facts about categories and functors that have been mentioned in the Homological Algebra course. For further reading about category
More informationG = G 0 > G 1 > > G k = {e}
Proposition 49. 1. A group G is nilpotent if and only if G appears as an element of its upper central series. 2. If G is nilpotent, then the upper central series and the lower central series have the same
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 informationRow Ideals and Fibers of Morphisms
Michigan Math. J. 57 (2008) Row Ideals and Fibers of Morphisms David Eisenbud & Bernd Ulrich Affectionately dedicated to Mel Hochster, who has been an inspiration to us for many years, on the occasion
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 informationSOME PROPERTIES OF FIBER PRODUCT PRESERVING BUNDLE FUNCTORS
SOME PROPERTIES OF FIBER PRODUCT PRESERVING BUNDLE FUNCTORS Ivan Kolář Abstract. Let F be a fiber product preserving bundle functor on the category FM m of the proper base order r. We deduce that the r-th
More informationA REMARK ON ALMOST MOORE DIGRAPHS OF DEGREE THREE. 1. Introduction and Preliminaries
Acta Math. Univ. Comenianae Vol. LXVI, 2(1997), pp. 285 291 285 A REMARK ON ALMOST MOORE DIGRAPHS OF DEGREE THREE E. T. BASKORO, M. MILLER and J. ŠIRÁŇ Abstract. It is well known that Moore digraphs do
More informationLinear Algebra. A vector space (over R) is an ordered quadruple. such that V is a set; 0 V ; and the following eight axioms hold:
Linear Algebra A vector space (over R) is an ordered quadruple (V, 0, α, µ) such that V is a set; 0 V ; and the following eight axioms hold: α : V V V and µ : R V V ; (i) α(α(u, v), w) = α(u, α(v, w)),
More informationClassification of Bundles
CHAPTER 2 Classification of Bundles In this chapter we prove Steenrod s classification theorem of principal G - bundles, and the corresponding classification theorem of vector bundles. This theorem states
More informationON GALOIS REALIZATIONS OF THE 2-COVERABLE SYMMETRIC AND ALTERNATING GROUPS
ON GALOIS REALIZATIONS OF THE 2-COVERABLE SYMMETRIC AND ALTERNATING GROUPS DANIEL RABAYEV AND JACK SONN Abstract. Let f(x) be a monic polynomial in Z[x] with no rational roots but with roots in Q p for
More informationA NOTE ON TRIVIAL FIBRATIONS
A NOTE ON TRIVIAL FIBRATIONS Petar Pavešić Fakulteta za Matematiko in Fiziko, Univerza v Ljubljani, Jadranska 19, 1111 Ljubljana, Slovenija petar.pavesic@fmf.uni-lj.si Abstract We study the conditions
More informationCLUSTER ALGEBRAS AND CATEGORIFICATION TALKS: QUIVERS AND AUSLANDER-REITEN THEORY
CLUSTER ALGEBRAS AND CATEGORIFICATION TALKS: QUIVERS AND AUSLANDER-REITEN THEORY ANDREW T. CARROLL Notes for this talk come primarily from two sources: M. Barot, ICTP Notes Representations of Quivers,
More informationOnline publication date: 11 March 2010 PLEASE SCROLL DOWN FOR ARTICLE
This article was downloaded by: [Modoi, George Ciprian] On: 12 March 2010 Access details: Access Details: [subscription number 919828804] Publisher Taylor & Francis Informa Ltd Registered in England and
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 J-homomorphism could be defined by
More informationGalois Theory III. 3.1. Splitting fields.
Galois Theory III. 3.1. Splitting fields. We know how to construct a field extension L of a given field K where a given irreducible polynomial P (X) K[X] has a root. We need a field extension of K where
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 information9. Quotient Groups Given a group G and a subgroup H, under what circumstances can we find a homomorphism φ: G G ', such that H is the kernel of φ?
9. Quotient Groups Given a group G and a subgroup H, under what circumstances can we find a homomorphism φ: G G ', such that H is the kernel of φ? Clearly a necessary condition is that H is normal in G.
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 informationFUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES
FUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES CHRISTOPHER HEIL 1. Cosets and the Quotient Space Any vector space is an abelian group under the operation of vector addition. So, if you are have studied
More informationGROUP ALGEBRAS. ANDREI YAFAEV
GROUP ALGEBRAS. ANDREI YAFAEV We will associate a certain algebra to a finite group and prove that it is semisimple. Then we will apply Wedderburn s theory to its study. Definition 0.1. Let G be a finite
More informationFINITE DIMENSIONAL ORDERED VECTOR SPACES WITH RIESZ INTERPOLATION AND EFFROS-SHEN S UNIMODULARITY CONJECTURE AARON TIKUISIS
FINITE DIMENSIONAL ORDERED VECTOR SPACES WITH RIESZ INTERPOLATION AND EFFROS-SHEN S UNIMODULARITY CONJECTURE AARON TIKUISIS Abstract. It is shown that, for any field F R, any ordered vector space structure
More informationDegree Hypergroupoids Associated with Hypergraphs
Filomat 8:1 (014), 119 19 DOI 10.98/FIL1401119F Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat Degree Hypergroupoids Associated
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 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 informationFIBRATION SEQUENCES AND PULLBACK SQUARES. Contents. 2. Connectivity and fiber sequences. 3
FIRTION SEQUENES ND PULLK SQURES RY MLKIEWIH bstract. We lay out some foundational facts about fibration sequences and pullback squares of topological spaces. We pay careful attention to connectivity ranges
More informationON GENERALIZED RELATIVE COMMUTATIVITY DEGREE OF A FINITE GROUP. A. K. Das and R. K. Nath
International Electronic Journal of Algebra Volume 7 (2010) 140-151 ON GENERALIZED RELATIVE COMMUTATIVITY DEGREE OF A FINITE GROUP A. K. Das and R. K. Nath Received: 12 October 2009; Revised: 15 December
More informationGroups with the same orders and large character degrees as PGL(2, 9) 1. Introduction and preliminary results
Quasigroups and Related Systems 21 (2013), 239 243 Groups with the same orders and large character degrees as PGL(2, 9) Behrooz Khosravi Abstract. An interesting class of problems in character theory arises
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 informationHow To Prove The Cellosauric Cardinal Compactness (For A Cardinal Cardinal Compact)
Cellular objects and Shelah s singular compactness theorem Logic Colloquium 2015 Helsinki Tibor Beke 1 Jiří Rosický 2 1 University of Massachusetts tibor beke@uml.edu 2 Masaryk University Brno rosicky@math.muni.cz
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 torsion-free
More informationF. ABTAHI and M. ZARRIN. (Communicated by J. Goldstein)
Journal of Algerian Mathematical Society Vol. 1, pp. 1 6 1 CONCERNING THE l p -CONJECTURE FOR DISCRETE SEMIGROUPS F. ABTAHI and M. ZARRIN (Communicated by J. Goldstein) Abstract. For 2 < p
More informationFIBER PRODUCTS AND ZARISKI SHEAVES
FIBER PRODUCTS AND ZARISKI SHEAVES BRIAN OSSERMAN 1. Fiber products and Zariski sheaves We recall the definition of a fiber product: Definition 1.1. Let C be a category, and X, Y, Z objects of C. Fix also
More informationA CONSTRUCTION OF THE UNIVERSAL COVER AS A FIBER BUNDLE
A CONSTRUCTION OF THE UNIVERSAL COVER AS A FIBER BUNDLE DANIEL A. RAMRAS In these notes we present a construction of the universal cover of a path connected, locally path connected, and semi-locally simply
More informationAlgebra of the 2x2x2 Rubik s Cube
Algebra of the 2x2x2 Rubik s Cube Under the direction of Dr. John S. Caughman William Brad Benjamin. Introduction As children, many of us spent countless hours playing with Rubiks Cube. At the time it
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 informationCOHOMOLOGY OF GROUPS
Actes, Congrès intern. Math., 1970. Tome 2, p. 47 à 51. COHOMOLOGY OF GROUPS by Daniel QUILLEN * This is a report of research done at the Institute for Advanced Study the past year. It includes some general
More information(0, 0) : order 1; (0, 1) : order 4; (0, 2) : order 2; (0, 3) : order 4; (1, 0) : order 2; (1, 1) : order 4; (1, 2) : order 2; (1, 3) : order 4.
11.01 List the elements of Z 2 Z 4. Find the order of each of the elements is this group cyclic? Solution: The elements of Z 2 Z 4 are: (0, 0) : order 1; (0, 1) : order 4; (0, 2) : order 2; (0, 3) : order
More informationThe components of a variety of matrices with square zero and submaximal rank
The components of a variety of matrices with square zero and submaximal ran DIKRAN KARAGUEUZIAN Mathematics Department, SUNY Binghamton, Binghamton, NY 13902, USA E-mail: diran@math.binghamton.edu BOB
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 informationACTA UNIVERSITATIS APULENSIS No 15/2008 PRODUCTS OF MULTIALGEBRAS AND THEIR FUNDAMENTAL ALGEBRAS. Cosmin Pelea
ACTA UNIVERSITATIS APULENSIS No 15/2008 PRODUCTS OF MULTIALGEBRAS AND THEIR FUNDAMENTAL ALGEBRAS Cosmin Pelea Abstract. An important tool in the hyperstructure theory is the fundamental relation. The factorization
More information6.2 Permutations continued
6.2 Permutations continued Theorem A permutation on a finite set A is either a cycle or can be expressed as a product (composition of disjoint cycles. Proof is by (strong induction on the number, r, of
More informationON THE NUMBER OF REAL HYPERSURFACES HYPERTANGENT TO A GIVEN REAL SPACE CURVE
Illinois Journal of Mathematics Volume 46, Number 1, Spring 2002, Pages 145 153 S 0019-2082 ON THE NUMBER OF REAL HYPERSURFACES HYPERTANGENT TO A GIVEN REAL SPACE CURVE J. HUISMAN Abstract. Let C be a
More informationCOFINAL MAXIMAL CHAINS IN THE TURING DEGREES
COFINA MAXIMA CHAINS IN THE TURING DEGREES WEI WANG, IUZHEN WU, AND IANG YU Abstract. Assuming ZF C, we prove that CH holds if and only if there exists a cofinal maximal chain of order type ω 1 in the
More informationFinite dimensional topological vector spaces
Chapter 3 Finite dimensional topological vector spaces 3.1 Finite dimensional Hausdorff t.v.s. Let X be a vector space over the field K of real or complex numbers. We know from linear algebra that the
More informationSHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH
31 Kragujevac J. Math. 25 (2003) 31 49. SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH Kinkar Ch. Das Department of Mathematics, Indian Institute of Technology, Kharagpur 721302, W.B.,
More informationMathematics Course 111: Algebra I Part IV: Vector Spaces
Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are
More informationTilings of the sphere with right triangles III: the asymptotically obtuse families
Tilings of the sphere with right triangles III: the asymptotically obtuse families Robert J. MacG. Dawson Department of Mathematics and Computing Science Saint Mary s University Halifax, Nova Scotia, Canada
More informationTHIN GROUPS OF FRACTIONS
Contemporary Mathematics THIN GROUPS OF FRACTIONS Patrick DEHORNOY Abstract. A number of properties of spherical Artin Tits groups extend to Garside groups, defined as the groups of fractions of monoids
More informationClassification of Cartan matrices
Chapter 7 Classification of Cartan matrices In this chapter we describe a classification of generalised Cartan matrices This classification can be compared as the rough classification of varieties in terms
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 informationEffective homotopy of the fiber of a Kan fibration
Effective homotopy of the fiber of a Kan fibration Ana Romero and Francis Sergeraert 1 Introduction Inspired by the fundamental ideas of the effective homology method (see [5] and [4]), which makes it
More information1 Local Brouwer degree
1 Local Brouwer degree Let D R n be an open set and f : S R n be continuous, D S and c R n. Suppose that the set f 1 (c) D is compact. (1) Then the local Brouwer degree of f at c in the set D is defined.
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 informationMATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional 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 0-534-40596-7. Systems of Linear Equations Definition. An n-dimensional vector is a row or a column
More informationMA651 Topology. Lecture 6. Separation Axioms.
MA651 Topology. Lecture 6. Separation Axioms. This text is based on the following books: Fundamental concepts of topology by Peter O Neil Elements of Mathematics: General Topology by Nicolas Bourbaki Counterexamples
More information5. Linear algebra I: dimension
5. Linear algebra I: dimension 5.1 Some simple results 5.2 Bases and dimension 5.3 Homomorphisms and dimension 1. Some simple results Several observations should be made. Once stated explicitly, the proofs
More informationInvertible elements in associates and semigroups. 1
Quasigroups and Related Systems 5 (1998), 53 68 Invertible elements in associates and semigroups. 1 Fedir Sokhatsky Abstract Some invertibility criteria of an element in associates, in particular in n-ary
More informationChapter 7. Homotopy. 7.1 Basic concepts of homotopy. Example: z dz. z dz = but
Chapter 7 Homotopy 7. Basic concepts of homotopy Example: but γ z dz = γ z dz γ 2 z dz γ 3 z dz. Why? The domain of /z is C 0}. We can deform γ continuously into γ 2 without leaving C 0}. Intuitively,
More informationAn inequality for the group chromatic number of a graph
An inequality for the group chromatic number of a graph Hong-Jian Lai 1, Xiangwen Li 2 and Gexin Yu 3 1 Department of Mathematics, West Virginia University Morgantown, WV 26505 USA 2 Department of Mathematics
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 informationON UNIQUE FACTORIZATION DOMAINS
ON UNIQUE FACTORIZATION DOMAINS JIM COYKENDALL AND WILLIAM W. SMITH Abstract. In this paper we attempt to generalize the notion of unique factorization domain in the spirit of half-factorial domain. It
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 informationDEGREES OF ORDERS ON TORSION-FREE ABELIAN GROUPS
DEGREES OF ORDERS ON TORSION-FREE ABELIAN GROUPS ASHER M. KACH, KAREN LANGE, AND REED SOLOMON Abstract. We construct two computable presentations of computable torsion-free abelian groups, one of isomorphism
More informationCycles in a Graph Whose Lengths Differ by One or Two
Cycles in a Graph Whose Lengths Differ by One or Two J. A. Bondy 1 and A. Vince 2 1 LABORATOIRE DE MATHÉMATIQUES DISCRÉTES UNIVERSITÉ CLAUDE-BERNARD LYON 1 69622 VILLEURBANNE, FRANCE 2 DEPARTMENT OF MATHEMATICS
More informationDegrees that are not degrees of categoricity
Degrees that are not degrees of categoricity Bernard A. Anderson Department of Mathematics and Physical Sciences Gordon State College banderson@gordonstate.edu www.gordonstate.edu/faculty/banderson Barbara
More informationTHE AVERAGE DEGREE OF AN IRREDUCIBLE CHARACTER OF A FINITE GROUP
THE AVERAGE DEGREE OF AN IRREDUCIBLE CHARACTER OF A FINITE GROUP by I. M. Isaacs Mathematics Department University of Wisconsin 480 Lincoln Dr. Madison, WI 53706 USA E-Mail: isaacs@math.wisc.edu Maria
More informationHandout #Ch7 San Skulrattanakulchai Gustavus Adolphus College Dec 6, 2010. Chapter 7: Digraphs
MCS-236: Graph Theory Handout #Ch7 San Skulrattanakulchai Gustavus Adolphus College Dec 6, 2010 Chapter 7: Digraphs Strong Digraphs Definitions. A digraph is an ordered pair (V, E), where V is the set
More informationPage 331, 38.4 Suppose a is a positive integer and p is a prime. Prove that p a if and only if the prime factorization of a contains p.
Page 331, 38.2 Assignment #11 Solutions Factor the following positive integers into primes. a. 25 = 5 2. b. 4200 = 2 3 3 5 2 7. c. 10 10 = 2 10 5 10. d. 19 = 19. e. 1 = 1. Page 331, 38.4 Suppose a is a
More informationOn the existence of G-equivariant maps
CADERNOS DE MATEMÁTICA 12, 69 76 May (2011) ARTIGO NÚMERO SMA# 345 On the existence of G-equivariant maps Denise de Mattos * Departamento de Matemática, Instituto de Ciências Matemáticas e de Computação,
More informationEXERCISES FOR THE COURSE MATH 570, FALL 2010
EXERCISES FOR THE COURSE MATH 570, FALL 2010 EYAL Z. GOREN (1) Let G be a group and H Z(G) a subgroup such that G/H is cyclic. Prove that G is abelian. Conclude that every group of order p 2 (p a prime
More informationLemma 5.2. Let S be a set. (1) Let f and g be two permutations of S. Then the composition of f and g is a permutation of S.
Definition 51 Let S be a set bijection f : S S 5 Permutation groups A permutation of S is simply a Lemma 52 Let S be a set (1) Let f and g be two permutations of S Then the composition of f and g is a
More informationWHEN DOES A CROSS PRODUCT ON R n EXIST?
WHEN DOES A CROSS PRODUCT ON R n EXIST? PETER F. MCLOUGHLIN It is probably safe to say that just about everyone reading this article is familiar with the cross product and the dot product. However, what
More informationAbout the inverse football pool problem for 9 games 1
Seventh International Workshop on Optimal Codes and Related Topics September 6-1, 013, Albena, Bulgaria pp. 15-133 About the inverse football pool problem for 9 games 1 Emil Kolev Tsonka Baicheva Institute
More informationSEQUENCES OF MAXIMAL DEGREE VERTICES IN GRAPHS. Nickolay Khadzhiivanov, Nedyalko Nenov
Serdica Math. J. 30 (2004), 95 102 SEQUENCES OF MAXIMAL DEGREE VERTICES IN GRAPHS Nickolay Khadzhiivanov, Nedyalko Nenov Communicated by V. Drensky Abstract. Let Γ(M) where M V (G) be the set of all vertices
More informationOutline 2.1 Graph Isomorphism 2.2 Automorphisms and Symmetry 2.3 Subgraphs, part 1
GRAPH THEORY LECTURE STRUCTURE AND REPRESENTATION PART A Abstract. Chapter focuses on the question of when two graphs are to be regarded as the same, on symmetries, and on subgraphs.. discusses the concept
More information3. Prime and maximal ideals. 3.1. Definitions and Examples.
COMMUTATIVE ALGEBRA 5 3.1. Definitions and Examples. 3. Prime and maximal ideals Definition. An ideal P in a ring A is called prime if P A and if for every pair x, y of elements in A\P we have xy P. Equivalently,
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 informationTransfer of the Ramsey Property between Classes
1 / 20 Transfer of the Ramsey Property between Classes Lynn Scow Vassar College BLAST 2015 @ UNT 2 / 20 Classes We consider classes of finite structures such as K < = {(V,
More informationAnalytic cohomology groups in top degrees of Zariski open sets in P n
Analytic cohomology groups in top degrees of Zariski open sets in P n Gabriel Chiriacescu, Mihnea Colţoiu, Cezar Joiţa Dedicated to Professor Cabiria Andreian Cazacu on her 80 th birthday 1 Introduction
More informationBP-cohomology of mapping spaces from the classifying space of a torus to some p-torsion free space
BP-cohomology of mapping spaces from the classifying space of a torus to some p-torsion free space 1. Introduction Let p be a fixed prime number, V a group isomorphic to (Z/p) d for some integer d and
More informationBlock fusion systems and the center of the group ring. Martin Wedel Jacobsen
Block fusion systems and the center of the group ring Martin Wedel Jacobsen Martin Wedel Jacobsen Department of Mathematical Sciences University of Copenhagen Universitetsparken 5 DK-2100 København Ø Denmark
More informationChapter 7. Permutation Groups
Chapter 7 Permutation Groups () We started the study of groups by considering planar isometries In the previous chapter, we learnt that finite groups of planar isometries can only be cyclic or dihedral
More informationBUNDLES, CLASSIFYING SPACES AND CHARACTERISTIC CLASSES
BUNDLES, CLASSIFYING SPACES AND CHARACTERISTIC CLASSES CHRIS KOTTKE Contents Introduction 1 1. Bundles 2 1.1. Pullback 2 1.2. Sections 3 1.3. Fiber bundles as fibrations 4 2. Vector bundles 4 2.1. Whitney
More informationINCIDENCE-BETWEENNESS GEOMETRY
INCIDENCE-BETWEENNESS GEOMETRY MATH 410, CSUSM. SPRING 2008. PROFESSOR AITKEN This document covers the geometry that can be developed with just the axioms related to incidence and betweenness. The full
More informationFiber bundles and non-abelian cohomology
Fiber bundles and non-abelian cohomology Nicolas Addington April 22, 2007 Abstract The transition maps of a fiber bundle are often said to satisfy the cocycle condition. If we take this terminology seriously
More information16.3 Fredholm Operators
Lectures 16 and 17 16.3 Fredholm Operators A nice way to think about compact operators is to show that set of compact operators is the closure of the set of finite rank operator in operator norm. In this
More informationGroup Fundamentals. Chapter 1. 1.1 Groups and Subgroups. 1.1.1 Definition
Chapter 1 Group Fundamentals 1.1 Groups and Subgroups 1.1.1 Definition A group is a nonempty set G on which there is defined a binary operation (a, b) ab satisfying the following properties. Closure: If
More informationMathematical Research Letters 1, 249 255 (1994) MAPPING CLASS GROUPS ARE AUTOMATIC. Lee Mosher
Mathematical Research Letters 1, 249 255 (1994) MAPPING CLASS GROUPS ARE AUTOMATIC Lee Mosher Let S be a compact surface, possibly with the extra structure of an orientation or a finite set of distinguished
More informationKyoto University. Note on the cohomology of finite cyclic coverings. Yasuhiro Hara and Daisuke Kishimoto
Kyoto University Kyoto-Math 2013-02 Note on the cohomology of finite cyclic coverings by Yasuhiro Hara and Daisuke Kishimoto April 2013 Department of Mathematics Faculty of Science Kyoto University Kyoto
More information1 = (a 0 + b 0 α) 2 + + (a m 1 + b m 1 α) 2. for certain elements a 0,..., a m 1, b 0,..., b m 1 of F. Multiplying out, we obtain
Notes on real-closed fields These notes develop the algebraic background needed to understand the model theory of real-closed fields. To understand these notes, a standard graduate course in algebra is
More informationTree sums and maximal connected I-spaces
Tree sums and maximal connected I-spaces Adam Bartoš drekin@gmail.com Faculty of Mathematics and Physics Charles University in Prague Twelfth Symposium on General Topology Prague, July 2016 Maximal and
More informationHomological Algebra Workshop 02-03-15/06-03-15
Homological Algebra Workshop 02-03-15/06-03-15 Monday: Tuesday: 9:45 10:00 Registration 10:00 11:15 Conchita Martínez (I) 10:00 11:15 Conchita Martínez (II) 11:15 11:45 Coffee Break 11:15 11:45 Coffee
More informationMathematics for Computer Science/Software Engineering. Notes for the course MSM1F3 Dr. R. A. Wilson
Mathematics for Computer Science/Software Engineering Notes for the course MSM1F3 Dr. R. A. Wilson October 1996 Chapter 1 Logic Lecture no. 1. We introduce the concept of a proposition, which is a statement
More information3. Mathematical Induction
3. MATHEMATICAL INDUCTION 83 3. Mathematical Induction 3.1. First Principle of Mathematical Induction. Let P (n) be a predicate with domain of discourse (over) the natural numbers N = {0, 1,,...}. If (1)
More informationConnectivity and cuts
Math 104, Graph Theory February 19, 2013 Measure of connectivity How connected are each of these graphs? > increasing connectivity > I G 1 is a tree, so it is a connected graph w/minimum # of edges. Every
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 informationSets of Fibre Homotopy Classes and Twisted Order Parameter Spaces
Communications in Mathematical Physics Manuscript-Nr. (will be inserted by hand later) Sets of Fibre Homotopy Classes and Twisted Order Parameter Spaces Stefan Bechtluft-Sachs, Marco Hien Naturwissenschaftliche
More informationOn Integer Additive Set-Indexers of Graphs
On Integer Additive Set-Indexers of Graphs arxiv:1312.7672v4 [math.co] 2 Mar 2014 N K Sudev and K A Germina Abstract A set-indexer of a graph G is an injective set-valued function f : V (G) 2 X such that
More information