While Theorem REF 
proves only an upper bound,
by some assumption on the decision values,[1]}
also assumed (REF ) for analyzing Micro-F1.
However, their results are not suited for our
use here because of various reasons.
In particular, they made a strong assumption that
Micro-F1 is equal to Instance-F1.
we can exactly obtain Micro-F1 for analysis.
The following theorem
shows that
if all binary models are
good enough,
the upper bound in (REF )
is attained.
Further,
if \(K_i\)  is
known,
we achieve the best possible \(\text{Micro-F1}=1\) .
