The logarithmic score of a finite certificate

For a Boolean function $g$ on $m$ bits, let $s(g)$ be the maximum, over all inputs, of the number of individual coordinates whose flip changes its output, and let $b(g,y)$ be the maximum size of a family of pairwise disjoint nonempty coordinate sets whose separate flips at input $y$ each change its output; the empty family is permitted and has size zero. Write $b(g)$ for the maximum of $b(g,y)$ over all inputs $y$. For every natural number $n$, every Boolean function $f$ on $n$ bits, every input $x$, and all natural numbers $A,B>1$, if $s(f)≤A$ and $B≤b(f,x)$, set $a=\log(B)/\log(A)$, where the logarithms are real natural logarithms. For every real $ε>0$ and every natural number $S≥2$, there exist a natural number $m$ and a Boolean function $g$ on $m$ bits such that $S≤s(g)$ and $s(g)^{a-ε}≤b(g)$, with the power taken in the reals. The witnesses may depend on both $ε$ and $S$, and $a-ε$ may be negative; zero-dimensional witnesses are ruled out by $S≤s(g)$. The denominator is nonzero because $A>1$. The quantified case $n=0$ cannot satisfy the hypotheses, since then $b(f,x)=0$.