Learn

Learning preferences

Make learning more comfortable. Changes apply immediately.

Enlarges page content, including diagrams and their labels. You can also use your browser’s zoom.

Choose the colours that are easiest for you to distinguish. Applies to lesson diagrams and lab plots. Labels, shapes, hatching and line patterns also distinguish meanings. Source photographs and raw image brightness stay unchanged; mask-only views are available for image overlays.

ExampleComparisonSample link

Saved in this browser on this device. Preferences are separate from progress backups.

Lesson 15 of 22

Build one test for a one-sided family

Use monotone ratios and stochastic ordering to control a composite null.

Loading your saved responses…

Try the optional starting-point checks and targeted refreshers. You can continue directly into this lesson.

Try

Test a Bernoulli probability against increases above p₀. In the previous lesson, every fixed larger probability p₁ produced the same ordering: larger success totals have larger likelihood ratios. This raises a stronger possibility. Could one upper-tail rule be most powerful against every p₁>p₀? The answer is yes for this one-sided binomial family when the rule’s size is calibrated at the null boundary and the whole null is controlled. The common ordering is useful precisely because it does not depend on which larger alternative is selected.

Predict

Predict where the largest rejection probability occurs under H₀:p≤p₀ for an upper-tail rule. Intuitively it is at p₀, but intuition must be converted into a stochastic-ordering argument. Merely checking a few smaller parameter values cannot prove a supremum statement over a continuum. We will use a coupling that generates Bernoulli observations for every p on one probability space and makes their monotonicity visible observation by observation.

Experiment

Take four fixed uniform values 0.1,0.3,0.6,0.9 as an illustrative record. For each p, set Xᵢ(p)=1 when the corresponding value is at most p. These are teaching values for inspecting the mechanism; random independent uniforms supply the actual coupling proof.

Probability pSuccess vectorTotal
0.210001
0.511002
0.811103

Increasing p never changes a success back to failure. Therefore any nondecreasing rejection function of the total also never decreases on each coupled outcome. Taking expectations proves monotonicity of the rejection probability, including rules that randomize at a boundary with an intermediate rejection probability.

Understand

A monotone likelihood-ratio family has ratios fθ₁/fθ₀ nondecreasing in a statistic T whenever θ₁>θ₀, under the relevant common-support conventions. In regular one-parameter settings this supports upper-tail tests. Rather than invoke the broad theorem without its details, the binomial case can be proved directly: its likelihood ratio is a constant times a base greater than one raised to S. Neyman–Pearson therefore makes an upper-tail size-α rule at p₀ most powerful against each fixed larger p₁. The coupling argument proves that no smaller null probability has larger rejection probability.

Combining those two facts gives uniform most-powerful, or UMP, status against the one-sided alternative. A competing level-α test for the composite null also has size at most α at p₀, so the simple-null optimality comparison applies at every larger p₁. “Uniform” refers to all alternative parameter values, not to equal power or equal rejection probability across them.

Apply

For two Bernoulli trials, reject only if both are successes. Its rejection probability is p². Under p≤1/2, size is 1/4; under p=3/4, power is 9/16. Derive both from the same function and state the different roles of the two parameter values. If a smaller target size is needed, randomizing at the high-total boundary can adjust it while preserving monotonicity.

For normal observations with known variance, the likelihood ratio for a larger mean is increasing in the sample sum. A mean threshold calibrated at μ₀ controls all μ≤μ₀ because shifting the mean down shifts the distribution left. With unknown variance, a nuisance parameter changes the problem: validity of a t test does not by itself prove unrestricted UMP optimality. Additional restrictions or different optimality criteria are needed.

Continue

Do not extend a one-sided UMP result to a two-sided alternative by attaching a second tail. Opposite alternatives generally prefer opposite error allocations. Continue to Likelihood-ratio tests for a general nested-model construction. Its appeal is broad applicability, while its calibration and optimality must be argued separately. This distinction prevents a useful testing recipe from being presented as a universal best test.

Apply · explain · revise

Practice and reasoning

Drafts save locally as you type. Reveal worked solutions when useful; the site remembers that exposure. Automatic matches check the requested answer, while written arguments require review against the rubric.

For n=2 Bernoulli observations reject only at S=2. At p=1/2, what is power?

Integers, fractions and finite decimals are accepted. Expressions such as sqrt(2) are not parsed by this checker.

For that same test under composite null 0≤p≤1/3, what is its size?

Integers, fractions and finite decimals are accepted. Expressions such as sqrt(2) are not parsed by this checker.

Explain why a common upper-tail NP rejection rule for every θ₁>θ₀ can be UMP for a one-sided alternative.

Structure your argument and preserve revisions

These optional planning fields save locally. Recording your response saves an immutable copy of the argument and these fields. Older records may contain only first/latest responses; missing intermediate revisions are not reconstructed.

Each field allows 2,000 characters. Keep a specific claim, state where it applies, cite the facts you use, and explain what still needs checking. Blank fields are allowed and are not evidence of mastery.

Prove binomial upper-tail rejection probability is nondecreasing in p by coupling.

Structure your argument and preserve revisions

These optional planning fields save locally. Recording your response saves an immutable copy of the argument and these fields. Older records may contain only first/latest responses; missing intermediate revisions are not reconstructed.

Each field allows 2,000 characters. Keep a specific claim, state where it applies, cite the facts you use, and explain what still needs checking. Blank fields are allowed and are not evidence of mastery.

For iid N(μ,σ²) with known σ, explain the UMP upper-tail mean test for H₀:μ≤μ₀ against μ>μ₀.

Structure your argument and preserve revisions

These optional planning fields save locally. Recording your response saves an immutable copy of the argument and these fields. Older records may contain only first/latest responses; missing intermediate revisions are not reconstructed.

Each field allows 2,000 characters. Keep a specific claim, state where it applies, cite the facts you use, and explain what still needs checking. Blank fields are allowed and are not evidence of mastery.

Does the same argument immediately prove a UMP test when normal variance is unknown?

Structure your argument and preserve revisions

These optional planning fields save locally. Recording your response saves an immutable copy of the argument and these fields. Older records may contain only first/latest responses; missing intermediate revisions are not reconstructed.

Each field allows 2,000 characters. Keep a specific claim, state where it applies, cite the facts you use, and explain what still needs checking. Blank fields are allowed and are not evidence of mastery.

Reflect and continue

Before marking this lesson complete, explain one key idea without the worked solution and identify a condition that matters. Marking complete records participation, not independent mastery.