Two results concerning symmetric bi-derivations on prime rings

Summary LetR be a ring. A bi-additive symmetric mappingD(.,.): R × R R is called a symmetric bi-derivation if, for any fixedy R, the mappingx D(x, y) is a derivation. The purpose of this paper is to prove two results concerning symmetric bi-derivations on prime rings. The first result states that, ifD ₁ andD ₂ are symmetric bi-derivations on a prime ring of characteristic different from two and three such thatD ₁(x, x)D ₂(x,x) = 0 holds for allx R, then eitherD ₁ = 0 orD ₂ = 0. The second result proves that the existence of a nonzero symmetric bi-derivation on a prime ring of characteristic different from two and three, such that [[D(x, x),x],x] Z(R) holds for allx R, whereZ(R) denotes the center ofR, forcesR to be commutative.     

On a theorem of J. Vukman

Summary LetR be a ring. A bi-additive symmetric mappingD:R × R R is called a symmetric bi-derivation if, for any fixedy R, the mappingx D(x, y) is a derivation. J. Vukman [2, Theorem 2] proved that, ifR is a non-commutative prime ring of characteristic not two and three, and ifD:R × R R is a symmetric bi-derivation such that [D(x, x), x] lies in the center ofR for allx R, thenD = 0. This result is in the spirit of the well-known theorem of Posner [1, Theorem 2], which states that the existence of a nonzero derivationd on a prime ringR, such that [d(x), x] lies in the center ofR for allx R, forcesR to be commutative. In this paper we generalize the result of J. Vukman mentioned above to nonzero two-sided ideals of prime rings of characteristic not two and we prove the following. Theorem.Let R be a non-commutative prime ring of characteristic different from two, and I a nonzero two-sided ideal of R. Let D: R × R R be a symmetric bi-derivation. If [D(x, x), x] lies in the center of R for all x I, then D = 0.     

Waterman classes and triangular sums of double Fourier series

Let ^a ={nln^a (n+1)}, where a R. The following results are established: For every &fnof ^a BV ((- ]²), the triangular partial sums of its Fourier series are uniformly bounded if a = -1, and converge everywhere if a < -1.For every a>0, there exists &fnof ^a BV ((- ]²) such that the triangular partial sums of its Fourier series are unbounded at the point (0;0).     

An implicit function theorem: Comment

In Ref. 1, Jittorntrum proposed an implicit function theorem for a continuous mappingF:R ⁿ ×R ^m R ⁿ, withF(x ⁰,y ⁰)=0, that requires neither differentiability ofF nor nonsingularity of _x F(x ⁰,y ⁰). In the proof, the local one-to-one condition forF(·,y):A R ⁿ R ⁿ for ally B is consciously or unconsciously treated as implying thatF(·,y) mapsA one-to-one ontoF(A, y) for ally B, and the proof is not perfect. A proof can be given directly, and the theorem is shown to be the strongest, in the sense that the condition is truly if and only if.     

The lyapunov equation and the problem of stability for linear bounded discrete-time systems in Hilbert space

This paper is devoted to a study of the properties of the equationA ^*FA–F=–G, where FL() is unknown, AL(), GL() is positive and is a Hilbert space. It is shown that necessary and sufficient (in some sense) conditions for the existence of positive definite solutions of this equation are directly connected with the stability of infinite dimensional linear systemx _k+1=Ax _k . The relationships between stability of such a system and stability of a continuous-time system generated by a strongly continuous semigroup are given also. As an example the case of the delayed system in Rⁿ is considered.This work was supported in part by the Polish Academy of Sciences under the contract Problem Miedzyresortowy I.1, Grupa Tematyczna 3 This paper was written while the author was with the Instytut Automatyki, the same university.     

On Gauss quadrature formulas with equal weights

Summary It is well known that the Chebyshev weight function (1–x ²)^–1/2 is the only weight function (up to a linear transformation) for which then point Gauss quadrature formula has equal weights for alln. In this paper we describe all weight functions for which thenm point Gauss quadrature formula has equal weights for alln, wherem is fixed.     

Hahn-Banach extension property for Banach spaces over non-archimedean fields

LetK be a locally compact non-archimedean non-trivially valued field. It is proved the theorem: For a Banach space overK containing a dense subspace with the Hahn-Banach extension property one of the following two mutually exclusive conditions holds:E is a non-archimedean Banach space or the space {xE:f(x)=0 for allfE ^*} has no non-trivial continuous linear functionals. Two corollaries are also obtained.     

Positive Solutions for a Singular Nonlinear Problem on a Bounded Domain in R 2

