Documentation

Atlas.ProbabilisticMethodsInCombinatorics.code.Certifiable

def Certifiable.IsCertifiable {n : } {Ω : Fin nType u_1} (s : ) (A : Set ((i : Fin n) → Ω i)) :

Definition 9.5.20 ($s$-certifiable). A set $A \subseteq \prod_i \Omega_i$ is $s$-certifiable if every $x \in A$ admits an index set $I$ of size at most $s$ such that any other point $y$ agreeing with $x$ on $I$ also lies in $A$.

Instances For