Professional Documents
Culture Documents
Benson
Benson
Benson
(P> Я) Φ (ρ'Ί </)· By induction, for each finite sequence (p, q,r,...) of zeros
and ones (binary markers) there is an open set Upqr,,,. Each finite sequence
defP q_ + _L + ...
2 22 23
in [0,1]. If t < t', then U(t) =f Up^~ С Up,q,r,... С Uplq,r,... d= U (t'). The
function
Ό ifx^y
U iff </>a -< ί^λ,λ e Λ. The set Φ is a partition of unity iff, то boot,
λ€Λ
N(Xi)CUx
implies there is a g\ such that K\ -< g\ ^ U\. Since there are only finitely
many pairwise different K\, there are only finitely many g\. At each x
дел λ€Λ
requirements. □
17
b) FOR EACH Χ, η(λ,χ) IS A NET, {λ -< μ} =>· {η(λ,χ) > η(μ,χ)}, AND
η(λ,χ) < e.
λ€Λ
/n^O.
properties