Rota-Baxter Type Operators, Rewriting Systems, and Gröbner-Shirshov Bases, Part II
|
|
- Stewart Elliott
- 5 years ago
- Views:
Transcription
1 Rota-Baxter Type Operators, Rewriting Systems, and Gröbner-Shirshov Bases, Part II William Sit 1 The City College of The City University of New York Kolchin Seminar in Differential Algebra December 9, 2016 (Graduate Center, CUNY) 1 Joint work with Shanghua Zheng, Xing Gao and Li Guo
2 Part II Outline (Review) TRS Defined by Certain Operated Polynomials Rota-Baxter Type Identities and Conjecture Main Theorems on RBT OPI Characterization Theorems of RBT OPI Monomial Orders on Operated Monomials TRS in Free Operated Algebras Defined by Subsets Compatibility of Monomial Order and Rewriting Systems Tools to Prove Termination Restriction and a Lemma on Confluence Gröbner-Shirshov Basis Composition Diamond Lemma Construction of Free RBT OPI-Algebras Construction of Monomial Order for a RBT OPI Equivalences for Compatibility with db,z Recap of Main Theorems and Further Discussions
3 TRS Defined by Certain Operated Polynomials Let ϕ(x, y) k x, y be an operated polynomial of the form x y B(x, y), where B(x, y) k x, y. The rewriting system Π ϕ (Z) defined by ϕ on k Z with basis M(Z) is the relation Π ϕ (Z) := { (q u v, q B(u,v) ) q M (Z), u, v M(Z) } We write ϕ instead of Πϕ(Z) when Z is fixed. Proposition: Π ϕ (Z) is simple. f ϕ g if for some u, v M(Z), g is obtained from f by replacing exactly once a subword u v in one monomial w Supp(f ) by B(u, v). A bracketed polynomial g k Z is said to be a normal ϕ-form for f if g is in RBNF and f ϕ g.
4 Totally Linear Expressions For ϕ = x y B(x, y) to be of a linear operator, we need to put some conditions on B(x, y). An expression B k X is totally linear in X if every variables x X, when counted with multiplicity in repeated multiplications, appears exactly once in every monomial w Supp(B). Examples: Let X = {x, y}. The expression x y + x y + xy is totally linear in X, but the monomials x (missing y), x 2 y and x y 2 are not.q
5 Rota-Baxter Type OPI, Operators, and Algebras An OPI ϕ k x, y is of Rota-Baxter type if ϕ has the form x y B(x, y) for some B(x, y) k x, y and if: (a) : B(x, y) is totally linear in x, y; (b) : B(x, y) is in RBNF; (c) : for every well-ordered set Z, the rewriting system Π ϕ (Z) defined by ϕ is terminating; (d) : for every well-ordered set Z, the expression B(B(u, v), w) B(u, B(v, w)) is ϕ-reducible to zero for all u, v, w M(Z). If ϕ := x y B(x, y) is of Rota-Baxter type, then we say the defining operator P = of a ϕ-algebra R, and (by abuse) the expression B(x, y), are of Rota-Baxter type. By a Rota-Baxter type algebra, we mean some ϕ-algebra R where ϕ is some OPI in k x, y of Rota-Baxter type.
6 Examples Let B(x, y) := x y. Then ϕ = 0 is the OPI defining the average operator and it is of Rota-Baxter type. The identity defining a Rota-Baxter operator and that defining a Nijenhuis operator are OPIs of Rota-Baxter type. The expression B(x, y) := y x is not of Rota-Baxter type. This is because in k u, v, w, the operated monomial B(B(u, v), w) = w B(u, v) = w v u is in RBNF, while B(u, B(v, w)) = B(v, w) u = w v u ϕ w u v is also in RBNF and the two operated monomials are not ϕ-joinable. By the Hierarchy Lemma, B(B(u, v), w) B(u, B(v, w)) ϕ 0. This also shows the base fork ( u v w ϕ B(u, v) w, u v w ϕ u B(v, w) ) is not ϕ-joinable, and the TRS Π ϕ (u, v, w) is not confluent.
7 Remarks on Definition of Rota-Baxter Type OPIs The well-order on Z need not be given if Z is denumerable or if Z is uncountable and we accept the Axiom of Choice. Total linearity on B(x, y) is imposed since we are considering linear operators. B(x, y) in RBNF and Π ϕ (Z) terminating are necessary to avoid obvious infinite rewriting under Π ϕ (Z). This rules out the Reynolds identity: x y = x y + x y + x y. ϕ-reduction to zero of B(B(u, v), w) B(u, B(v, w)) for all u, v, w M(Z) is to ensure Π ϕ (Z) is confluent. Note that in the definition for ϕ to be of Rota-Baxter type, there is no mention of monomial orders on M(Z) and hence no requirement of compatibility.
8 List of Rota-Baxter Type Operators Conjecture: For any c, λ k, the operated polynomial ϕ := x y B(x, y), where B(x, y) is taken from the list below, is of Rota-Baxter type. Moreover, any OPI ϕ of Rota-Baxter type is necessarily defined as above by a B(x, y) from among this list. (a) : x y (average) (b) : x y (inverse average) (c) : x y + y x, (symmetric average) (d) : x y + y x, (symmetric inverse average) (e) : x y + x y xy (Nijenhuis) (f ) : x y + x y + λxy (Rota-Baxter) (g) : x y x 1 y + λxy, (average TD) (h) : x y x 1 y + λxy, (inverse average TD)
9 List continued (i) : x y + x y x 1 y + λxy (TD) (j) : x y + x y x 1 y xy 1 + λxy, (right TD) (k) : x y + x y x 1 y xy + λxy, (Nijenhuis TD) (l) : x y + x y x 1 y 1 xy + λxy, (left TD) (m) : cx 1 y + λxy (generalized endomorphism) (n) : cy 1 x + λyx (generalized antimorphism) A new type is underlined followed by a proposed name. When λ is present, of weight λ should be added.
10 Main Result on RBT OPI, Sufficiency Theorem. Let k be a field. Let ϕ := x y B(x, y) k x, y, where B(x, y) is in the list in the Conjecture. Then for every well-ordered set (Z, Z ), the following statements hold : 1. The operated polynomial ϕ is of Rota-Baxter type. 2. Z can be extended to the monomial order db,z on M(Z) with which ϕ compatible. 3. The rewriting system Π ϕ (Z) on k Z is convergent. 4. The set S ϕ (Z) is a Gröbner-Shirshov basis in k Z with respect to the monomial order db,z. 5. There is a (uniform) construction of the free ϕ-algebra over Z, which is (k R(Z),, P r ). Moreover, the constructions of Π ϕ (Z), db,z, S ϕ (Z) and (k R(Z),, P r ) are uniformly defined.
11 Main Result on RBT OPI: Necessity Theorem. Let k be a field. Let ϕ := x y B(x, y). Then ϕ is of Rota-Baxter type and is compatible with db.z on M(Z) for some well-ordered set Z (possibly the empty set) if and only if B(x, y) is among the list given in Conjecture. When Z is the empty set, M(Z) is the free operated monoid M(1) on 1 where 1 is the monoid identity element and M(1) contains (not consists of) monomials of the form M = n i=1 Pe i (1) and P(P i (1)) = P i+1 (1). It also contains P(M). Remark. Recall that in the definition for ϕ to be of Rota-Baxter type, there is no mention of monomial orders on M(Z) and hence no requirement of compatibility. So, there might be some ϕ of Rota-Baxter type (as we define it) that is not on the list.
12 A Local Characterization Theorem Theorem: Let k be a field. Let Z be a set, let Z be a monomial order on M(Z), let B(x, y) be in RBNF and totally linear in x, y, and let ϕ(x, y) := x y B(x, y) k x, y be compatible with Z on M(Z). TFAE: (a): For all u, v, w M(Z), B(B(u, v), w) B(u, B(v, w)) ϕ 0. (b): For all u, v, w M(Z), B(B(u, v), w) ϕ B(u, B(v, w)). (c): Π ϕ (Z) is confluent. (d): Π ϕ (Z) is convergent. Moreover, these hold if the following holds, and the converse is true if Z has at least 3 elements. (e): B(B(µ, ν), ω) Πϕ(µ,ν,ω) B(µ, B(ν, ω)) under the rewriting system Π ϕ (µ, ν, ω) for k µ, ν, ω.
13 A Global Characterization for Rota-Baxter Type Let k be a field. Let B(x, y) k x, y be in RBNF and totally linear in x, y. Let ϕ(x, y) := x y B(x, y). Let Z = { µ, ν, ω }. Suppose for every well-ordered set (Z, Z ), there is a monomial order with which ϕ is compatible (also denoted by Z ) extending Z from Z to M(Z). Then the following four statements are equivalent. (a) ϕ is a Rota-Baxter type OPI. (b) The two expressions B(B(µ, ν), ω) and B(µ, B(ν, ω)) k Z are joinable under Π ϕ (Z ). (c) Π ϕ (Z ) is convergent. (d) Π ϕ (Z) is convergent for every well-ordered set Z.
14 Monomial Order on M(Z) A monomial order on M(Z) is a well order on M(Z) such that: u < v = q u < q v, for all u, v M(Z) and all q M (Z). Given a monomial order, and f k Z, f / k, the notions of leading bracketed monomial f and leading coefficient c(f ) are clear. The remainder R(f ) is defined as f c(f )f. If f k (including f = 0), we define the leading monomial of f to be f = 1 M(Z), the leading coefficient to be c(f ) = f, and the remainder is R(f ) = 0. We say f is monic with respect to if c(f ) = 1. A subset S k Z is monic if every s S is.
15 TRS on Free Operated Algebras For Subsets Let be a monomial order on M(Z). Let S k Z be monic with respect to. We associate a term-rewriting system Π S, (Z) on k Z with basis M(Z): Π S, (Z) := {(q s, q R(s) ) s S, q M (Z) } Z k Z. We will often abbreviate Π S, (Z) to Π S, and denote the relation by S and its reflexive transitive closure by S. If a rule (q s, q R(s) ) Π S is used to reduce f k Z to q,s g k Z in one step, we shall write f S g, in which case, f g = q s, and f Id(S) if and only if g Id(S), where Id(S) is the operated ideal of k Z generated by S.
16 Compatible Rewriting Systems Let Π be a rewriting system on V = k M(Z) with basis W = M(Z). We say Π is compatible with the monomial order on M(Z) if v < t for all (t, v) Π. Every rewriting system Π,S (Z) is by definition compatible with respect to. Let ϕ = x y B(x, y) k x, y. We say ϕ is compatible with on M(Z) if the rewriting system Π ϕ (Z) is compatible with on M(Z), or equivalently, if the rewriting subsystem Π ϕ(z) is, or equivalently, if B(u, v) < u v for every u, v M(Z). If ϕ is compatible with, then Π ϕ (Z) = Π,S (Z), with S = { ϕ(u, v) q,u,v u, v M(Z) }. If s = ϕ(u, v), then f ϕ g q,s if and only if f S g. Hence f k Z is Π ϕ -reducible if and only if f is Π S -reducible. The set Irr(S) of Π S -irreducible monomials is precisely the set R(Z) of monomials in RBNF.
17 The Rewriting System Π S is Terminating Let be a monomial order on M(Z) for a set Z. Let S k Z be monic and let f k Z. For the rewriting system Π S, we define the leading S-reducible monomial of f to be the monomial L(f ) maximal with respect to among monomials m appearing in f that are not in Irr(S), that is, L(f ) := max{m m Supp(f ), m / Irr(S)}. Lemma: Suppose g, g k Z are both S-reducible and for some q M (Z) and s S, g (q,s) S g. Then L(g ) L(g), where equality holds if and only if L(g) q s. Theorem: The rewriting system Π S is terminating. In particular, the rewriting system Π ϕ (Z) is terminating if ϕ := x y B(x, y) k x, y is compatible with.
18 Descent of Leading Term After Rewriting The following are more refined versions of the previous Lemma. Lemma: Let g k Z be Π S -reducible and for some s S, q M (Z), suppose g (q,s) S g k Z. Then g g, where equality holds if and only if q s < g. Corollary: Let ϕ = x y B(x, y) k Z be compatible with on M(Z). Let g k Z be ϕ-reducible and let u, v M(Z), q M (Z) and g k Z be such that g q,u,v ϕ g. Then g g, where equality holds if and only if q u v < g.
19 Restriction to a Rewritng Subsystem Let W be a subset of M(Z) and let V be the free k-submodule of k Z with basis W. We say the rewriting system Π ϕ (Z) on k Z restricts to a rewriting system Π on V with basis W if for all f V and all triples (q, u, v) for f, we have f q,u,v ϕ g implies g V. A necessary and sufficient condition that Π ϕ (Z) restricts to Π is that for all f V and all triples (q, u, v) of f, q u v W implies q B(u,v) V. A similar definition can be given for the more general TRS Π S (Z) for a subset S k Z.
20 A Crucial Lemma on Confluence Let Z be a set, let be a monomial order on M(Z), let Y M(Z) be monic and let ϕ(x, y) := x y B(x, y) k x, y be compatible with on M(Z). Suppose the rewriting system Π ϕ (Z) restricts to a rewriting system Π ϕ,y on k Y with basis Y and suppose Π ϕ,y is confluent. For 1 i n, let c i k, q i M (Z) and s i S ϕ (Z) be such that q i si Y and n i=1 c iq i si s i = 0. Lemma: Then n i=1 c iq i si ϕ 0.
21 Basics on Gröbner-Shirshov Basis Let f, g k Z be two distinct bracketed polynomials, each monic with respect to. Let f be the leading monomial of f, and let f be the breadth of f. If there exist µ, ν, b M(Z) such that b = f µ = νg with max{ f, g } < b < f + g, we call the operated polynomial (f, g) µ,ν b := f µ νg the intersection composition of f and g with respect to (µ, ν). If there exist q M (Z) and b M(Z) such that b = f = q g, we call the operated polynomial (f, g) q b := f q g the including composition of f and g with respect to q.
22 Gröbner-Shirshov Basis Let b M(Z), let S be a set of monic bracketed polynomials in k Z, and let Id(S) be the bracketed ideal generated by S. An operated polynomial f k Z is called trivial modulo S with bound b or, in short, trivial modulo (S, b) if f Id(S) and can be expressed as a sum i c iq i si where 0 c i k, q i M (Z), s i S and q i si < b. The polynomial 0, expressed as the empty sum, is trivial modulo (S, b) for any S and b. A set S k Z of monic bracketed polynomials is called a Gröbner-Shirshov basis with respect to if, for all pairs f, g S with f g, every intersection composition of the form (f, g) µ,ν b is trivial modulo S with bound b, and every including composition of the form (f, g) q b is trivial modulo S with bound b.
23 The Composition-Diamond Lemma Let η : k Z k Z /Id(S) be the canonical homomorphism of k-modules. Then the following statements are equivalent. (a) : S is a Gröbner-Shirshov basis in k Z. (b) : For every non-zero f Id(S), f = q s for some q M (Z) and some s S. (c) : For every non-zero f Id(S), f can be expressed in triangular form: f = c 1 q 1 s1 + c 2 q 2 s2 + + c n q n sn, (1) where c i k (c i 0), s i S, q i M (Z) for 1 i n, and q 1 s1 > q 2 s2 > > q n sn. (d) : As k-modules, k Z = k Irr(S) Id(S) and η(irr(s)) is a k-basis of k Z /Id(S).
24 Second Local Characterization Theorem Let Z be a set, and let be a monomial order on M(Z). Let ϕ(x, y) := x y B(x, y) k x, y with B(x, y) in RBNF and totally linear in x, y be compatible with. Then the following conditions are equivalent. (a) : The rewriting system Π ϕ (Z) is convergent. (b) : With respect to, the set S := S ϕ (Z) is a Gröbner-Shirshov basis in k Z.
25 Construction of Free ϕ-algebras Let Z be a set, let be a monomial order on M(Z), and let ϕ(x, y) := x y B(x, y) k x, y be of Rota-Baxter type and compatible with. Let S = S ϕ (Z). Then the following holds: Recall that R(Z) M(Z) is the set of monomials in RBNF and η : k Z k Z /Id(S) =: k ϕ Z is the canonical homomorphism of k-modules. The composition η ι: k R(Z) ι k M(Z) k Z η k ϕ Z is an isomorphism of operated k-modules, taking the k-basis R(Z) of k R(Z) to a k-basis of k ϕ Z and P r the operator induced by P, that is, P r (f + Id(S)) = P(f ) + Id(S). Let α : k ϕ Z k R(Z) be the inverse of η ι and let ρ := ρ ϕ be the composition k Z η k ϕ Z α k R(Z). For u, v R(Z), let u = u 1 u s and v = v 1 v t be standard decompositions.
26 Construction of Diamond Product Let be the multiplication on k R(Z) that is uniquely determined by bilinearity and the products u v, where 1. 1 v = v and u 1 := u, if either u = 1 or v = 1 (or both) where 1 is the empty word in M(Z); 2. u v := uv if either u S(Z) or v S(Z) (or both); 3. u v := ρ(b(u, v )) if u = u and v = v are both in R(Z) ; 4. u v := u 1 u s 1 (u s v 1 )v 2 v t if either s > 1, or t > 1 (or both). Here the multiplications are concatenations, except for u s v 1, where is defined recursively by Step 2 or 3. With the above construction, (k R(Z),, P r ) is a free ϕ-algebra on the set Z.
27 Monomial order on M(Z) We construct a monomial order on M(Z) inductively in several steps. Recall that M(Z) is the direct limit of ι n : M n (Z) M n+1 (Z). The degree lexicographical order dlex on M(Z). A well-order n on M n (Z) for every non-negative integer n which is induced by Z on M n (Z) and the preorders induced by degree and breadth. The degree-breadth lexicographic order db,z is the direct limit of n. Lemma. db,z is a well order and the restriction of Z to M n (Z) is n. Theorem. db,z is a monomial order on M(Z).
28 Degree Lexicographic Order dlex on M(Z) Let Z be a set with a well order Z and M(Z) the free monoid on Z. For u = u 1 u r M(Z) with u 1,, u r Z, define deg Z (u) = r if u 1 and deg Z (1) = 0. Define the degree lexicographical order dlex on M(Z) by taking, for any u = u 1 u r, v = v 1 v s M(Z)\{1}, where u 1,, u r, v 1,, v s Z, { degz (u) < deg Z (v), u dlex v or deg Z (u) = deg Z (v)(= r) and u 1 u r lex v 1 where lex is the lexicographical order on M(Z), with the convention that the empty word 1 dlex u for all u M(Z). Lemma. If Z is a well order on Z, then dlex is a well order on M(Z).
29 Preorders and Pre-linear Orders Let Y be a nonempty set. A preorder or quasiorder Y on Y is a binary relation that is reflexive and transitive, that is, for all x, y, z Y, we have 1. x Y x; and 2. if x Y y, y Y z, then x Y z. We denote x = Y y if x Y y and y Y x. If x Y y but x Y y, we write x < Y y or y > Y x. A pre-linear order Y on Y is a preorder Y such that either x Y y or y Y x (or both) for all x, y Y.
30 P-degree and P-breadth: Examples of Preorders Let u = u 0 u1 u 1 u2 ur u r M(Z), where u 0, u 1,, u r M(Z) and u1, u2,, ur, M(Z). Same for v = v 0 v1 v 1 v2 vs v s M(Z). Define u dgp v deg P (u) deg P (v), (2) where the P-degree deg P (u) of u is the number of occurrences of P = in u. Define u brp v r s (that is u P v P ), (3) where u P := r is the P-breadth of u. Lemma. dgp and brp are pre-linear orders satisfying the descending chain condition on M(Z).
31 Isomorphisms between Ordered Free Monoids Proposition. For every n 0, we can construct a well order n on M n (Z) depending only on Z such that the natural embeddings ι n induces an isomorphism of ordered free monoids between (M n (Z), n ) and (Im(ι n ), n+1), where n+1 is the restriction of n+1 to Im(ι n ). For natural numbers m 0, let M m (Z) := {u M(Z) u P = m} and let M m n (Z) := M n (Z) M m (Z). Then M n (Z) is the infinite disjoint union m=0 Mm n (Z).
32 Linear Order lexn on M n (Z) Define a relation lex m n on M m n (Z) by u lex m n v (u 1, u 2, u m, u 0,, u m ) clexn,m (v 1, v 2,, v m, v 0,, v m ). Then lex m n is a well order on M m n (Z) for all m 0. Now M n (Z) = m=0 M m=0, hence we may define a relation on M n (Z) by u lexn v lexn { u <brp v, or u = brp v and u lex m n v, where m = u P = v P. lexn a linear order on M n (Z), and in fact, it is a well order.
33 Well Order n on M n (Z) and db,z on M(Z) Finally, define the relation n on M n (Z) by: { u <dgp v, u n v (4) or u = dgp v and u lexn v, where we have restricted dgp to M n (Z). We prove by induction on n that u n v ι n (u) n+1 ι n (v) for all n 0, and so the induced map M n (Z) Im(ι n ) is an isomorphism between ordered free monoids. {(M n (Z), n )} n=0 as a filtration of ordered free monoids for (M(Z), db ), where M(Z) = n=0 M n(z) and db = lim n. More specifically, for u, v M(Z), u db,z v := u n v for any n such that u, v M n (Z). (5)
34 db,z is a Monomial Order A well order on M(Z) is called bracket compatible if u v u v for all u, v, w M(Z). A well order on M(Z) is called left (multiplicatively) compatible if u v wu wv for all u, v, w M(Z). A well order on M(Z) is called right (multiplicatively) compatible if u v uw vw for all u, v, w M(Z). Lemma. A well order is a monomial order on M(Z) if and only if is bracket, left, and right compatible. Theorem. Let (Z, Z ) be a well-ordered set. The order db,z is a monomial order on M(Z), extending Z.
35 Equivalences for Compatibility with db,z Proposition. Let ϕ(x, y) = x y B(x, y) k x, y and suppose B(x, y) is totally linear and in RBNF. TFAE: (a) For every well-ordered set (Z, Z ), the rewriting system Π ϕ (Z) is compatible with db,z on M(Z). (b) For some well-ordered set (Z, Z ) (possibly the empty set), the rewriting system Π ϕ (Z ) is compatible with db,z. (c) The total P-degree of B(x, y) is 1. (d) B(x, y) has the form: a 1 y x + a 2 x y + a 3 y x + a 4 x y + a 5 yx + a 6 xy +a 7 y 1 x+a 8 x 1 y+a 9 yx 1 +a 10 xy 1 +a 11 1 yx+a 12 1 xy where a j k (1 j 14). +a 13 yx + a 14 xy
Differential Type Operators, Rewriting Systems and Gröbner-Shirshov Bases
1 Differential Type Operators, Rewriting Systems and Gröbner-Shirshov Bases Li GUO (joint work with William Sit and Ronghua Zhang) Rutgers University at Newark Motivation: Classification of Linear Operators
More informationNON-COMMUTATIVE POLYNOMIAL COMPUTATIONS
NON-COMMUTATIVE POLYNOMIAL COMPUTATIONS ARJEH M. COHEN These notes describe some of the key algorithms for non-commutative polynomial rings. They are intended for the Masterclass Computer algebra, Spring
More informationInfinite-Dimensional Triangularization
Infinite-Dimensional Triangularization Zachary Mesyan March 11, 2018 Abstract The goal of this paper is to generalize the theory of triangularizing matrices to linear transformations of an arbitrary vector
More informationA finite universal SAGBI basis for the kernel of a derivation. Osaka Journal of Mathematics. 41(4) P.759-P.792
Title Author(s) A finite universal SAGBI basis for the kernel of a derivation Kuroda, Shigeru Citation Osaka Journal of Mathematics. 4(4) P.759-P.792 Issue Date 2004-2 Text Version publisher URL https://doi.org/0.890/838
More informationGröbner-Shirshov Bases for Free Product of Algebras and beyond
Southeast Asian Bulletin of Mathematics (2006) 30: 811 826 Southeast Asian Bulletin of Mathematics c SEAMS. 2003 Gröbner-Shirshov Bases for Free Product of Algebras and beyond Yuqun Chen School of Mathematical
More informationINTRODUCTION TO REAL ANALYTIC GEOMETRY
INTRODUCTION TO REAL ANALYTIC GEOMETRY KRZYSZTOF KURDYKA 1. Analytic functions in several variables 1.1. Summable families. Let (E, ) be a normed space over the field R or C, dim E
More informationNon-commutative reduction rings
Revista Colombiana de Matemáticas Volumen 33 (1999), páginas 27 49 Non-commutative reduction rings Klaus Madlener Birgit Reinert 1 Universität Kaiserslautern, Germany Abstract. Reduction relations are
More informationHomotopy-theory techniques in commutative algebra
Homotopy-theory techniques in commutative algebra Department of Mathematical Sciences Kent State University 09 January 2007 Departmental Colloquium Joint with Lars W. Christensen arxiv: math.ac/0612301
More informationCourse 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra
Course 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra D. R. Wilkins Contents 3 Topics in Commutative Algebra 2 3.1 Rings and Fields......................... 2 3.2 Ideals...............................
More informationLetterplace ideals and non-commutative Gröbner bases
Letterplace ideals and non-commutative Gröbner bases Viktor Levandovskyy and Roberto La Scala (Bari) RWTH Aachen 13.7.09, NOCAS, Passau, Niederbayern La Scala, Levandovskyy (RWTH) Letterplace ideals 13.7.09
More information4.4 Noetherian Rings
4.4 Noetherian Rings Recall that a ring A is Noetherian if it satisfies the following three equivalent conditions: (1) Every nonempty set of ideals of A has a maximal element (the maximal condition); (2)
More informationJoseph Muscat Universal Algebras. 1 March 2013
Joseph Muscat 2015 1 Universal Algebras 1 Operations joseph.muscat@um.edu.mt 1 March 2013 A universal algebra is a set X with some operations : X n X and relations 1 X m. For example, there may be specific
More informationFILTERED RINGS AND MODULES. GRADINGS AND COMPLETIONS.
FILTERED RINGS AND MODULES. GRADINGS AND COMPLETIONS. Let A be a ring, for simplicity assumed commutative. A filtering, or filtration, of an A module M means a descending sequence of submodules M = M 0
More informationRings and groups. Ya. Sysak
Rings and groups. Ya. Sysak 1 Noetherian rings Let R be a ring. A (right) R -module M is called noetherian if it satisfies the maximum condition for its submodules. In other words, if M 1... M i M i+1...
More informationarxiv: v1 [math.rt] 4 Jan 2016
IRREDUCIBLE REPRESENTATIONS OF THE CHINESE MONOID LUKASZ KUBAT AND JAN OKNIŃSKI Abstract. All irreducible representations of the Chinese monoid C n, of any rank n, over a nondenumerable algebraically closed
More information12. Hilbert Polynomials and Bézout s Theorem
12. Hilbert Polynomials and Bézout s Theorem 95 12. Hilbert Polynomials and Bézout s Theorem After our study of smooth cubic surfaces in the last chapter, let us now come back to the general theory of
More informationAN INTRODUCTION TO AFFINE SCHEMES
AN INTRODUCTION TO AFFINE SCHEMES BROOKE ULLERY Abstract. This paper gives a basic introduction to modern algebraic geometry. The goal of this paper is to present the basic concepts of algebraic geometry,
More informationCHAPTER 4. βs as a semigroup
CHAPTER 4 βs as a semigroup In this chapter, we assume that (S, ) is an arbitrary semigroup, equipped with the discrete topology. As explained in Chapter 3, we will consider S as a (dense ) subset of its
More informationDefinitions. Notations. Injective, Surjective and Bijective. Divides. Cartesian Product. Relations. Equivalence Relations
Page 1 Definitions Tuesday, May 8, 2018 12:23 AM Notations " " means "equals, by definition" the set of all real numbers the set of integers Denote a function from a set to a set by Denote the image of
More informationI. Duality. Macaulay F. S., The Algebraic Theory of Modular Systems, Cambridge Univ. Press (1916);
I. Duality Macaulay F. S., On the Resolution of a given Modular System into Primary Systems including some Properties of Hilbert Numbers, Math. Ann. 74 (1913), 66 121; Macaulay F. S., The Algebraic Theory
More informationKiddie Talk - The Diamond Lemma and its applications
Kiddie Tal - The Diamond Lemma and its applications April 22, 2013 1 Intro Start with an example: consider the following game, a solitaire. Tae a finite graph G with n vertices and a function e : V (G)
More informationTEST GROUPS FOR WHITEHEAD GROUPS
TEST GROUPS FOR WHITEHEAD GROUPS PAUL C. EKLOF, LÁSZLÓ FUCHS, AND SAHARON SHELAH Abstract. We consider the question of when the dual of a Whitehead group is a test group for Whitehead groups. This turns
More informationAlgebra Homework, Edition 2 9 September 2010
Algebra Homework, Edition 2 9 September 2010 Problem 6. (1) Let I and J be ideals of a commutative ring R with I + J = R. Prove that IJ = I J. (2) Let I, J, and K be ideals of a principal ideal domain.
More information(1) A frac = b : a, b A, b 0. We can define addition and multiplication of fractions as we normally would. a b + c d
The Algebraic Method 0.1. Integral Domains. Emmy Noether and others quickly realized that the classical algebraic number theory of Dedekind could be abstracted completely. In particular, rings of integers
More informationTHE CLOSED-POINT ZARISKI TOPOLOGY FOR IRREDUCIBLE REPRESENTATIONS. K. R. Goodearl and E. S. Letzter
THE CLOSED-POINT ZARISKI TOPOLOGY FOR IRREDUCIBLE REPRESENTATIONS K. R. Goodearl and E. S. Letzter Abstract. In previous work, the second author introduced a topology, for spaces of irreducible representations,
More informationObservation 4.1 G has a proper separation of order 0 if and only if G is disconnected.
4 Connectivity 2-connectivity Separation: A separation of G of order k is a pair of subgraphs (H, K) with H K = G and E(H K) = and V (H) V (K) = k. Such a separation is proper if V (H) \ V (K) and V (K)
More informationPolynomials, Ideals, and Gröbner Bases
Polynomials, Ideals, and Gröbner Bases Notes by Bernd Sturmfels for the lecture on April 10, 2018, in the IMPRS Ringvorlesung Introduction to Nonlinear Algebra We fix a field K. Some examples of fields
More informationChapter 1. Sets and Mappings
Chapter 1. Sets and Mappings 1. Sets A set is considered to be a collection of objects (elements). If A is a set and x is an element of the set A, we say x is a member of A or x belongs to A, and we write
More informationMATH 326: RINGS AND MODULES STEFAN GILLE
MATH 326: RINGS AND MODULES STEFAN GILLE 1 2 STEFAN GILLE 1. Rings We recall first the definition of a group. 1.1. Definition. Let G be a non empty set. The set G is called a group if there is a map called
More informationMonomial orderings, rewriting systems, and Gröbner bases for the commutator ideal of a free algebra
Monomial orderings, rewriting systems, and Gröbner bases for the commutator ideal of a free algebra Susan M. Hermiller Department of Mathematics and Statistics University of Nebraska-Lincoln Lincoln, NE
More informationDERIVATIONS. Introduction to non-associative algebra. Playing havoc with the product rule? BERNARD RUSSO University of California, Irvine
DERIVATIONS Introduction to non-associative algebra OR Playing havoc with the product rule? PART VI COHOMOLOGY OF LIE ALGEBRAS BERNARD RUSSO University of California, Irvine FULLERTON COLLEGE DEPARTMENT
More informationEndomorphism rings generated using small numbers of elements arxiv:math/ v2 [math.ra] 10 Jun 2006
Endomorphism rings generated using small numbers of elements arxiv:math/0508637v2 [mathra] 10 Jun 2006 Zachary Mesyan February 2, 2008 Abstract Let R be a ring, M a nonzero left R-module, and Ω an infinite
More informationTheorem 4.18 ( Critical Pair Theorem ) A TRS R is locally confluent if and only if all its critical pairs are joinable.
4.4 Critical Pairs Showing local confluence (Sketch): Problem: If t 1 E t 0 E t 2, does there exist a term s such that t 1 E s E t 2? If the two rewrite steps happen in different subtrees (disjoint redexes):
More informationADVANCED COMMUTATIVE ALGEBRA: PROBLEM SETS
ADVANCED COMMUTATIVE ALGEBRA: PROBLEM SETS UZI VISHNE The 11 problem sets below were composed by Michael Schein, according to his course. Take into account that we are covering slightly different material.
More informationObservation 4.1 G has a proper separation of order 0 if and only if G is disconnected.
4 Connectivity 2-connectivity Separation: A separation of G of order k is a pair of subgraphs (H 1, H 2 ) so that H 1 H 2 = G E(H 1 ) E(H 2 ) = V (H 1 ) V (H 2 ) = k Such a separation is proper if V (H
More informationAperiodic languages and generalizations
Aperiodic languages and generalizations Lila Kari and Gabriel Thierrin Department of Mathematics University of Western Ontario London, Ontario, N6A 5B7 Canada June 18, 2010 Abstract For every integer k
More information4. Noether normalisation
4. Noether normalisation We shall say that a ring R is an affine ring (or affine k-algebra) if R is isomorphic to a polynomial ring over a field k with finitely many indeterminates modulo an ideal, i.e.,
More informationEquational Logic. Chapter Syntax Terms and Term Algebras
Chapter 2 Equational Logic 2.1 Syntax 2.1.1 Terms and Term Algebras The natural logic of algebra is equational logic, whose propositions are universally quantified identities between terms built up from
More informationEquational Logic. Chapter 4
Chapter 4 Equational Logic From now on First-order Logic is considered with equality. In this chapter, I investigate properties of a set of unit equations. For a set of unit equations I write E. Full first-order
More informationReversely Well-Ordered Valuations on Polynomial Rings in Two Variables
Reversely Well-Ordered Valuations on Polynomial Rings in Two Variables Edward Mosteig Loyola Marymount University Los Angeles, California, USA Workshop on Valuations on Rational Function Fields Department
More informationCheat Sheet Equational Logic (Spring 2013) Terms. Inductive Construction. Positions: Denoting Subterms TERMS
TERMS Cheat Sheet Equational Logic (Spring 2013) The material given here summarizes those notions from the course s textbook [1] that occur frequently. The goal is to have them at hand, as a quick reminder
More informationFormal power series rings, inverse limits, and I-adic completions of rings
Formal power series rings, inverse limits, and I-adic completions of rings Formal semigroup rings and formal power series rings We next want to explore the notion of a (formal) power series ring in finitely
More informationLecture 1. (i,j) N 2 kx i y j, and this makes k[x, y]
Lecture 1 1. Polynomial Rings, Gröbner Bases Definition 1.1. Let R be a ring, G an abelian semigroup, and R = i G R i a direct sum decomposition of abelian groups. R is graded (G-graded) if R i R j R i+j
More informationLADDER INDEX OF GROUPS. Kazuhiro ISHIKAWA, Hiroshi TANAKA and Katsumi TANAKA
Math. J. Okayama Univ. 44(2002), 37 41 LADDER INDEX OF GROUPS Kazuhiro ISHIKAWA, Hiroshi TANAKA and Katsumi TANAKA 1. Stability In 1969, Shelah distinguished stable and unstable theory in [S]. He introduced
More informationCOMMUNICATIONS IN ALGEBRA, 15(3), (1987) A NOTE ON PRIME IDEALS WHICH TEST INJECTIVITY. John A. Beachy and William D.
COMMUNICATIONS IN ALGEBRA, 15(3), 471 478 (1987) A NOTE ON PRIME IDEALS WHICH TEST INJECTIVITY John A. Beachy and William D. Weakley Department of Mathematical Sciences Northern Illinois University DeKalb,
More information3. The Sheaf of Regular Functions
24 Andreas Gathmann 3. The Sheaf of Regular Functions After having defined affine varieties, our next goal must be to say what kind of maps between them we want to consider as morphisms, i. e. as nice
More informationThe set of points at which a polynomial map is not proper
ANNALES POLONICI MATHEMATICI LVIII3 (1993) The set of points at which a polynomial map is not proper by Zbigniew Jelonek (Kraków) Abstract We describe the set of points over which a dominant polynomial
More informationA Combinatorial Approach to Involution and δ-regularity I: Involutive Bases in Polynomial Algebras of Solvable Type
AAECC manuscript No. (will be inserted by the editor) A Combinatorial Approach to Involution and δ-regularity I: Involutive Bases in Polynomial Algebras of Solvable Type Werner M. Seiler AG Computational
More informationarxiv: v1 [math.ra] 2 Oct 2007
OPERATED SEMIGROUPS, MOTZKIN PATHS AND ROOTED TREES LI GUO arxiv:0710.0429v1 [math.ra] 2 Oct 2007 Abstract. Combinatorial objects such as rooted trees that carry a recursive structure have found important
More informationIntroduction Non-uniqueness of factorization in A[x]... 66
Abstract In this work, we study the factorization in A[x], where A is an Artinian local principal ideal ring (briefly SPIR), whose maximal ideal, (t), has nilpotency h: this is not a Unique Factorization
More informationWinter School on Galois Theory Luxembourg, February INTRODUCTION TO PROFINITE GROUPS Luis Ribes Carleton University, Ottawa, Canada
Winter School on alois Theory Luxembourg, 15-24 February 2012 INTRODUCTION TO PROFINITE ROUPS Luis Ribes Carleton University, Ottawa, Canada LECTURE 2 2.1 ENERATORS OF A PROFINITE ROUP 2.2 FREE PRO-C ROUPS
More informationHowever another possibility is
19. Special Domains Let R be an integral domain. Recall that an element a 0, of R is said to be prime, if the corresponding principal ideal p is prime and a is not a unit. Definition 19.1. Let a and b
More informationLecture 2. (1) Every P L A (M) has a maximal element, (2) Every ascending chain of submodules stabilizes (ACC).
Lecture 2 1. Noetherian and Artinian rings and modules Let A be a commutative ring with identity, A M a module, and φ : M N an A-linear map. Then ker φ = {m M : φ(m) = 0} is a submodule of M and im φ is
More information5 Dedekind extensions
18.785 Number theory I Fall 2016 Lecture #5 09/22/2016 5 Dedekind extensions In this lecture we prove that the integral closure of a Dedekind domain in a finite extension of its fraction field is also
More informationarxiv:math/ v1 [math.gm] 21 Jan 2005
arxiv:math/0501341v1 [math.gm] 21 Jan 2005 SUBLATTICES OF LATTICES OF ORDER-CONVEX SETS, I. THE MAIN REPRESENTATION THEOREM MARINA SEMENOVA AND FRIEDRICH WEHRUNG Abstract. For a partially ordered set P,
More informationTHE DIAMOND LEMMA FOR RING THEORY
THE DIAMOND LEMMA FOR RING THEORY NOTES BY APOORVA KHARE PRESENTED TO AKAKI TIKARADZE IN ECKHART 16 ON AUG 16, 2007, THURSDAY AND TO DMITRIY BOYARCHENKO IN RYERSON ON NOV 26, 2008, WEDNESDAY It is useful
More informationChapter 8. P-adic numbers. 8.1 Absolute values
Chapter 8 P-adic numbers Literature: N. Koblitz, p-adic Numbers, p-adic Analysis, and Zeta-Functions, 2nd edition, Graduate Texts in Mathematics 58, Springer Verlag 1984, corrected 2nd printing 1996, Chap.
More informationYuriy Drozd. Intriduction to Algebraic Geometry. Kaiserslautern 1998/99
Yuriy Drozd Intriduction to Algebraic Geometry Kaiserslautern 1998/99 CHAPTER 1 Affine Varieties 1.1. Ideals and varieties. Hilbert s Basis Theorem Let K be an algebraically closed field. We denote by
More informationSPECIAL IDENTITIES FOR THE PRE-JORDAN PRODUCT IN THE FREE DENDRIFORM ALGEBRA
SPECIAL IDENTITIES FOR THE PRE-JORDAN PRODUCT IN THE FREE DENDRIFORM ALGEBRA MURRAY R. BREMNER AND SARA MADARIAGA In memory of Jean-Louis Loday (1946 2012) Abstract. Pre-Jordan algebras were introduced
More informationMath 418 Algebraic Geometry Notes
Math 418 Algebraic Geometry Notes 1 Affine Schemes Let R be a commutative ring with 1. Definition 1.1. The prime spectrum of R, denoted Spec(R), is the set of prime ideals of the ring R. Spec(R) = {P R
More informationLattices, closure operators, and Galois connections.
125 Chapter 5. Lattices, closure operators, and Galois connections. 5.1. Semilattices and lattices. Many of the partially ordered sets P we have seen have a further valuable property: that for any two
More informationFREE STEINER LOOPS. Smile Markovski, Ana Sokolova Faculty of Sciences and Mathematics, Republic of Macedonia
GLASNIK MATEMATIČKI Vol. 36(56)(2001), 85 93 FREE STEINER LOOPS Smile Markovski, Ana Sokolova Faculty of Sciences and Mathematics, Republic of Macedonia Abstract. A Steiner loop, or a sloop, is a groupoid
More informationAbstract Algebra II Groups ( )
Abstract Algebra II Groups ( ) Melchior Grützmann / melchiorgfreehostingcom/algebra October 15, 2012 Outline Group homomorphisms Free groups, free products, and presentations Free products ( ) Definition
More informationMath 429/581 (Advanced) Group Theory. Summary of Definitions, Examples, and Theorems by Stefan Gille
Math 429/581 (Advanced) Group Theory Summary of Definitions, Examples, and Theorems by Stefan Gille 1 2 0. Group Operations 0.1. Definition. Let G be a group and X a set. A (left) operation of G on X is
More informationNOTES ON FINITE FIELDS
NOTES ON FINITE FIELDS AARON LANDESMAN CONTENTS 1. Introduction to finite fields 2 2. Definition and constructions of fields 3 2.1. The definition of a field 3 2.2. Constructing field extensions by adjoining
More informationIntegro-differential Algebras of Combinatorial species
1 Integro-differential Algebras of Combinatorial species Xing Gao Lanzhou University in China, Rutgers University-Newark (Joint work with L. Guo, M. Rosenkranz and S. Zhang) Kolchin Seminar in Differential
More informationINTRODUCTION TO SEMIGROUPS AND MONOIDS
INTRODUCTION TO SEMIGROUPS AND MONOIDS PETE L. CLARK We give here some basic definitions and very basic results concerning semigroups and monoids. Aside from the mathematical maturity necessary to follow
More information12 Hilbert polynomials
12 Hilbert polynomials 12.1 Calibration Let X P n be a (not necessarily irreducible) closed algebraic subset. In this section, we ll look at a device which measures the way X sits inside P n. Throughout
More informationIsomorphisms between pattern classes
Journal of Combinatorics olume 0, Number 0, 1 8, 0000 Isomorphisms between pattern classes M. H. Albert, M. D. Atkinson and Anders Claesson Isomorphisms φ : A B between pattern classes are considered.
More informationThis is a closed subset of X Y, by Proposition 6.5(b), since it is equal to the inverse image of the diagonal under the regular map:
Math 6130 Notes. Fall 2002. 7. Basic Maps. Recall from 3 that a regular map of affine varieties is the same as a homomorphism of coordinate rings (going the other way). Here, we look at how algebraic properties
More informationOrdering functions. Raphaël Carroy. Hejnice, Czech Republic January 27th, Universität Münster 1/21
Ordering functions Raphaël Carroy Universität Münster Hejnice, Czech Republic January 27th, 2014 1/21 General background: 0-dimensional Polish spaces, and functions The Baire space ω ω of infinite sequences
More informationMath 121 Homework 4: Notes on Selected Problems
Math 121 Homework 4: Notes on Selected Problems 11.2.9. If W is a subspace of the vector space V stable under the linear transformation (i.e., (W ) W ), show that induces linear transformations W on W
More information10. Noether Normalization and Hilbert s Nullstellensatz
10. Noether Normalization and Hilbert s Nullstellensatz 91 10. Noether Normalization and Hilbert s Nullstellensatz In the last chapter we have gained much understanding for integral and finite ring extensions.
More informationarxiv: v2 [math.ra] 5 Aug 2017
ON RINGS OF DIFFERENTIAL ROTA-BAXTER OPERATORS XING GAO, LI GUO, AND MARKUS ROSENKRANZ arxiv:1512.01247v2 [math.ra] 5 Aug 2017 Abstract. Using the language of operated algebras, we construct and investigate
More informationComposition-Diamond Lemma for Non-associative Algebras over a Commutative Algebra
Composition-Diamond Lemma for Non-associative Algebras over a Commutative Algebra arxiv:1009.0196v1 [math.ra] 1 Sep 2010 Yuqun Chen, Jing Li and Mingjun Zeng School of Mathematical Sciences, South China
More informationMATH 101: ALGEBRA I WORKSHEET, DAY #1. We review the prerequisites for the course in set theory and beginning a first pass on group. 1.
MATH 101: ALGEBRA I WORKSHEET, DAY #1 We review the prerequisites for the course in set theory and beginning a first pass on group theory. Fill in the blanks as we go along. 1. Sets A set is a collection
More informationCHEVALLEY S THEOREM AND COMPLETE VARIETIES
CHEVALLEY S THEOREM AND COMPLETE VARIETIES BRIAN OSSERMAN In this note, we introduce the concept which plays the role of compactness for varieties completeness. We prove that completeness can be characterized
More informationne varieties (continued)
Chapter 2 A ne varieties (continued) 2.1 Products For some problems its not very natural to restrict to irreducible varieties. So we broaden the previous story. Given an a ne algebraic set X A n k, we
More informationII - REAL ANALYSIS. This property gives us a way to extend the notion of content to finite unions of rectangles: we define
1 Measures 1.1 Jordan content in R N II - REAL ANALYSIS Let I be an interval in R. Then its 1-content is defined as c 1 (I) := b a if I is bounded with endpoints a, b. If I is unbounded, we define c 1
More informationSchool of Mathematics and Statistics. MT5836 Galois Theory. Handout 0: Course Information
MRQ 2017 School of Mathematics and Statistics MT5836 Galois Theory Handout 0: Course Information Lecturer: Martyn Quick, Room 326. Prerequisite: MT3505 (or MT4517) Rings & Fields Lectures: Tutorials: Mon
More informationConfluence Algebras and Acyclicity of the Koszul Complex
Confluence Algebras and Acyclicity of the Koszul Complex Cyrille Chenavier To cite this version: Cyrille Chenavier. Confluence Algebras and Acyclicity of the Koszul Complex. Algebras and Representation
More informationPERVERSE SHEAVES ON A TRIANGULATED SPACE
PERVERSE SHEAVES ON A TRIANGULATED SPACE A. POLISHCHUK The goal of this note is to prove that the category of perverse sheaves constructible with respect to a triangulation is Koszul (i.e. equivalent to
More informationClearly C B, for every C Q. Suppose that we may find v 1, v 2,..., v n
10. Algebraic closure Definition 10.1. Let K be a field. The algebraic closure of K, denoted K, is an algebraic field extension L/K such that every polynomial in K[x] splits in L. We say that K is algebraically
More informationOrderings of Monomial Ideals
Orderings of Monomial Ideals Matthias Aschenbrenner Department of Mathematics University of California at Berkeley Evans Hall Berkeley, CA 94720 maschenb@math.berkeley.edu Wai Yan Pong Department of Mathematics
More informationIntroduction to Chiral Algebras
Introduction to Chiral Algebras Nick Rozenblyum Our goal will be to prove the fact that the algebra End(V ac) is commutative. The proof itself will be very easy - a version of the Eckmann Hilton argument
More informationChapter 1 : The language of mathematics.
MAT 200, Logic, Language and Proof, Fall 2015 Summary Chapter 1 : The language of mathematics. Definition. A proposition is a sentence which is either true or false. Truth table for the connective or :
More information5 Set Operations, Functions, and Counting
5 Set Operations, Functions, and Counting Let N denote the positive integers, N 0 := N {0} be the non-negative integers and Z = N 0 ( N) the positive and negative integers including 0, Q the rational numbers,
More informationCounting Zeros over Finite Fields with Gröbner Bases
Counting Zeros over Finite Fields with Gröbner Bases Sicun Gao May 17, 2009 Contents 1 Introduction 2 2 Finite Fields, Nullstellensatz and Gröbner Bases 5 2.1 Ideals, Varieties and Finite Fields........................
More informationFUNCTORS AND ADJUNCTIONS. 1. Functors
FUNCTORS AND ADJUNCTIONS Abstract. Graphs, quivers, natural transformations, adjunctions, Galois connections, Galois theory. 1.1. Graph maps. 1. Functors 1.1.1. Quivers. Quivers generalize directed graphs,
More informationLECTURE 4: REPRESENTATION THEORY OF SL 2 (F) AND sl 2 (F)
LECTURE 4: REPRESENTATION THEORY OF SL 2 (F) AND sl 2 (F) IVAN LOSEV In this lecture we will discuss the representation theory of the algebraic group SL 2 (F) and of the Lie algebra sl 2 (F), where F is
More informationCW complexes. Soren Hansen. This note is meant to give a short introduction to CW complexes.
CW complexes Soren Hansen This note is meant to give a short introduction to CW complexes. 1. Notation and conventions In the following a space is a topological space and a map f : X Y between topological
More information9. Integral Ring Extensions
80 Andreas Gathmann 9. Integral ing Extensions In this chapter we want to discuss a concept in commutative algebra that has its original motivation in algebra, but turns out to have surprisingly many applications
More informationCHAPTER I. Rings. Definition A ring R is a set with two binary operations, addition + and
CHAPTER I Rings 1.1 Definitions and Examples Definition 1.1.1. A ring R is a set with two binary operations, addition + and multiplication satisfying the following conditions for all a, b, c in R : (i)
More informationCATEGORICAL GROTHENDIECK RINGS AND PICARD GROUPS. Contents. 1. The ring K(R) and the group Pic(R)
CATEGORICAL GROTHENDIECK RINGS AND PICARD GROUPS J. P. MAY Contents 1. The ring K(R) and the group Pic(R) 1 2. Symmetric monoidal categories, K(C), and Pic(C) 2 3. The unit endomorphism ring R(C ) 5 4.
More informationProjective Varieties. Chapter Projective Space and Algebraic Sets
Chapter 1 Projective Varieties 1.1 Projective Space and Algebraic Sets 1.1.1 Definition. Consider A n+1 = A n+1 (k). The set of all lines in A n+1 passing through the origin 0 = (0,..., 0) is called the
More informationOn the generation of the coefficient field of a newform by a single Hecke eigenvalue
On the generation of the coefficient field of a newform by a single Hecke eigenvalue Koopa Tak-Lun Koo and William Stein and Gabor Wiese November 2, 27 Abstract Let f be a non-cm newform of weight k 2
More informationSymbol Index Group GermAnal Ring AbMonoid
Symbol Index 409 Symbol Index Symbols of standard and uncontroversial usage are generally not included here. As in the word index, boldface page-numbers indicate pages where definitions are given. If a
More informationFactorization in Polynomial Rings
Factorization in Polynomial Rings Throughout these notes, F denotes a field. 1 Long division with remainder We begin with some basic definitions. Definition 1.1. Let f, g F [x]. We say that f divides g,
More informationCHAPTER 1. AFFINE ALGEBRAIC VARIETIES
CHAPTER 1. AFFINE ALGEBRAIC VARIETIES During this first part of the course, we will establish a correspondence between various geometric notions and algebraic ones. Some references for this part of the
More informationFree Subgroups of the Fundamental Group of the Hawaiian Earring
Journal of Algebra 219, 598 605 (1999) Article ID jabr.1999.7912, available online at http://www.idealibrary.com on Free Subgroups of the Fundamental Group of the Hawaiian Earring Katsuya Eda School of
More information