Documentation

ChandraFurstLipton.LowerBoundEval

def NOF.eval {ι : Type u_1} {G : Type u_2} [AddCommGroup G] [DecidableEq G] [Fintype ι] (x : ιG) :
Equations
Instances For
    @[simp]
    theorem NOF.eval_eq_true {ι : Type u_1} {G : Type u_2} [AddCommGroup G] [DecidableEq G] [Fintype ι] {x : ιG} :
    eval x = true i : ι, x i = 0
    theorem NOF.trivial_of_isForbiddenPattern_of_isValid_eval {G : Type u_2} [AddCommGroup G] [DecidableEq G] {d : } [NeZero d] {P : Protocol G d} {t : } {B : List Bool} {a : ZMod dZMod dG} (ha : IsForbiddenPattern a) (hP : P.IsValid eval t) (hE : ∀ (i : ZMod d), eval (a i) = true) (hB : ∀ (i : ZMod d), P.broadcast (a i) t = B) (i j : ZMod d) :
    a i = a j
    def NOF.getBits (B : List Bool) (i d : ) :
    Equations
    • One or more equations did not get rendered due to their size.
    Instances For
      noncomputable def NOF.Protocol.trivial {G : Type u_2} [AddCommGroup G] {d : } [Fintype G] (hd : 3 d) (F : (ZMod dG)Bool) :
      Equations
      • One or more equations did not get rendered due to their size.
      Instances For