Repository navigation
Prove negative association of three binary full-guard events - #5073
Merged
Mister-Meeseeks merged 1 commit intoOct 23, 2026
Merged
Mister-Meeseeks merged 1 commit into
Mister-Meeseeks merged 1 commit into
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Change and mathematical scope
PR #4777 leaves negative association of the three binary full-guard events open after proving the conjunction-versus-singleton inequality. This contribution completes that question for every m >= 3, with three pairwise orthogonal rank-one kernels and one uniformly sampled complete GL_m(F_2) header. Any two nonconstant increasing real functions on disjoint nonempty subsets of the indicators have strictly negative covariance.
The new proof uses the credited marginal and pair formulas. Writing
n=m-1,p=Pr(E_i),p2=Pr(E_i E_j),p3=Pr(E_1 E_2 E_3), andr=(7/9)^n, it provesThe union inequality needs only
p3 >= 0; it has no finite cutoff. The proof then explicitly decomposes every two-variable increasing function into nonnegative combinations of AND, the two coordinates and OR. Together with #4777's conjunction result, this proves the full definition of negative association. A separate exchangeable distribution shows why pairwise negativity and the conjunction comparison alone are insufficient.Only the five-file package
research/corankone-triple-negative-association/is added. README Sections 1–4 give the domain, sources and complete new argument; Section 6 restates and independently checks the existing conjunction proof. Nick Petalas's #4227/#4261/#4275/#4767/#4777 retain their credit, as do Cinna Davis and the retained normalizer/closure contributors. Sources are pinned at canonical main4c0a359d88f22f05189d51f48387750b801a45d4; no predecessor executable is imported.Task and overlap
Card
formal-interface-lemma, scope changed to the donor's explicit request for this written mathematical theorem. The side result closes the dependence question for three shared-header events; no physical selection cost or selected-caller improvement is inferred. Exact original card, scope change and source pins are in TASK.json/SOURCES.json.Publication head:
1aace155467e4a560bdb5b28f4f0fdc60a45c29d. Submission refresh confirmed unchanged canonical main and predecessor proofs. The fresh overlap snapshot covers all pages of 329 open PR bodies and 4,183 Discussion records through 2026-10-23 08:06 UTC, plus all-state PR search and targeted source reads. It found the predecessor question and this investigation; sparse local notes, arbitrary diffs and unpublished work are not fully covered. Canonical investigation.Validation
Validation on Python 3.12 / macOS, standard library only:
Hosted CI run 39922618243 passed at exact head
1aace155467e4a560bdb5b28f4f0fdc60a45c29d: the plan/onboarding stage and the sole registered package replay both completed successfully.Scope: binary field, three orthogonal kernels, complete uniform headers. No odd-field or four-event theorem, physical caller, supplier admission, new kappa, independent human review or proof-kernel verification is claimed. Selected scientific replay and optional full-history preflight were not run; the sparse orientation limitation is recorded in TASK.json.
Credit
Nick Petalas supplied the marginal/pair/triple laws, pair and conjunction comparisons, and the explicit open question. Cinna Davis supplied the BIT request context; source527, commdata2338, Jose Manuel and Chris R / Clear1nsight retain the lineage credited in the package. New proof and independent checks were prepared for lee-phys with substantial OpenAI Codex assistance. Apache-2.0.
Open next questions
README and TASK.json give scoped follow-ups. The first is to test the
2+2increasing-event comparisons for four orthogonal binary kernels against the known four-event law. This would extend the dependence result, but new event types prevent the present three-variable proof from settling it. Odd fields need a separate transfer/sign analysis.