The Converse of Schur's Lemma in Noetherian Rings and Group Algebras

ABSTRACT

If M is a simple module over a ring R, then, by Schur's Lemma, its endomorphism ring is a division ring. However, the converse of this property, which we called the CSL property, does not hold in general. The object of this article is to study this converse for a few classes of rings: left Noetherian rings, V-rings and group algebras. First, we establish that a left Noetherian ring R is a CSL ring if and only if a ring R is left–artinian and primary decomposable. Secondly, we prove that a left semiartinian V-ring is CSL. At last, we study the CSL property in group algebra K [ G ] where K a field algebraically closed of characteristic p and G is a finite group of order divisible by p. Our main contribution is that K [ G ] is a CSL ring if and only if Gbf = HP where H is a normal p′-subgroup and bfP a Sylow bfp-subgroup of bfG. In this case, K [ G ] is primary decomposable.     

Finite-to-finite universal quasivarieties are Q-universal

Let K be a quasivariety of algebraic systems of finite type. K is said to be universal if the category G of all directed graphs is isomorphic to a full subcategory of K. If an embedding of G may be effected by a functor F:G K which assigns a finite algebraic system to each finite graph, then K is said to be finite-to-finite universal. K is said to be Q-universal if, for any quasivariety M of finite type, L(M) is a homomorphic image of a sublattice of L(K), where L(M) and L(K) are the lattices of quasivarieties contained in M and K, respectively.?We establish a connection between these two, apparently unrelated, notions by showing that if K is finite-to-finite universal, then K is Q-universal. Using this connection a number of quasivarieties are shown to be Q-universal. Received February 8, 2000; accepted in final form December 23, 2000.     

On relative enumerability of Turing degrees

Let d be a Turing degree, R[d] and Q[d] denote respectively classes of recursively enumerable (r.e.) and all degrees in which d is relatively enumerable. We proved in Ishmukhametov [1999] that there is a degree d containing differences of r.e.sets (briefly, d.r.e.degree) such that R[d] possess a least elementm 0. Now we show the existence of a d.r.e. d such that R[d] has no a least element. We prove also that for any REA-degree d below 0 the class Q[d] cannot have a least element and more generally is not bounded below by a non-zero degree, except in the trivial cases. Received: 17 January 1996     

Spectral properties of k p schrödinger operators in one space dimension

In the physics of layered semiconductor devices the k · p method in combination with the envelope function approach is a well established tool for band structure calculations. We perform a rigorous mathematical analysis of spectral properties for the corresponding spatially one dimensional k · p Schrödinger operators;thereby encompassing a wide class of such operators. This class covers many of the k · p operators prevalent in solid state physics. It includes k · p Schrödinger operators with piecewise constant coefficients, a prerequisite for dealing with the important case of semiconductor hetero-structures. In particular, we address the question of persistence of a spectral gap over the wave vector range. We also introduce a regularization of the problem which gives rise to a consistent discretization of k · p operators with jumping coefficients and describe design patterns for the numerical treatment of k · p operators.     

Rank formulae from the perspective of orthogonal projectors

For matrices F and G having the same number of rows and the orthogonal projectors P?=?FF ^? and Q?=?GG ^?, with F ^? and G ^? denoting the Moore–Penrose inverses of F and G, respectively, several formulae for ranks of various functions of F, G, P and Q are established. Besides a collection of original characterizations, many of which involve the ranks of F*G and (F?:?G) (which coincide with the ranks of PQ and P?+?Q, respectively), some properties known in the literature are reestablished in a generalized form. The variety of relationships considered shows that the approach utilized in the article, based on the partitioned representations of the projectors, provides a powerful tool of wide applicability.     

On the r.e. predecessors of d.r.e. degrees

Let d be a Turing degree containing differences of recursively enumerable sets (d.r.e.sets) and R[d] be the class of less than d r.e. degrees in whichd is relatively enumerable (r.e.). A.H.Lachlan proved that for any non-recursive d.r.e. d R[d] is not empty. We show that the r.e. degree defined by Lachlan for a d.r.e.set d is just the minimum degree in which D is r.e. Then we study for a given d.r.e. degree d class R[d] and show that there exists a d.r.e.d such that R d] has a minimum element 0. The most striking result of the paper is the existence of d.r.e. degrees for which R[d] consists of one element. Finally we prove that for some d.r.e. d R[d] can be the interval [a,b] for some r.e. degrees a,b, a b d. Received: 17 January 1996     

