$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$.

翻译：$P \overset{\text{?}}{=} NP$ 或 $P\ vs\ NP$ 是计算复杂性理论中的核心问题。本文提出导出矩阵与系统线性相关性的定义，并探讨$P$与$NP$的线性相关性。我们得出结论：$P$是线性相关的，且存在线性无关的$NP$，并以属于$NP$的3SAT实例为例，即$P \neq NP$。