Pure Skew Lattices in Rings
|
|
- Alan Francis
- 5 years ago
- Views:
Transcription
1 Semigroup Forum Vol. 68 (24) c 24 Springer-Verlag New York, LLC DOI:.7/s RESEARCH ARTICLE Pure Skew Lattices in Rings Karin Cvetko-Vah Communicated by Boris M. Schein Abstract Given a ring R, let S R be a pure multiplicative band that is closed under the cubic join operation x y = x + y + yx xyx yxy. We show that (S,, ) forms a pure skew lattice if and only if S satisfies the polynomial identity (xy yx) 2 z = z (xy yx) 2. We also examine properties of pure skew lattices in rings.. Introduction In [4] a skew lattice S is defined as a set S endowed with two operations, denoted by and, where the operations and are both idempotent and associative, and they satisfy the absorption laws x (x y) =x, (x y) y = y and their duals. On a skew lattice S a preorder is defined by x y whenever x y x = x or dually y x y = y. Preorder induces an equivalence relation on S defined by x y ifand only ifx y and y x. Relation is a congruence for either of the operations,. The equivalence classes in respect to are called components of S. Let R be a ring. Skew lattices in rings were also introduced in [4]. The operation is defined as multiplication, while there are two natural ways of defining the operation, namely x y = x + y xy, and x y = x + y + yx xyx yxy. Throughout this paper, a set S R is called a skew lattice if it forms a skew lattice for multiplication and operation. Any multiplicative band S in a ring R that is closed under the operation is called a -band. It is an easy observation that -bands satisfy all axioms for skew lattices except perhaps associativity. A semigroup ofidempotents is called a band. Recall that in a band, the Green s equivalence relations can be defined by: xry (xy = y & yx = x), xly (xy = x & yx = y), xhy (xry & xly), D = L R= R L. Note that our congruence relation equals Green s relation D, while xhy implies x = y.
2 Cvetko-Vah 269 In [2] pure bands ofmatrices were introduced. We can generalize this definition to arbitrary rings. A band S R is called a pure band if S/D is totally ordered. A skew lattice S R is called a pure skew lattice ifthe multiplicative reduct (S, ) is a pure band. The main result ofthis paper is the following. Theorem.. A pure -band S in a ring R is a skew lattice if and only if S satisfies the polynomial identity x (yz zy) 2 =(yz zy) 2 x. Historically, skew lattices arise from pseudolattices which were introduced by Schein in [8], and near lattices which were studied by Schweigert in [9] and []. For the definitions and basic notions on semigroups and skew lattices we refer the reader to [3] and [4], respectively. 2. Pure skew lattices The following is a useful property of multiplicative bands in rings. Proposition 2.. If S R is a band, then (x y) x = x (y x) = x + y yxy for all x, y S. Proof. Expanding the left and middle expressions with the aid of x (x y) = x =(y x) x yields x + y yxy. Corollary2.2. If S R is a band, then xyx = x if and only if y x y = y. Proof. Clearly, y x y = x + y xyx equals y ifand only ifxyx = x. Corollary2.3. Any -band S in a ring R is a regular band. That is, xyxzx = xyzx holds in S. Proof. Given x y in S, denote x y x = x + y yxy by x. It is easily seen that both x x and x y in S. But ifsuch an x exists for all pairs x y in S, then S must be regular. (See [6]). For any multiplicative band S in a ring R we also have: Proposition 2.4. If x y in S, then x y reduces to y + yx yxy, y x reduces to y+xy yxy with both being idempotent in R. Moreover, xy, yx x, while x y, y x y, provided x y and y x also lie in S. Proof. Given xyx = x, x y and y x clearly reduce as stated. A simple multiplication verifies that they are idempotent. Clearly y (x y) y = y ; moreover (x y) y (x y) =y (y + yx yxy) =y + yx yxy = x y.thusx y y in S provided x y is in S. The situation for y x is similar. That xy, yx x if x y is well known.
3 27 Cvetko-Vah 3. Associativityof Throughout this section let S R be a pure -band. An example in [] shows that S need not be a skew lattice, i.e. need not be associative. In order to prove Theorem., we first prove the following two propositions: Proposition 3.. and bca = ba. Let a, b, c S be such that a b c. Then acb = ab Proof. To begin, consider a = a b a = a+b bab. Clearly, aa = a a = a. Moreover, a Db. That ba b = b is again clear. On the other hand, a ba = (a + b bab) b (a + b bab) = (a + b bab)(ba + b bab) = aba + ba + b bab ba bab + bab = a + b bab = a. In any band, xyz = xz if x and z are in the same D -class and y lies either in that class or in some higher D -class. Hence, acb = aa cb = aa b = b. Similarly, bca = ba. Proposition 3.2. Let a, b, c S be such that a b c. Then (a c) b = a (c b) and (b c) a = b (c a). Proof. We calculate the following with the aid of the previous proposition. a (c b) = a (c + bc cbc) = c + bc cbc + ca + ba cba (ca + ba cba)(c + bc cbc) = c + bc cbc + ca + ba cba cac cabc + cacbc bac babc + bacbc + cbac + cbabc cbacbc = c + bc cbc + ca + ba cba cac bac + cbac, and (a c) b = (c + ca cac) b = c + ca cac + bc + bca bcac (c + ca cac)(bc + bca bcac) = c + ca cac + bc + ba bac cbc cba + cbac cabc caba + cabac + cabc + caba cabac = c + ca cac + bc + ba bac cbc cba + cbac = a (c b), By a symmetric argument, one sees that b (c a) =(b c) a. Proof of Theorem.. Given a b c as above, we next calculate all cases of -composition where c is not in the middle. Using Proposition 3. we calculate the following: (a b) c = (b + ba bab) c = c + cb + cba cbab cbc cbac + cbabc,
4 Cvetko-Vah 27 a (b c) = a (c + cb cbc) = c + cb cbc + ca + cba cba ca (c + cb cbc) = c + cb cbc + ca cac cab + cabc, (b a) c = (b + ab bab) c = c + cb + cab cbab cbc cabc + cbabc, b (a c) = b (c + ca cac) = c + ca cac + cb + cab cab cb (c + ca cac) = c + ca cac + cb cbc cba + cbac, (c a) b = (c + ac cac) b = c + ac cac + bc + bac bac (c + ac cac) bc = c + ac + bc cac cbc abc + cabc, c (a b) = c (b + ba bab) = c + bc + bac babc cbc cbac + cbabc, (c b) a = (c + bc cbc) a = c + bc cbc + ac + abc abc (c + bc cbc) ac = c + ac + bc cbc cac bac + cbac, and c (b a) = c (b + ab bab) = c + bc + abc babc cbc cabc + cbabc. The above calculations yield the following differences: a (b c) (a b) c = ca cac cab + cabc cba + cbab + cbac cbabc = c (ab + ba a bab)(c ) = c (ab ba) 2 (c ) b (a c) (b a) c = ca cac cba + cbac cab + cbab + cabc cbabc = c (ab ba) 2 (c ), (c a) b c (a b) = ac cac abc + cabc bac + babc + cbac cbabc = (c ) (ab ba) 2 c, and (c b) a c (b a) = ac cac bac + cbac abc + babc + cabc cbabc = (c ) (ab ba) 2 c. It is now clear that the associativity of is equivalent to (ab ba) 2 c = c (ab ba) 2 c = c (ab ba) 2 holding for all a b c in S. But for a b c we also have a (bc cb) 2 = abc + acb abcb acbc = abc + ab ab abc =,
5 272 Cvetko-Vah and similarly: (bc cb) 2 a = b (ac ca) 2 =(ac ca) 2 b =. All possible cases are exhausted. The associativity of is indeed equivalent to (xy yx) 2 z = z (xy yx) 2. Recall that a band S R is called a normal band, ifs satisfies the identity xyzw = xzyw, or the equivalent, but seemingly broader identity, xyzx = xzyx. If S is a normal band which is also a skew lattice, then S is called a normal skew lattice [5]. Corollary3.3. lattice. If S is a pure normal -band in a ring R, then S is a skew Proof. The identity xyzw = xzyw implies that both x (yz zy) 2 and (yz zy) 2 x must reduce to. The conclusion ofcorollary 3.3 holds even ifs is not pure, but in our case this is an immediate consequence oftheorem.. A particular instance of a normal -band is a rectangular band (satisfying xyz = xz ). All rectangular bands are normal. If S is a multiplicative rectangular band in a ring R, then x y = yx, so that S is closed under and thus forms a single component skew lattice. This is not generally true for the quadratic join x y = x+y xy. 4. Distributivityand normality Recall the following definitions from [6]. Definition 4.. A skew lattice S is symmetric iffor any x, y S each of the equalities x y = y x and x y = y x implies the other. Definition 4.2. A skew lattice S is middle distributive ifit satisfies the following distributive laws: x (y z) x =(x y x) (x z x) () and x (y z) x =(x y x) (x z x). (2) Notice that every skew lattice S in a ring R is symmetric. In [] M. Spinks stated his result that in every symmetric skew lattice the middle distributivity laws () and (2) are equivalent. We can say even more if S is a pure skew lattice. Theorem 4.3. Every -band S R satisfies (). If S is also pure, then S also satisfies (2). In particular, every pure skew lattice in a ring is middle distributive.
6 Cvetko-Vah 273 Proof. Since S is a regular band, x (y z) x = x (y + z + zy yzy zyz) x = xyx + xzx + xzxyx xyxzxyx xzxyxzx = (xyx) (xzx), and () follows. In general, for all x, y, z S, x yz x = x+yz yzxyz, while (x y x)(x z x) = (x + y yxy)(x + z zxz) = x + xz xz + yx + yz yzxz yx yxyz + yxyzxz = x + yz yzxz yxyz + yxyzxz. Hence (2) holds precisely when yzxz+yxyz = yzxyz+yxyzxz for all x, y, z S. Applying purity we get: Case, x, y z : yxz + yxyz = yxyz + yxz. Case 2, x, z y : yzxz + yxz = yzxz + yxz. Case 3, y, z x: yz + yz = yz + yz. Hence in all cases, (2) must hold. Corollary4.4. Every -band S R for which is associative is a middle distributive skew lattice. Proof. Since is associative, S is a symmetric skew lattice satisfying (). By Spinks Theorem [], S must satisfy (2). We investigate yet another concept ofdistributivity. We say that a skew lattice S is left meet distributive ifit satisfies the identity (x y) z = xz yz and S is right meet distributive ifit satisfies the identity x (y z) =xy xz. Proposition 4.5. A pure band S is normal if and only if for all a b c in S, abc = ac and cba = ca. Proof. Given a b c, both abca = a = acba and bacb = bab = bcab hold by Proposition 3.. If abc = ac and cba = ca hold, then cabc = cac = cbac follows and S is seen to be normal. Conversely, given cabc = cbac, we obtain both abc = ac and cba = ca by multiplying cabc = cbac by a respectively on the left and on the right and reducing by Proposition 3.. The connection between normality and middle distributivity was established in [5]. For pure -bands we observe the following:
7 274 Cvetko-Vah Theorem 4.6. A pure -band S R satisfies (x y) z = xz yz if and only if cba = ca for all a b c in S. S satisfies x (y z) =xy xz if and only if abc = ac for all a b c in S. Proof. Let a b cin S. We use Propositions 2.4 and 3. to calculate the following: (a b) c = bc + bac babc = ac bc (a c) b = cb = ab cb (b a) c = bc + abc babc = bc ac (b c) a = ca = ba ca (c a) b = cb + ab cab cb ab = cb + ab cbab (c b) a = ca + ba cba ca ba = ba. By examining the two cases where (x y) z = xz yz need not hold, it is clear that the equality holds precisely when cba = ca. The argument that x (y z) =xy xz ifand only ifabc = ac for all a b c in S is similar. Since a band is normal ifand only ifall ofits totally quasiordered sub-bands are normal, we can generalize a known result about skew lattices in rings, and about middle distributive, symmetric skew lattices in general. Corollary4.7. A -band S R is both right and left meet distributive if and only if it is normal. Proof. If S is both left and right meet distributive, then so is every totally quasiordered subalgebra of S. By the theorem, each such subalgebra is normal and hence so is S. Conversely, if S is normal, then Similarly, (a b) c = ac bc. a (b c) = a (b + c + cb bcb cbc) = ab + ac + acb abcb acbc = ab + ac + acab abacab acabac = ab ac. 5. Maximal pure skew lattices of matrices We denote by M n (K) the algebra ofall square matrices ofdimension n over a field K. A skew lattice S M n (K) is called a skew lattice of matrices. By [7] S is triangularizable. We may therefore assume that all matrices in S are upper-triangular with s and s on the diagonal. The components of S are determined by certain patterns ofs on the diagonal. IfS is a pure skew lattice, then the diagonals ofmatrices in S form a totally ordered set, and r (ab) = min {r (a),r(b)} by [2] (r (x) denotes the rank ofa matrix x). Each component of S therefore consists exactly of all matrices in S having equal rank; moreover:
8 Cvetko-Vah 275 Lemma 5.. Let S be a pure band in M n (K). Then x y if and only if r (x) = r (y). Moreover, if S is also a -band, then r (x y) = max {r (x),r(y)}. Proof. Let r (x) r (y). Then r (xy) =r (x), which implies xy x, and therefore x y. Hence x y y y x and r (x y) =r (y x) =r (y). In this section we shall see how Theorem. can be used to produce examples ofpure skew lattices. Every pure skew lattice S is contained in a maximal pure skew lattice S max with respect to inclusion. In fact, if S max is a maximal pure skew lattice, then S S max is a pure skew lattice ifand only if S is closed under both multiplication and. A band S M n (K) is called a unicellular band ifthe invariant subspaces of K n for S form a chain with respect to inclusion. In [2] unicellular bands were introduced and a full atlas of maximal unicellular bands in M 2 (K), M 3 (K) and M 4 (K) up to similarity was listed. We obtain maximal pure bands in M n (K) in a similar way. Doing so, we use the result from [2] that every pure band is similar to a band with the property (S) S, where : S M n (K) denotes a map which maps each matrix s S into its diagonal s s 22 (s) =.... snn It follows from Propositions 3. and 4.5 that every pure band contained in M 2 (K) orm 3 (K) that is closed under yields a skew lattice (since it has at most two nontrivial components). Examples 5.2 and 5.3 give a full atlas of maximal pure skew lattices in M 2 (K) and M 3 (K) up to similarity. All letters denoting entries ofmatrices are arbitrary elements ofk, and so is. Example 5.2. Up to similarity, maximal pure skew lattices in M 2 (K) are: S 2 = S 22 = { (, { (, ) },I, ) },I. Example 5.3. Up to similarity, maximal pure bands in M 3 (K) are: S 3 =, I S 32 =, I
9 276 Cvetko-Vah S 33 =, S 34 =, x xy y S 35 =, S 36 =, S 37 =, S 38 =, x xy y I I I I I I. Bands S 3, S 33, S 34, S 35, S 36 and S 38 yield maximal skew lattices, while S 32 and S 37 contain one maximal pure skew lattice each. Band S 32 contains maximal pure skew lattice S 32 =, which is obtained in the following way. For a = x x 2 b= y I we obtain ab = x y + x 2 and ba = a. Therefore: a b = b + ba bab = b + a ab = x x y y
10 Cvetko-Vah 277 and b a = b. From a b b follows x =, and S 32 is a maximal pure skew lattice. Similarly, band S 37 contains maximal pure skew lattice S 37 =, I. To find maximal pure skew lattices in M 4 (K), we use Theorem.. Example 5.4. We begin in the same way as in the case M 3 (K). Let us take a maximal pure band B =, x xy xy 2 y y 2 u u 2 u v + u 2 v 2 v v 2 I. In order for a band S B to be associative in, we need to prove that for all x xy xy 2 a= y y 2 b= u u 2 u v + u 2 v 2 v v 2 c= w w 2 w 3 the identity c (ab ba) 2 =(ab ba) 2 c holds. We observe cs = s for all s S, and therefore c (ab ba) 2 =(ab ba) 2. We calculate: (ab ba) 2 = (x u )(v + y v 2 y 2 ) and obtain the condition: (x u )(v + y v 2 y 2 )=. Theorem. yields the following candidates for maximal pure skew lattices:
11 278 Cvetko-Vah S =, S 2 = {,a,b,i}, S 3 = {,a,c,i}, S 4 = {,b,c,i}, S 5 =, S 6 =, x xy y u 2 u 2 v 2 v 2 u 2 u 2 v 2 v 2 c,i c,i, c,i It remains to check which ofthese candidates are closed under multiplication and. We leave it to the reader to show that S, S, S 3 and S 4 are indeed skew lattices, while S 5 contains one maximal pure skew lattice, S 5 =, x xy y, and S 6 also contains one maximal pure skew lattice, namely S 6 =, u 2 u 2 v 2 v 2. I I Acknowledgment The author is very grateful to Professors M. Omladič and J. Leech for their suggestions that led to significant improvements and to my communicating editor for his patience and guidance. References [] Cvetko-Vah, K., Skew lattices of matrices in rings, Preprint. [2] Fillmore, P., G. MacDonald, M. Radjabalipour, H. Radjavi, Towards a classification of maximal unicellular bands, Semigroup Forum 49 (994), ,.
12 Cvetko-Vah 279 [3] Higgins, P. M., Techniques ofsemigroup Theory, Oxford University Press, New York, 992. [4] Leech, J., Skew lattices in rings, A. Universalis 26 (989), [5] Leech, J., Normal skew lattices, Semigroup Forum 44 (992), 8. [6] Leech, J., Recent developments in the theory of skew lattices, Semigroup Forum 52 (996), [7] Radjavi, H., P. Rosenthal, Simultaneous Triangularization, Springer, New York, 2. [8] Schein, B. M., Pseudosemilattices and pseudolattices, Amer. Math. Soc. Transl. 9(2) (983), 6. [9] Schweigert, D., Near lattices, Math. Slovaca 32 (982), [] Schweigert, D., Distributive associative near lattices, Math. Slovaca 35 (985), [] Spinks, M., On middle distributivity for skew lattices, Semigroup Forum 6 (2), Department of Mathematics University of Ljubljana Jadranska 9, Ljubljana, Slovenia karin.cvetko@fmf.uni-lj.si Received April 4, 23 and in final form August 9, 23 Online publication January 2, 24
Skew lattices of matrices in rings
Algebra univers. 53 (2005) 471 479 0002-5240/05/040471 09 DOI 10.1007/s00012-005-1913-5 c Birkhäuser Verlag, Basel, 2005 Algebra Universalis Skew lattices of matrices in rings Karin Cvetko-Vah Abstract.
More informationCATEGORICAL SKEW LATTICES
CATEGORICAL SKEW LATTICES MICHAEL KINYON AND JONATHAN LEECH Abstract. Categorical skew lattices are a variety of skew lattices on which the natural partial order is especially well behaved. While most
More informationALGEBRAIC EXPRESSIONS AND IDENTITIES
9 ALGEBRAIC EXPRESSIONS AND IDENTITIES Exercise 9.1 Q.1. Identify the terms, their coefficients for each of the following expressions. (i) 5xyz 3zy (ii) 1 + x + x (iii) 4x y 4x y z + z (iv) 3 pq + qr rp
More informationCONGRUENCES AND IDEALS IN A DISTRIBUTIVE LATTICE WITH RESPECT TO A DERIVATION
Bulletin of the Section of Logic Volume 42:1/2 (2013), pp. 1 10 M. Sambasiva Rao CONGRUENCES AND IDEALS IN A DISTRIBUTIVE LATTICE WITH RESPECT TO A DERIVATION Abstract Two types of congruences are introduced
More informationSection 5.6 Factoring Strategies
Section 5.6 Factoring Strategies INTRODUCTION Let s review what you should know about factoring. (1) Factors imply multiplication Whenever we refer to factors, we are either directly or indirectly referring
More informationSEMICENTRAL IDEMPOTENTS IN A RING
J. Korean Math. Soc. 51 (2014), No. 3, pp. 463 472 http://dx.doi.org/10.4134/jkms.2014.51.3.463 SEMICENTRAL IDEMPOTENTS IN A RING Juncheol Han, Yang Lee, and Sangwon Park Abstract. Let R be a ring with
More informationName. 5. Simplify. a) (6x)(2x 2 ) b) (5pq 2 )( 4p 2 q 2 ) c) (3ab)( 2ab 2 )(2a 3 ) d) ( 6x 2 yz)( 5y 3 z)
3.1 Polynomials MATHPOWER TM 10, Ontario Edition, pp. 128 133 To add polynomials, collect like terms. To subtract a polynomial, add its opposite. To multiply monomials, multiply the numerical coefficients.
More information127. On the B.covers in Lattices. (ac)(bc)=c--c(ab) (ac)(bc)--c--c,--(ab) (a(bc)),--(bc)-c. (G**) (M)
No. 8] 549 127. On the B.covers in Lattices By Yataro MATSUSHIMA Gumma University, Maebashi (Comm. by K. KUNUGI, M.J.A., Oct. 12, 1956) Let L be a lattice. For any two elements a and b of L we shall define
More informationDownloaded from
9. Algebraic Expressions and Identities Q 1 Using identity (x - a) (x + a) = x 2 a 2 find 6 2 5 2. Q 2 Find the product of (7x 4y) and (3x - 7y). Q 3 Using suitable identity find (a + 3)(a + 2). Q 4 Using
More informationORDERED SEMIGROUPS HAVING THE P -PROPERTY. Niovi Kehayopulu, Michael Tsingelis
ORDERED SEMIGROUPS HAVING THE P -PROPERTY Niovi Kehayopulu, Michael Tsingelis ABSTRACT. The main results of the paper are the following: The ordered semigroups which have the P -property are decomposable
More informationOrdered Semigroups in which the Left Ideals are Intra-Regular Semigroups
International Journal of Algebra, Vol. 5, 2011, no. 31, 1533-1541 Ordered Semigroups in which the Left Ideals are Intra-Regular Semigroups Niovi Kehayopulu University of Athens Department of Mathematics
More informationMultiply the binomials. Add the middle terms. 2x 2 7x 6. Rewrite the middle term as 2x 2 a sum or difference of terms. 12x 321x 22
Section 5.5 Factoring Trinomials 349 Factoring Trinomials 1. Factoring Trinomials: AC-Method In Section 5.4, we learned how to factor out the greatest common factor from a polynomial and how to factor
More informationChapter 5 Self-Assessment
Chapter 5 Self-Assessment. BLM 5 1 Concept BEFORE DURING (What I can do) AFTER (Proof that I can do this) 5.1 I can multiply binomials. I can multiply trinomials. I can explain how multiplication of binomials
More informationSpecial Binomial Products
Lesson 11-6 Lesson 11-6 Special Binomial Products Vocabulary perfect square trinomials difference of squares BIG IDEA The square of a binomial a + b is the expression (a + b) 2 and can be found by multiplying
More informationMETRIC POSTULATES FOR MODULAR, DISTRIBUTIVE, AND BOOLEAN LATTICES
Bulletin of the Section of Logic Volume 8/4 (1979), pp. 191 195 reedition 2010 [original edition, pp. 191 196] David Miller METRIC POSTULATES FOR MODULAR, DISTRIBUTIVE, AND BOOLEAN LATTICES This is an
More informationThe finite lattice representation problem and intervals in subgroup lattices of finite groups
The finite lattice representation problem and intervals in subgroup lattices of finite groups William DeMeo Math 613: Group Theory 15 December 2009 Abstract A well-known result of universal algebra states:
More informationON THE LATTICE OF ORTHOMODULAR LOGICS
Jacek Malinowski ON THE LATTICE OF ORTHOMODULAR LOGICS Abstract The upper part of the lattice of orthomodular logics is described. In [1] and [2] Bruns and Kalmbach have described the lower part of the
More informationThe illustrated zoo of order-preserving functions
The illustrated zoo of order-preserving functions David Wilding, February 2013 http://dpw.me/mathematics/ Posets (partially ordered sets) underlie much of mathematics, but we often don t give them a second
More informationCompositional Models in Valuation-Based Systems
Appeared in: Belief Functions: Theory and Applications, T. Denoeux and M.-H. Masson (eds.), Advances in Intelligent and Soft Computing 164, 2012, pp. 221--228, Springer-Verlag, Berlin. Compositional Models
More informationMath 101, Basic Algebra Author: Debra Griffin
Math 101, Basic Algebra Author: Debra Griffin Name Chapter 5 Factoring 5.1 Greatest Common Factor 2 GCF, factoring GCF, factoring common binomial factor 5.2 Factor by Grouping 5 5.3 Factoring Trinomials
More informationTranslates of (Anti) Fuzzy Submodules
International Journal of Engineering Research and Development e-issn: 2278-067X, p-issn : 2278-800X, www.ijerd.com Volume 5, Issue 2 (December 2012), PP. 27-31 P.K. Sharma Post Graduate Department of Mathematics,
More informationMath 167: Mathematical Game Theory Instructor: Alpár R. Mészáros
Math 167: Mathematical Game Theory Instructor: Alpár R. Mészáros Midterm #1, February 3, 2017 Name (use a pen): Student ID (use a pen): Signature (use a pen): Rules: Duration of the exam: 50 minutes. By
More informationWe begin, however, with the concept of prime factorization. Example: Determine the prime factorization of 12.
Chapter 3: Factors and Products 3.1 Factors and Multiples of Whole Numbers In this chapter we will look at the topic of factors and products. In previous years, we examined these with only numbers, whereas
More informationSection R.4 Review of Factoring. Factoring Out the Greatest Common Factor
1 Section R.4 Review of Factoring Objective #1: Factoring Out the Greatest Common Factor The Greatest Common Factor (GCF) is the largest factor that can divide into the terms of an expression evenly with
More information-5y 4 10y 3 7y 2 y 5: where y = -3-5(-3) 4 10(-3) 3 7(-3) 2 (-3) 5: Simplify -5(81) 10(-27) 7(9) (-3) 5: Evaluate = -200
Polynomials: Objective Evaluate, add, subtract, multiply, and divide polynomials Definition: A Term is numbers or a product of numbers and/or variables. For example, 5x, 2y 2, -8, ab 4 c 2, etc. are all
More informationMultiplying Polynomials
14 Multiplying Polynomials This chapter will present problems for you to solve in the multiplication of polynomials. Specifically, you will practice solving problems multiplying a monomial (one term) and
More informationYao s Minimax Principle
Complexity of algorithms The complexity of an algorithm is usually measured with respect to the size of the input, where size may for example refer to the length of a binary word describing the input,
More informationREMARKS ON K3 SURFACES WITH NON-SYMPLECTIC AUTOMORPHISMS OF ORDER 7
REMARKS ON K3 SURFACES WTH NON-SYMPLECTC AUTOMORPHSMS OF ORDER 7 SHNGO TAK Abstract. n this note, we treat a pair of a K3 surface and a non-symplectic automorphism of order 7m (m = 1, 3 and 6) on it. We
More informationAn Optimal Odd Unimodular Lattice in Dimension 72
An Optimal Odd Unimodular Lattice in Dimension 72 Masaaki Harada and Tsuyoshi Miezaki September 27, 2011 Abstract It is shown that if there is an extremal even unimodular lattice in dimension 72, then
More informationTheorem 1.3. Every finite lattice has a congruence-preserving embedding to a finite atomistic lattice.
CONGRUENCE-PRESERVING EXTENSIONS OF FINITE LATTICES TO SEMIMODULAR LATTICES G. GRÄTZER AND E.T. SCHMIDT Abstract. We prove that every finite lattice hasa congruence-preserving extension to a finite semimodular
More informationMATD 0370 ELEMENTARY ALGEBRA REVIEW FOR TEST 3 (New Material From: , , and 10.1)
NOTE: In addition to the problems below, please study the handout Exercise Set 10.1 posted at http://www.austin.cc.tx.us/jbickham/handouts. 1. Simplify: 5 7 5. Simplify: ( 6ab 5 c )( a c 5 ). Simplify:
More informationDeterminants II Linear Algebra, Fall 2008
Determinants II Linear Algebra, Fall 2008 1 Basic Properties of Determinants Here are the basic properties of determinants which you proved in the exercises to the previous handout Theorem 1 Let A be an
More informationSection R.5 Review of Factoring. Factoring Out the Greatest Common Factor
1 Section R.5 Review of Factoring Objective #1: Factoring Out the Greatest Common Factor The Greatest Common Factor (GCF) is the largest factor that can divide into the terms of an expression evenly with
More informationQuadrant marked mesh patterns in 123-avoiding permutations
Quadrant marked mesh patterns in 23-avoiding permutations Dun Qiu Department of Mathematics University of California, San Diego La Jolla, CA 92093-02. USA duqiu@math.ucsd.edu Jeffrey Remmel Department
More informationBinomial Coefficient
Binomial Coefficient This short text is a set of notes about the binomial coefficients, which link together algebra, combinatorics, sets, binary numbers and probability. The Product Rule Suppose you are
More informationPURITY IN IDEAL LATTICES. Abstract.
ANALELE ŞTIINŢIFICE ALE UNIVERSITĂŢII AL.I.CUZA IAŞI Tomul XLV, s.i a, Matematică, 1999, f.1. PURITY IN IDEAL LATTICES BY GRIGORE CĂLUGĂREANU Abstract. In [4] T. HEAD gave a general definition of purity
More informationA NEW NOTION OF TRANSITIVE RELATIVE RETURN RATE AND ITS APPLICATIONS USING STOCHASTIC DIFFERENTIAL EQUATIONS. Burhaneddin İZGİ
A NEW NOTION OF TRANSITIVE RELATIVE RETURN RATE AND ITS APPLICATIONS USING STOCHASTIC DIFFERENTIAL EQUATIONS Burhaneddin İZGİ Department of Mathematics, Istanbul Technical University, Istanbul, Turkey
More informationOn the h-vector of a Lattice Path Matroid
On the h-vector of a Lattice Path Matroid Jay Schweig Department of Mathematics University of Kansas Lawrence, KS 66044 jschweig@math.ku.edu Submitted: Sep 16, 2009; Accepted: Dec 18, 2009; Published:
More informationMath 135: Answers to Practice Problems
Math 35: Answers to Practice Problems Answers to problems from the textbook: Many of the problems from the textbook have answers in the back of the book. Here are the answers to the problems that don t
More informationGödel algebras free over finite distributive lattices
TANCL, Oxford, August 4-9, 2007 1 Gödel algebras free over finite distributive lattices Stefano Aguzzoli Brunella Gerla Vincenzo Marra D.S.I. D.I.COM. D.I.C.O. University of Milano University of Insubria
More informationDevelopmental Math An Open Program Unit 12 Factoring First Edition
Developmental Math An Open Program Unit 12 Factoring First Edition Lesson 1 Introduction to Factoring TOPICS 12.1.1 Greatest Common Factor 1 Find the greatest common factor (GCF) of monomials. 2 Factor
More informationApplied Mathematics Letters
Applied Mathematics Letters 23 (2010) 286 290 Contents lists available at ScienceDirect Applied Mathematics Letters journal homepage: wwwelseviercom/locate/aml The number of spanning trees of a graph Jianxi
More informationTHE NUMBER OF UNARY CLONES CONTAINING THE PERMUTATIONS ON AN INFINITE SET
THE NUMBER OF UNARY CLONES CONTAINING THE PERMUTATIONS ON AN INFINITE SET MICHAEL PINSKER Abstract. We calculate the number of unary clones (submonoids of the full transformation monoid) containing the
More informationarxiv: v1 [math.lo] 24 Feb 2014
Residuated Basic Logic II. Interpolation, Decidability and Embedding Minghui Ma 1 and Zhe Lin 2 arxiv:1404.7401v1 [math.lo] 24 Feb 2014 1 Institute for Logic and Intelligence, Southwest University, Beibei
More informationCONSTRUCTION OF CODES BY LATTICE VALUED FUZZY SETS. 1. Introduction. Novi Sad J. Math. Vol. 35, No. 2, 2005,
Novi Sad J. Math. Vol. 35, No. 2, 2005, 155-160 CONSTRUCTION OF CODES BY LATTICE VALUED FUZZY SETS Mališa Žižović 1, Vera Lazarević 2 Abstract. To every finite lattice L, one can associate a binary blockcode,
More informationOn Toponogov s Theorem
On Toponogov s Theorem Viktor Schroeder 1 Trigonometry of constant curvature spaces Let κ R be given. Let M κ be the twodimensional simply connected standard space of constant curvature κ. Thus M κ is
More informationMath1090 Midterm 2 Review Sections , Solve the system of linear equations using Gauss-Jordan elimination.
Math1090 Midterm 2 Review Sections 2.1-2.5, 3.1-3.3 1. Solve the system of linear equations using Gauss-Jordan elimination. 5x+20y 15z = 155 (a) 2x 7y+13z=85 3x+14y +6z= 43 x+z= 2 (b) x= 6 y+z=11 x y+
More informationDouble Ore Extensions versus Iterated Ore Extensions
Double Ore Extensions versus Iterated Ore Extensions Paula A. A. B. Carvalho, Samuel A. Lopes and Jerzy Matczuk Departamento de Matemática Pura Faculdade de Ciências da Universidade do Porto R.Campo Alegre
More informationLaurence Boxer and Ismet KARACA
SOME PROPERTIES OF DIGITAL COVERING SPACES Laurence Boxer and Ismet KARACA Abstract. In this paper we study digital versions of some properties of covering spaces from algebraic topology. We correct and
More information2.07 Factoring by Grouping/ Difference and Sum of Cubes
2.07 Factoring by Grouping/ Difference and Sum of Cubes Dr. Robert J. Rapalje, Retired Central Florida, USA This lesson introduces the technique of factoring by grouping, as well as factoring the sum and
More informationa*(variable) 2 + b*(variable) + c
CH. 8. Factoring polynomials of the form: a*(variable) + b*(variable) + c Factor: 6x + 11x + 4 STEP 1: Is there a GCF of all terms? NO STEP : How many terms are there? Is it of degree? YES * Is it in the
More informationGUESSING MODELS IMPLY THE SINGULAR CARDINAL HYPOTHESIS arxiv: v1 [math.lo] 25 Mar 2019
GUESSING MODELS IMPLY THE SINGULAR CARDINAL HYPOTHESIS arxiv:1903.10476v1 [math.lo] 25 Mar 2019 Abstract. In this article we prove three main theorems: (1) guessing models are internally unbounded, (2)
More informationFair semigroups. Valdis Laan. University of Tartu, Estonia. (Joint research with László Márki) 1/19
Fair semigroups Valdis Laan University of Tartu, Estonia (Joint research with László Márki) 1/19 A semigroup S is called factorisable if ( s S)( x, y S) s = xy. 2/19 A semigroup S is called factorisable
More informationA Property Equivalent to n-permutability for Infinite Groups
Journal of Algebra 221, 570 578 (1999) Article ID jabr.1999.7996, available online at http://www.idealibrary.com on A Property Equivalent to n-permutability for Infinite Groups Alireza Abdollahi* and Aliakbar
More informationA NOTE ON A SQUARE-ROOT RULE FOR REINSURANCE. Michael R. Powers and Martin Shubik. June 2005 COWLES FOUNDATION DISCUSSION PAPER NO.
A NOTE ON A SQUARE-ROOT RULE FOR REINSURANCE By Michael R. Powers and Martin Shubik June 2005 COWLES FOUNDATION DISCUSSION PAPER NO. 1521 COWLES FOUNDATION FOR RESEARCH IN ECONOMICS YALE UNIVERSITY Box
More information0.1 Equivalence between Natural Deduction and Axiomatic Systems
0.1 Equivalence between Natural Deduction and Axiomatic Systems Theorem 0.1.1. Γ ND P iff Γ AS P ( ) it is enough to prove that all axioms are theorems in ND, as MP corresponds to ( e). ( ) by induction
More informationMAT 4250: Lecture 1 Eric Chung
1 MAT 4250: Lecture 1 Eric Chung 2Chapter 1: Impartial Combinatorial Games 3 Combinatorial games Combinatorial games are two-person games with perfect information and no chance moves, and with a win-or-lose
More informationMultiplication of Polynomials
Multiplication of Polynomials In multiplying polynomials, we need to consider the following cases: Case 1: Monomial times Polynomial In this case, you can use the distributive property and laws of exponents
More informationGame Theory. Lecture Notes By Y. Narahari. Department of Computer Science and Automation Indian Institute of Science Bangalore, India August 2012
Game Theory Lecture Notes By Y. Narahari Department of Computer Science and Automation Indian Institute of Science Bangalore, India August 01 Chapter 5: Pure Strategy Nash Equilibrium Note: This is a only
More informationACCUPLACER Elementary Algebra Assessment Preparation Guide
ACCUPLACER Elementary Algebra Assessment Preparation Guide Please note that the guide is for reference only and that it does not represent an exact match with the assessment content. The Assessment Centre
More informationBest-Reply Sets. Jonathan Weinstein Washington University in St. Louis. This version: May 2015
Best-Reply Sets Jonathan Weinstein Washington University in St. Louis This version: May 2015 Introduction The best-reply correspondence of a game the mapping from beliefs over one s opponents actions to
More informationSpecial M-Hyperidentities in Triregular Leftmost without Loop and Reverse Arc Graph Varieties of Type (2,0)
International Mathematical Forum, Vol. 7, 2012, no. 39, 1925-1940 Special M-Hyperidentities in Triregular Leftmost without Loop and Reverse Arc Graph Varieties of Type (2,0) Apinant Anantpinitwatna and
More information3.1 Properties of Binomial Coefficients
3 Properties of Binomial Coefficients 31 Properties of Binomial Coefficients Here is the famous recursive formula for binomial coefficients Lemma 31 For 1 < n, 1 1 ( n 1 ) This equation can be proven by
More informationNotes on the symmetric group
Notes on the symmetric group 1 Computations in the symmetric group Recall that, given a set X, the set S X of all bijections from X to itself (or, more briefly, permutations of X) is group under function
More information4: SINGLE-PERIOD MARKET MODELS
4: SINGLE-PERIOD MARKET MODELS Marek Rutkowski School of Mathematics and Statistics University of Sydney Semester 2, 2016 M. Rutkowski (USydney) Slides 4: Single-Period Market Models 1 / 87 General Single-Period
More informationLATTICE LAWS FORCING DISTRIBUTIVITY UNDER UNIQUE COMPLEMENTATION
LATTICE LAWS FORCING DISTRIBUTIVITY UNDER UNIQUE COMPLEMENTATION R. PADMANABHAN, W. MCCUNE, AND R. VEROFF Abstract. We give several new lattice identities valid in nonmodular lattices such that a uniquely
More informationTHE UNIVERSITY OF AKRON Mathematics and Computer Science
Lesson 5: Expansion THE UNIVERSITY OF AKRON Mathematics and Computer Science Directory Table of Contents Begin Lesson 5 IamDPS N Z Q R C a 3 a 4 = a 7 (ab) 10 = a 10 b 10 (ab (3ab 4))=2ab 4 (ab) 3 (a 1
More informationCHARACTERIZATION OF CLOSED CONVEX SUBSETS OF R n
CHARACTERIZATION OF CLOSED CONVEX SUBSETS OF R n Chebyshev Sets A subset S of a metric space X is said to be a Chebyshev set if, for every x 2 X; there is a unique point in S that is closest to x: Put
More informationNOTES ON (T, S)-INTUITIONISTIC FUZZY SUBHEMIRINGS OF A HEMIRING
NOTES ON (T, S)-INTUITIONISTIC FUZZY SUBHEMIRINGS OF A HEMIRING K.Umadevi 1, V.Gopalakrishnan 2 1Assistant Professor,Department of Mathematics,Noorul Islam University,Kumaracoil,Tamilnadu,India 2Research
More informationHyperidentities in (xx)y xy Graph Algebras of Type (2,0)
Int. Journal of Math. Analysis, Vol. 8, 2014, no. 9, 415-426 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ijma.2014.312299 Hyperidentities in (xx)y xy Graph Algebras of Type (2,0) W. Puninagool
More informationINTERVAL DISMANTLABLE LATTICES
INTERVAL DISMANTLABLE LATTICES KIRA ADARICHEVA, JENNIFER HYNDMAN, STEFFEN LEMPP, AND J. B. NATION Abstract. A finite lattice is interval dismantlable if it can be partitioned into an ideal and a filter,
More informationLattice Laws Forcing Distributivity Under Unique Complementation
Lattice Laws Forcing Distributivity Under Unique Complementation R. Padmanabhan Department of Mathematics University of Manitoba Winnipeg, Manitoba R3T 2N2 Canada W. McCune Mathematics and Computer Science
More informationSect General Factoring Summary
111 Concept #1 Sect 6.6 - General Factoring Summary Factoring Strategy The flow chart on the previous page gives us a visual picture of how to attack a factoring problem. We first start at the top and
More informationTranscendental lattices of complex algebraic surfaces
Transcendental lattices of complex algebraic surfaces Ichiro Shimada Hiroshima University November 25, 2009, Tohoku 1 / 27 Introduction Let Aut(C) be the automorphism group of the complex number field
More informationOptimal Voting Rules. Alexander Scheer. November 14, 2012
Optimal Voting Rules Alexander Scheer November 14, 2012 1 Introduction What we have seen in the last weeks: Borda's Count Condorcet's Paradox 2 Introduction What we have seen in the last weeks: Independence
More informationLECTURE 3: FREE CENTRAL LIMIT THEOREM AND FREE CUMULANTS
LECTURE 3: FREE CENTRAL LIMIT THEOREM AND FREE CUMULANTS Recall from Lecture 2 that if (A, φ) is a non-commutative probability space and A 1,..., A n are subalgebras of A which are free with respect to
More informationThe two meanings of Factor
Name Lesson #3 Date: Factoring Polynomials Using Common Factors Common Core Algebra 1 Factoring expressions is one of the gateway skills necessary for much of what we do in algebra for the rest of the
More informationHomomorphism and Cartesian Product of. Fuzzy PS Algebras
Applied Mathematical Sciences, Vol. 8, 2014, no. 67, 3321-3330 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2014.44265 Homomorphism and Cartesian Product of Fuzzy PS Algebras T. Priya Department
More informationFuzzy L-Quotient Ideals
International Journal of Fuzzy Mathematics and Systems. ISSN 2248-9940 Volume 3, Number 3 (2013), pp. 179-187 Research India Publications http://www.ripublication.com Fuzzy L-Quotient Ideals M. Mullai
More informationSome Remarks on Finitely Quasi-injective Modules
EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS Vol. 6, No. 2, 2013, 119-125 ISSN 1307-5543 www.ejpam.com Some Remarks on Finitely Quasi-injective Modules Zhu Zhanmin Department of Mathematics, Jiaxing
More informationEquilibrium payoffs in finite games
Equilibrium payoffs in finite games Ehud Lehrer, Eilon Solan, Yannick Viossat To cite this version: Ehud Lehrer, Eilon Solan, Yannick Viossat. Equilibrium payoffs in finite games. Journal of Mathematical
More informationGame Theory. Lecture Notes By Y. Narahari. Department of Computer Science and Automation Indian Institute of Science Bangalore, India August 2012
Game Theory Lecture Notes By Y. Narahari Department of Computer Science and Automation Indian Institute of Science Bangalore, India August 2012 Chapter 6: Mixed Strategies and Mixed Strategy Nash Equilibrium
More informationFUZZY PRIME L-FILTERS
International Journal of Applied Mathematical Sciences ISSN 0973-0176 Volume 9, Number 1 (2016), pp. 37-44 Research India Publications http://www.ripublication.com FUZZY PRIME L-FILTERS M. Mullai Assistant
More informationFactors of 10 = = 2 5 Possible pairs of factors:
Factoring Trinomials Worksheet #1 1. b 2 + 8b + 7 Signs inside the two binomials are identical and positive. Factors of b 2 = b b Factors of 7 = 1 7 b 2 + 8b + 7 = (b + 1)(b + 7) 2. n 2 11n + 10 Signs
More informationUnit: Polynomials and Factoring
Unit: Polynomials: Multiplying and Factoring Name Dates Taught Specific Outcome 10I.A.1 Demonstrate an understanding of factors of whole numbers by determining: Prime factors Greatest common factor Least
More informationSection 7.4 Additional Factoring Techniques
Section 7.4 Additional Factoring Techniques Objectives In this section, you will learn to: To successfully complete this section, you need to understand: Factor trinomials when a = 1. Multiplying binomials
More informationEssays on Some Combinatorial Optimization Problems with Interval Data
Essays on Some Combinatorial Optimization Problems with Interval Data a thesis submitted to the department of industrial engineering and the institute of engineering and sciences of bilkent university
More informationIntroduction to Priestley duality 1 / 24
Introduction to Priestley duality 1 / 24 2 / 24 Outline What is a distributive lattice? Priestley duality for finite distributive lattices Using the duality: an example Priestley duality for infinite distributive
More informationAlgebra homework 8 Homomorphisms, isomorphisms
MATH-UA.343.005 T.A. Louis Guigo Algebra homework 8 Homomorphisms, isomorphisms For every n 1 we denote by S n the n-th symmetric group. Exercise 1. Consider the following permutations: ( ) ( 1 2 3 4 5
More informationCartesian Product of Two S-Valued Graphs
Global Journal of Mathematical Sciences: Theory and Practical. ISSN 0974-3200 Volume 9, Number 3 (2017), pp. 347-355 International Research Publication House http://www.irphouse.com Cartesian Product of
More informationCollinear Triple Hypergraphs and the Finite Plane Kakeya Problem
Collinear Triple Hypergraphs and the Finite Plane Kakeya Problem Joshua Cooper August 14, 006 Abstract We show that the problem of counting collinear points in a permutation (previously considered by the
More informationExercises. 140 Chapter 3: Factors and Products
Exercises A 3. List the first 6 multiples of each number. a) 6 b) 13 c) 22 d) 31 e) 45 f) 27 4. List the prime factors of each number. a) 40 b) 75 c) 81 d) 120 e) 140 f) 192 5. Write each number as a product
More informationLog-linear Dynamics and Local Potential
Log-linear Dynamics and Local Potential Daijiro Okada and Olivier Tercieux [This version: November 28, 2008] Abstract We show that local potential maximizer ([15]) with constant weights is stochastically
More information4x + 5y 5 If x = 0 find the value of: (substitute) 13 (x 2)(x + 5) Solve (using guess and check) 14
Algebra Skills MCAT preparation # DO NOT USE A CALCULATOR 0z yz (x y) Expand -x(ax b) (a b) (a b) (a b)(a b) (a b) x y + abc ab c a bc x + x + 0 x x x = 0 and y = - find the value of: x y x = and y = -
More information5.6 Special Products of Polynomials
5.6 Special Products of Polynomials Learning Objectives Find the square of a binomial Find the product of binomials using sum and difference formula Solve problems using special products of polynomials
More informationIn this section we revisit two special product forms that we learned in Chapter 5, the first of which was squaring a binomial.
5B. SPECIAL PRODUCTS 11 5b Special Products Special Forms In this section we revisit two special product forms that we learned in Chapter 5, the first of which was squaring a binomial. Squaring a binomial.
More information7.1 Review for Mastery
7.1 Review for Mastery Factors and Greatest Common Factors A prime number has exactly two factors, itself and 1. The number 1 is not a prime number. To write the prime factorization of a number, factor
More informationChapter 6: Quadratic Functions & Their Algebra
Chapter 6: Quadratic Functions & Their Algebra Topics: 1. Quadratic Function Review. Factoring: With Greatest Common Factor & Difference of Two Squares 3. Factoring: Trinomials 4. Complete Factoring 5.
More informationTERMINOLOGY 4.1. READING ASSIGNMENT 4.2 Sections 5.4, 6.1 through 6.5. Binomial. Factor (verb) GCF. Monomial. Polynomial.
Section 4. Factoring Polynomials TERMINOLOGY 4.1 Prerequisite Terms: Binomial Factor (verb) GCF Monomial Polynomial Trinomial READING ASSIGNMENT 4. Sections 5.4, 6.1 through 6.5 160 READING AND SELF-DISCOVERY
More informationMATD 0370 ELEMENTARY ALGEBRA REVIEW FOR TEST 3 (New Material From: , , and 10.1)
NOTE: In addition to the problems below, please study the handout Exercise Set 10.1 posted at http://www.austincc.edu/jbickham/handouts. 1. Simplify: 5 7 5. Simplify: ( ab 5 c )( a c 5 ). Simplify: 4x
More information