From Encyclopedia of Mathematics
Jump to: navigation, search

A "countably-ramified" system of sets, i.e. a family of subsets of a set , indexed by all finite sequences of natural numbers. An -system is called regular if . A sequence of elements of an -system indexed by all segments of one and the same finite sequence of natural numbers is called a chain of this -system. The intersection of all elements of a chain is called its kernel, and the union of all kernels of all chains of an -system is called the kernel of this -system, or the result of the -operation applied to this -system, or the -set generated by this -system. Every -system can be regularized without changing the kernel (it suffices to put ). If is a system of sets, then the kernels of the -system composed from the elements of are called the -sets generated by . The -sets generated by the closed sets of a topological space are called the -sets of this space.


[1] P.S. Aleksandrov, "Einführung in die Mengenlehre und die allgemeine Topologie" , Deutsch. Verlag Wissenschaft. (1984) (Translated from Russian)
[2] K. Kuratowski, "Topology" , 1 , Acad. Press (1966) (Translated from French)


The -operation is an important tool in descriptive set theory. It was introduced by M.Ya. Suslin, hence it is also known as the Suslin operation (also Souslin operation). In this connection, an -system is also called a Suslin (Souslin) scheme. See also -operation; -set.

While [2] is the standard reference for classical results, a modern approach can be found in [a1].


[a1] J.P.R. Christensen, "Topology and Borel structure" , North-Holland (1974)
How to Cite This Entry:
A-system. A.G. El'kin (originator), Encyclopedia of Mathematics. URL:
This text originally appeared in Encyclopedia of Mathematics - ISBN 1402006098