https://github.com/EasyCrypt/easycrypt
Tip revision: 7ce03dc9799a816dbcb9b1164afc30d5cf2869a5 authored by Pierre-Yves Strub on 25 February 2022, 17:12:21 UTC
WIP: fix printing of modules
WIP: fix printing of modules
Tip revision: 7ce03dc
DBool.ec
(* --------------------------------------------------------------------
* Copyright (c) - 2012--2016 - IMDEA Software Institute
* Copyright (c) - 2012--2021 - Inria
* Copyright (c) - 2012--2021 - Ecole Polytechnique
*
* Distributed under the terms of the CeCILL-B-V1 license
* -------------------------------------------------------------------- *)
(* -------------------------------------------------------------------- *)
require import AllCore List Distr Ring Number.
require import StdRing StdOrder StdBigop RealSeq RealSeries.
require (*--*) Bigop Bigalg.
(*---*) import RField RealOrder Bigreal.BRA.
(* -------------------------------------------------------------------- *)
clone include Distr.MFinite with
type t <- bool,
op Support.enum <- [true; false],
op Support.card <- 2
rename "dunifinE" as "dboolE_count"
rename "dunifin" as "dbool"
proof Support.enum_spec by case.
lemma dboolE (E : bool -> bool):
mu dbool E = (if E true then 1%r/2%r else 0%r)
+ (if E false then 1%r/2%r else 0%r).
proof. rewrite !dboolE_count /= /b2i /#. qed.
lemma dbool_leq b1 b2:
(b1 => b2) =>
mu1 dbool b1 <= mu1 dbool b2.
proof. by case b1; case b2=> //=; rewrite 2!dbool1E. qed.
(* -------------------------------------------------------------------- *)
theory Biased.
op clamp (p : real) = maxr 0%r (minr 1%r p).
lemma clamp_ge0 p : 0%r <= clamp p by move=> /#.
lemma clamp_le1 p : clamp p <= 1%r by move=> /#.
lemma clamp_id (p : real) : 0%r <= p <= 1%r => clamp p = p.
proof. by move=> /#. qed.
op mbiased (p : real) =
fun b => if b then clamp p else 1%r - clamp p.
lemma ge0_mbiased (p : real) :
forall b, 0%r <= mbiased p b.
proof. by move=> /#. qed.
lemma isdistr_mbiased p : isdistr (mbiased p).
proof.
apply/(isdistr_finP [true; false])=> //.
by case. by apply/ge0_mbiased.
by rewrite 2!big_cons big_nil => @/predT /= /#.
qed.
op dbiased (p : real) = Distr.mk (mbiased p).
lemma dbiased1E (p : real) (b : bool) :
mu1 (dbiased p) b =
if b then clamp p else 1%r - clamp p.
proof. by rewrite muK // isdistr_mbiased. qed.
lemma dbiasedE (p : real) (E : bool -> bool) :
mu (dbiased p) E =
(if E true then clamp p else 0%r)
+ (if E false then 1%r - clamp p else 0%r).
proof.
rewrite muE (@sumE_fin _ [true; false]) => [|[]|] //.
by rewrite 2!big_cons big_nil => @/predT /=; rewrite !dbiased1E.
qed.
lemma supp_dbiased (p : real) b :
0%r < p < 1%r => b \in (dbiased p).
proof.
case=> gt0_p lt1_p; rewrite /support /in_supp dbiased1E /#.
qed.
lemma dbiased_ll (p : real) : is_lossless (dbiased p).
proof. by rewrite /is_lossless dbiasedE /predT /= addrCA. qed.
lemma dbiased_fu (p : real) :
0%r < p < 1%r => is_full (dbiased p).
proof.
by move=> ??;rewrite supp_dbiased.
qed.
end Biased.
(* -------------------------------------------------------------------- *)
abstract theory FixedBiased.
import Biased.
op p : {real | 0%r < p < 1%r} as in01_p.
op dbiased = Biased.dbiased p.
lemma dbiased1E (b : bool) :
mu1 dbiased b = if b then p else 1%r - p.
proof. rewrite dbiased1E clamp_id //; smt (in01_p). qed.
lemma dbiasedE (E : bool -> bool) :
mu dbiased E =
(if E true then p else 0%r)
+ (if E false then 1%r - p else 0%r).
proof. rewrite dbiasedE !clamp_id //;smt(in01_p). qed.
lemma supp_dbiased x : x \in dbiased.
proof. by apply supp_dbiased;apply in01_p. qed.
lemma dbiased_ll : is_lossless dbiased.
proof. by apply dbiased_ll;apply in01_p. qed.
lemma dbiased_fu : is_full (dbiased p).
proof.
by move=> ?;rewrite /is_full supp_dbiased.
qed.
end FixedBiased.
(* -------------------------------------------------------------------- *)
import Biased Bigreal.
abstract theory MUniFinFunBiased.
type t.
clone import MUniFinFun with type t <- t.
op dbfun c = dfun (fun _ => dbiased c).
lemma dbfunE (c : real) (pT pF : t -> bool) :
0%r <= c <= 1%r => (forall x, !(pT x /\ pF x)) =>
mu (dbfun c) (fun f =>
(forall x, pT x => f x)
/\ (forall x, pF x => !f x)) =
( c) ^ (count pT FinT.enum)
* (1%r - c) ^ (count pF FinT.enum).
proof.
move=> rgc h; pose Q x b := (pT x => b) /\ (pF x => !b).
rewrite -(mu_eq _ (fun f => forall x, Q x (f x))) /= 1:/#.
rewrite dfunE (@BRM.bigID _ _ pT) !predTI /=.
rewrite -(BRM.eq_bigr _ (fun _ => clamp c)).
- move=> x @/Q /= ^pTx -> /=; rewrite -(mu_eq _ (pred1 true)).
- by case=> //=; case: (pF x) (h x). - by rewrite dbiased1E.
rewrite mulr_const_cond clamp_id //; congr; rewrite (@BRM.bigID _ _ pF).
rewrite -(BRM.eq_bigr _ (fun _ => 1%r - clamp c)).
- move=> x [_] @/Q /= ^pFx -> /=; rewrite -(mu_eq _ (pred1 false)).
- by case=> //=; case: (pT x) (h x). - by rewrite dbiased1E.
rewrite mulr_const_cond clamp_id // -(BRM.eq_bigr _ (fun _ => 1%r)).
- move=> x /= @/predC [pTNx pFNx]; rewrite -(mu_eq _ predT).
- by move=> b @/predT @/Q; rewrite pTNx pFNx.
by rewrite dbiased_ll.
rewrite mulr_const_cond expr1z mulr1; congr; apply: eq_count.
by move=> x @/predI @/predC; case: (pT x) (pF x) (h x).
qed.
lemma dbfunE_mem_uniq (c: real) (lT lF : t list) :
0%r <= c <= 1%r => uniq lT => uniq lF =>
(forall x, !(x \in lT /\ x \in lF)) =>
mu (dbfun c) (fun f =>
(forall x, x \in lT => f x)
/\ (forall x, x \in lF => !f x)) =
( c) ^ (size lT)
* (1%r - c) ^ (size lF).
proof.
move=> hc huT huF hd; have := dbfunE c (mem lT) (mem lF) hc hd.
by rewrite !FinT.count_mem.
qed.
lemma dbfunE_mem_le (c: real) (lT lF : t list) :
0%r <= c <= 1%r =>
(forall x, !(x \in lT /\ x \in lF)) =>
c ^ (size lT) * (1%r - c) ^ (size lF) <=
mu (dbfun c) (fun f =>
(forall x, x \in lT => f x)
/\ (forall x, x \in lF => !f x)).
proof.
move=> [h0c hc1] hl; have /ler_trans:
c ^ (size lT) * (1%r - c) ^ (size lF) <=
c ^ (size (undup lT)) * (1%r - c) ^ (size (undup lF)).
+ apply/ler_pmul; try by apply expr_ge0=> //#.
+ by rewrite &(ler_wiexpn2l) 1://# size_undup size_ge0.
+ by rewrite &(ler_wiexpn2l) 1://# size_undup size_ge0.
apply; rewrite -(dbfunE_mem_uniq _ (undup _)) // ?undup_uniq.
+ by move=> x; rewrite !mem_undup hl.
+ by apply mu_le => /= f _; smt (mem_undup).
qed.
end MUniFinFunBiased.