In mathematics, the Suslin operation is an operation that constructs a set from a collection of sets indexed by finite sequences of positive integers. The Suslin operation was introduced by and . In Russia it is sometimes called the A-operation after Alexandrov. It is usually denoted by the symbol (a calligraphic capital letter A).
A Suslin scheme is a family
P=\{Ps:s\in\omega<\omega\}
X
lAP=
cup | |
x\in{\omega\omega |
Alternatively, suppose we have a Suslin scheme, in other words a function
M
n1,...,nk
M | |
n1,...,nk |
lA(M)=cup
\left(M | |
n1 |
\cap
M | |
n1,n2 |
\cap
M | |
n1,n2,n3 |
\cap...\right)
n1,...,nk,...
If
M
X
lA(M)
X
lA
M | |
n1,...,nk |
M
X
lA(lA(M))=lA(M)
lA(M)
If
M
lA(M)
For each finite sequence
s\in\omegan
Ns=\{x\in\omega\omega:x\upharpoonrightn=s\}
s
\omega\omega
X
f:\omega\omega\toX
Ps=\overline{f[Ns]}
P=\{Ps:s\in\omega<\omega\}
X
lAP=f[\omega\omega]