Definition · Antithetic pairGiven one uniform draw U, the antithetic pair is U and 1 − U. If U is uniform on [0, 1) then so is 1 − U, so each half of the pair is a legitimate draw and the estimator built on the pair mean is unbiased for the same quantity as the ordinary one.
Theorem · The variance of a pair meanFor A = g(U) and B = g(1 − U) with the same distribution, Var((A + B)/2) = (Var A + Cov(A, B))/2. An independent pair has Cov = 0 and therefore variance Var A/2, so the antithetic pair is better exactly when Cov(A, B) < 0 and worse exactly when it is positive.
Var((A + B)/2) = (Var A + Var B + 2 Cov(A, B))/4, which is the expansion of the variance of a sum divided by four.
A and B have the same distribution, because U and 1 − U do, so Var B = Var A and the expression is (2 Var A + 2 Cov)/4 = (Var A + Cov)/2. Setting Cov = 0 gives the independent-pair value Var A/2, and the comparison is the sign of Cov.
□
So the technique has no magic in it and no tuning: it is a choice about which second draw to take, and the choice is good or bad according to the sign of one number. The panel prints that number.
The best case, and it is exact
Example · A monotone quantity: g(U) = 1 when U is at least 1/2Sixty-four pairs from the standard stream. Whenever U ≥ 1/2 the partner 1 − U is below 1/2, and conversely, so one of the two is always 1 and the other always 0: every pair mean is exactly 1/2. The sample variance of the pair means is exactly 0, the correlation within a pair is exactly −1, and an independent pair would have had variance 247/2016.
Look at what that does to the estimate. The sixty-four single draws came out 1 thirty-eight times, so an ordinary estimator on the same draws would report 19/32 = 0.59375 against a true value of 1/2. The antithetic estimator reports 1/2, exactly, because every pair mean is 1/2, exactly. The variance is not small here; it is zero, and the arithmetic says so rather than the picture.
The worst case, and it is exactly twice as bad
Example · A symmetric quantity: g(U) = the distance from U to 1/2|(1 − U) − 1/2| = |1/2 − U|, so g(1 − U) is g(U) identically: the two halves of the pair are the same number. The correlation is exactly +1, the pair mean has exactly the variance of a single draw — both 0.022439, exact fractions shown to six places — and an independent pair would have had 0.011219. The ratio is exactly 2.
Two draws were consumed to produce one observation that is no better than one draw. That is not a mild disappointment; it is exactly double the work for exactly the same width, and it is what happens when the condition fails. A reader who has only ever seen the technique work cannot tell the condition from the conclusion, which is why both cases are on the page rather than one of them being mentioned in a footnote.
64 pairs, the same stream, the same seed
monotone g symmetric g
exact mean 1/2 1/4
Var of one draw 247/1008 0.022439
Var, independent pair 247/2016 0.011219
Var, antithetic pair 0 0.022439
Cov within a pair −247/1008 0.022439
squared correlation 1 1
antithetic / independent 0 2
same squared correlation, opposite sign, opposite result
The squared correlation is 1 in both columns, and that is the sharpest way to see why ρ² is not the whole story here. ρ² = 1 says the two halves of the pair determine each other; the sign of the covariance says whether that is worth nothing or worth everything. Later on this course ρ² is exactly the right summary, because there the sign has been optimised away; here it is not.
Why this is available at all on this path
Inverse-transform sampling returns the first value whose cumulative probability reaches U, so a larger U never gives a smaller value: the sampler is monotone in U by construction. Any quantity that is a non-decreasing function of the sampled values is therefore monotone in U, and the pairing is guaranteed to have a negative covariance. That is a property of the method built in the opening lesson of this course, not a lucky feature of the examples.
It stops being guaranteed the moment a run uses more than one draw in a way that is not monotone in each of them, which is most interesting simulations. The queue runs earlier on this course are not monotone in the service draws in any useful sense, which is why the pairing is demonstrated here on functions of a single draw, where the claim can be exact, rather than asserted on a system where it would have to be hoped for.