Skip to content

feat: concrete Bernoulli lottery model proving lemma1's good-event bound #50

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
adust09 wants to merge 1 commit into
base: main
Choose a base branch
from
Open

feat: concrete Bernoulli lottery model proving lemma1's good-event bound #50

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
7 changes: 7 additions & 0 deletions Goldfish/Probabilistic.lean
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,6 +1,7 @@
import Goldfish.Probabilistic.Basic
import Goldfish.Probabilistic.CountBound
import Goldfish.Probabilistic.LeaderWindow
import Goldfish.Probabilistic.Lottery

/-!
# Probabilistic layer (paper App. G)
Expand All @@ -18,4 +19,10 @@ The measure-theoretic foundation for replacing the good-event axioms
window bounds (`window_fail_bound`, `no_leader_window_union_bound`)
underlying Lemma 4's `HonestLeaderEveryWindow` good event (its
honest-majority half is covered by the timing-agnostic `Lottery` model).
* `Goldfish.Probabilistic.Lottery` — the concrete product-Bernoulli lottery
model (`eligLot` / `leaderLot`) discharging the sub-Gaussianity and
independence hypotheses of the abstract layer, and the capstone
`lemma1_good_event_bound`: the good-event failure probability behind
`axiom lemma1` proved with explicit constants, reducing the axiom to a
documented model-instantiation gap.
-/
Loading