Cross-cuts in the power set of an infinite set

In the power setP(E) of a setE, the sets of a fixed finite cardinalityk form across-cut, that is, a maximal unordered setC such that ifX, Y E satisfyXY, X someX inC, andY someY inC, thenXZY for someZ inC. ForE=, ₁, and ₂, it is shown with the aid of the continuum hypothesis thatP(E) has cross-cuts consisting of infinite sets with infinite complements, and somewhat stronger results are proved for and ₁.The work reported here has been partially supported by NSERC Grant No. A8054.     

Homogeneity in finite ordered sets

A tower in an ordered set (X, ) is defined to be a subsetS ofX which has the property that for everysS there is a maximal chainC in {xX|xs} which is wholly contained inS. An ordered set (X, ) is called tower-homogeneous if every order isomorphism between towers in (X, ) can be extended to an automorphism of (X, ). It is shown that a finite ordered set is tower-homogeneous if and only if it can be built up from singletons stepwise by constructions of three different types.     

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.     

The PT-order and the fixed point property

The PT-order, or passing through order, of a poset P is a quasi order defined on P so that ab holds if and only if every maximal chain of P which passes throug a also passes through b. We show that if P is chain complete, then it contains a subset X which has the properties that (i) each element of X is -maximal, (ii) X is a -antichain, and (iii) X is -dominating; we call such a subset a -good subset of P. A -good subset is a retract of P and any two -good subsets are order isomorphic. It is also shown that if P is chain complete, then it has the fixed point property if and only if a -good subset also has the fixed point property. Since a retract of a chain complete poset is also chain complete, the construction may be iterated transfinitely. This leads to the notion of the core of P (a -good subset of itself) which is the transfinite analogue of the core of a finite poset obtained by dismantling.Research partially supported by grants from the National Natural Science Foundation of China and The Natural Science Foundation of Shaanxi province.Research supported by NSERC grant #69-0982.     

Partially ordered permutation groups

In this note we discuss permutation groups (G, ) in which the set admits aG-invariant order. By aG-invariant partial order (G-partial order) we mean a partial order < of such that < implies g<g, for all and in andg inG. If the set admits aG-partial order which is a total order, then (G, ) is an O-permutation group (orderable permutation group).The main concern of this paper is the development of a foundation for partially ordered permutation groups analogous to the existing one for partially ordered groups, as found in Fuchs [2].     

Images of two-dimensional motivic Galois representations

Let M be a two-dimensional motive which is pure of weight w over a number field K and let (: G_K Aut(H(M) )) be the system of the -adic realizations. Choose G_K-invariant -lattices T of H(M) and let (:G_K GL (T))be the corresponding system of integral representations. Then either for almost all primes (G_K) consist of all the elements of GL(T) with determinant in ( ^*)^–w or the system () is associated to algebraic Hecke characters. We also can prove an adelic version of our results.Mathematics Subject Classification (2000): 11F80     

Factorization of a selfadjoint nonanalytic operator function II. Single spectral zone

