Youzhe H.

asked • 07/10/24

Linear algebra question: does it have a solution?

Given $k\in\mathbb{N}$, $p$ a prime number, $s = (s_1, s_2,..., s_{2k+1})\in \mathbb{M}_{(2k+1)*1}(\mathbb{F}_p)$, the Hankel matrix generated by s is denoted as H.

$$

H = \begin{pmatrix}

s_1 & s_2 & \cdots & s_{k+1} \\

s_2 & s_3 & \cdots & s_{k+2} \\

\vdots & \vdots & \ddots & \vdots \\

s_{k+1} & s_{k+2} & \cdots & s_{2k+1}

\end{pmatrix}

$$

Now we know that H is of full rank. Question: do there exist $c = (n_1,n_2,\dots,n_{k+1})\in\mathbb{M}_{1*(k+1)}(\mathbb{F}_p)$ and $b = (b_1,b_2,\dots, b_{k+1})^T\in\mathbb{M}_{(k+1)*1}(\mathbb{F}_p)$ such that the following system holds:

$$\begin{pmatrix}

1 & 1 & \cdots & 1 \\

n_1 & n_2 & \cdots & n_{k+1} \\

\vdots & \vdots & \ddots & \vdots \\

n_1^{2k} & n_2^{2k} & \cdots & n_{k+1}^{2k}

\end{pmatrix}\cdot \begin{pmatrix}

b_1 \\ b_2\\ \vdots\\b_{k+1}

\end{pmatrix} = \begin{pmatrix}

s_1\\s_2\\\vdots\\\vdots\\s_{2k+1}

\end{pmatrix}$$

Bradford T.

Apparently this did not translate to wyzant well. Can you redo with regular text characters?
Report

07/10/24

1 Expert Answer

By:

Ross M. answered • 07/10/24

Tutor
4.8 (32)

PhD in Mathematics with Expertise in Discrete Math and 10+ Years Teach

Youzhe H.

The Vandemonde matrix is not square.
Report

07/11/24

Ross M.

Okay, what does it change? What does H is of full rank mean? It is a little bit hard to go through all the details of your problem here. But anyway, look again the details.
Report

07/11/24

Youzhe H.

The Vandermonde matrix on the left-hand side is known to be non-singular if the \( n_i \) are distinct. That's from your last paragraph and the Vandermonde matrix is non-square. However, H is square and of full rank. Could you please elaborate more on this sentence: 'Since \( H \) is of full rank, it means that the sequence \( s \) can be represented in the form of a linear combination of powers of \( n_1, n_2, \ldots, n_{k+1} \).'?
Report

07/12/24

Still looking for help? Get the right answer, fast.

Ask a question for free

Get a free answer to a quick problem.
Most questions answered within 4 hours.

OR

Find an Online Tutor Now

Choose an expert and meet online. No packages or subscriptions, pay only for the time you need.