Cylinder set

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

In mathematics, a cylinder set is the natural set in a product space. Such sets are the basis for the open sets of the product topology and, they are a generating family of the cylinder sigma-algebra, which in the countable case is the product sigma-algebra.

Cylinder sets are particularly useful in providing the base of the natural topology of the product of a countable number of copies of a set. If V is a finite set, then each element of V can be represented by a letter, and the countable product can be represented by the collection of strings of letters.

General definition[edit]

Consider the Cartesian product of some spaces , indexed by some index . The canonical projection corresponding to some is the function that maps every element of the product to its component. A cylinder set is a preimage of a canonical projection or finite intersection of such preimages. Explicitly, it is a set of the form,

for any choice of and finite set of indexes and subsets for .

Then, in case of topological spaces, the product topology is generated by cylinder sets corresponding to the coordinates open sets. That is cylinders of the form where are open sets. In the same manner, in case of measurable spaces, the cylinder sigma-algebra is the one which is generated by cylinder sets corresponding to the coordinats measurable sets. In case of countable product, the cylinder sigma-algebra is the product sigma-algebra.[1]

The restriction that the cylinder set be the intersection of a finite number of open cylinders is important; allowing infinite intersections generally results in a finer topology. In the latter case, the resulting topology is the box topology; cylinder sets are never Hilbert cubes.

Cylinder sets in products of discrete sets[edit]

Let be a finite set, containing n objects or letters. The collection of all bi-infinite strings in these letters is denoted by

where denotes the integers. The natural topology on is the discrete topology. Basic open sets in the discrete topology consist of individual letters; thus, the open cylinders of the product topology on are

The intersections of a finite number of open cylinders are the cylinder sets

Cylinder sets are clopen sets. As elements of the topology, cylinder sets are by definition open sets. The complement of an open set is a closed set, but the complement of a cylinder set is a union of cylinders, and so cylinder sets are also closed, and are thus clopen.

Definition for vector spaces[edit]

Given a finite or infinite-dimensional vector space over a field K (such as the real or complex numbers), the cylinder sets may be defined as

where is a Borel set in , and each is a linear functional on ; that is, , the algebraic dual space to . When dealing with topological vector spaces, the definition is made instead for elements , the continuous dual space. That is, the functionals are taken to be continuous linear functionals.

Applications[edit]

Cylinder sets are often used to define a topology on sets that are subsets of and occur frequently in the study of symbolic dynamics; see, for example, subshift of finite type. Cylinder sets are often used to define a measure, using Kolmogorov extension theorem; for example, the measure of a cylinder set of length m might be given by 1/m or by . Since strings in can be considered to be p-adic numbers, some of the theory of p-adic numbers can be applied to cylinder sets, and in particular, the definition of p-adic measures and p-adic metrics apply to cylinder sets. This type of measure spaces appears in the theory of dynamical systems and they are called Nonsingular odometer. A generalization of these systems is Markov odometer. Cylinder sets may be used to define a metric on the space: for example, one says that two strings are ε-close if a fraction 1-ε of the letters in the strings match.

Cylinder sets over topological vector spaces are the core ingredient in the formal definition of the Feynman path integral or functional integral of quantum field theory, and the partition function of statistical mechanics.

See also[edit]

References[edit]

  1. ^ Gerald B Folland (2013). Real Analysis: Modern Techniques and Their Applications. John Wiley & Sons. p. 23. ISBN 0471317160.