The Kővari-Sós-Turán theorem for $\operatorname{GF}(q)$-representable matroids

In this paper, we establish an analogue of the K\H{o}vari-S\'os-Tur\'an Theorem for $\operatorname{GF}(q)$-representable matroids. For $2\leq s\leq t$, we show that if $M$ is a rank-$n$ simple $\operatorname{GF}(q)$-representable matroid having no $M(K_{s,t})$-restriction, then $$|E(M)|=O_{q,s,t}\bigl(q^{(1-1/s)n}\bigr).$$ In particular, we prove that the maximum number of elements in a simple rank-$n$ binary matroid with no $M(K_{2,t})$-restriction is $\Theta_{t}(2^{n/2})$ where the lower bound is obtained using binary Sidon sets.