[26] Let (P, H) in Theorem 5.4.1 be small (for example, a constant) and prior P := m. Show that Theorem 5.4.1 is satisfied iff

[26] Let α(P, H) in Theorem 5.4.1 be small (for example, a constant) and prior P := m. Show that Theorem 5.4.1 is satisfied iff the data sample D is Pr(·|Hmdl)-random. Show also that this has probability going to one for the binary length n of the data increasing unboundedly (and the lim sup of the probability exceeds 1 − O(1/n)).
Comments. The choice of m as prior satisfies the condition of Theorem