Autocommutator Subgroups of Finite Groups

Size: px
Start display at page:

Download "Autocommutator Subgroups of Finite Groups"

Transcription

1 JOURNAL OF ALGEBRA 90, ARTICLE NO. JA96692 Autocommutator Subgroups of Fiite Groups Peter V. Hegarty Departmet of Mathematics, Priceto Uiersity, Priceto, New Jersey Commuicated by Gordo James Received July 9, 996 We preset some ew results about the absolute ceter ad autocommutator subgroup of a group, cocepts which were itroduced i a earlier paper. 997 Academic Press. INTRODUCTION I 4, we itroduced the otios of the absolute ceter LG ad the autocommutator subgroup G* of a group G, ad proved the followig basic result:.. THEOREM. If GL G is fiite the so are G* ad Aut G. May atural questios ow beg to be asked. The most obvious is whether aythig like a coverse to Theorem. holds. We ca give a complete aswer, as follows:.2. THEOREM. If G* ad AutŽ G. are both fiite, the so is GLŽ G.. Howeer, there exists a group G for which G* is fiite but GLŽ G. is ifiite. Proof. First suppose that both G* ad AutŽ G. are fiite. Let AutŽ G.. The ŽG: C Ž.. is fiite, sice G* is fiite. But LG G C Ž. AutŽG. G, ad sice this is a fiite itersectio, it follows that GLG is fiite. If oe removes the hypothesis that AutŽ G. be fiite, the result breaks dow. I 3, Fourelle costructs, for every odd prime p, a ifiite group G for which AutŽ G. is a ucoutable elemetary abelia p-group. For these groups, oe checks readily that G* is fiite, but GLŽ G. is ifiite..3. Remark. If G is fiitely geerated, ad G* is fiite, the AutŽ G. is clearly fiite. So GLŽ G. is also fiite by our theorem. I fact, G is a fiite cetral extesio of a cyclic group, by Alperi s result $25.00 Copyright 997 by Academic Press All rights of reproductio i ay form reserved. 556

2 AUTOCOMMUTATOR GROUPS 557 The ext issue is whether the result of Theorem. ca be stregtheed. Specifically, oe ca ask whether there exists ay ifiite group G such that GLŽ G. is fiite. A defiitive aswer is cotaied i the followig result:.4. THEOREM. Let p be a odd prime. The, for eery 4, there exists a ifiite group G with GL G elemetary p-abelia of rak. Proof. Agai we refer the reader to the paper of Fourelle 3. He costructs, for every prime p, ifiite groups G for which AutŽ G. is elemetary p-abelia of fiite rak. A straightforward aalysis of these groups, for p odd, yields our theorem. We have bee able to prove that if, 2, or 3, the above theorem is false Žoly the case 3 causes ay problemsthe proof is tedious rather tha difficult; it is therefore omitted, ad may be obtaied from the author if desired.. It is also false for p 2 ad ay, as oe may easily show. I the oabelia case, it is easy to see, for example, that if GLŽ G. is ay dihedral group the G must be fiite. However, we do ot curretly possess ay systematic treatmet of the problem of determiig those fiite groups K for which there exists a ifiite G such that GLŽ G. K, eve i the case where K is abelia. So for the remaider of the paper we shall tur to discuss other problems. 2. MAIN RESULTS The results of Sect. may be tatalisig, but ot very rewardig. So let us chage focus. The followig result is well kow Žsee, for example. 2 : 2.. THEOREM. Let K be ay fiite group. The there are oly fiitely may fiite groups G such that AutŽ G. K. Ideed, oe ca write dow explicitly a fuctio g: N N such that the followig holds: If p is ay prime gž h. h ad G p p the AutŽ G. p p. For example, oe ca take gž h. h 2 6, for h 3. We shall ow provide results similar to Theorem 2., with AutŽ G. replaced by either GLŽ G. or G*. The case of GLŽ G. is by far the simplest: 2.2. THEOREM. Let K be a fiite group. The there are oly fiitely may fiite groups G for which GL G K. Proof. Let K ad suppose G is fiite with GLŽ G. K. By Theorem 2. of 4, there is a fuctio f: N N such that AutŽ G. fž.. This, combied with Theorem 2., yields the result.

3 558 PETER V. HEGARTY 2.3. Remark. From this proof it is clear that, as i Theorem 2., oe could write dow explicitly a fuctio g: N N such that if G is fiite ad GLŽ G., the G gž.. However, sice the boud i Theorem 2. of 4 seems extravagat, this g is ulikely to be the best possible Ž see Sect. 2. of this paper Remark. As is well kow, the first part of Theorem 2. is false if we allow G to be ifiite. The same is true of Theorem 2.2 ad ideed of Theorem 2.5 below. Oce agai, the groups costructed i Fourelle s paper 3 illustrate all three of these facts. We ow tur to the mai result of this paper THEOREM. Let K be a fiite group. The there are oly fiitely may fiite groups G for which G* K. As the proof will show, this is essetially a result about p-groups. We begi with five lemmas, which costitute the basic tools eeded for the proof LEMMA. Let K be ay fiite group, d 0 a fixed positie iteger. The there are oly fiitely may d-geerated fiite groups G for which G* K. Proof. Suppose G is a d-geerated fiite group for which G* K. We shall show that AutŽ G. is bouded. This will immediately yield the lemma, because of Theorem 2.. So let x, x,..., x geerate G, ad let AutŽ G. 2 d. is completely determied by specifyig the set x 4 i xi i d of elemets of G. But all these elemets lie i G*, by defiitio of the latter. So AutŽ G. is certaily bouded by the umber of fuctios from the set,..., d4 K, i.e., by K d. The lemma follows. The followig crucial result must surely appear i some form i the literature, though I have ot bee able to locate it. 2.7 LEMMA. Let p be ay prime, N ay fiite p-group. Let deote the class of all fiite p-groups which possess a ormal subgroup, which is isomorphic to N, ad such that the factor group is abelia. The there exists N Ž idepedet of p. N such that the followig holds: If G satisfies dž GN. the C Ž N. ZŽ N. N G cotais a direct factor of GN. Explicitly, we may take N bžb.2, where b log ŽN.. N Proof. Ž This is essetially just the pigeohole priciple.. Let G ad suppose dgn, with as above. Defie a sequece N of N N k p