For a bounded regular Jordan domain in R ², we introduce and study a new class of functions K() related on its Green function G. We exploit the properties of this class to prove the existence and the uniqueness of a positive solution for the singular nonlinear elliptic equation u+(x,u)=0, in D(), with u=0 on and uC(), where is a nonnegative Borel measurable function in ×(0,) that belongs to a convex cone which contains, in particular, all functions (x,t)=q(x)t ^–,>0 with nonnegative functions qK(). Some estimates on the solution are also given.     

On a certain identity satisfied by a derivation and an arbitrary additive mapping II

Summary The structure of prime ringsR and nonzero derivationsd onR, satisfyingd(x)f(x) = 0 for allx R, is described,f being a nonzero additive mapping ofR. Supported in part by a grant from the Ministry of Science of Slovenia.     

Transversally bounded lattices

A problem stemming from a boundedness question for torsion modules and its translation into ideal lattices is explored in the setting of abstract lattices. Call a complete lattice L transversally bounded (resp., uniformly transversally bounded) if for all families (X _i)_iIof nonempty subsets of L with the property that {x _iiI}<1 for all choices of x _iX _i, almost all of the sets X _ihave join smaller than 1 (resp., _jJ X _jhas join smaller than 1 for some cofinite subset J of I). It is shown that the lattices which are transversally bounded, but not uniformly so, correspond to certain ultrafilters with peculiar boundedness properties similar to those studied by Ramsey. The prototypical candidates of the two types of lattices which one is led to construct from ultrafilters (in particular the lattices arising from what will be called Ramsey systems) appear to be of interest beyond the questions at stake.     

Spectral properties of cosine operator functions

LetA be the generator of a cosine functionC _t ,t R in a Banach spaceX; we shall connect the existence and uniqueness of aT-periodic mild solution of the equationu = Au + f with the spectral property 1 (C _T ) and, in caseX is a Hilbert space, also with spectral properties ofA. This research was supported in part by DAAD, West Germany.     

Efficiency of Proximal Bundle Methods

We give efficiency estimates for proximal bundle methods for finding f_*min_Xf, where f and X are convex. We show that, for any accuracy <0, these methods find a point x^kX such that f(x^k)–f^* after at most k=O(1/³) objective and subgradient evaluations.     

On the dimensions of ordered sets of bounded degree

Let P be a partially ordered set. Define k = k (P) = max _p |{x P : p < x or p = x}|, i.e., every element is comparable with at most k others. Here it is proven that there exists a constant c (c < 50) such that dim P < ck(log k)². This improves an earlier result of Rödl and Trotter (dim P 2 k ²+2). Our proof is nonconstructive, depending in part on Lovász' local lemma.Supported in part by NSF under Grant No. MCS83-01867 and by a Sloan Research Fellowship.     

The design centering problem as a D.C. programming problem

The following problem is studied: Given a compact setS inR ⁿ and a Minkowski functionalp(x), find the largest positive numberr for which there existsx S such that the set of ally R ⁿ satisfyingp(y–x) r is contained inS. It is shown that whenS is the intersection of a closed convex set and several complementary convex sets (sets whose complements are open convex) this design centering problem can be reformulated as the minimization of some d.c. function (difference of two convex functions) overR ⁿ . In the case where, moreover,p(x) = (x ^T Ax)^1/2, withA being a symmetric positive definite matrix, a solution method is developed which is based on the reduction of the problem to the global minimization of a concave function over a compact convex set.     

Projectivities in Moufang-Klingenberg planes

Let = = (,,) be a Moufang-Klingenberg plane coordinatized by a local alternative ring R. We define the projectivities of a line g in geometrically as products of perspectivities. It is shown that under certain conditions the group of projectivities of g is generated by the algebraically defined permutations xx+t (tR), xcx (cR a unit), xx ^–.     

Quadratically constrained quadratic programming: Some applications and a method for solution

The problem (QPQR) considered here is: minimizeQ ₁ (x) subject toQ _i (x) 0,i M ₁ {2,...,m},x P R ⁿ, whereQ _i (x), i M {1} M ₁ are quadratic forms with positive semi-definite matrices, andP a compact nonempty polyhedron of Rⁿ. Applications of (QPQR) and a new method to solve it are presented.Letu S={u R ^m;u 0, u _i= l}be fixed;then the problem:iM minimize u _iQ_i (x (u)) overP, always has an optimal solutionx (u), which is either feasible, iM i.e. u C₁ {u S;Q _i (x (u)) 0,i M ₁} or unfeasible, i.e. there exists ani M ₁ withu C {u S; Q_i(x(u)) 0}.Let us defineC _i C_i S _i withS _i {u S; u _i=0}, i M. A constructive method is used to prove that C _i is not empty and thatx (û) withiM û C _i characterizes an optimal solution to (QPQR). Quite attractive numerical results have been reached with this method.

