claimroutineinferred_dep
Conditional expectations yield balanced labels
Claim·§4.4 Choosing the variable and factor groups·inside lemDeterministic balanced incidence labeling
Statement (paper)
One can fix the and the for nonempty one at a time, deterministically, so that the final value of is at most two. Consequently for every and for all , , and under these give and .
In plain English
The labels and (nonempty ) can be fixed one at a time deterministically so that . This gives and , which under the hypotheses become and .
Why it's here
By the previous claim the random labeling has expected value of the combined potential at most 2, so the method of conditional expectations, choosing each label to not increase the conditional expectation, yields a fixed labeling with value at most 2. Since each potential is a sum of squared deviations, it bounds every single deviation by a square root, and the size hypotheses and make the square-root terms at most and , giving the two stated balance bounds of the lemma.
Classified routine:
Standard method of conditional expectations (derandomization, Erdős–Selfridge / Raghavan–Spencer) applied to the expected potential bound from the previous claim, followed by a bound on each squared deviation and arithmetic using the size hypotheses.
Uses
Used by
Sources
PaperOpen
- Section
- §4.4 Choosing the variable and factor groups
- Page
- —
- Label
—- Line
main_full_version.tex:2496
Leannot aligned
Phase 2 aligns this node to a Lean declaration.
Friction
- infoinferred_depoutline: "Conditional expectations yield balanced labels" rests on claim-lem-incidence-labels-1