4 AUTOCOMMUTATOR GROUPS 559 subgroups of N as follows: N G, N ; N G, N for k 0. Ž. 0 k k bk Sice N G, we have that N p for k b ad that N. 4 k b Also, we defie a sequece Cr of positive itegers, accordig to the followig rule: C ; C N r.c for r. Ž 2. r r Note that C. Now let x,..., x 4 b N i d be a set of elemets of G which geerate G mod N ŽddGN.. Sice dn bwe ca choose elemets,..., 4 b of N which geerate it. Fix ay such choice. Now we have d fuctios :,..., b4 N defied by, j 0 Ž t. x, Ž jd,tb.. Ž 3., j j t But there are certaily o more tha N b distict fuctios from,..., b4 to N. Sice dgn C, there is a subset of S of,..., d4 0 b such that Ž S. C ad for all j, j S Ž pigeohole priciple!. b, j, j. It follows that xx,n j j N for all j j S. I other words, there exists a set y,..., y 4 C b of elemets of G which are idepedet mod N, geerate a direct factor of G mod N, ad satisfy y, N j N for j,...,c. Now we ca defie fuctios :,..., b4 N Ž j,...,c. b 2, j b by Ž t. y, Ž 4. 2, j j t But there are certaily o more tha N b distict fuctios from,...,b4 to N so, reasoig as above, we coclude that there exists a set z,..., z 4 C b of elemets of G which are idepedet mod N, geerate a direct factor of G mod N, ad satisfy z, N j N2 for j,...,c b. It is clear how this argumet is goig to proceed. Sice N 4 b ad C we will evetually be able to coclude that there exists w G which geerates a Ž cyclic. direct factor of G mod N ad satisfies w, N. This proves Lemma 2.7. The followig stroger result follows, with some care, from repeated applicatio of Lemma LEMMA. Let p, N, ad be as i Lemma 2.7. The there is a fuctio f : N N, with f Ž. N N N, such that the followig holds: If G satisfies dž GN. f Ž i. N the there is a subgroup H of G with the followig properties: Ž. HN. Ž. 2 H is geerated mod N by elemets of ZŽ H.. Ž. 3 HN cotais a direct factor of GN of rak i.

5 560 PETER V. HEGARTY The ext tool we require is a simple homological result, a proof of which may be foud i 5, 7., Satz I LEMMA. Let G be ay group ad N a ormal subgroup. The the set of automorphisms of G which cetralize both N ad GN form a group which is caoically isomorphic to Z ŽGN, ZŽ N... For the ext lemma, Ž G. deotes the set of primes dividig the order of a fiite group G ad Ž G. deotes the umber of such primes LEMMA. Let K be a fiite group ad let K deote the class of fiite groups G such that G K. The eery G K possesses a ormal subgroup N with the followig properties: Ž. N is ilpotet ad characteristic i G. Ž. 2 G: N is bouded by a fuctio of K ad G oly. Proof. The proof is by iductio o K. The result is trivial for K, so suppose it true for K. Now let K have order ad cosider G K.If Gis itself ilpotet we may take N G. Otherwise, let N be the itersectio of the ormalizers of all Sylow p-subgroups of G ŽpŽ G... Evidetly, N is characteristic i G ad Ž G : N. is bouded by some fuctio of K ad Ž G.. But equally clearly oe sees that N G is properly cotaied i G. So we ca apply our iductio hypothesis, ad the lemma follows immediately. Proof of Theorem 2.5. We suppose that Theorem 2.5 is false for some Ž heceforth fixed. fiite group K, ad we obtai a cotradictio. I what follows O Ž G. deotes the maximal ormal -subgroup of a fiite group G, where is ay set of primes. Sice our theorem is false for K we ca fid a ifiite sequece G of fiite groups such that G K. Each G is a semidirect product of O Ž G. by a abelia Ž K. Ž K. -group, say A. But, for each, AutŽ G. is a extesio of a Ž K.-group Ž amely, Z ŽG G, ZG Ž.., by Lemma 2.9. by a subgroup of AutŽ K.. It follows, from Theorem 2., that the order of each A is bouded. So we ca fix a choice A of a abelia Ž K. -group ad suppose, without loss of geerality, that each G has Ž K.-complemet A. The poit is that Ž G. is ow the same for each. To ease otatio, write J for O Ž G. Ž K.. For p p K we also write T for the subgroup of G geerated by G ad the p-part of G G. Combiig Lemmas 2.6 ad 2.0, we ca ow coclude that, for some p Ž K. ad K0 a p-subgroup of K, the followig holds: Without loss of geerality, the sequece G may be chose so that Ž. G is the same for all.

6 AUTOCOMMUTATOR GROUPS 56 Ž. 2 Each J cotais a characteristic p-subgroup P such that P G K ad dppg Ž. 2f Ž. 0 K, where fk is the positive-iteger 0 0 valued fuctio of Lemma 2.8. Ž. Ž p. Ž p 3 Also, dt G f ad T : P. is the same for all. K0 Sice the factor group GG* is abelia for ay group G, we may apply Lemma 2.8 to the groups P. A techical poit arises here, which will become importat later. So, for the momet, please just accept what I am about to say. For each, we ca list the ivariats of P P G ad divide them ito two disjoit subsets U ad V, each cotaiig at least f Ž. K 0 umbers, such that o umber i U is bigger tha ay umber i V. The, by Lemma 2.8, there exists, for each, a characteristic subgroup H of P with the followig properties: Ž. HPG. Ž. 2 H is geerated mod P G by elemets of ZŽ H.. Ž. 3 HPG is a direct factor of PP G of rak. Ž. 4 All the ivariats of H P G come from the set U. Now, for each, fix the followig otatio: A Z P G Ž., BZŽ H., CBA, GH. Ž 5. The we have a short exact sequece of -modules 0 A B C 0 Ž 6. ad, hece, a log exact sequece of homology groups 0 H 0 Ž, A. H 0 Ž, B. H 0 Ž, C. H Ž, A. H Ž, B. H Ž,C. H 2 Ž, A.. Ž 7. It follows easily, ad i a purely formal maer, from Ž.Ž 7 just write dow what exactess meas at each step ad take it from there. that ž / H Ž, C. Z Ž, B. H Ž,C. H Ž, A. H Ž, A. Z Ž, A.. Ž 8.

