Repository navigation
Couplings of random systems - #26
Merged
Merged
Conversation
This was referenced Oct 12, 2026
Merged
A coupling of two PDSs is a joint distribution `J` of the two (`Distribution.IsCoupling J P Q`), with no new structure. New file `RandomSystems/Distance/Coupling.lean`: - `System.tr s σ n`: the transcript of a deterministic system with a strategy within `n` rounds (Lanzenberger–Maurer, Definition 7, printed p. 12), with `tr_eq_iff`: when the system answers the strategy's queries, its transcript is the only complete transcript it replies. - `PDS.sLaw_behavior_eq_fTransform`: for a strategy compatible with the random system of a PDS, the transcript law is the transformation of the PDS by the transcript map (footnote 9, printed p. 14; Definition 4, printed p. 10). - `PDS.statDist_sLaw_behavior_le_of_isCoupling`: under a coupling, the transcript laws are at statistical distance at most the probability that the two transcripts differ. - `PDS.transcriptDistance_behavior_le_of_isCoupling`: under a coupling, the transcript distance of the two random systems is at most the probability that the two systems differ, stated in ℝ≥0: the inequality of Theorem 2 (printed p. 15) for every coupling. THEORY.md §1.4 gets a paragraph on couplings; `#print axioms` lines in Tests/Axioms/Systems. The transcript of a deterministic system with a strategy replaces the run of an environment against a total resource (`TotRes`, `eRun`, `tr E n s` and their lemmas in `Distance/Transcript.lean`), which nothing used; one transcript function remains. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_01E7GPy1oUx164NSZsxJT3N9
MarcIlunga
force-pushed
the
coupling-systems
branch
from
October 13, 2026 08:43
1ba9a13 to
cf8dbcc
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 1 (systems level). Based on the ℝ≥0 bounds PR.
A PDS is a distribution over deterministic systems, so a coupling of two PDSs is just a coupling of distributions,
Distribution.IsCoupling J P Q: no new structure. This ports the easy direction of Lanzenberger–Maurer's coupling theorem.New file
RandomSystems/Distance/Coupling.lean:System.tr s σ n: the transcript of a deterministic system with a strategy withinnrounds (Lanzenberger–Maurer, Definition 7, p. 12), andtr_eq_iff.PDS.sLaw_behavior_eq_fTransform: the transcript law of the random system of a PDS is the pushforward of the PDS by the transcript map (footnote 9, p. 14; Definition 4, p. 10).PDS.statDist_sLaw_behavior_le_of_isCoupling, per environment: under a coupling, the transcript laws are within the probability that the two transcripts differ.PDS.transcriptDistance_behavior_le_of_isCoupling, globally: the transcript distance is at most the probability that the two systems differ (the inequality of Theorem 2, p. 15). The attainment half of Theorem 2 is not part of this PR.The new transcript function replaces the run of an environment against a total resource (
TotRes,eRun,tr E n sand their lemmas inDistance/Transcript.lean), which nothing used, so one transcript function remains.THEORY.md §1.4 gets a paragraph on couplings.
Checks: build with
--wfail, axiom audit, linter set on the new file, anchors, math rendering, citations 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