How To Factorize Of Finite Abelian Groups By A Cyclic Subset Of A Finite Group



Similar documents
FACTORING CERTAIN INFINITE ABELIAN GROUPS BY DISTORTED CYCLIC SUBSETS

GROUPS ACTING ON A SET

(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.

I. GROUPS: BASIC DEFINITIONS AND EXAMPLES

SUBGROUPS OF CYCLIC GROUPS. 1. Introduction In a group G, we denote the (cyclic) group of powers of some g G by

Factoring finite abelian groups

SCORE SETS IN ORIENTED GRAPHS

Assignment 8: Selected Solutions

SECTION 10-2 Mathematical Induction

MATHEMATICAL INDUCTION. Mathematical Induction. This is a powerful method to prove properties of positive integers.

COMMUTATIVE RINGS. Definition: A domain is a commutative ring R that satisfies the cancellation law for multiplication:

Math 115 Spring 2011 Written Homework 5 Solutions

4. FIRST STEPS IN THE THEORY 4.1. A

IRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL. 1. Introduction

How To Prove The Dirichlet Unit Theorem

Lemma 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.

Solutions to TOPICS IN ALGEBRA I.N. HERSTEIN. Part II: Group Theory

Cycles in a Graph Whose Lengths Differ by One or Two

Revised Version of Chapter 23. We learned long ago how to solve linear congruences. ax c (mod m)

Prime Numbers and Irreducible Polynomials

Elements of Abstract Group Theory

Handout #1: Mathematical Reasoning

Non-Separable Detachments of Graphs

MATH10040 Chapter 2: Prime and relatively prime numbers

6 Commutators and the derived series. [x,y] = xyx 1 y 1.

This chapter is all about cardinality of sets. At first this looks like a

Chapter 3. Cartesian Products and Relations. 3.1 Cartesian Products

Homework until Test #2

Elementary Number Theory and Methods of Proof. CSE 215, Foundations of Computer Science Stony Brook University

Solutions to Homework 6 Mathematics 503 Foundations of Mathematics Spring 2014

Formal Languages and Automata Theory - Regular Expressions and Finite Automata -

ON GALOIS REALIZATIONS OF THE 2-COVERABLE SYMMETRIC AND ALTERNATING GROUPS

Fundamentele Informatica II

ADDITIVE GROUPS OF RINGS WITH IDENTITY

A Second Course in Mathematics Concepts for Elementary Teachers: Theory, Problems, and Solutions

INTRODUCTORY SET THEORY

Odd induced subgraphs in graphs of maximum degree three

11 Ideals Revisiting Z

If n is odd, then 3n + 7 is even.

WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT?

Every tree contains a large induced subgraph with all degrees odd

Welcome to Math Video Lessons. Stanley Ocken. Department of Mathematics The City College of New York Fall 2013

k, then n = p2α 1 1 pα k

HOMEWORK 5 SOLUTIONS. n!f n (1) lim. ln x n! + xn x. 1 = G n 1 (x). (2) k + 1 n. (n 1)!

Adding vectors We can do arithmetic with vectors. We ll start with vector addition and related operations. Suppose you have two vectors

All trees contain a large induced subgraph having all degrees 1 (mod k)

You know from calculus that functions play a fundamental role in mathematics.

GROUPS WITH TWO EXTREME CHARACTER DEGREES AND THEIR NORMAL SUBGROUPS

Real Roots of Univariate Polynomials with Real Coefficients

DEGREES OF ORDERS ON TORSION-FREE ABELIAN GROUPS

Degree Hypergroupoids Associated with Hypergraphs

Sign changes of Hecke eigenvalues of Siegel cusp forms of degree 2

Math 55: Discrete Mathematics

Wald s Identity. by Jeffery Hein. Dartmouth College, Math 100

Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan

FIRST YEAR CALCULUS. Chapter 7 CONTINUITY. It is a parabola, and we can draw this parabola without lifting our pencil from the paper.

RINGS WITH A POLYNOMIAL IDENTITY

About the inverse football pool problem for 9 games 1

Chapter 7: Products and quotients

PUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include

On the generation of elliptic curves with 16 rational torsion points by Pythagorean triples

F. ABTAHI and M. ZARRIN. (Communicated by J. Goldstein)

4. CLASSES OF RINGS 4.1. Classes of Rings class operator A-closed Example 1: product Example 2:

A simple criterion on degree sequences of graphs

1 = (a 0 + b 0 α) (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

= = 3 4, Now assume that P (k) is true for some fixed k 2. This means that

minimal polyonomial Example

To define function and introduce operations on the set of functions. To investigate which of the field properties hold in the set of functions

Primality - Factorization

THE AVERAGE DEGREE OF AN IRREDUCIBLE CHARACTER OF A FINITE GROUP

Student Outcomes. Lesson Notes. Classwork. Discussion (10 minutes)

SOLUTIONS TO ASSIGNMENT 1 MATH 576

Group Theory. Contents

S on n elements. A good way to think about permutations is the following. Consider the A = 1,2,3, 4 whose elements we permute with the P =

FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z

CS 103X: Discrete Structures Homework Assignment 3 Solutions

The Open University s repository of research publications and other research outputs

Continued Fractions and the Euclidean Algorithm

SOLVING POLYNOMIAL EQUATIONS

Page 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.

MA651 Topology. Lecture 6. Separation Axioms.

THE FUNDAMENTAL THEOREM OF ARBITRAGE PRICING

Every Positive Integer is the Sum of Four Squares! (and other exciting problems)

Ideal Class Group and Units

Applications of Fermat s Little Theorem and Congruences

The Ideal Class Group

POLYNOMIAL RINGS AND UNIQUE FACTORIZATION DOMAINS

a 11 x 1 + a 12 x a 1n x n = b 1 a 21 x 1 + a 22 x a 2n x n = b 2.

Chapter ML:IV. IV. Statistical Learning. Probability Basics Bayes Classification Maximum a-posteriori Hypotheses

2. Let H and K be subgroups of a group G. Show that H K G if and only if H K or K H.

Abstract Algebra Cheat Sheet

Math Abstract Algebra I Questions for Section 23: Factoring Polynomials over a Field

U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, Notes on Algebra

Math 231b Lecture 35. G. Quick

Sample Induction Proofs

def: An axiom is a statement that is assumed to be true, or in the case of a mathematical system, is used to specify the system.

CONTRIBUTIONS TO ZERO SUM PROBLEMS

Transcription:

Comment.Math.Univ.Carolin. 51,1(2010) 1 8 1 A Hajós type result on factoring finite abelian groups by subsets II Keresztély Corrádi, Sándor Szabó Abstract. It is proved that if a finite abelian group is factored into a direct product of lacunary cyclic subsets, then at least one of the factors must be periodic. This result generalizes Hajós s factorization theorem. Keywords: factorization of finite abelian groups, periodic subset, cyclic subset, Hajós s theorem Classification: Primary 20K01; Secondary 05B45, 52C22, 68R05 1. Introduction Let G be a finite abelian group written multiplicatively with identity element e. Let A 1,..., A n be subsets of G. We form the list of elements (1) a 1 a n, a 1 A 1,...,a n A n. This list contains A 1 A n elements. The product A 1 A n is defined to be the set of all elements on the list (1). If the elements on the list (1) are distinct, that is, if a 1 a n = a 1 a n, a 1, a 1 A 1,..., a n, a n A n always implies a 1 = a 1,..., a n = a n, then we say that the product A 1 A n is direct. If the product A 1 A n is direct and it is equal to G, then we say that G is factored into subsets A 1,..., A n. We also express this fact by saying that the equation G = A 1 A n is a factorization of G. Clearly, G = A 1 A n is a factorization of G if and only if each element g of G is uniquely expressible in the form g = a 1 a n, a 1 A 1,..., a n A n. A subset A of G is called normalized if e A. A factorization G = A 1 A n is called normalized if each A i is a normalized subset of G. In this paper mainly normalized factorizations will appear. If G = A 1 A n is a normalized factorization of G and A n = {e}, then clearly G = A 1 A n 1 is also a normalized factorization of G. In other words the factors that are equal to {e} can be cancelled from each normalized factorization of G unless G = {e}. Throughout this note we assume that G {e} and that in each

2 K. Corrádi, S. Szabó normalized factorization of G there is no factor equal to {e}. Plainly A i = is not possible and so we may assume that A i 2. Let a be an element of G and let r be a nonnegative integer. We form the list of elements (2) e, a, a 2,..., a r 1. We assume that a r since otherwise there are repetition among the elements (2). In other words we assume that the elements on the list (2) are distinct. The set of elements on the list (2) of G is called a cyclic subset of G. We will use the bracket notation [a, r] for this subset of G. If r = 1, then [a, r] = {e} independently of the choice of the element a. If r = 0, then [a, r] = independently of the choice of the element a. In order to solve a long standing geometric conjecture of H. Minkowski, G. Hajós [2] proved the following theorem. Theorem 1. Let G be a finite abelian group and let G = A 1 A n be a factorization of G, where each A i is a cyclic subset of G. Then at least one of the factors A 1,..., A n is a subgroup of G. This note deals with possible extensions of this theorem. Let a, d be elements of G and let i, r be positive integers. We form the list of elements (3) e, a, a 2,..., a i 1, a i d, a i+1,..., a r 1. We assume that a r and 1 i r 1 and further we assume that a i d / {e, a, a 2,..., a i 1 } {a i+1,..., a r 1 }. The set of elements on the list (3) is called a distorted cyclic subset of G. In this note distorted cyclic subsets in the form {e, a, a 2,...,a r 2, a r 1 d} will mainly appear. The following result has been proved by Sands [3]. In fact he proved a more general result but we cite only a special case. Theorem 2. Let G be a finite abelian group and let G = A 1 A n be a factorization of G, where each A i is a distorted cyclic subset of G. Then at least one of the factors A 1,...,A n is a subgroup of G. As a cyclic subset is always a distorted cyclic subset, Theorem 2 can be considered to be an extension of Theorem 1. Let g be an element of G and let [a, r], [a, s] be cyclic subsets of G. A subset of G in the form [a, r] g[a, s] is called a lacunary cyclic subset of G. If [a, r] g[a, s], then a i = ga j for some i, j, 0 i r 1, 0 j s 1 and so g a. In this case the lacunary cyclic

A Hajós type result on factoring finite abelian groups by subsets II 3 subset [a, r] g[a, s] can be written in the form [a, r ] a k [a, s ] for some integers r, s, k. In addition we may choose these integers such that [a, r ] a k [a, s ] =. In the rest of this note we will choose the notation such that for the lacunary cyclic subset [a, r] g[a, s], [a, r] g[a, s] = holds. As a consequence the number of the elements of the lacunary cyclic subset [a, r] g[a, s] is r + s. If s = 0, then [a, r] g[a, s] reduces to the cyclic subset [a, r]. If s = 1, then [a, r] g[a, s] reduces to the distorted cyclic subset {e, a, a 2,...,a r 1, a r d}. Corrádi and Szabó [1] have proved the following theorem. Theorem 3. Let G be a finite abelian group of odd order and let G = A 1 A n be a factorization of G, where each A i is a lacunary cyclic subset of G. Then at least one of the factors A 1,..., A n is a subgroup of G. From the remarks before Theorem 3 it follows that Theorem 3 is an extension of Theorem 2 for finite abelian groups of odd order. However, examples exhibited in [1] show that Theorem 3 cannot be extended for finite abelian groups of even order. A subset A of G is defined to be periodic if there is an element g of G such that g e and Ag = A. Sands [3] established the following about periodic distorted cyclic subsets. Theorem 4. Let G be a finite abelian group and let G = AB be a factorization of G, where A is a distorted cyclic subset of G. If A is periodic, then A must be a subgroup of G. This result implies that the next theorem is an equivalent formulation of Theorem 2. Theorem 5. Let G be a finite abelian group and let G = A 1 A n be a factorization of G, where each A i is a distorted cyclic subset of G. Then at least one of the factors A 1,...,A n is a periodic subset of G. We will prove the following variant of Theorem 5. Theorem 6. Let G be a finite abelian group and let G = A 1 A n be a factorization of G, where each A i is a lacunary cyclic subset of G. Then at least one of the factors A 1,...,A n is a periodic subset of G. 2. The result In this section we present a proof of Theorem 6. Proof: Assume on the contrary that there is a finite abelian group G and a factorization G = A 1 A n, where each A i is a non-periodic lacunary cyclic subset of G. Of course we assume that neither G nor any of the factor is equal to {e}.

4 K. Corrádi, S. Szabó Our goal is to prove that if there exists a counter-example G = A 1 A n, then there exists a counter-example G = A 1 A m such that each A i is a distorted cyclic subset of G that is not periodic. Such an example would contradict Theorem 5, and hence there can be no counter-example at all. We thus need to demonstrate that each A i that is not a distorted cyclic subset can be factored into a direct product of such subsets or can be replaced by such a subset. The replacing subsets should not be periodic. To verify that it suffices, by Theorem 4, to verify that they do not form a subgroup. When n 2 with no loss of generality we can choose i = 1 and set A = A 1 and B = A 2 A n. Let us turn to the details. If n = 1, then G = A 1. As G {e}, A 1 is periodic. This contradiction gives that n 2. The factorization G = A 1 A n can be written in the form G = AB, where A = A 1 and B = A 2 A n. We have assumed that A i 2 and so A 2 and B 2. If A = 2, then A = A 1 is a cyclic subset of G. In this case we do nothing with A 1. For the remaining part of the proof we assume that A 3. Let A = [a, r] g[a, s]. Multiplying the factorization G = AB by g 1 we get the factorization G = Gg 1 = (Ag 1 )B. Note that Ag 1 = [a, s] g 1 [a, r] is also a lacunary cyclic subset of G. Clearly, if Ag 1 is periodic, then A is periodic too. This shows that the roles of r and s can be reversed in a counter-example. In the remaining part of the proof we assume that r s. In the r = s case the computation A = [a, r] g[a, s] = [a, r] g[a, r] = {e, g}[a, r] = [g, 2][a, r] shows that A is a direct product of two cyclic subsets. If [g, 2] is a subgroup of G, then we get the contradiction that A = A 1 is periodic. Similarly, if [a, r] is a subgroup of G, then we get the contradiction that A = A 1 is periodic. Therefore, in the r = s special case the factor A = A 1 is a direct product of two non-subgroup cyclic subsets. Thus for the remaining part of the proof we assume that r > s. Let us turn to the A = 3 case. Now r+s = 3, r > s 0 and so either s = 0 or s = 1. If s = 0, then A = A 1 is a non-periodic cyclic subset of G. By Theorem 4, A = A 1 is a non-subgroup cyclic subset of G. In this case we do nothing with A 1. If s = 1, then A = A 1 is a non-periodic distorted cyclic subset of G. By Theorem 4, A = A 1 is a non-subgroup distorted cyclic subset of G. In this case again we do nothing with A 1. The A = 4 case is similar. The factor A = A 1 is either a non-subgroup cyclic subset of G or a non-subgroup distorted cyclic subset of G and we do nothing with A 1. For the remaining part of the proof we assume that A 5.

A Hajós type result on factoring finite abelian groups by subsets II 5 If s = 0 or s = 1, then A = A 1 is a non-subgroup cyclic or distorted cyclic subset of G and we do nothing with A 1. Suppose s 2 and let Define d G by g = a r d. Then A = {e, a, a 2,..., a r+s 2, a s 1 g}. A = {e, a, a 2,...,a r+s 2, a r+s 1 d}. We claim that in the factorization G = AB the factor A can be replaced by A to get the factorization G = A B. In order to prove the claim note that the factorization G = AB implies that the sets (4) eb, ab,..., a r 1 B, gb, gab,..., ga s 1 B form a partition of G. Multiplying the factorization G = AB by a we get the factorization G = Ga = (Aa)B. (Here Aa is not a normalized subset of G. This is the only factorization in the paper which is not normalized.) Hence the sets (5) ab, a 2 B,..., a r B, gab, ga 2 B,...,ga s B form a partition of G. Comparing partitions (4) and (5) provides that (6) eb gb = a r B ga s B. If gb ga s B, then B a s B. This violates (4) as 2 s < r. Thus gb ga s B =. From (6) it follows that gb a r B. Both sets are of the same size and so gb = a r B. Replacing gb by a r B in (4) in the following way gives that the sets eb, ab,..., a r 1 B, gb, gab }{{} } {{ } a r B a r+1 B,..., ga s 2 B, ga s 1 B } {{ } a r+s 2 B eb, ab,..., a r 1 B, a r B, a r+1 B,..., a r+s 2 B, ga s 1 B form a partition of G. This means that G = A B is a factorization of G as we claimed. As G = A B is a factorization of G, the elements are distinct. In particular e, a, a 2,..., a r+s 2, a r+s 1 d a r+s 1 d / {e, a, a 2,...,a r+s 2 } and so A is a distorted cyclic subset of G.

6 K. Corrádi, S. Szabó Suppose s 2 and let A = [a, r + s] = {e, a, a 2,..., a r+s 2, a r+s 1 }. We claim that in the factorization G = AB the factor A can be replaced by A to get the factorization G = A B. In order to prove the claim let us replace gb by a r B in (4) in the following way Therefore the sets eb, ab,..., a r 1 B, gb, gab }{{} } {{ } a r B a r+1 B,..., ga s 2 B } {{ } a r+s 2 B, ga s 1 B } {{ } a r+s 1 B eb, ab,...,a r 1 B, a r B, a r+1 B,...,a r+s 2 B, a r+s 1 B form a partition of G. This means that G = A B is a factorization of G as we claimed. In order to simplify the notations we set t = r + s. Now A = {e, a, a 2,...,a t 2, a s 1 g} = {e, a, a 2,...,a t 2, a t 1 d}. We claim that A is not a subgroup of G. To verify the claim first note that from the factorization G = A B, it follows that the elements e, a, a 2,...,a t 1 must be distinct. Next assume on the contrary that A is a subgroup of G. Let us consider the product a a t 2. Either a a t 2 {e, a,...,a t 2 }. or a a t 2 {a t 1 d}. In the first case we get a t 1 = a i for some i, 0 i t 2. Therefore a t 1 i = e. This is contradiction since the elements e, a, a 2,...,a t 1 are distinct. In the second case a t 1 = a t 1 d and so d = e. This means that A = A. It was assumed that A is not periodic. By Theorem 4, A is not a subgroup. Thus A is a not a subgroup of G as we claimed. We may summarize the above argument by saying that in the factorization G = A 1 A 2 A n the factor A 1 is either a direct product of non-subgroup cyclic subsets of G or can be replaced by a non-subgroup distorted cyclic subset of G. It may happen that the distorted cyclic subset is simply a cyclic subset. The essential point is that it is not a subgroup. We may repeat this replacement in connection with each A i factor in the factorization and we get a factorization G = A 1 A m, where each A i is a non-subgroup distorted cyclic subset of G. (The index m is not a typographical error. When we replace the factor A i it may happen that A i is replaced by a product of two

A Hajós type result on factoring finite abelian groups by subsets II 7 cyclic subsets. Therefore the number of the factors may change after the replacements.) The new factorization G = A 1 A m contradicts Theorem 2 and this contradiction completes the proof. 3. An example In her or his report the anonymous referee writes the following. For the sake of completeness I suggest to equip the paper with examples of direct products that do not fulfill the hypothesis of Theorem 6 but are close to the hypothesis. For example, can all the factors be lacunary with the exception of one? Can this be achieved for any n? Can the non-lacunary factor be of a simple structure, say [a, r] g[a, s] h[a, t]? We present an example motivated by these questions. Let G be an abelian group with basis elements x, y, z, where x = y = z = 4. Set A 1 = {e, x 2 y 2 z 2 } xz 2 {e, x 2 } x 2 y{e, y 2 } y 2 z{e, z 2 }, A 2 A 3 A 4 = {e, x}, = {e, y}, = {e, z}. We claim that the product A 1 A 2 A 3 A 4 is direct and it is equal to G. Further none of the factors is periodic. The sets A 2, A 3, A 4 are cyclic and so they are lacunary cyclic subsets too. The factor A 1 can be written in the form [x 2 y 2 z 2, 2] xz 2 [x 2, 2] x 2 y[y 2, 2] y 2 z[z 2, 2]. This is not exactly the example the referee asks for since the elements x 2 y 2 z 2, x 2, y 2, z 2 are not equal. We close this section with an open problem. The credit for this problem goes to the referee. Problem 1. Let G be a finite abelian group and let G = A 1 A 2 A n be a factorization of G such that A 1 is in the form [a, r] g[a, s] h[a, t] and A 2,..., A n are lacunary cyclic subsets. Does it follow that at least one of the factors is periodic? The next problem is a simplified version of Problem 1 and it is motivated by the example above. An answer in the affirmative still would provide a generalization for Hajós s theorem. Problem 2. Let G be a finite abelian group and let G = A 1 A 2 A n be a factorization of G such that A 1 is in the form [a, r] g[a, s] h[a, t] and A 2,..., A n are cyclic subsets. Does it follow that at least one of the factors is periodic?

8 K. Corrádi, S. Szabó References [1] Corrádi K., Szabó S., A Hajós type result on factoring finite abelian groups by subsets, Math. Pannon. 5 (1994), 275 280. [2] Hajós G., Über einfache und mehrfache Bedeckung des n-dimensionalen Raumes mit einem Würfelgitter, Math. Z. 47 (1942), 427 467. [3] Sands A.D., A note on distorted cyclic subsets, Math. Pannon. 20 (2009), 123 127. Department of General Computer Technics, Eötvös L. University, Pázmány P. sétány 1/c, H 1117 Budapest, Hungary Institute of Mathematics and Informatics, University of Pécs, Ifjúság u. 6, 7624 Pécs, Hungary Email: sszabo7@hotmail.com (Received July 25, 2009, revised November 6, 2009)