Regular closure operators

In an E,M-categoryX for sinks, we identify necessary conditions for Galois connections from the power collection of the class of (composable pairs) of morphisms inM to factor through the lattice of all closure operators onM, and to factor through certain sublattices. This leads to the notion ofregular closure operator. As one byproduct of these results we not only arrive (in a novel way) at the Pumplün-Röhrl polarity between collections of morphisms and collections of objects in such a category, but obtain many factorizations of that polarity as well. (One of these factorizations constituted the main result of an earlier paper by the same authors). Another byproduct is the clarification of the Salbany construction (by means of relative dominions) of the largest idempotent closure operator that has a specified class ofX-objects as separated objects. The same relation that is used in Salbany's relative dominion construction induces classical regular closure operators as described above. Many other types of closure operators can be obtained by this technique; particular instances of this are the idempotent and modal closure operators that in a Grothendieck topos correspond to the Grothendieck topologies.Dedicated to Professor Dieter Pumplün, on his 60th birthdayResearch partially supported by the Faculty of Arts and Sciences, University of Puerto Rico, Mayagüez Campus during a sabbatical visit at Kansas State University.     

Equivariant closure operators and trisp closure maps

A trisp closure map ? is a special map on the vertices of a trisp (triangulated space) T with the property that T collapses onto the subtrisp induced by the image of ?. We study the interaction between trisp closure maps and group operations on the trisp, and give conditions such that the quotient map is again a trisp closure map. Special attention is on the case that the trisp is the nerve of an acyclic category, and the relationship between trisp closure maps and closure operators on posets is studied.     

Weak subintegral closure of ideals

We describe some basic facts about the weak subintegral closure of ideals in both the algebraic and complex-analytic settings. We focus on the analogy between results on the integral closure of ideals and modules and the weak subintegral closure of an ideal. We start by giving a new geometric interpretation of the Reid–Roberts–Singh criterion for when an element is weakly subintegral over a subring. We give new characterizations of the weak subintegral closure of an ideal. We associate with an ideal I of a ring A an ideal I_>, which consists of all elements of A such that v(a)>v(I), for all Rees valuations v of I. The ideal I_> plays an important role in conditions from stratification theory such as Whitney's condition A and Thom's condition Af and is contained in every reduction of I. We close with a valuative criterion for when an element is in the weak subintegral closure of an ideal. For this, we introduce a new closure operation for a pair of modules, which we call relative weak closure. We illustrate the usefulness of our valuative criterion.     

Representations of structural closure operators

We continue the work of Blok and Jónsson by developing the theory of structural closure operators and introducing the notion of a representation between them. Similarities and equivalences of Blok-Jónsson turn out to be bijective representations and bijective structural representations, respectively. We obtain a characterization for representations induced by a transformer. In order to obtain a similar characterization for structural representations we introduce the notions of a graduation and a graded variable of an M-set. We show that several deductive systems, Gentzen systems among them, are graded M-sets having graded variables, and describe the graded variables in each case. In the last section we show that, for a sentential logic, having an algebraic semantics is equivalent to being representable in an equational consequence. This motivates the extension of the notion of having an algebraic semantics for Gentzen systems, hypersequents systems, etc. We prove that if a closure operator is representable by a transformer, then every extension of it is also representable by the same transformer. As a consequence we obtain that if one of these systems has an algebraic semantics, then so does any of its extensions with the same defining equations.     

Weak convergence of inner superposition operators

The equivalence of the weak (pointwise) and strong convergence of a sequence of inner superposition operators is proved as well as the criteria for such convergence are provided. Besides, the problems of continuous weak convergence of such operators and of representation of a limit operator are studied.

     

Nemitsky's operators and lower closure theorems

This paper focuses on certain analytic criteria given by the authors in earlier works, for the geometric property of upper semicontinuity of set-valued functions, used in the proofs of lower closure theorems, and hence in existence theory. In particular, it is observed that, under Filippov-type condition (namely, when the set of controls is bounded in measure or in norm), mere Carathéodory-type continuity of the relevant functionsf is sufficient to guarantee a weak form of property (Q), and in turn the lower closure theorems.This work has been partially supported by Research Project AFOSR-71-2122 at the University of Michigan, Ann Arbor, Michigan.     

Extension closure of relative syzygy modules

In this paper we introduce the notion of relative syzygy modules.We then study the extensionclosure of the category of modules consisting of relative syzygy modules(resp.relative k-torsionfree modules).     

Weak type inequalities of maximal Hankel convolution operators

In this paper we characterize weak type (1,1) inequalities for Hankel convolution operators by means of discrete methods. Partially supported by DGICYT Grant PB 94-0591 (Spain).     

Weak and strong extensions of ordinary differential operators

Let A be a second order differential operator with positive leading term defined on an interval J of R. In this paper we study conditions for the equality D₀(A) = D₁(A) to hold. Here D₀(A) and D₁(A) are the domains of the minimal and maximal extensions of A respectively. Under the general assumption that $\text{A(1)}\text{and}\text{A}{}^1\text{(1)}$ are bounded above it is proven that under certain conditions D₀(A) = D₁(A) if functions which are constant near the boundaries of J are in $\text{D}{}_0\text{(A) ∩ D}{}_0\text{(A}{}^1\text{)}$ whenever they are in $\text{D}{}_1\text{(A) ∩ D}{}_1\text{(A}{}^1\text{)}$. In particular if A is formally selfadjoint and 1 ?D₁(A) then D₁(A) = D₀(A) if and only if 1 ?D₀(A). When the measure of J is infinite at both ends D₀(A) is always equal to D₁(A). This fact is used to show that the leading term of A as well as its terminal coefficient can be chosen arbitrarily (although not independently of one another) in such a way that the equality D₀ = D₁ holds.     

Algebraic closure operators and strong amalgamation bases

Axioms for a closure operator are given and it is proved that, for suitable classes, a unique largest closure operator exists. Necessary and sufficient conditions in terms of closure properties are given for structures to be strong amalgamation bases. Research supported by NSF GP 34091X Presented by B. Jónsson     

Weak estimates for commutators of fractional integral operators

By introducing a kind of maximal operator of the fractional order associated with the mean Luxemburg norm and using the technique of the sharp function, the weak type LlogL estimates for the commutators of the fractional integral operator and the related maximal operator are established.     

Valuations and closure operators on finite lattices

Let L be a lattice. A function f:L→R (usually called evaluation) is submodular if f(x∧y)+f(x∨y)≤f(x)+f(y), supermodular if f(x∧y)+f(x∨y)≥f(x)+f(y), and modular if it is both submodular and supermodular. Modular functions on a finite lattice form a finite dimensional vector space. For finite distributive lattices, we compute this (modular) dimension. This turns out to be another characterization of distributivity (Theorem 3.9). We also present a correspondence between isotone submodular evaluations and closure operators on finite lattices (Theorem 5.5). This interplay between closure operators and evaluations should be understood as building a bridge between qualitative and quantitative data analysis.