Namespaces
Variants
Actions

Difference between revisions of "Regular lattice"

From Encyclopedia of Mathematics
Jump to: navigation, search
(Importing text file)
 
m (tex encoded by computer)
 
Line 1: Line 1:
A [[Conditionally-complete lattice|conditionally-complete lattice]] in which the following condition (also called the axiom of regularity) holds: For any sequence <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/r/r080/r080740/r0807401.png" /> of bounded sets for which
+
<!--
 +
r0807401.png
 +
$#A+1 = 12 n = 0
 +
$#C+1 = 12 : ~/encyclopedia/old_files/data/R080/R.0800740 Regular lattice
 +
Automatically converted into TeX, above some diagnostics.
 +
Please remove this comment and the {{TEX|auto}} line below,
 +
if TeX found to be correct.
 +
-->
  
<table class="eq" style="width:100%;"> <tr><td valign="top" style="width:94%;text-align:center;"><img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/r/r080/r080740/r0807402.png" /></td> </tr></table>
+
{{TEX|auto}}
 +
{{TEX|done}}
  
there exist finite subsets <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/r/r080/r080740/r0807403.png" /> with the same property (where <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/r/r080/r080740/r0807404.png" /> denotes convergence in order, cf. also [[Riesz space|Riesz space]]). Such lattices are most often met in functional analysis and in measure theory (for example, regular <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/r/r080/r080740/r0807405.png" />-spaces and Boolean algebras). They arise naturally in the problem of extending homomorphisms and positive linear operators. In a regular lattice the following two principles hold: a) the diagonal principle (if <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/r/r080/r080740/r0807406.png" /> and <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/r/r080/r080740/r0807407.png" />, then <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/r/r080/r080740/r0807408.png" /> for some sequence of indices <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/r/r080/r080740/r0807409.png" />); and b) the principle of countability of type (every bounded infinite set contains a countable subset with the same bounds). Conversely, a) and b) together imply the axiom of regularity. Examples of regular lattices are: Any <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/r/r080/r080740/r08074010.png" />-space and, in particular, any <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/r/r080/r080740/r08074011.png" />, <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/r/r080/r080740/r08074012.png" />; the Boolean algebra of measurable sets modulo sets of measure 0 in an arbitrary space with a finite countably-additive measure. Other examples of regular Boolean algebras are based on the negation of the [[Suslin hypothesis|Suslin hypothesis]].
+
A [[Conditionally-complete lattice|conditionally-complete lattice]] in which the following condition (also called the axiom of regularity) holds: For any sequence  $  \{ E _ {n} \} $
 +
of bounded sets for which
 +
 
 +
$$
 +
\sup  E _ {n}  \mathop \rightarrow \limits ^ {(}  o)  a ,\ \
 +
\inf  E _ {n}  \mathop \rightarrow \limits ^ {(}  o)  b ,
 +
$$
 +
 
 +
there exist finite subsets $  E _ {n}  ^  \prime  \subset  E _ {n} $
 +
with the same property (where $  \rightarrow  ^ {(} o) $
 +
denotes convergence in order, cf. also [[Riesz space|Riesz space]]). Such lattices are most often met in functional analysis and in measure theory (for example, regular $  K $-
 +
spaces and Boolean algebras). They arise naturally in the problem of extending homomorphisms and positive linear operators. In a regular lattice the following two principles hold: a) the diagonal principle (if $  x _ {nm} \rightarrow  ^ {(} o) x _ {n} $
 +
and $  x _ {n} \rightarrow  ^ {(} o) x $,  
 +
then $  x _ {nm _ {n}  } \rightarrow  ^ {(} o) x $
 +
for some sequence of indices $  m _ {n} $);  
 +
and b) the principle of countability of type (every bounded infinite set contains a countable subset with the same bounds). Conversely, a) and b) together imply the axiom of regularity. Examples of regular lattices are: Any $  K B $-
 +
space and, in particular, any $  L _ {p} $,  
 +
$  1 \leq  p < + \infty $;  
 +
the Boolean algebra of measurable sets modulo sets of measure 0 in an arbitrary space with a finite countably-additive measure. Other examples of regular Boolean algebras are based on the negation of the [[Suslin hypothesis|Suslin hypothesis]].
  
 
====References====
 
====References====
 
<table><TR><TD valign="top">[1]</TD> <TD valign="top">  L.V. Kantorovich,  B.Z. Vulikh,  A.G. Pinsker,  "Functional analysis in semi-ordered spaces" , Moscow-Leningrad  (1950)  (In Russian)</TD></TR></table>
 
<table><TR><TD valign="top">[1]</TD> <TD valign="top">  L.V. Kantorovich,  B.Z. Vulikh,  A.G. Pinsker,  "Functional analysis in semi-ordered spaces" , Moscow-Leningrad  (1950)  (In Russian)</TD></TR></table>
 
 
  
 
====Comments====
 
====Comments====
 
  
 
====References====
 
====References====
 
<table><TR><TD valign="top">[a1]</TD> <TD valign="top">  W.A.J. Luxemburg,  A.C. Zaanen,  "Theory of Riesz spaces" , '''I''' , North-Holland  (1972)</TD></TR></table>
 
<table><TR><TD valign="top">[a1]</TD> <TD valign="top">  W.A.J. Luxemburg,  A.C. Zaanen,  "Theory of Riesz spaces" , '''I''' , North-Holland  (1972)</TD></TR></table>

Latest revision as of 08:10, 6 June 2020


A conditionally-complete lattice in which the following condition (also called the axiom of regularity) holds: For any sequence $ \{ E _ {n} \} $ of bounded sets for which

$$ \sup E _ {n} \mathop \rightarrow \limits ^ {(} o) a ,\ \ \inf E _ {n} \mathop \rightarrow \limits ^ {(} o) b , $$

there exist finite subsets $ E _ {n} ^ \prime \subset E _ {n} $ with the same property (where $ \rightarrow ^ {(} o) $ denotes convergence in order, cf. also Riesz space). Such lattices are most often met in functional analysis and in measure theory (for example, regular $ K $- spaces and Boolean algebras). They arise naturally in the problem of extending homomorphisms and positive linear operators. In a regular lattice the following two principles hold: a) the diagonal principle (if $ x _ {nm} \rightarrow ^ {(} o) x _ {n} $ and $ x _ {n} \rightarrow ^ {(} o) x $, then $ x _ {nm _ {n} } \rightarrow ^ {(} o) x $ for some sequence of indices $ m _ {n} $); and b) the principle of countability of type (every bounded infinite set contains a countable subset with the same bounds). Conversely, a) and b) together imply the axiom of regularity. Examples of regular lattices are: Any $ K B $- space and, in particular, any $ L _ {p} $, $ 1 \leq p < + \infty $; the Boolean algebra of measurable sets modulo sets of measure 0 in an arbitrary space with a finite countably-additive measure. Other examples of regular Boolean algebras are based on the negation of the Suslin hypothesis.

References

[1] L.V. Kantorovich, B.Z. Vulikh, A.G. Pinsker, "Functional analysis in semi-ordered spaces" , Moscow-Leningrad (1950) (In Russian)

Comments

References

[a1] W.A.J. Luxemburg, A.C. Zaanen, "Theory of Riesz spaces" , I , North-Holland (1972)
How to Cite This Entry:
Regular lattice. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Regular_lattice&oldid=48481
This article was adapted from an original article by D.A. Vladimirov (originator), which appeared in Encyclopedia of Mathematics - ISBN 1402006098. See original article