Search Results for ""

Let P be a finite partially ordered set, then an antichain in P is a set of pairwise incomparable elements. Antichains are also called Sperner systems in older literature ...

An independent vertex set of a graph G is a subset of the vertices such that no two vertices in the subset represent an edge of G. The figure above shows independent sets ...

X subset= R^n is subanalytic if, for all x in R^n, there is an open set U and a bounded semianalytic set Y subset R^(n+m) such that X intersection U is the projection of Y ...

The Banach-Steinhaus theorem is a result in the field of functional analysis which relates the "size" of a certain subset of points defined relative to a family of linear ...

The axiom of Zermelo-Fraenkel set theory which asserts the existence for any set a and a formula A(y) of a set x consisting of all elements of a satisfying A(y), exists x ...

Let G be an open subset of the complex plane C, and let L_a^2(G) denote the collection of all analytic functions f:G->C whose complex modulus is square integrable with ...

Let T be an ergodic endomorphism of the probability space X and let f:X->R be a real-valued measurable function. Then for almost every x in X, we have 1/nsum_(j=1)^nf ...

Every bounded infinite set in R^n has an accumulation point. For n=1, an infinite subset of a closed bounded set S has an accumulation point in S. For instance, given a ...

A cadlag function is a function, defined on R or a subset of R, that is right continuous and has a left limit. The acronym cadlag comes from the French "continue à droite, ...

Let P be a finite partially ordered set. A chain in P is a set of pairwise comparable elements (i.e., a totally ordered subset). The partial order length of P is the maximum ...