Negative control for run2_checks.py (deliberately broken claims; each must fail)
  N1 Lemma 3.1: block sums <= 2^-k/2 (true bound 5 2^-k): 9 failures out of 9 instances
  N2 Lemma 3.1: envelope ubar_n <= 2^k s_n (second term dropped): 1597 failures out of 4095 instances
  N3 Proposition 5.1: 2^-e'(n) > z_(n+1)/(2 sigma) (true constant 4): 1200 failures out of 1200 instances
  N4 Lemma 4.2: sum_n 2^n z_(2^n) <= sum z (factor 2 dropped): 3 failures out of 3 instances
  N5 Lemma 4.1: monotonicity of y dropped: 5851 failures out of 6670 instances
  N6 Proposition 6.2: |S_z(k)| <= (1/3)(k+1)^2 sum_W z (true constant 4/3): 50 failures out of 50 instances
  N7 Proposition 6.1: y = x^g/4 in place of y > x^g: 330 failures out of 330 instances
  N8 Lemma 4.3(ii): bands shifted by one: 3900 failures out of 3900 instances
  N9 Lemma 4.2: weight 2^(n-1) in place of 2^n: 404 failures out of 472 instances
  N10 Lemma 2.1 with reversed inequalities: 91 failures out of 215 instances
  N11 Table 1: d = aleph_1 implies a Hinkkanen family: 1 failures out of 3 instances
NEGATIVE CONTROL OK: every broken claim fails
