Sets Have Simple Members

The combined Universal Probability M(D) of strings x in sets D is close to max M({x}) over x in D: their ~logs differ by at most D’s information j=I(D:H) about the halting sequence H. Thus if all x have complexity K(x) >k, D carries

i bits of information on each its x where i+j ~ k. Note that there are no ways to generate D with significant I(D:H).