The Linear Correlation of $P$ and $NP$

$P \overset{\text{?}}{=} NP$ or $P\ vs\ NP$ is the core problem in computational complexity theory. In this paper, we proposed a definition of linear correlation of derived matrix and system, and discussed the linear correlation of $P$ and $NP$. We draw a conclusion that $P$ is linearly dependent and there exists $NP$ which is is linearly independent and take a 3SAT instance which belongs to $NP$ as the example , that is, $P \neq NP$.