Whaley's Theorem for Finite Lattices

Whaley's Theorem on the existence of large proper sublattices of infinite lattices is extended to ordered sets and finite lattices. As a corollary it is shown that every finite lattice L with |L|≥3 contains a proper sublattice S with |S|≥|L|^1/3. It is also shown that that every finite modular lattice L with |L|≥3 contains a proper sublattice S with |S|≥|L|^1/2, and every finite distributive lattice L with |L|≥4 contains a proper sublattice S with |S|≥3/4|L|. This revised version was published online in June 2006 with corrections to the Cover Date.     

Two equivalent definitions of a congruence on a finitary model in a quasivariety

LetL be a finitary language and letK be a subcategory of the category of allL-models andL-morphisms. For aK-objectA we consider two definitions of aK-congruence relation onA: that given by Rosenberg and Sturm [2], and that given by Adámek [1]. Both definitions are external definitions in the sense that they depend on the otherK-objects. IfK is a full subcategory, such that theK-objects form a quasivariety, then it is shown that the definitions ofK-congruence are equivalent and a purely internal characterisation is given.Presented by I. Rosenberg.I am indebted to Professor Teo Sturm as this paper originated from his seminar series on Algebraic Structures.     

Approach Theory in Merotopic, Cauchy and Convergence Spaces. I

We introduce the notions of approach-merotopic structure and approach-filter merotopic structure by means of a map assigning to a collection of sets 'smallness' of members and define categories AMER and AFIL containing MER and FIL as bireflectively and bicoreflectively embedded subcategories, respectively. We show that the category AMER is a topological construct and AFIL which is a supercategory of ps-MET as well is a cartesian closed topological category bicoreflectively embedded in AMER.     

The linear combination of vectors implies the existence of the cross and dot products

Given two vectors u and v, their cross product u × v is a vector perpendicular to u and v. The motivation for this property, however, is never addressed. Here we show that the existence of the cross and dot products and the perpendicularity property follow from the concept of linear combination, which does not involve products of vectors. For our proof we consider the plane generated by a linear combination of uand v. When looking for the coefficients in the linear combination required to reach a desired point on the plane, the solution involves the existence of a normal vector n = u × v. Our results have a bearing on the history of vector analysis, as a product similar to the cross product but without the perpendicularity requirement existed at the same time. These competing products originate in the work of two major nineteen-century mathematicians, W. Hamilton, and H. Grassmann. These historical aspects are discussed in some detail here. We also address certain aspects of the teaching of u × v to undergraduate students, which is known to carry some difficulties. This includes the algebraic and geometric denitions of u × v, the rule for the direction of u × v, and the pseudovectorial nature of u × v.     

Annihilator Primes and Foundation Primes

ABSTRACT

Let R be a Noetherian ring and M a finitely generated R -module. In this article, we introduce the set of prime ideals Fnd  M , the foundation primes of M . Using the fact that this set is nicely organized by foundation levels, we present an approach to the problem of understanding Annspec  M , the annihilator primes of M , via Fnd  M . We show: (1) Fnd  M is a finite set containing Annspec  M . Further, suppose that moreover every ideal of R has a centralizing sequence of generators; now, Annspec  M is equal to the set Ass  M of associated primes of M. Then: (2) For an arbitrary P  ∈ Fnd  M , P  ∈ Annspec  M if and only if there is no Q  ∈ Annspec  M such that P contains Q , and at the same time, the minimal foundation level on which appears P is greater than the minimal foundation level on which appears Q .     

Divergent torus orbits in homogeneous spaces of ℚ-rank two

LetG be a semisimple algebraic ℚ-group, let Γ be an arithmetic subgroup ofG, and letT be an ℝ-split torus inG. We prove that if there is a divergentT _ℝ-orbit in Γ\G _ℝ, and ℚ-rankG≤2, then dimT≤ℚ-rankG. This provides a partial answer to a question of G. Tomanov and B. Weiss.     

Singular Archimedean lattice-ordered groups

W stands for the category of all archimedean l-groups with designated weak unit. The subcategory W _s of all groups with singular weak unit is analyzed as a full subcategory of W which is both epireflective and monocoreflective. A general technique for "contracting" monoreflections of a category A to a monocoreflective subcategory B is developed and then applied to W _s to show that: (i) the projectable hull in W _s is a monoreflection; (ii) essential hulls in W _s are formed by simply taking the lateral completion, and G is essentially closed in this category if and only if , where X is compact, Hausdorff and extremally disconnected; (iii) the maximum monoreflection on W _s , denoted , is obtained by contracting the maximum monoreflection on W, and G is epicomplete in W _s precisely when G is laterally -complete; (iv) the maximum essential reflection on W _s , denoted , is the contraction of the maximum essential reflection on W. Received January 22, 1997; accepted in final form June 11, 1998.     