We consider a selfadjoint and smooth enough operator-valued functionL() on the segment [a, b]. LetL(a)0,L(b)0, and there exist two positive numbers and such that the inequality |(L()f, f)|< ([a, b] f=1) implies the inequality (L'()f, f)>. Then the functionL() admits a factorizationL()=M()(I-Z) whereM() is a continuous and invertible on [a, b] operator-valued function, and operatorZ is similar to a selfadjoint one. This result was obtained in the first part of the present paper [10] under a stronge conditionL()0 ( [a,b]). For analytic functionL() the result of this paper was obtained in [13].     

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.     

Note on initial topologies on rational vector spaces induced by realvalued linear mappings

LetG be a vector space over the field of rational numbers andf, g:G -linear mappings. equipped with the usual norm topology. Denote by _f , _g the initial topologies onG induced byf respectivelyg.Then the following result holds: If there is a nonvoid open setU whose complement contains at least one inner point such thatf ^–1 U _g , then there is ac withf=cg. In particular, iff0, the topologies coincide.Furthermore, a -linear mappingh: (G, _f )(G, _g ) is continuous if and only if there is a real constantc withg ^o h=cf.Dedicated to Professor János Aczél on his 60th birthday     

The core of a chain complete poset with no one-way infinite fence and no tower

Like dismantling for finite posets, a perfect sequence = P : of a chain complete posetP represents a canonical procedure to produce a coreP . It has been proved that if the posetP contains no infinite antichain then this coreP is a retract ofP andP has the fixed point property iffP has this property. In this paper the condition of having no infinite antichain is replaced by a weaker one. We show that the same conclusion holds under the assumption thatP does not contain a one-way infinite fence or a tower.Supported by a grant from The National Natural Science Foundation of China.     

Generalizations of Tarski's fixed point theorem for order varieties of complete meet semilattices

A poset P is -conditionally complete ( a cardinal) if every set X P all of whose subsets of cardinality < have an upper bound has a least upper bound. For we characterize the subposets of a -complete poset which can occur as the set of fixed points of some montonic function on P. This yields a generalization of Tarski's fixed point theorem. We also show that for every the class of -conditionally complete posets forms an order variety and we exhibit a simple generating poset for each such class.Research supported in part by NSERC while the author was visiting Professor Ivo Rosenberg at the Université de Montreal.Research supported in part by NSF-grant DMS-8703743.     

Universal correlations in finite posets

Posets A, BX×X, with X finite, are said to be universally correlated (AB) if, for all posets R over X, (i.e., all posets RY×Y with XY), we have P(RA) P(RB)P(RAB) P(R). Here P(RA), for instance, is the probability that a randomly chosen bijection from Y to the totally ordered set with |Y| elements is a linear extension of RA. We show that AB iff, for all posets R over X, P(RA) P(RB)P(RAB) P(R(AB)).Winkler proved a theorem giving a necessary and sufficient condition for AB. We suggest an alteration to his proof, and give another condition equivalent to AB.Daykin defined the pair (A, B) to be universally negatively correlated (A B) if, for all posets R over X, P(RA) P(RB)P(RAB) P(R(AB)). He suggested a condition for AB. We give a counterexample to that conjecture, and establish the correct condition. We write AB if, for all posets R over X, P(RA) P(RB)P(RAB) P(R). We give a necessary and sufficient condition for AB.We also give constructive techniques for listing all pairs (A, B) satisfying each of the relations AB, AB, and AB.     

Convergence of epigraphs and of sublevel sets

Let LSC(X) be the set of the proper lower semicontinuous extended real-valued functions defined on a metric spaceX. Given a sequence f _n in LSC(X) and a functionf LSC(X), we show that convergence of f _n tof in several variational convergence modes implies that for each , the sublevel set at height off is the limit, in the same variational sense, of an appropriately chosen sequence of sublevel sets of thef _n, at height _n approaching . The converse holds true whenever a form of stability of the sublevel sets of the limit function is verified. The results are obtained by regarding a hyperspace topology as the weakest topology for which each member of an appropriate family of excess functionals is upper semicontinuous, and each member of an appropriate family of gap functionals is lower semicontinuous. General facts about the representation of hyperspace topologies in this manner are given.     

Computations in choice groupoids

Defining achoice as a mapping of the subsets of a setX into their respective subsets, a one-to-one (and naturally) corresponding binary operation,sequential choice, is identified under which the power set ofX is closed as achoice groupoid. A complete logical diagram is given, exhibiting all the implications between conjunctions of the seven conditions: (1) idempotence, (2) consistency, (3) absorbence, and (4) homomorphism of a choice, and (5) commutativity, (6) associativity, and (7) path-independence of the corresponding sequential choice.     

Posets isomorphic to their extensions

A standard extension for a poset P is a system Q of lower ends (descending subsets) of P containing all principal ideals of P. An isomorphism between P and Q is called recycling if [Y]Q for all YQ. The existence of such an isomorphism has rather restrictive consequences for the system Q in question. For example, if Q contains all lower ends generated by chains then a recycling isomorphism between P and Q forces Q to be precisely the system of all principal ideals. For certain standard extensions Q, it turns out that every isomorphism between P and Q (if there is any) must be recycling. Our results include the well-known fact that a poset cannot be isomorphic to the system of all lower ends, as well as the fact that a poset is isomorphic to the system of all ideals (i.e., directed lower ends) only if every ideal is principal.     

Generation of alternating groups by pairs of conjugates

Considering the conjugacy classes of the alternating group of degreen, those classes that contain a pair of generators are in the majority. In fact, the proportion of such classes is 1 –(n), and(n) 0 asn .     

First order properties of random posets

Let =(n,p) be a binary relation on the set [n]={1, 2, ..., n} such that (i,i) for every i and (i,j) with probability p, independently for each pair i,j [n], where i<j. Define as the transitive closure of and denote poset ([n], ) by R(n, p). We show that for any constant p probability of each first order property of R(n, p) converges as n .     

Automorphism groups of comparability and covering graphs

Let G be a group and H a subgroup of G. It is shown that there exists a partially ordered set (X, ) such that G is isomorphic to the group of all automorphisms of the comparability graph of (X, ) and such that under this isomorphism H is mapped onto the group of all order-automorphisms of (X, ). There also exists a partially ordered set (Y, ) such that G is isomorphic to the group of all automorphisms of the covering graph of (Y, ) and such that under this isomorphism H is mapped onto the group of all order-automorphisms of (Y, ). In this representation X and Y can be taken to be finite if G is finite and of the same cardinality as G if G is infinite.     

Nonstandard analysis of ordered sets

We introduce a nonstandard approach to the study of ordered setsX based on a classification of the elements of the ordered set *X into three types, upward, downward, and lateral, which may be thought of dynamically as arising from the possibilities of upward, downward, and lateral motion withinX. Initial applications include the characterization thatX has no infinite diverse subset iff *X has no lateral elements, a result subsequently exploited in work on the interval topology and order-compatibility, where we give a nonstandard proof of Naito's result that ifX has no infinite diverse subset, it has a unique order-compatible topology. We also describe how the completion of a nonempty linearly ordered setX may be obtained as a quotient of *X.     

On the product of sign vectors and unit vectors

For a fixed unit vectora=(a ₁,...,a _n )S ^n-1, consider the 2 ⁿ sign vectors=(₁,..., _n ){±1{ ⁿ and the corresponding scalar products^·a = _n ⁱ⁼¹ = _i a _i . The question that we address is: for how many of the sign vectors must^.a lie between–1 and 1. Besides the straightforward interpretation in terms of the sums ±a ₂ , this question has appealing reformulations using the language of probability theory or of geometry.The natural conjectures are that at least 1/2 the sign vectors yield |.a|1 and at least 3/8 of the sign vectors yield |.a|<1 (the latter excluding the case when |a _i |=1 for somei). These conjectured lower bounds are easily seen to be the best possible. Here we prove a lower bound of 3/8 for both versions of the problem, thus completely solving the version with strict inequality. The main part of the proof is cast in a more general probabilistic framework: it establishes a sharp lower bound of 3/8 for the probability that |X+Y|<1, whereX andY are independent random variables, each having a symmetric distribution with variance 1/2.We also consider an asymptotic version of the question, wheren along a sequence of instances of the problem satisfying ||a||0. Our result, best expressed in probabilistic terms, is that the distribution of .a converges to the standard normal distribution, and in particular the fraction of sign vectors yielding .a between –1 and 1 tends to 68%.This research was supported in part by the Institute for Mathematics and its Applications with funds provided by the National Science Foundation.