Documentation

Complexitylib.Algebraic.LowerBound.Cutwidth.Extractor.SourceReduction.Construction

The actual finite sumset extractor #

The concrete source-linear sampler and one fixed affine correlation breaker supply every parity test of order at most four. Their exact error budgets give enough good coordinates to apply the moment and majority theorems. The final Boolean map is a flat-source sumset extractor with error 35/72. Its only premises are the positive scale and the two numerical sampler guards; no sampler, security, or parity estimate is assumed.

This formalizes the finite composition in Chattopadhyay--Liao, Extractors for Sum of Two Sources, Lemma 5.4 and the proof of Theorem 2: https://arxiv.org/abs/2110.12652. The source threshold is the maximum of the actual affine leakage and growing matched-sampler reserves. The eventual sublinear entropy bound and uniform evaluation of the complete family are proved separately, in Construction.Asymptotics and Construction.Uniform.

Concrete binary enumeration preserves source XOR-linearity at every size.

Majority of the actual XOR reduction extracts from both flat sources at the stated reserve.