Why 7.4 and not the paper's 7.09. The proof subtracts a lower bound for the strongly-major-arc contribution from the full-circle large-sieve bound 8.001(N0/3)2x (Proposition 4.10). The paper asserts the major-arc lower bound ∫∥α∥≤T0/(3.6πx)∣Sη1,x♯∣2≥0.92x from Corollary 4.9. But Corollary 4.9 is normalised to ∥η∥L2=1, while ∥η1∥L22=2/3 by (8.2); applied to η1/∥η1∥2 it gives ∫major∣Sη1∣2≥0.94⋅32x≈0.627x, not 0.92x. This is consistent with the Plancherel heuristic: on the major arc Sη1(x,α)≈xη^1(αx), so ∫major∣Sη1∣2≈x∥η^1∥L22=x∥η1∥L22=32x — the major arc cannot carry 0.92x of L2 mass. With the lower bound 0.627x⋅(1−10−10)2(N0/3)2 from (8.13), the difference is 8.001−0.6266<7.4.
The theorem is unaffected: the companion L∞ estimate minor_arc_Linfty_corrected holds with constant 0.05 in place of the paper's 0.078 (the paper's regime boundary α≥20/N0 was not optimised), and 0.05×7.4=0.37<32−0.1. This node replaces the retired minor_arc_L2 (constant 7.09), which the analysis above indicates is not provable as stated.
Preamble
import Definitions.Def_TaoFivePrimes_ArcSplit
open MeasureTheory
T. Tao, Every odd number greater than 1 is the sum of at most five primes, Math. Comp. 83 (2014), 997-1038, https://arxiv.org/abs/1201.6656, Section 8, Proposition 8.4 (p. 41), with the major-arc lower bound recomputed from Corollary 4.9 and the Plancherel heuristic; Proposition 4.10 for the upper bound