7 562 PETER V. HEGARTY I claim that, for sufficietly large, the bracketed term will be greater tha. Admit this for the momet. The, for some, Z Ž, B. Z Ž, A.. By Lemma 2.9, this is equivalet to the existece of a automorphism of G which cetralizes both H ad GH, but ot G P G. But this cotradicts the very defiitio of G. So, i order to complete the proof of Theorem 2.5, it suffices to Ž p establish our claim above. To simplify otatio, let d dt G. ad d. First, for ay, simple recourse to the defiitios gives 0 H Ž, A. A K, Ž H Ž, A. A K. Ž 0. Next, we ote that C is a trivial -module Ž sice G* G for ay group G.. Hece, H Ž, C. HomŽ, C. ad H 0 Ž, C. C. It is here that the techical poit referred to earlier becomes importat. Property Ž. 4 of the group H guaratees Ž a fact of which oe easily covices oeself. that the quotiet HomŽ, C.C grows at least as rapidly, with icreasig, as p. Hece, the bracketed term i Ž. 8 grows at least as rapidly, with icreas- Ž ig, as pk 2.. Our claim follows immediately, ad the proof of Theorem 2.5 is complete. 2.. OPEN PROBLEMS. Ž. a Usig our proofs of Theorems 2.2 ad 2.5, oe could compute explicit bouds for the order of a fiite group G i terms of GLŽ G. ad G*, respectiely. Howeer, these bouds will be ery extraagat. So it is a alid questio to ask for best possible, or ee reasoable, bouds, like those gie i Theorem 2.. Ž b. Gie a systematic treatmet of the problem, raised earlier, of determiig those fiite groups K for which there exists a ifiite group G such that GLG K. More realistically, fid the smallest such K ŽTheorem.4 4 implies that K REFERENCES. J. L. Alperi, Groups with fiitely may automorphisms, Pacific J. Math. 2 Ž 962., T. Exarchakos, Automorphisms of a fiite p-group, Caad. J. Math. 32 Ž 980., T. A. Fourelle, Elemetary abelia p-groups as automorphism groups of ifiite groups II, Housto J. Math. 9 Ž 983., P. V. Hegarty, The absolute ceter of a group, J. Algebra 69Ž.Ž , B. Huppert, Edliche Gruppe, I. Spriger, New York, 967.

FINITE GROUPS WITH THREE RELATIVE COMMUTATIVITY DEGREES. Communicated by Ali Reza Ashrafi. 1. Introduction

FINITE GROUPS WITH THREE RELATIVE COMMUTATIVITY DEGREES. Communicated by Ali Reza Ashrafi. 1. Introduction Bulleti of the Iraia Mathematical Society Vol. 39 No. 2 203), pp 27-280. FINITE GROUPS WITH THREE RELATIVE COMMUTATIVITY DEGREES R. BARZGAR, A. ERFANIAN AND M. FARROKHI D. G. Commuicated by Ali Reza Ashrafi

More information

Infinite Sequences and Series

Infinite Sequences and Series Chapter 6 Ifiite Sequeces ad Series 6.1 Ifiite Sequeces 6.1.1 Elemetary Cocepts Simply speakig, a sequece is a ordered list of umbers writte: {a 1, a 2, a 3,...a, a +1,...} where the elemets a i represet

More information

If a subset E of R contains no open interval, is it of zero measure? For instance, is the set of irrationals in [0, 1] is of measure zero?

If a subset E of R contains no open interval, is it of zero measure? For instance, is the set of irrationals in [0, 1] is of measure zero? 2 Lebesgue Measure I Chapter 1 we defied the cocept of a set of measure zero, ad we have observed that every coutable set is of measure zero. Here are some atural questios: If a subset E of R cotais a

More information

Seunghee Ye Ma 8: Week 5 Oct 28

Seunghee Ye Ma 8: Week 5 Oct 28 Week 5 Summary I Sectio, we go over the Mea Value Theorem ad its applicatios. I Sectio 2, we will recap what we have covered so far this term. Topics Page Mea Value Theorem. Applicatios of the Mea Value

More information

Chapter 0. Review of set theory. 0.1 Sets

Chapter 0. Review of set theory. 0.1 Sets Chapter 0 Review of set theory Set theory plays a cetral role i the theory of probability. Thus, we will ope this course with a quick review of those otios of set theory which will be used repeatedly.

More information

Convergence of random variables. (telegram style notes) P.J.C. Spreij

Convergence of random variables. (telegram style notes) P.J.C. Spreij Covergece of radom variables (telegram style otes).j.c. Spreij this versio: September 6, 2005 Itroductio As we kow, radom variables are by defiitio measurable fuctios o some uderlyig measurable space

More information

MA131 - Analysis 1. Workbook 3 Sequences II

MA131 - Analysis 1. Workbook 3 Sequences II MA3 - Aalysis Workbook 3 Sequeces II Autum 2004 Cotets 2.8 Coverget Sequeces........................ 2.9 Algebra of Limits......................... 2 2.0 Further Useful Results........................

More information

Product measures, Tonelli s and Fubini s theorems For use in MAT3400/4400, autumn 2014 Nadia S. Larsen. Version of 13 October 2014.

Product measures, Tonelli s and Fubini s theorems For use in MAT3400/4400, autumn 2014 Nadia S. Larsen. Version of 13 October 2014. Product measures, Toelli s ad Fubii s theorems For use i MAT3400/4400, autum 2014 Nadia S. Larse Versio of 13 October 2014. 1. Costructio of the product measure The purpose of these otes is to preset the

More information

Exercises 1 Sets and functions

Exercises 1 Sets and functions Exercises 1 Sets ad fuctios HU Wei September 6, 018 1 Basics Set theory ca be made much more rigorous ad built upo a set of Axioms. But we will cover oly some heuristic ideas. For those iterested studets,

More information

Math 140A Elementary Analysis Homework Questions 3-1

Math 140A Elementary Analysis Homework Questions 3-1 Math 0A Elemetary Aalysis Homework Questios -.9 Limits Theorems for Sequeces Suppose that lim x =, lim y = 7 ad that all y are o-zero. Detarime the followig limits: (a) lim(x + y ) (b) lim y x y Let s

More information

Commutativity in Permutation Groups

Commutativity in Permutation Groups Commutativity i Permutatio Groups Richard Wito, PhD Abstract I the group Sym(S) of permutatios o a oempty set S, fixed poits ad trasiet poits are defied Prelimiary results o fixed ad trasiet poits are

