Say that the rank of a set of functions $\{f_1,\ldots,f_n\}$ is the size of the largest linearly independent subset.
If you have two sets of linearly independent functions $\{f_1,\ldots,f_n\}$ and $\{g_1,\ldots,g_k\}$, is it possible for the set of all pairwise products $\{f_i\cdot g_j \}$ to have rank less than $n$?
So far, I have attempted to make use of two characteristics of linear independence, namely:
- $f_1,\ldots,f_n$ are linearly independent if and only if $(\exists c_1,\ldots,c_n : \sum_i c_i f_i = 0 \Longrightarrow c_1 = \ldots = c_n=0)$
- $f_1,\ldots,f_n$ are linearly independent if and only if $\exists x_1,\ldots,x_n$: $\det([f_i(x_j)]) \neq 0$.
I am particularly interested in the case where the $g$ are everywhere positive. I think it might help because you can divide a set of not-all-zero constants $c_1,\ldots,c_n$ by the value of an everywhere nonzero function, and the result will still be a set of not-all-zero constants.
I assume that we are considering functions $f_1,\dots,f_n,g_1,\dots,g_k:\Bbb R \to \Bbb R$. If you have some other idea of the domain/codomain of these functions, please clarify this in your original question.
If $\{f_1,\dots,f_n\}$ and $\{g_1,\dots,g_k\}$ are linearly dependent and if there exists a function $g_m$ for some $1 \leq m \leq k$ that is positive for all inputs, then the set $\{f_i \cdot g_j : 1 \leq i \leq n, 1 \leq j \leq k\}$ must have rank at least $n$. Indeed: if $\{f_1,\dots,f_n\}$ is linearly independent, then so is $\{f_1 \cdot g_m, \dots, f_n \cdot g_m\}$.
In general, the set of pairwise products could have rank $0$. For instance, consider the functions given by $$ f_i(x) = \begin{cases} x^i & 0 \leq x \leq 1\\ 0 & \text{otherwise}, \end{cases} \quad g_j(x) = \begin{cases} x^j & 2 \leq x \leq 3\\ 0 & \text{otherwise.} \end{cases} $$ Although each set is linearly independent, the set of pairwise products has rank $0$.