---

Zusammenfassung Die vorliegende Arbeit befaßt sich mit Anwendungen und einer neuen Lösungsmethode der folgenden Aufgabe (QPQR): man minimiere eine konvexe quadratische ZielfunktionQ _i (x) unter Berücksichtigung konvexer quadratischer RestriktionenQ _i (x) 0, iM ₁ {2,...,m}, und/oder linearer Restriktionen.·Für ein festesu S {u R ^m;u 0, u _i=1},M {1} M₁ besitzt das Problem:iM minimiere die konvexe quadratische Zielfunktion u _i Q_i (x (u)) über dem durch die lineareniM Restriktionen von (QPQR) erzeugten, kompakten und nicht leeren PolyederP R ⁿ, immer eine Optimallösungx (u), die entweder zulässig ist: u C₁ {u S;Q ₁ (x (u)) 0,i M ₁} oder unzulässig ist, d.h. es existiert eini M ₁ mitu C_i {u S;Q _i (x(u))0}.Es seien folgende MengenC _i C_i S _i definiert, mitS _i {u S;u _i=0}, i M. Es wird konstruktiv bewiesen, daß C _i 0 undx (û) mitû C _i eine Optimallösung voniM iM (QPQR) ist; damit ergibt sich eine Methode zur Lösung von (QPQR), die sich als sehr effizient erwiesen hat. Ein einfaches Beispiel ist angegeben, mit dem alle Schritte des Algorithmus und dessen Arbeitsweise graphisch dargestellt werden können.

---

---

An earlier version of this paper was written during the author's stay at the Institute for Operations Research, Swiss Federal Institute of Technology, Zürich.     

Symmetric bi-derivations on prime and semi-prime rings

Summary LetR be a ring. A bi-additive symmetric mappingD(.,.): R × R R is called a symmetric bi-derivation if, for any fixedy R, a mappingx D(x, y) is a derivation. The purpose of this paper is to prove some results concerning symmetric bi-derivations on prime and semi-prime rings. We prove that the existence of a nonzero symmetric bi-derivationD(.,.): R × R R, whereR is a prime ring of characteristic not two, with the propertyD(x, x)x = xD(x, x), x R, forcesR to be commutative. A theorem in the spirit of a classical result first proved by E. Posner, which states that, ifR is a prime ring of characteristic not two andD ₁,D ₂ are nonzero derivations onR, then the mappingx D ₁(D ₂ (x)) cannot be a derivation, is also presented.     

The caratheodory number for thek-core

Thek-core of the setS ⁿ is the intersection of the convex hull of all setsA S with ¦SA¦<-k. The Caratheodory number of thek-core is the smallest integerf (d,k) with the property thatx core _{kS, S} ⁿ implies the existence of a subsetT S such thatx core_kT and ¦T¦f (d, k). In this paper various properties off(d, k) are established.Research of this author was partially supported by Hungarian National Science Foundation grant no. 1812.     

Lexicographic quasiconcave multiobjective programming

Summary Letf _i :A R ben real-valued objective functions on a convex setA -K ^m ,K:=R orC, n, mN. Letg: A R ⁿ be defined by , where for eachxA, (i ₁ (x), ..., i _n (x)) is a permutation of (1, ...,n) such that . In this paper we treat the problem of findingx ^*A such that , wherel-max denotes the lexicographic maximum. If the f_i's are strongly quasiconcave we can reduce the problem stepwise until finally it is in the form of a scalar programming problem. Further, we consider conditions for the existence and uniqueness of a solution and discuss the relationship of the problem to the vector maximum (i.e. Pareto) and maxmin (i.e. Chebychev) problems.

---

Zusammenfassung f _i :AR seienn reellwertige Zielfunktionen über einer konvexen MengeA-K ^m ,K:=R oderC, n, mN. g:AR ⁿ sei definiert durch , wobei für jedesxA (i ₁ (x), ... i _n (x)) eine Permutation von (1, ...,n) derart ist, daß Wir betrachten das Problem, einx ^*A so zu finden, daß , wobeil-max das lexikographische Maximum bedeute. Falls dief _i stark quasikonkav sind, läßt sich das Problem stufenweise reduzieren, bis es schließlich die Gestalt eines skalaren Optimierungsproblems annimmt. Wir geben Existenz- und Eindeutigkeitsbedingungen an und besprechen Zusammenhänge mit dem Vektormaximumproblem (d.h. Pareto-Optimierung) und dem Maxmin-Problem (d.h. Tschebyscheff-Optimierung).