A fourth-moment certificate for both majority tails #
The constant-error sumset-extractor route only needs each Boolean outcome to
have some fixed positive probability. Four-wise independent fair bits provide
the first four moments of an independent sign sum. After normalization, the
quartic u * (u + 1)^2 * (3 - u) proves that each tail beyond 1/8 has mass at
least 1/36. This elementary certificate avoids a general theorem about
bounded independence fooling halfspaces. Together with the deterministic margin
lemmas, it permits fewer than one eighth of a standard deviation in arbitrary
bad votes.
The intended source reduction is Chattopadhyay and Liao, Extractors for Sum
of Two Sources (2021), Lemma 5.4. The quartic estimate here is a direct
calculation. Moments bounds raw sign-sum moments from parity bias, and
Moments.Tails supplies the normalization used by Majority.Probability.
SourceReduction.Construction constructs the source reduction that supplies
these parity bounds (sourceReductionExtractor_flat).
Approximate first four normal moments suffice for a positive tail of
mass at least 1/36, beyond the normalized margin 1/8.
Approximate first four normal moments also force the negative tail, by applying the same certificate to the negated variable.
Exact normal moments through degree three and fourth moment at most three imply the positive-tail bound.
The corresponding negative-tail bound under exact moment identities.