Skip to content
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.

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

Generalisation of Fisher-Yates Correctness #146

Merged
merged 1 commit into from
Feb 12, 2024
Merged
Changes from all commits
Commits
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
17 changes: 17 additions & 0 deletions src/Util/FisherYates/Correctness.dfy
Original file line number Diff line number Diff line change
Expand Up @@ -17,6 +17,23 @@ module FisherYates.Correctness {
Lemmas
*******/

lemma CorrectnessFisherYates<T(!new)>(xs: seq<T>, p: seq<T>)
requires
var xs' := seq(|xs|, i requires 0 <= i < |xs| => (xs[i], i));
var p' := seq(|p|, i requires 0 <= i < |p| => (p[i], i));
multiset(p') == multiset(xs')
ensures
var xs' := seq(|xs|, i requires 0 <= i < |xs| => (xs[i], i));
var p' := seq(|p|, i requires 0 <= i < |p| => (p[i], i));
var e := iset s | Model.Shuffle(xs')(s).Equals(p');
e in Rand.eventSpace
&& Rand.prob(e) == 1.0 / (NatArith.FactorialTraditional(|xs|) as real)
{
var xs' := seq(|xs|, i requires 0 <= i < |xs| => (xs[i], i));
var p' := seq(|p|, i requires 0 <= i < |p| => (p[i], i));
CorrectnessFisherYatesUniqueElements(xs', p');
}

lemma CorrectnessFisherYatesUniqueElements<T(!new)>(xs: seq<T>, p: seq<T>)
requires forall a, b | 0 <= a < b < |xs| :: xs[a] != xs[b]
requires multiset(p) == multiset(xs)
Expand Down