More information

(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3

(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3 MATH 337 Sequeces Dr. Neal, WKU Let X be a metric space with distace fuctio d. We shall defie the geeral cocept of sequece ad limit i a metric space, the apply the results i particular to some special

More information

The Boolean Ring of Intervals

The Boolean Ring of Intervals MATH 532 Lebesgue Measure Dr. Neal, WKU We ow shall apply the results obtaied about outer measure to the legth measure o the real lie. Throughout, our space X will be the set of real umbers R. Whe ecessary,

More information

ACO Comprehensive Exam 9 October 2007 Student code A. 1. Graph Theory

ACO Comprehensive Exam 9 October 2007 Student code A. 1. Graph Theory 1. Graph Theory Prove that there exist o simple plaar triagulatio T ad two distict adjacet vertices x, y V (T ) such that x ad y are the oly vertices of T of odd degree. Do ot use the Four-Color Theorem.

More information

4 The Sperner property.

4 The Sperner property. 4 The Sperer property. I this sectio we cosider a surprisig applicatio of certai adjacecy matrices to some problems i extremal set theory. A importat role will also be played by fiite groups. I geeral,

More information

11. FINITE FIELDS. Example 1: The following tables define addition and multiplication for a field of order 4.

11. FINITE FIELDS. Example 1: The following tables define addition and multiplication for a field of order 4. 11. FINITE FIELDS 11.1. A Field With 4 Elemets Probably the oly fiite fields which you ll kow about at this stage are the fields of itegers modulo a prime p, deoted by Z p. But there are others. Now although

More information

MATH 324 Summer 2006 Elementary Number Theory Solutions to Assignment 2 Due: Thursday July 27, 2006

MATH 324 Summer 2006 Elementary Number Theory Solutions to Assignment 2 Due: Thursday July 27, 2006 MATH 34 Summer 006 Elemetary Number Theory Solutios to Assigmet Due: Thursday July 7, 006 Departmet of Mathematical ad Statistical Scieces Uiversity of Alberta Questio [p 74 #6] Show that o iteger of the

More information

It is always the case that unions, intersections, complements, and set differences are preserved by the inverse image of a function.

It is always the case that unions, intersections, complements, and set differences are preserved by the inverse image of a function. MATH 532 Measurable Fuctios Dr. Neal, WKU Throughout, let ( X, F, µ) be a measure space ad let (!, F, P ) deote the special case of a probability space. We shall ow begi to study real-valued fuctios defied

More information

Chapter 6 Infinite Series

Chapter 6 Infinite Series Chapter 6 Ifiite Series I the previous chapter we cosidered itegrals which were improper i the sese that the iterval of itegratio was ubouded. I this chapter we are goig to discuss a topic which is somewhat

More information

Math 155 (Lecture 3)

Math 155 (Lecture 3) Math 55 (Lecture 3) September 8, I this lecture, we ll cosider the aswer to oe of the most basic coutig problems i combiatorics Questio How may ways are there to choose a -elemet subset of the set {,,,

More information

The Structure of Z p when p is Prime

The Structure of Z p when p is Prime LECTURE 13 The Structure of Z p whe p is Prime Theorem 131 If p > 1 is a iteger, the the followig properties are equivalet (1) p is prime (2) For ay [0] p i Z p, the equatio X = [1] p has a solutio i Z

More information

A REMARK ON A PROBLEM OF KLEE

A REMARK ON A PROBLEM OF KLEE C O L L O Q U I U M M A T H E M A T I C U M VOL. 71 1996 NO. 1 A REMARK ON A PROBLEM OF KLEE BY N. J. K A L T O N (COLUMBIA, MISSOURI) AND N. T. P E C K (URBANA, ILLINOIS) This paper treats a property

More information

Square-Congruence Modulo n

Square-Congruence Modulo n Square-Cogruece Modulo Abstract This paper is a ivestigatio of a equivalece relatio o the itegers that was itroduced as a exercise i our Discrete Math class. Part I - Itro Defiitio Two itegers are Square-Cogruet

More information

Bertrand s Postulate

Bertrand s Postulate Bertrad s Postulate Lola Thompso Ross Program July 3, 2009 Lola Thompso (Ross Program Bertrad s Postulate July 3, 2009 1 / 33 Bertrad s Postulate I ve said it oce ad I ll say it agai: There s always a

More information

6.3 Testing Series With Positive Terms

6.3 Testing Series With Positive Terms 6.3. TESTING SERIES WITH POSITIVE TERMS 307 6.3 Testig Series With Positive Terms 6.3. Review of what is kow up to ow I theory, testig a series a i for covergece amouts to fidig the i= sequece of partial

More information

Math 61CM - Solutions to homework 3

Math 61CM - Solutions to homework 3 Math 6CM - Solutios to homework 3 Cédric De Groote October 2 th, 208 Problem : Let F be a field, m 0 a fixed oegative iteger ad let V = {a 0 + a x + + a m x m a 0,, a m F} be the vector space cosistig

More information

Dirichlet s Theorem on Arithmetic Progressions

Dirichlet s Theorem on Arithmetic Progressions Dirichlet s Theorem o Arithmetic Progressios Athoy Várilly Harvard Uiversity, Cambridge, MA 0238 Itroductio Dirichlet s theorem o arithmetic progressios is a gem of umber theory. A great part of its beauty

More information

Solutions to Math 347 Practice Problems for the final

Solutions to Math 347 Practice Problems for the final Solutios to Math 347 Practice Problems for the fial 1) True or False: a) There exist itegers x,y such that 50x + 76y = 6. True: the gcd of 50 ad 76 is, ad 6 is a multiple of. b) The ifiimum of a set is

More information

1. By using truth tables prove that, for all statements P and Q, the statement

1. By using truth tables prove that, for all statements P and Q, the statement Author: Satiago Salazar Problems I: Mathematical Statemets ad Proofs. By usig truth tables prove that, for all statemets P ad Q, the statemet P Q ad its cotrapositive ot Q (ot P) are equivalet. I example.2.3

More information

6 Integers Modulo n. integer k can be written as k = qn + r, with q,r, 0 r b. So any integer.

6 Integers Modulo n. integer k can be written as k = qn + r, with q,r, 0 r b. So any integer. 6 Itegers Modulo I Example 2.3(e), we have defied the cogruece of two itegers a,b with respect to a modulus. Let us recall that a b (mod ) meas a b. We have proved that cogruece is a equivalece relatio

More information

The normal subgroup structure of ZM-groups

The normal subgroup structure of ZM-groups arxiv:1502.04776v1 [math.gr] 17 Feb 2015 The ormal subgroup structure of ZM-groups Marius Tărăuceau February 17, 2015 Abstract The mai goal of this ote is to determie ad to cout the ormal subgroups of

More information

Axioms of Measure Theory

Axioms of Measure Theory MATH 532 Axioms of Measure Theory Dr. Neal, WKU I. The Space Throughout the course, we shall let X deote a geeric o-empty set. I geeral, we shall ot assume that ay algebraic structure exists o X so that

More information

62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 +

62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + 62. Power series Defiitio 16. (Power series) Give a sequece {c }, the series c x = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + is called a power series i the variable x. The umbers c are called the coefficiets of

More information

Lecture Notes for Analysis Class

Lecture Notes for Analysis Class Lecture Notes for Aalysis Class Topological Spaces A topology for a set X is a collectio T of subsets of X such that: (a) X ad the empty set are i T (b) Uios of elemets of T are i T (c) Fiite itersectios

More information

Chapter 3. Strong convergence. 3.1 Definition of almost sure convergence

Chapter 3. Strong convergence. 3.1 Definition of almost sure convergence Chapter 3 Strog covergece As poited out i the Chapter 2, there are multiple ways to defie the otio of covergece of a sequece of radom variables. That chapter defied covergece i probability, covergece i

More information

lim za n n = z lim a n n.

lim za n n = z lim a n n. Lecture 6 Sequeces ad Series Defiitio 1 By a sequece i a set A, we mea a mappig f : N A. It is customary to deote a sequece f by {s } where, s := f(). A sequece {z } of (complex) umbers is said to be coverget

More information

The Borel hierarchy classifies subsets of the reals by their topological complexity. Another approach is to classify them by size.

The Borel hierarchy classifies subsets of the reals by their topological complexity. Another approach is to classify them by size. Lecture 7: Measure ad Category The Borel hierarchy classifies subsets of the reals by their topological complexity. Aother approach is to classify them by size. Filters ad Ideals The most commo measure

More information

7.1 Convergence of sequences of random variables

7.1 Convergence of sequences of random variables Chapter 7 Limit theorems Throughout this sectio we will assume a probability space (Ω, F, P), i which is defied a ifiite sequece of radom variables (X ) ad a radom variable X. The fact that for every ifiite

More information

Definition 4.2. (a) A sequence {x n } in a Banach space X is a basis for X if. unique scalars a n (x) such that x = n. a n (x) x n. (4.

Definition 4.2. (a) A sequence {x n } in a Banach space X is a basis for X if. unique scalars a n (x) such that x = n. a n (x) x n. (4. 4. BASES I BAACH SPACES 39 4. BASES I BAACH SPACES Sice a Baach space X is a vector space, it must possess a Hamel, or vector space, basis, i.e., a subset {x γ } γ Γ whose fiite liear spa is all of X ad

More information

7.1 Convergence of sequences of random variables

7.1 Convergence of sequences of random variables Chapter 7 Limit Theorems Throughout this sectio we will assume a probability space (, F, P), i which is defied a ifiite sequece of radom variables (X ) ad a radom variable X. The fact that for every ifiite

More information

Boundaries and the James theorem

Boundaries and the James theorem Boudaries ad the James theorem L. Vesely 1. Itroductio The followig theorem is importat ad well kow. All spaces cosidered here are real ormed or Baach spaces. Give a ormed space X, we deote by B X ad S

More information

THE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS

THE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS THE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS DEMETRES CHRISTOFIDES Abstract. Cosider a ivertible matrix over some field. The Gauss-Jorda elimiatio reduces this matrix to the idetity

More information

Chapter 2. Periodic points of toral. automorphisms. 2.1 General introduction

Chapter 2. Periodic points of toral. automorphisms. 2.1 General introduction Chapter 2 Periodic poits of toral automorphisms 2.1 Geeral itroductio The automorphisms of the two-dimesioal torus are rich mathematical objects possessig iterestig geometric, algebraic, topological ad

More information

Resolution Proofs of Generalized Pigeonhole Principles

Resolution Proofs of Generalized Pigeonhole Principles Resolutio Proofs of Geeralized Pigeohole Priciples Samuel R. Buss Departmet of Mathematics Uiversity of Califoria, Berkeley Győrgy Turá Departmet of Mathematics, Statistics, ad Computer Sciece Uiversity

More information

Lecture 10: Mathematical Preliminaries

Lecture 10: Mathematical Preliminaries Lecture : Mathematical Prelimiaries Obective: Reviewig mathematical cocepts ad tools that are frequetly used i the aalysis of algorithms. Lecture # Slide # I this

More information

M A T H F A L L CORRECTION. Algebra I 1 4 / 1 0 / U N I V E R S I T Y O F T O R O N T O

M A T H F A L L CORRECTION. Algebra I 1 4 / 1 0 / U N I V E R S I T Y O F T O R O N T O M A T H 2 4 0 F A L L 2 0 1 4 HOMEWORK ASSIGNMENT #4 CORRECTION Algebra I 1 4 / 1 0 / 2 0 1 4 U N I V E R S I T Y O F T O R O N T O P r o f e s s o r : D r o r B a r - N a t a Correctio Homework Assigmet

More information

Math F215: Induction April 7, 2013

Math F215: Induction April 7, 2013 Math F25: Iductio April 7, 203 Iductio is used to prove that a collectio of statemets P(k) depedig o k N are all true. A statemet is simply a mathematical phrase that must be either true or false. Here

More information

MAT1026 Calculus II Basic Convergence Tests for Series

MAT1026 Calculus II Basic Convergence Tests for Series MAT026 Calculus II Basic Covergece Tests for Series Egi MERMUT 202.03.08 Dokuz Eylül Uiversity Faculty of Sciece Departmet of Mathematics İzmir/TURKEY Cotets Mootoe Covergece Theorem 2 2 Series of Real

More information

Math 220A Fall 2007 Homework #2. Will Garner A

Math 220A Fall 2007 Homework #2. Will Garner A Math 0A Fall 007 Homewor # Will Garer Pg 3 #: Show that {cis : a o-egative iteger} is dese i T = {z œ : z = }. For which values of q is {cis(q): a o-egative iteger} dese i T? To show that {cis : a o-egative

More information

An Introduction to Randomized Algorithms

An Introduction to Randomized Algorithms A Itroductio to Radomized Algorithms The focus of this lecture is to study a radomized algorithm for quick sort, aalyze it usig probabilistic recurrece relatios, ad also provide more geeral tools for aalysis

More information

sin(n) + 2 cos(2n) n 3/2 3 sin(n) 2cos(2n) n 3/2 a n =

sin(n) + 2 cos(2n) n 3/2 3 sin(n) 2cos(2n) n 3/2 a n = 60. Ratio ad root tests 60.1. Absolutely coverget series. Defiitio 13. (Absolute covergece) A series a is called absolutely coverget if the series of absolute values a is coverget. The absolute covergece

More information

FINITE MULTIPLICATIVE SUBGROUPS IN DIVISION RINGS

FINITE MULTIPLICATIVE SUBGROUPS IN DIVISION RINGS FINITE MULTIPLICATIVE SUBGROUPS IN DIVISION RINGS I. N. HERSTEIN 1. Itroductio. If G is a fiite subgroup of the multiplicative group of ozero elemets of a commutative field, the it is kow that G must be

More information

Metric Space Properties

Metric Space Properties Metric Space Properties Math 40 Fial Project Preseted by: Michael Brow, Alex Cordova, ad Alyssa Sachez We have already poited out ad will recogize throughout this book the importace of compact sets. All

More information

Homework 3. = k 1. Let S be a set of n elements, and let a, b, c be distinct elements of S. The number of k-subsets of S is

Homework 3. = k 1. Let S be a set of n elements, and let a, b, c be distinct elements of S. The number of k-subsets of S is Homewor 3 Chapter 5 pp53: 3 40 45 Chapter 6 p85: 4 6 4 30 Use combiatorial reasoig to prove the idetity 3 3 Proof Let S be a set of elemets ad let a b c be distict elemets of S The umber of -subsets of

More information

On groups of diffeomorphisms of the interval with finitely many fixed points II. Azer Akhmedov

On groups of diffeomorphisms of the interval with finitely many fixed points II. Azer Akhmedov O groups of diffeomorphisms of the iterval with fiitely may fixed poits II Azer Akhmedov Abstract: I [6], it is proved that ay subgroup of Diff ω +(I) (the group of orietatio preservig aalytic diffeomorphisms

More information

The value of Banach limits on a certain sequence of all rational numbers in the interval (0,1) Bao Qi Feng

The value of Banach limits on a certain sequence of all rational numbers in the interval (0,1) Bao Qi Feng The value of Baach limits o a certai sequece of all ratioal umbers i the iterval 0, Bao Qi Feg Departmet of Mathematical Scieces, Ket State Uiversity, Tuscarawas, 330 Uiversity Dr. NE, New Philadelphia,

More information

Sequences and Series of Functions

Sequences and Series of Functions Chapter 6 Sequeces ad Series of Fuctios 6.1. Covergece of a Sequece of Fuctios Poitwise Covergece. Defiitio 6.1. Let, for each N, fuctio f : A R be defied. If, for each x A, the sequece (f (x)) coverges

More information

Journal of Mathematical Analysis and Applications 250, doi: jmaa , available online at http:

Journal of Mathematical Analysis and Applications 250, doi: jmaa , available online at http: Joural of Mathematical Aalysis ad Applicatios 5, 886 doi:6jmaa766, available olie at http:wwwidealibrarycom o Fuctioal Equalities ad Some Mea Values Shoshaa Abramovich Departmet of Mathematics, Uiersity

More information

LONG SNAKES IN POWERS OF THE COMPLETE GRAPH WITH AN ODD NUMBER OF VERTICES

LONG SNAKES IN POWERS OF THE COMPLETE GRAPH WITH AN ODD NUMBER OF VERTICES J Lodo Math Soc (2 50, (1994, 465 476 LONG SNAKES IN POWERS OF THE COMPLETE GRAPH WITH AN ODD NUMBER OF VERTICES Jerzy Wojciechowski Abstract I [5] Abbott ad Katchalski ask if there exists a costat c >

More information

Sequence A sequence is a function whose domain of definition is the set of natural numbers.

Sequence A sequence is a function whose domain of definition is the set of natural numbers. Chapter Sequeces Course Title: Real Aalysis Course Code: MTH3 Course istructor: Dr Atiq ur Rehma Class: MSc-I Course URL: wwwmathcityorg/atiq/fa8-mth3 Sequeces form a importat compoet of Mathematical Aalysis

More information

The multiplicative structure of finite field and a construction of LRC

The multiplicative structure of finite field and a construction of LRC IERG6120 Codig for Distributed Storage Systems Lecture 8-06/10/2016 The multiplicative structure of fiite field ad a costructio of LRC Lecturer: Keeth Shum Scribe: Zhouyi Hu Notatios: We use the otatio

More information

CSE 1400 Applied Discrete Mathematics Number Theory and Proofs

CSE 1400 Applied Discrete Mathematics Number Theory and Proofs CSE 1400 Applied Discrete Mathematics Number Theory ad Proofs Departmet of Computer Scieces College of Egieerig Florida Tech Sprig 01 Problems for Number Theory Backgroud Number theory is the brach of

More information

1 lim. f(x) sin(nx)dx = 0. n sin(nx)dx

1 lim. f(x) sin(nx)dx = 0. n sin(nx)dx Problem A. Calculate ta(.) to 4 decimal places. Solutio: The power series for si(x)/ cos(x) is x + x 3 /3 + (2/5)x 5 +. Puttig x =. gives ta(.) =.3. Problem 2A. Let f : R R be a cotiuous fuctio. Show that

More information

Homework 1 Solutions. The exercises are from Foundations of Mathematical Analysis by Richard Johnsonbaugh and W.E. Pfaffenberger.

Homework 1 Solutions. The exercises are from Foundations of Mathematical Analysis by Richard Johnsonbaugh and W.E. Pfaffenberger. Homewor 1 Solutios Math 171, Sprig 2010 Hery Adams The exercises are from Foudatios of Mathematical Aalysis by Richard Johsobaugh ad W.E. Pfaffeberger. 2.2. Let h : X Y, g : Y Z, ad f : Z W. Prove that

More information

The log-behavior of n p(n) and n p(n)/n

The log-behavior of n p(n) and n p(n)/n Ramauja J. 44 017, 81-99 The log-behavior of p ad p/ William Y.C. Che 1 ad Ke Y. Zheg 1 Ceter for Applied Mathematics Tiaji Uiversity Tiaji 0007, P. R. Chia Ceter for Combiatorics, LPMC Nakai Uivercity

More information

2.4 Sequences, Sequences of Sets

2.4 Sequences, Sequences of Sets 72 CHAPTER 2. IMPORTANT PROPERTIES OF R 2.4 Sequeces, Sequeces of Sets 2.4.1 Sequeces Defiitio 2.4.1 (sequece Let S R. 1. A sequece i S is a fuctio f : K S where K = { N : 0 for some 0 N}. 2. For each

More information

A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence

A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece,, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet as

More information

Math 104: Homework 2 solutions

Math 104: Homework 2 solutions Math 04: Homework solutios. A (0, ): Sice this is a ope iterval, the miimum is udefied, ad sice the set is ot bouded above, the maximum is also udefied. if A 0 ad sup A. B { m + : m, N}: This set does

More information

Integrable Functions. { f n } is called a determining sequence for f. If f is integrable with respect to, then f d does exist as a finite real number

Integrable Functions. { f n } is called a determining sequence for f. If f is integrable with respect to, then f d does exist as a finite real number MATH 532 Itegrable Fuctios Dr. Neal, WKU We ow shall defie what it meas for a measurable fuctio to be itegrable, show that all itegral properties of simple fuctios still hold, ad the give some coditios

More information

Cardinality Homework Solutions

Cardinality Homework Solutions Cardiality Homework Solutios April 16, 014 Problem 1. I the followig problems, fid a bijectio from A to B (you eed ot prove that the fuctio you list is a bijectio): (a) A = ( 3, 3), B = (7, 1). (b) A =

More information

Part A, for both Section 200 and Section 501

Part A, for both Section 200 and Section 501 Istructios Please write your solutios o your ow paper. These problems should be treated as essay questios. A problem that says give a example or determie requires a supportig explaatio. I all problems,

More information

Here are some examples of algebras: F α = A(G). Also, if A, B A(G) then A, B F α. F α = A(G). In other words, A(G)

Here are some examples of algebras: F α = A(G). Also, if A, B A(G) then A, B F α. F α = A(G). In other words, A(G) MATH 529 Probability Axioms Here we shall use the geeral axioms of a probability measure to derive several importat results ivolvig probabilities of uios ad itersectios. Some more advaced results will

More information

Section 5.1 The Basics of Counting

Section 5.1 The Basics of Counting 1 Sectio 5.1 The Basics of Coutig Combiatorics, the study of arragemets of objects, is a importat part of discrete mathematics. I this chapter, we will lear basic techiques of coutig which has a lot of

More information

Beurling Integers: Part 2

Beurling Integers: Part 2 Beurlig Itegers: Part 2 Isomorphisms Devi Platt July 11, 2015 1 Prime Factorizatio Sequeces I the last article we itroduced the Beurlig geeralized itegers, which ca be represeted as a sequece of real umbers

More information

MATH 112: HOMEWORK 6 SOLUTIONS. Problem 1: Rudin, Chapter 3, Problem s k < s k < 2 + s k+1

MATH 112: HOMEWORK 6 SOLUTIONS. Problem 1: Rudin, Chapter 3, Problem s k < s k < 2 + s k+1 MATH 2: HOMEWORK 6 SOLUTIONS CA PRO JIRADILOK Problem. If s = 2, ad Problem : Rudi, Chapter 3, Problem 3. s + = 2 + s ( =, 2, 3,... ), prove that {s } coverges, ad that s < 2 for =, 2, 3,.... Proof. The

More information

Lecture 27. Capacity of additive Gaussian noise channel and the sphere packing bound

Lecture 27. Capacity of additive Gaussian noise channel and the sphere packing bound Lecture 7 Ageda for the lecture Gaussia chael with average power costraits Capacity of additive Gaussia oise chael ad the sphere packig boud 7. Additive Gaussia oise chael Up to this poit, we have bee

More information

The Growth of Functions. Theoretical Supplement

The Growth of Functions. Theoretical Supplement The Growth of Fuctios Theoretical Supplemet The Triagle Iequality The triagle iequality is a algebraic tool that is ofte useful i maipulatig absolute values of fuctios. The triagle iequality says that

More information

A Proof of Birkhoff s Ergodic Theorem

A Proof of Birkhoff s Ergodic Theorem A Proof of Birkhoff s Ergodic Theorem Joseph Hora September 2, 205 Itroductio I Fall 203, I was learig the basics of ergodic theory, ad I came across this theorem. Oe of my supervisors, Athoy Quas, showed

More information

10.1 Sequences. n term. We will deal a. a n or a n n. ( 1) n ( 1) n 1 2 ( 1) a =, 0 0,,,,, ln n. n an 2. n term.

10.1 Sequences. n term. We will deal a. a n or a n n. ( 1) n ( 1) n 1 2 ( 1) a =, 0 0,,,,, ln n. n an 2. n term. 0. Sequeces A sequece is a list of umbers writte i a defiite order: a, a,, a, a is called the first term, a is the secod term, ad i geeral eclusively with ifiite sequeces ad so each term Notatio: the sequece

More information

Advanced Stochastic Processes.

Advanced Stochastic Processes. Advaced Stochastic Processes. David Gamarik LECTURE 2 Radom variables ad measurable fuctios. Strog Law of Large Numbers (SLLN). Scary stuff cotiued... Outlie of Lecture Radom variables ad measurable fuctios.

More information

ON THE LEHMER CONSTANT OF FINITE CYCLIC GROUPS

ON THE LEHMER CONSTANT OF FINITE CYCLIC GROUPS ON THE LEHMER CONSTANT OF FINITE CYCLIC GROUPS NORBERT KAIBLINGER Abstract. Results of Lid o Lehmer s problem iclude the value of the Lehmer costat of the fiite cyclic group Z/Z, for 5 ad all odd. By complemetary

More information

Assignment 5: Solutions

Assignment 5: Solutions McGill Uiversity Departmet of Mathematics ad Statistics MATH 54 Aalysis, Fall 05 Assigmet 5: Solutios. Let y be a ubouded sequece of positive umbers satisfyig y + > y for all N. Let x be aother sequece

More information

Singular Continuous Measures by Michael Pejic 5/14/10

Singular Continuous Measures by Michael Pejic 5/14/10 Sigular Cotiuous Measures by Michael Peic 5/4/0 Prelimiaries Give a set X, a σ-algebra o X is a collectio of subsets of X that cotais X ad ad is closed uder complemetatio ad coutable uios hece, coutable

More information

Measure and Measurable Functions

Measure and Measurable Functions 3 Measure ad Measurable Fuctios 3.1 Measure o a Arbitrary σ-algebra Recall from Chapter 2 that the set M of all Lebesgue measurable sets has the followig properties: R M, E M implies E c M, E M for N implies

More information

Sequences A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence

Sequences A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece 1, 1, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet

More information

Lecture 4: Grassmannians, Finite and Affine Morphisms

Lecture 4: Grassmannians, Finite and Affine Morphisms 18.725 Algebraic Geometry I Lecture 4 Lecture 4: Grassmaias, Fiite ad Affie Morphisms Remarks o last time 1. Last time, we proved the Noether ormalizatio lemma: If A is a fiitely geerated k-algebra, the,

More information

Frequentist Inference

Frequentist Inference Frequetist Iferece The topics of the ext three sectios are useful applicatios of the Cetral Limit Theorem. Without kowig aythig about the uderlyig distributio of a sequece of radom variables {X i }, for

More information

INFINITE SEQUENCES AND SERIES

INFINITE SEQUENCES AND SERIES INFINITE SEQUENCES AND SERIES INFINITE SEQUENCES AND SERIES I geeral, it is difficult to fid the exact sum of a series. We were able to accomplish this for geometric series ad the series /[(+)]. This is

More information

Injections, Surjections, and the Pigeonhole Principle

Injections, Surjections, and the Pigeonhole Principle Ijectios, Surjectios, ad the Pigeohole Priciple 1 (10 poits Here we will come up with a sloppy boud o the umber of parethesisestigs (a (5 poits Describe a ijectio from the set of possible ways to est pairs

More information

Fall 2013 MTH431/531 Real analysis Section Notes

Fall 2013 MTH431/531 Real analysis Section Notes Fall 013 MTH431/531 Real aalysis Sectio 8.1-8. Notes Yi Su 013.11.1 1. Defiitio of uiform covergece. We look at a sequece of fuctios f (x) ad study the coverget property. Notice we have two parameters

More information

Math 609/597: Cryptography 1

Math 609/597: Cryptography 1 Math 609/597: Cryptography 1 The Solovay-Strasse Primality Test 12 October, 1993 Burt Roseberg Revised: 6 October, 2000 1 Itroductio We describe the Solovay-Strasse primality test. There is quite a bit

More information

Ma 530 Infinite Series I

Ma 530 Infinite Series I Ma 50 Ifiite Series I Please ote that i additio to the material below this lecture icorporated material from the Visual Calculus web site. The material o sequeces is at Visual Sequeces. (To use this li

More information

w (1) ˆx w (1) x (1) /ρ and w (2) ˆx w (2) x (2) /ρ.

w (1) ˆx w (1) x (1) /ρ and w (2) ˆx w (2) x (2) /ρ. 2 5. Weighted umber of late jobs 5.1. Release dates ad due dates: maximimizig the weight of o-time jobs Oce we add release dates, miimizig the umber of late jobs becomes a sigificatly harder problem. For

More information

University of Colorado Denver Dept. Math. & Stat. Sciences Applied Analysis Preliminary Exam 13 January 2012, 10:00 am 2:00 pm. Good luck!

University of Colorado Denver Dept. Math. & Stat. Sciences Applied Analysis Preliminary Exam 13 January 2012, 10:00 am 2:00 pm. Good luck! Uiversity of Colorado Dever Dept. Math. & Stat. Scieces Applied Aalysis Prelimiary Exam 13 Jauary 01, 10:00 am :00 pm Name: The proctor will let you read the followig coditios before the exam begis, ad

More information

1 Introduction. 1.1 Notation and Terminology

1 Introduction. 1.1 Notation and Terminology 1 Itroductio You have already leared some cocepts of calculus such as limit of a sequece, limit, cotiuity, derivative, ad itegral of a fuctio etc. Real Aalysis studies them more rigorously usig a laguage

More information

Solution. 1 Solutions of Homework 1. Sangchul Lee. October 27, Problem 1.1

Solution. 1 Solutions of Homework 1. Sangchul Lee. October 27, Problem 1.1 Solutio Sagchul Lee October 7, 017 1 Solutios of Homework 1 Problem 1.1 Let Ω,F,P) be a probability space. Show that if {A : N} F such that A := lim A exists, the PA) = lim PA ). Proof. Usig the cotiuity

More information

MA131 - Analysis 1. Workbook 9 Series III

MA131 - Analysis 1. Workbook 9 Series III MA3 - Aalysis Workbook 9 Series III Autum 004 Cotets 4.4 Series with Positive ad Negative Terms.............. 4.5 Alteratig Series.......................... 4.6 Geeral Series.............................

More information

On Topologically Finite Spaces

On Topologically Finite Spaces saqartvelos mecierebata erovuli aademiis moambe, t 9, #, 05 BULLETIN OF THE GEORGIAN NATIONAL ACADEMY OF SCIENCES, vol 9, o, 05 Mathematics O Topologically Fiite Spaces Giorgi Vardosaidze St Adrew the

More information

ii. O = {x x = 2k + 1 for some integer k} (This set could have been listed O = { -3, -1, 1, 3, 5 }.)

ii. O = {x x = 2k + 1 for some integer k} (This set could have been listed O = { -3, -1, 1, 3, 5 }.) Sets 1 Math 3312 Set Theory Sprig 2008 Itroductio Set theory is a brach of mathematics that deals with the properties of welldefied collectios of objects, which may or may ot be of a mathematical ature,

More information

Lecture 1. January 8, 2018

Lecture 1. January 8, 2018 Lecture 1 Jauary 8, 018 1 Primes A prime umber p is a positive iteger which caot be writte as ab for some positive itegers a, b > 1. A prime p also have the property that if p ab, the p a or p b. This

More information