Multilinear polynomials with invertible values

ABSTRACT

Let 𝔅( m, n ) be a free Burnside group of a sufficiently large exponent bin with a basis of cardinality m , m  ≥  2 . We prove the existence of a free semigroup of rank 2 in Aut 𝔅( m, n ).     

Orders in regular rings with minimal condition for principal right ideals

ABSTRACT

A ring R is called an n-clean (resp. Σ-clean) ring if every element in R is n-clean (resp. Σ-clean). Clean rings are 1-clean and hence are Σ-clean. An example shows that there exists a 2-clean ring that is not clean. This shows that Σ-clean rings are a proper generalization of clean rings. The group ring ?_(p) G with G a cyclic group of order 3 is proved to be Σ-clean. The m× m matrix ring M _m (R) over an n-clean ring is n-clean, and the m×m (m>1) matrix ring M _m (R) over any ring is Σ-clean. Additionally, rings satisfying a weakly unit 1-stable range were introduced. Rings satisfying weakly unit 1-stable range are left-right symmetric and are generalizations of abelian π-regular rings, abelian clean rings, and rings satisfying unit 1-stable range. A ring R satisfies a weakly unit 1-stable range if and only if whenever a ₁ R + ˙˙˙ a _m R = dR, with m ≥ 2, a ₁,…, a _m, d ∈ R, there exist u ₁ ∈ U(R) and u ₂,…, u _m ∈ W(R) such that a ₁ u ₁ + ? a _m u _m = Rd.     

Homomorphisms into N *

We study the properties of continuous homomorphisms from β S into N ^* and from N ^* into N ^* . We show that the image C of N ^* under a continuous homomorphism which does not arise from the continuous extension of a homomorphism mapping N to itself, has the property that C+C is a singleton.     

Boolean-valued loops

A new control structure construct, thewhile-until, is introduced as a syntactic combination of thewhile statement and therepeat-until statement. Examples show that the use of thewhile-until can lead to structured programs that are conceptually more manageable than those attainable without it. Thewhile-until statement is then extended to a value-returning expression which is shown to be more powerful than the classical looping structures. It is shown to be equivalent in power to those structures withexit when a value-returningif-then-else is allowed. As a consequence, there are flowcharts whose implementations require control structures stronger than thewhile-until. Implementation details are discussed and Hoare-like axioms are presented. A closing discussion on oesthetics discourages some natural generalizations, but it concludes that the basicwhile-until is convenient for all parties on a programming team: coder, reader, compiler, and validator.     

Algebras with a compatible uniformity

Given a variety of algebras V, we study categories of algebras in V with a compatible structure of uniform space. The lattice of compatible uniformities of an algebra, Unif A, can be considered a generalization of the lattice of congruences Con A. Mal'cev properties of V influence the structure of Unif A, much as they do that of Con A. The category V[CHUnif] of complete, Hausdor. such algebras in the variety V is particularly interesting; it has a factorization system , and V embeds into V[CHUnif] in such a way that is the subcategory of onto and the subcategory of one-one homomorphisms. Received February 17, 2000; accepted in final form April 1, 2001.     

Generating primitive positive clones

Suppose is a set of operations on a finite set A. Define PPC() to be the smallest primitive positive clone on A containing . For any finite algebra A, let PPC#(A) be the smallest number n for which PPC(CloA) = PPC(Clo _n A). S. Burris and R. Willard [2] conjectured that PPC#(A) ≤|A| when CloA is a primitive positive clone and |A| > 2. In this paper, we look at how large PPC#(A) can be when special conditions are placed on the finite algebra A. We show that PPC#(A) ≤|A| holds when the variety generated by A is congruence distributive, Abelian, or decidable. We also show that PPC#(A) ≤|A| + 2 if A generates a congruence permutable variety and every subalgebra of A is the product of a congruence neutral algebra and an Abelian algebra. Furthermore, we give an example in which PPC#(A) ≥|A| - 1)² so that these results are not vacuous. Received August 30, 1999; accepted in final form April 4, 2000.