Appendix A: Examples of the implementation of the modified procedure
The following two examples illustrate the advantage of the modified procedure as compared to Hochberg's procedure. We use α= .05.
Example 1. P(1)= .02, P(2)= .03, P(3)= .2. Clearly, Hochberg's procedure rejects no hypothesis. The modified procedure starts by comparing P(3) with .05. Since it is larger, H(3) is retained, and we proceed to compare P(2) with 3α/4 = .0375. Since it is smaller, we can reject any hypothesis with a p-value less than or equal to α/2 = .025. Hence, H(1) can be rejected.
Example 2. P(1)= .009, P(2)= .015, P(3)= .025, P(4)= .04, P(5)= .2. Going through the steps of Hochberg's procedure, the first rejection occurs at the last step, where P(1) < α/5 = .01. Hence, Hochberg's procedure rejects H(1) only. For the modified procedure, going through the steps, P(3) < 2α/3 = .0333. We can then reject any hypothesis with a p-value less than or equal to α/3 = .0167. Hence, H(1) and H(2) can be rejected.
Appendix B: Calculation of the probability of (1)
Under the global null hypothesis, P(i), i= 1, …, n, are order statistics from n independent uniform U(0,1) random variables. For any 1 > C3≥C2≥C1≥C0 > 0, we can show the following:
- 1
Using the Binomial distribution,

.
- 2

can be partitioned into probabilities of disjoint events:
where
j1={n−k− 2, …, n−k} and
j2={max (0, 2 −j1), …, n−k−j1}.
Using the above partition repeatedly, we calculate (1) as follows:
For each Ak(n) in the summations above, i={1, …, n−k}, j1={1, …, k}, j2={max (0, 2 −j1), …, k−j1}, …, jk−1={max (0, k− 1 −j1−⋯−jk−2), …, k−j1−⋯−jk−2}. Note that n≥ 2 and Cn= 1/n. Hence, we can write:
((B1))
The set of critical values, Ci, i= 2, …, n, is either Hochberg's or the modified procedure, shown in Table 1. We use (B1) to calculate the Type I error shown in Table 2.
Appendix C: Proof of strong control of the FWE using the closure principle
Let H(1), …, H(n) be n hypotheses with corresponding ordered p-values, P(1), …, P(n) . Assume that for at least one i, 1 ≤i≤n, P(n+1−i)≤α (i+ 1)/2i. Let k= 1, …, r, for which P(k)≤α/i. According to the proposed procedure, all r hypotheses H(k), k= 1, …, r, can be rejected. To prove that this procedure has strong control of the FWE, we must show that every subset intersection hypothesis including H(k) as its component is also rejected by an α-level test. Consider the following two cases and the resulting partitions of H(1), .., H(n) .
Case 1: i= 1, H1:H(1), .., H(n). In this case, where we reject at the first step of the modified Hochberg procedure, all p-values are less than or equal to α; hence all subset intersection hypotheses formed from H1 are rejected at the first step by an α-level modified Hochberg procedure.
Case 2: i > 1, H1:H(1), .., H(r), H2:H(r+1), .., H(n+1−i), H3:H(n+2−i), .., H(n). In this case, H1 is the set of rejected hypotheses; H2 is a set of (retained) hypotheses with corresponding p-values satisfying α/i < P(l)≤α (i+ 1)/2i(l=r+ 1, …, n+ 1 −i); and H3 is the set of i− 1 retained hypotheses with corresponding p-values, P(m) > α (i+ 1)/2i(m=n+ 2 −i, …, n).
Now consider the following configurations of subset intersection hypotheses of case 2. Subset intersection hypotheses formed from H1 and H2, including at least one hypothesis from H1, have all of their corresponding p-values less than or equal to α; hence all of these subset intersection hypotheses will be rejected at the first step of an α-level modified Hochberg procedure. Turning to subset intersection hypotheses formed from H1,H2, and H3, including at least one hypothesis from H1, any such subset intersection hypothesis may include i′− 1 (i′≤i) hypotheses from H3. Note that α (i′+ 1)/2i′≥α (i+ 1)/2i and α/i′≥α/n. It follows that all p-values corresponding to the hypotheses from H2 are necessarily less than or equal to α (i′+ 1)/2i′ and all p-values corresponding to hypotheses from H1 are necessarily less than or equal to α/i′. Hence a modified Hochberg procedure will reject this these intersection hypotheses at step i′.
The above application of the closure principle indicates that the modified Hochberg procedure is a closed multiple test procedure which can implemented without the need to directly test every subset intersection hypothesis. This is referred to as a ‘shortcut’ version of the closed test procedure which is possible due to monotonicity of the critical values.