Prove or disaprove the following statment:
Let $q$ the power of a prime number $p$ and $n,m\in \mathbb{Z}^{+}$ such that $n<m$. If $K$ is a Kakeya set in $F_q^m$ then $K\times F_q^{n-m}$ is a Kakeya set in $F_q^n$.
Attempt
Actually this is true.
Suppose that $K\times F_q^{n-m}$ isn´t a Kakeya set in $F_q^n$ then we must have $$|K\times F_q^{n-m}|<\frac{q^n}{n!}$$ But notice that $$|K\times F_q^{n-m}|=|K||F_q^{n-m}|=|K|q^{n-m}$$
Since $K$ is a Kakeya set in $F_q^m$ then $|K|\geq \frac{q^m}{m!}$ and $m!<n!\rightarrow \frac{1}{n!}<\frac{1}{m!}$ Therefore
$$|K||F_q^{n-m}|=|K|q^{n-m}\geq \frac{q^m}{m!}q^{n-m}\geq \frac{q^n}{n!}$$ a contradiction.
Then $K$ is a Kakeya set.
Is the proof right? if it had a mistake where and how can i prove that.
Note: Let $q$ the power of a prime number $p$, consider the finite field $F_q^n$, A set $K\subset F_q^n$ is a Kakeya set if for every direction $v\in F_q^n\setminus \lbrace 0 \rbrace$ the line $L_{v,a}\subset K$
I haven't checked any sources, but presumably the correct definition of a Kakeya set is the following.
Apparently $|K|\ge q^m/m!$ is a known lower bound to the size of a Kakeya set $K$. A fundamental mistake in your attempt is that you treat this lower bound (a necessary condition) as a sufficient condition. After such a logical mistake no recovery is possible.
Assuming I guessed the correct defition of a Kakeya set (please provide one!), the claim is straight forward using
The observation: A vector $(x,y)\in \Bbb{F}_q^m\times \Bbb{F}_q^{n-m}$ is an element of $K\times \Bbb{F}_q^{n-m}$ if and only if $x\in K$.
The main claim follows from this immediately. Let us fix a direction $v=(v_1,v_2)\neq0$, where $v_1\in\Bbb{F}_q^m, v_2\in\Bbb{F}_q^{n-m}$.
Hence $K\times \Bbb{F}_q^{n-m}$ is a Kakeya set.