Repository navigation
Games equivalent as games and the fundamental lemma - #28
Merged
Merged
Conversation
This was referenced Oct 12, 2026
Merged
MarcIlunga
force-pushed
the
h-coefficient
branch
from
October 13, 2026 08:52
fddadfc to
355b09c
Compare
`RandomSystem.GameEquivalent`, two games equivalent as games, G ≡g H (CR18, Definition 4.16, p. 105): they give every transcript with every MBO unset the same probability, the cumulative condition CR18 states as equivalent to identical pre-winning behavior; Maurer 2002, Definition 5 (F^A ≡ G^C), is the same notion with a monotone event sequence in place of the unset MBO. Such games are won alike (`GameEquivalent.winProbability_eq`, `Domain.Distinguisher.winProbability_eq_of_gameEquivalent`; CR18, Lemma 4.15; Maurer 2002, Lemma 7 and Lemma 6 (ii)), and the advantage between their visible systems is at most the winning probability, the fundamental lemma (`GameEquivalent.abs_decisionProbability_sub_le`, `Domain.Distinguisher.advantage_le_winProbability_of_gameEquivalent`; CR18, Lemma 4.16; Maurer 2002, Lemma 7 and Theorem 1 (i)). `Distribution.abs_mass_sub_le_of_le`: two laws of weight one above a common part `ν` differ on every event by at most `1 - ν.weight`. The conditional-equivalence bound `RandomSystem.abs_decisionProbability_sub_le_winProbability` now uses it instead of proving the step inline. THEORY.md §1.5 gets a paragraph; `#print axioms` lines for the four theorems. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_01E7GPy1oUx164NSZsxJT3N9
MarcIlunga
force-pushed
the
game-equivalence
branch
from
October 13, 2026 09:01
509eff3 to
e0db706
Compare
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.
Proof-technique stack, layer 3 (games). Based on the H-coefficient PR, though independent of the two layers below it.
RandomSystem.GameEquivalent: two games equivalent as games,G ≡g H(CR18, Definition 4.16, p. 105). They give every transcript with every MBO unset the same probability, which is the cumulative condition CR18 states as equivalent to identical pre-winning behavior. Maurer 2002, Definition 5 (F^A ≡ G^C), is the same notion.GameEquivalent.winProbability_eqandDomain.Distinguisher.winProbability_eq_of_gameEquivalent(CR18, Lemma 4.15, p. 106; Maurer 2002, Lemma 7 and Lemma 6 (ii)).GameEquivalent.abs_decisionProbability_sub_leandDomain.Distinguisher.advantage_le_winProbability_of_gameEquivalent(CR18, Lemma 4.16, p. 107; Maurer 2002, Lemma 7 and Theorem 1 (i)).Distribution.abs_mass_sub_le_of_le: two laws of weight one above a common partνdiffer on every event by at most1 - ν.weight. The conditional-equivalence bound from Games with a monotone binary output: Games, DistinctionGames and the interface instance #4 now uses it instead of proving the step inline.There is no
≡gnotation: the systems level has no scoped notation of its own.THEORY.md §1.5 gets a paragraph.
Checks: build with
--wfail, axiom audit, linter set, anchors, math rendering, CR18 pages checked on the PDF.The stack
Proof techniques for the HCTR2 port, one technique per PR, ordered by abstraction (merge bottom-up):
🤖 Generated with Claude Code
https://claude.ai/code/session_01E7GPy1oUx164NSZsxJT3N9