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.     

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.     

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 .     

Arithmetic of Finite Ordered Sets: Cancellation of Exponents, I

Garrett Birkhoff conjectured in 1942 that when A, B, P are finite posets satisfying A ^P B ^P , then A B. We show that this is true in case P is dismantlable to each of its points, or P is connected and each of A and B is dismantlable to each of its covering pairs.     

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.     

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.     

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.     

Arithmetic of Finite Ordered Sets: Cancellation of Exponents,II

Garrett Birkhoff conjectured in 1942 that when A, B, P are finite posets satisfying A ^PB ^P, then AB. We show that this is true. Further, we introduce an operation C(A ^B), related to Garrett Birkhoff's exponentiation, and determine the structure of the algebra of isomorphism types of finite posets under the operations induced by A+B, A×B, and C(A ^B). Every finite +-indecomposable and ×-indecomposable poset A of more than one element is expressible for unique (up to isomorphism) E and P as AC(E ^P) where P is connected and E is indecomposable for all three operations.     

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.     

On the Unit Groups of Commutative Modular Group Algebras of KT-Groups

ABSTRACT

In this article, we prove that the inner projection of a projective curve with higher linear syzygies has also higher linear syzygies. Specifically, if a very ample line bundle ? on a smooth projective curve X satisfies property N _p for p  ≥  1 and H ¹ (? ^? 2) =  0 , then ?( ?  q ) satisfies property N _{p ? 1} for any point q  ∈  X . We also give simple proofs of well-known theorems about syzygies and raise some questions related to the line bundles of degree 2 g which do not satisfy property N ₁ .     

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     

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.     

Multivariate normal distributions,Fisher information and matrix inequalities

Using appropriately parameterized families of multivariate normal distributions and basic properties of the Fisher information matrix for normal random vectors, we provide statistical proofs of the monotonicity of the matrix function A ^-1 in the class of positive definite Hermitian matrices. Similarly, we prove that A ¹¹ < A ^-111, where A ₁₁ is the principal submatrix of A and A ¹¹ is the corresponding submatrix of A ^-1. These results in turn lead to statistical proofs that the the matrix function A ^-1 is convex in the class of positive definite Hermitian matrices and that A ² is convex in the class of all Hermitian matrices. (These results are based on the Loewner ordering of Hermitian matrices, under which A < B if A - B is non-negative definite.) The proofs demonstrate that the Fisher information matrix, a fundamental concept of statistics, deserves attention from a purely mathematical point of view.     

On Kalai’s Conjectures Concerning Centrally Symmetric Polytopes

In 1989, Kalai stated three conjectures A, B, C of increasing strength concerning face numbers of centrally symmetric convex polytopes. The weakest conjecture, A, became known as the “3 ^d -conjecture.” It is well known that the three conjectures hold in dimensions d≤3. We show that in dimension 4 only conjectures A and B are valid, while conjecture C fails. Furthermore, we show that both conjectures B and C fail in all dimensions d≥5.     

A hybrid algorithm for solving linear inequalities in a least squares sense

The need for solving a system of linear inequalities, A x ≥ b, arises in many applications. Yet in some cases the system to be solved turns out to be inconsistent due to measurement errors in the data vector b. In such a case it is often desired to find the smallest correction of b that recovers feasibility. That is, we are looking for a small nonnegative vector, y ≥ 0, for which the modified system A x ≥ b - y is solvable. The problem of calculating the smallest correction vector is called the least deviation problem. In this paper we present new algorithms for solving this problem. Numerical experiments illustrate the usefulness of the proposed methods.     

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.     

A Generalized Global Cartan Decomposition: A Basic Example

Suppose G ₁ ?  G are complex linear simple Lie groups. Let  ₁ ?  be the corresponding pair of Lie algebras. For the Killing-orthogonal  of  ₁ in  we have a vector space direct sum  =  ₁⊕ , which generalizes the classical Cartan decomposition on the Lie algebras level. In this article we study the corresponding problem of a ‘generalized global Cartan decomposition’ on the Lie groups level for the pair of groups ( G , G ₁) = (SL (4,?),Sp (2,?)); here  =  (4,?),  ₁ =  (2,?), and  = {X ?  | X ^? = X}, where X? X ^? is the symplectic involution. We prove that G  =  G ₁exp  ∪ i G ₁exp . The key point of the proof is to study in detail the set exp ; and for that purpose we introduce the J-twisted Pfaffian of size 2n defined on the set of all 2n × 2n matrices X satisfying X ^? = X, which is here a natural counterpart of the standard Pfaffian.