chore(tools): 向量章节生产脚本归档入 tools/vector-audit
- 5 个未跟踪文件从 .workbuddy 根目录移入 .workbuddy/tools/vector-audit/ - ROOT 由 parents[1] 改为 parents[3](深两层),json 输出改到脚本同目录, inspect 脚本从 cwd 相对路径改为 ROOT 拼接 - check_vector_learning 的字符数检查由 assert 降为警告: 否则一项超限就中断,后面两百多项全不执行 - 归档后实测 PASS 298 项,1 条警告:01-知识点盘点.md 17335 字符超 1.3 万 - 新增 README 说明用途、跑法与 rewrite 脚本的破坏性
This commit is contained in:
@@ -0,0 +1,46 @@
|
|||||||
|
---
|
||||||
|
tags: [工具, 线性代数, 第3讲, 向量, 校验]
|
||||||
|
日期: 2026-10-23 建, 2026-11-04 归档入 tools
|
||||||
|
---
|
||||||
|
|
||||||
|
# vector-audit · 第 3 讲「向量」的生产与校验脚本
|
||||||
|
|
||||||
|
这三个脚本是 2026-10-23 重写 `在学练习/线性代数-第3讲-向量/` 时留下的产物。**不是一次性废码**:`check_vector_learning.py` 的 180 项精确校验,是那一讲所有数值题、参数分支、链接与结构的回归网。以后改这一讲的任何一题,跑一遍就知道有没有改坏。
|
||||||
|
|
||||||
|
## 文件
|
||||||
|
|
||||||
|
| 文件 | 行数 | 做什么 | 安全 |
|
||||||
|
|---|---|---|---|
|
||||||
|
| `check_vector_learning.py` | 189 | **主校验器**。用 `fractions.Fraction` 精确验算全部数值例子与参数分支,同时检查 Markdown 结构与内部链接。结果写入同目录 `vector_learning_checks.json` | 只读笔记,只写 json |
|
||||||
|
| `check_vector_exam_sample.py` | 59 | 抽样校验点 1「线性相关与无关」考研试写篇的 12 组行列式与相关系数 | 只读 |
|
||||||
|
| `inspect_vector_exam_sample.py` | 10 | 打印真题库 `chapter_id=11`(向量)的全部题目,出题时对照用 | 只读 |
|
||||||
|
| `rewrite_vector_learning.py` | 1257 | 第 3 讲整章重写的**生成脚本**,`FILES` 字典里存了全部正文 | ⚠️ **会覆盖正式笔记** |
|
||||||
|
| `vector_learning_checks.json` | — | 最近一次校验结果(当前 298 项通过 + 1 条警告) | 生成物 |
|
||||||
|
|
||||||
|
## 怎么跑
|
||||||
|
|
||||||
|
```bash
|
||||||
|
cd "D:/考研/第二代数学笔记"
|
||||||
|
"$P" .workbuddy/tools/vector-audit/check_vector_learning.py # 应输出 PASS: 298 ...
|
||||||
|
"$P" .workbuddy/tools/vector-audit/inspect_vector_exam_sample.py # 打印 ch11 真题
|
||||||
|
```
|
||||||
|
|
||||||
|
`$P` 指 `C:/Users/Wang Ling/.workbuddy/binaries/python/envs/default/Scripts/python.exe`。三个脚本都用 `parents[3]` 定位项目根,从哪个目录调用都行。
|
||||||
|
|
||||||
|
## 两个注意点
|
||||||
|
|
||||||
|
1. **`rewrite_vector_learning.py` 是破坏性的**。它把 `FILES` 里的字符串直接 `write_text` 覆盖到讲次目录,跑一次就把线上那 15 个 md 全部替换成脚本内的版本。只在该讲需要**整章重生成**时用,且跑之前先 `git status` 确认工作区干净、跑完必 diff。
|
||||||
|
2. **`check_vector_learning.py` 的校验范围是「可以精确算的部分」**:数值例子、参数分支、链接、Markdown 结构。抽象证明的推导逻辑靠人读,脚本管不到——json 里的 `scope` 字段已写明这一点。
|
||||||
|
|
||||||
|
## 归档时改了什么
|
||||||
|
|
||||||
|
2026-11-04 从 `.workbuddy/` 根目录移入本目录,做了四处调整:
|
||||||
|
|
||||||
|
- 三个脚本的 `ROOT` 由 `parents[1]` 改为 `parents[3]`(深了两层目录)
|
||||||
|
- `check_vector_learning.py` 的 json 输出路径由项目根改为脚本同目录
|
||||||
|
- `inspect_vector_exam_sample.py` 原先用 cwd 相对的 `Path('试卷/...')`,改为 `ROOT` 拼接
|
||||||
|
- **字符数检查由断言降为警告**。原来 `assert len(text) <= 13000` 一旦超限就中断整个脚本,后面两百多项全不执行;改为记入 `warns`、末尾统一打印。改完跑出 **298 项通过**,其中唯一警告是 `01-知识点盘点.md` 已达 **17335 字符**(超 1.3 万上限)。
|
||||||
|
|
||||||
|
## 一条待处理
|
||||||
|
|
||||||
|
`01-知识点盘点.md` 17335 字符,超过项目「单文件 ≤ 1.3 万字符」的约定。这是 2026-10-23 21:55 重写时涨上去的(校验脚本 19:47 写好后没再跑,所以 json 里的 180 项是旧快照)。**要不要拆**取决于是否愿意打断「15 个点文件」的编号体系——参照《大题十年考点》的做法,可以把覆盖对照与相邻讲接口拆成 `01b`。目前只记录,未动。
|
||||||
@@ -0,0 +1,59 @@
|
|||||||
|
from pathlib import Path
|
||||||
|
from fractions import Fraction as F
|
||||||
|
from itertools import combinations
|
||||||
|
import importlib.util
|
||||||
|
|
||||||
|
ROOT=Path(__file__).resolve().parents[3]
|
||||||
|
p=ROOT/'基于考研的学习/数学一/在学练习/线性代数-第3讲-向量/02-点1-线性相关与无关-考研试写.md'
|
||||||
|
def det(a):
|
||||||
|
if len(a)==1:return a[0][0]
|
||||||
|
return sum((-1)**j*a[0][j]*det([r[:j]+r[j+1:] for r in a[1:]]) for j in range(len(a)))
|
||||||
|
def apply(a,x):return [sum(F(v)*c for v,c in zip(r,x)) for r in a]
|
||||||
|
def rank(a):
|
||||||
|
a=[[F(x) for x in r] for r in a]; k=0
|
||||||
|
for j in range(len(a[0])):
|
||||||
|
i=next((i for i in range(k,len(a)) if a[i][j]),None)
|
||||||
|
if i is None:continue
|
||||||
|
a[k],a[i]=a[i],a[k]; d=a[k][j]; a[k]=[v/d for v in a[k]]
|
||||||
|
for i in range(k+1,len(a)):
|
||||||
|
d=a[i][j];a[i]=[x-d*y for x,y in zip(a[i],a[k])]
|
||||||
|
k+=1
|
||||||
|
if k==len(a):break
|
||||||
|
return k
|
||||||
|
checks=0
|
||||||
|
def ck(ok):
|
||||||
|
global checks
|
||||||
|
assert ok
|
||||||
|
checks+=1
|
||||||
|
# Determinants are degree <= 2 / <= 1 here; enough exact evaluations also check their coefficients.
|
||||||
|
for t in [-2,0,1,2,3]:
|
||||||
|
A=[[1,1,1],[1,2,4],[1,t,t*t]]
|
||||||
|
ck(det(A)==(t-1)*(t-2))
|
||||||
|
ck(rank(A)==(2 if t in (1,2) else 3))
|
||||||
|
if t in (1,2):ck(apply(A,[2,-3,1])==[0]*3)
|
||||||
|
C=[[1,0,1],[1,1,0],[0,t,1]]
|
||||||
|
ck(det(C)==1+t)
|
||||||
|
C=[[1,0,1],[1,1,0],[0,-1,1]]
|
||||||
|
ck(rank(C)==2);ck(apply(C,[1,-1,-1])==[0]*3)
|
||||||
|
A=[[-2,2,1],[1,2,-2],[1,-4,1],[1,-4,1]]
|
||||||
|
ck(apply(A,[2,1,2])==[0]*4);ck(rank(A)==2)
|
||||||
|
for i,j in combinations(range(3),2):ck(rank([[r[i],r[j]] for r in A])==2)
|
||||||
|
C=[[1,2,3],[2,-1,1]]
|
||||||
|
ck(apply(C,[1,1,-1])==[0,0]);ck(det([[1,2],[2,-1]])==-5)
|
||||||
|
# Check all explicit counterexamples used in the multiple choice and uniqueness discussion.
|
||||||
|
ck(rank([[1,0,1],[0,1,1]])==2)
|
||||||
|
ck(rank([[1,0,0],[0,1,2]])==2)
|
||||||
|
ck(rank([[1,0],[0,1]])==2);ck(rank([[1,0]])==1)
|
||||||
|
ck(rank([[1,1],[0,1]])==2)
|
||||||
|
ck(rank([[1,2],[0,0]])<rank([[1,2,0],[0,0,1]]))
|
||||||
|
for n,s in [(1,1),(2,4),(4,2),(3,3)]:
|
||||||
|
ck(rank([[F(j)**i for j in range(1,s+1)] for i in range(n)])==min(n,s))
|
||||||
|
text=p.read_text(encoding='utf-8')
|
||||||
|
ck(len(text)<13000)
|
||||||
|
spec=importlib.util.spec_from_file_location('fmt',ROOT/'.workbuddy/tools/md2pdf/fix_gitea_math.py')
|
||||||
|
fmt=importlib.util.module_from_spec(spec);spec.loader.exec_module(fmt)
|
||||||
|
result=fmt.fix_text(text)
|
||||||
|
print('Format check:',str(result[1:])[:500])
|
||||||
|
ck(result[0]==text)
|
||||||
|
print('Exact numerical and format checks:',checks,'passed; characters:',len(text))
|
||||||
|
print('General parameter arguments and abstract proofs reviewed separately; numeric checks do not prove universal statements.')
|
||||||
@@ -0,0 +1,188 @@
|
|||||||
|
"""Exact numerical and structural checks for the 2026-10-23 vector rewrite.
|
||||||
|
|
||||||
|
Uses standard-library Fraction; does not require an external CAS. Universal
|
||||||
|
claims and abstract proofs still require the reasoning written in the notes.
|
||||||
|
"""
|
||||||
|
from fractions import Fraction as F
|
||||||
|
from itertools import combinations
|
||||||
|
from pathlib import Path
|
||||||
|
import json
|
||||||
|
import re
|
||||||
|
|
||||||
|
ROOT = Path(__file__).resolve().parents[3]
|
||||||
|
CHAPTER = ROOT / '基于考研的学习/数学一/在学练习/线性代数-第3讲-向量'
|
||||||
|
checks = []
|
||||||
|
warns = []
|
||||||
|
|
||||||
|
def check(name, value):
|
||||||
|
assert value, name
|
||||||
|
checks.append(name)
|
||||||
|
|
||||||
|
def mat(rows):
|
||||||
|
return [[F(v) for v in row] for row in rows]
|
||||||
|
|
||||||
|
def cols(*vectors):
|
||||||
|
return mat(zip(*vectors))
|
||||||
|
|
||||||
|
def transpose(a):
|
||||||
|
return [list(row) for row in zip(*a)]
|
||||||
|
|
||||||
|
def mul(a, b):
|
||||||
|
return [[sum(x*y for x, y in zip(row, column))
|
||||||
|
for column in zip(*b)] for row in a]
|
||||||
|
|
||||||
|
def apply(a, x):
|
||||||
|
return [sum(v*c for v, c in zip(row, x)) for row in a]
|
||||||
|
|
||||||
|
def rank(rows):
|
||||||
|
a = mat(rows)
|
||||||
|
p = 0
|
||||||
|
for j in range(len(a[0])):
|
||||||
|
k = next((i for i in range(p, len(a)) if a[i][j]), None)
|
||||||
|
if k is None:
|
||||||
|
continue
|
||||||
|
a[p], a[k] = a[k], a[p]
|
||||||
|
d = a[p][j]
|
||||||
|
a[p] = [x/d for x in a[p]]
|
||||||
|
for i in range(len(a)):
|
||||||
|
if i != p:
|
||||||
|
d = a[i][j]
|
||||||
|
a[i] = [x-d*y for x, y in zip(a[i], a[p])]
|
||||||
|
p += 1
|
||||||
|
if p == len(a):
|
||||||
|
break
|
||||||
|
return p
|
||||||
|
|
||||||
|
def det(a):
|
||||||
|
if len(a) == 1:
|
||||||
|
return a[0][0]
|
||||||
|
return sum((-1)**j * a[0][j] * det([r[:j]+r[j+1:] for r in a[1:]])
|
||||||
|
for j in range(len(a)))
|
||||||
|
|
||||||
|
def eye(n):
|
||||||
|
return mat([[int(i == j) for j in range(n)] for i in range(n)])
|
||||||
|
|
||||||
|
def gram(vectors):
|
||||||
|
a = cols(*vectors)
|
||||||
|
return mul(transpose(a), a)
|
||||||
|
|
||||||
|
def orthogonal(name, vectors, norms_squared):
|
||||||
|
check(name, gram(vectors) == mat([[norms_squared[i] if i == j else 0
|
||||||
|
for j in range(len(vectors))]
|
||||||
|
for i in range(len(vectors))]))
|
||||||
|
|
||||||
|
u, v, w = [1, 0, 1], [0, 1, 1], [1, 1, 2]
|
||||||
|
check('1.1 target', apply(cols(u, v), [2, 3]) == [2, 3, 5])
|
||||||
|
check('1.1 impossible target', rank(cols(u, v)) == 2 and rank(cols(u, v, [2, 3, 6])) == 3)
|
||||||
|
check('1.2 nontrivial zero relation', apply(cols(u, v, w), [1, 1, -1]) == [0]*3)
|
||||||
|
check('1.5 reference coefficient relation', apply([[1, 0, 1], [1, 1, 0], [0, -1, 1]], [1, -1, -1]) == [0]*3)
|
||||||
|
check('1.5 plus variant independent', det([[1, 0, 1], [1, 1, 0], [0, 1, 1]]) == 2)
|
||||||
|
a2024 = cols([-2, 1, -1, 1], [1, 1, 2, -2], [1, -2, -1, 1])
|
||||||
|
check('1.6 2024 relation', apply(a2024, [1, 1, 1]) == [0]*4)
|
||||||
|
for pair in combinations(range(3), 2):
|
||||||
|
check('1.6 2024 pair '+str(pair), rank([[row[i] for i in pair] for row in a2024]) == 2)
|
||||||
|
|
||||||
|
A = cols([1, 2, -1], [2, 4, -2], [0, 1, 1], [1, 3, 0])
|
||||||
|
check('2.1 rank and pivot columns', rank(A) == 2 and rank(cols([1, 2, -1], [0, 1, 1])) == 2)
|
||||||
|
check('2.1 a2 relation', apply(A, [-2, 1, 0, 0]) == [0]*3)
|
||||||
|
check('2.1 a4 relation', apply(A, [-1, 0, -1, 1]) == [0]*3)
|
||||||
|
A = cols([1, 1, 0, 0], [0, 1, 1, 0], [0, 0, 1, 1], [1, 0, 0, 1])
|
||||||
|
check('2.3 four dimensional rank', rank(A) == 3)
|
||||||
|
check('2.3 cycle relation', apply(A, [1, -1, 1, -1]) == [0]*4)
|
||||||
|
check('2.4 2017 rank', rank([[1, 0, 1], [1, 1, 2], [0, 1, 1]]) == 2)
|
||||||
|
|
||||||
|
for t in [-2, 0, F(3, 2), 5]:
|
||||||
|
check('3.1 family '+str(t), apply(cols(u, v, w), [2-t, 3-t, t]) == [2, 3, 5])
|
||||||
|
A = cols([1, 1, 1], [1, 2, 4], [1, 3, 9])
|
||||||
|
check('3.2 reference representation', apply(A, [2, -2, 1]) == [1, 1, 3] and det(A) != 0)
|
||||||
|
for a in range(-3, 6):
|
||||||
|
A = [[1, 2, 1], [2, 3, a+2], [1, a, -2]]
|
||||||
|
check('3.3 determinant '+str(a), det(A) == -(a-3)*(a+1))
|
||||||
|
augmented = [row+[b] for row, b in zip(A, [1, 3, 0])]
|
||||||
|
expected = (2, 2) if a == 3 else ((2, 3) if a == -1 else (3, 3))
|
||||||
|
check('3.3 classification '+str(a), (rank(A), rank(augmented)) == expected)
|
||||||
|
A = [[1, 2, 1], [2, 3, 5], [1, 3, -2]]
|
||||||
|
check('3.3 particular', apply(A, [3, -1, 0]) == [1, 3, 0])
|
||||||
|
check('3.3 homogeneous direction', apply(A, [-7, 3, 1]) == [0]*3)
|
||||||
|
|
||||||
|
# Five distinct evaluations suffice for the displayed degree-at-most-four
|
||||||
|
# polynomial determinant identities; the notes separately show their expansion.
|
||||||
|
for l in [-2, -1, 0, 1, 2]:
|
||||||
|
A = [[l, 1, 1], [1, l, 1], [1, 1, l]]
|
||||||
|
B = [[l, 1, 1], [1, l, l], [1, 1, l*l]]
|
||||||
|
check('4.3 first determinant '+str(l), det(A) == (l-1)**2*(l+2))
|
||||||
|
check('4.3 second determinant '+str(l), det(B) == (l-1)**2*(l+1)**2)
|
||||||
|
joined = [x+y for x, y in zip(A, B)]
|
||||||
|
check('4.3 equivalence branch '+str(l), (rank(A) == rank(B) == rank(joined)) == (l not in [-1, -2]))
|
||||||
|
|
||||||
|
U = cols([1, 0, 1], [0, 1, 1])
|
||||||
|
C = mat([[1, 1], [1, -1]])
|
||||||
|
check('5.3 new coordinates', apply(C, [F(5, 2), F(-1, 2)]) == [2, 3])
|
||||||
|
check('5.3 vector reconstruction', apply(mul(U, C), [F(5, 2), F(-1, 2)]) == [2, 3, 5])
|
||||||
|
A = cols([1, 2, 1], [1, 3, 2], [1, 3, 3])
|
||||||
|
D = mat([[0, 0, 2], [1, 0, -2], [0, 1, 1]])
|
||||||
|
C = mat([[1, 1, 0], [F(-1, 2), 0, 1], [F(1, 2), 0, 0]])
|
||||||
|
N = cols([1, 3, 2], [1, 3, 3], [1, 1, 1])
|
||||||
|
check('5.4 2019 parameters', apply(A, [2, -2, 1]) == [1, 1, 1])
|
||||||
|
check('5.4 2019 new basis', det(A) == 1 and det(D) == 2 and mul(A, D) == N)
|
||||||
|
check('5.4 2019 requested transition direction', mul(N, C) == A and mul(D, C) == eye(3))
|
||||||
|
check('5.5 coordinate conversion', apply(C, [1, 0, 2]) == [1, F(3, 2), F(1, 2)])
|
||||||
|
check('5.5 reconstruction', apply(N, [1, F(3, 2), F(1, 2)]) == [3, 8, 7])
|
||||||
|
|
||||||
|
vectors = [[1, 0, 1, 1], [-1, -1, 0, 1], [0, 1, -1, 1]]
|
||||||
|
orthogonal('6.2 adapted source orthogonal', vectors, [3, 3, 3])
|
||||||
|
k = [F(1, 3), -1, F(-1, 3)]
|
||||||
|
check('6.2 coefficient sum squares', sum(x*x for x in k) == F(11, 9))
|
||||||
|
g = apply(cols(*vectors), k)
|
||||||
|
check('6.2 projection value', g == [F(4, 3), F(2, 3), F(2, 3), -1])
|
||||||
|
residual = [F(b)-x for b, x in zip([1, 1, 1, -1], g)]
|
||||||
|
check('6.2 residual orthogonal', apply(transpose(cols(*vectors)), residual) == [0]*3)
|
||||||
|
orthogonal('6.3 2021 orthogonal', [[1, 0, 1], [0, 2, 0], [F(1, 2), 0, F(-1, 2)]], [2, 4, F(1, 2)])
|
||||||
|
check('6.3 2021 coefficient subtraction',
|
||||||
|
[F(a)-F(5, 2)*b-F(1, 2)*c for a, b, c in zip([3, 1, 2], [1, 0, 1], [0, 2, 0])]
|
||||||
|
== [F(1, 2), 0, F(-1, 2)])
|
||||||
|
orthogonal('6.5 orthogonal before normalization', [[1, 1, 0], [F(1, 2), F(-1, 2), 1], [F(-2, 3), F(2, 3), F(2, 3)]], [2, F(3, 2), F(4, 3)])
|
||||||
|
orthogonal('6.5 normalized numerators', [[1, 1, 0], [1, -1, 2], [-1, 1, 1]], [2, 6, 3])
|
||||||
|
|
||||||
|
A, B = cols([1, 1, 0], [0, 1, 1]), cols([1, 0, 1], [0, 1, 2])
|
||||||
|
check('7.2 first representation', apply(A, [1, -3]) == [1, -2, -3])
|
||||||
|
check('7.2 second representation', apply(B, [1, -2]) == [1, -2, -3])
|
||||||
|
A, B = cols([1, 2, 3], [2, 1, 1]), cols([2, 5, 9], [1, 0, 1])
|
||||||
|
check('7.3 2023 first representation', apply(A, [3, -1]) == [1, 5, 8])
|
||||||
|
check('7.3 2023 second representation', apply(B, [1, -1]) == [1, 5, 8])
|
||||||
|
check('7.3 ranks and intersection dimension', rank(A) == rank(B) == 2 and rank([x+y for x, y in zip(A, B)]) == 3)
|
||||||
|
A = cols([1, 0, 1, 0], [0, 1, 0, 1])
|
||||||
|
B = cols([1, 1, 0, 0], [0, 0, 1, 1])
|
||||||
|
check('7.4 four dimensional intersection', apply(A, [1, 1]) == apply(B, [1, 1]) == [1]*4)
|
||||||
|
check('7.4 four dimensional sum rank', rank([x+y for x, y in zip(A, B)]) == 3)
|
||||||
|
for a in [0, 1, 2]:
|
||||||
|
check('7.5 direct sum branch '+str(a), det([[1, 1, 2], [1, 0, 1], [0, 1, a]]) == 1-a)
|
||||||
|
|
||||||
|
check('8.2A reference relation', apply([[1, 1, 3], [1, -2, 2]], [-8, -1, 3]) == [0, 0])
|
||||||
|
A, B = [[1, 0, 0], [0, 1, 0]], [[1, 0], [0, 0], [0, 1]]
|
||||||
|
check('8.3B Sylvester sharp example', rank(A) == rank(B) == 2 and rank(mul(A, B)) == 1)
|
||||||
|
A = [[1, 0, 1], [0, 1, 1]]
|
||||||
|
check('8.4 Gram singular example', rank(A) == rank(mul(transpose(A), A)) == 2)
|
||||||
|
|
||||||
|
for file in sorted(CHAPTER.glob('*.md')):
|
||||||
|
text = file.read_text(encoding='utf-8')
|
||||||
|
check('structure balanced details '+file.name, text.count('<details>') == text.count('</details>'))
|
||||||
|
check('structure summaries '+file.name, text.count('<summary>') == text.count('</summary>') == text.count('<details>'))
|
||||||
|
# 字符数上限是项目约定(单文件 ≤ 1.3 万字符)。超限只记警告:它不影响
|
||||||
|
# 数值与链接的正确性,若直接 assert 会让后面几百项检查全部不执行。
|
||||||
|
if len(text) > 13000:
|
||||||
|
warns.append('file size %s: %d 字符 > 13000' % (file.name, len(text)))
|
||||||
|
check('structure no replacement chars '+file.name, '\ufffd' not in text)
|
||||||
|
check('structure math dollar parity '+file.name, text.count('$') % 2 == 0)
|
||||||
|
for target in re.findall(r'\]\(([^)]+)\)', text):
|
||||||
|
if not target.startswith(('http:', 'https:')):
|
||||||
|
check('link '+file.name+' -> '+target, (file.parent / target.split('#')[0]).exists())
|
||||||
|
|
||||||
|
report = {'passed': len(checks), 'arithmetic': 'fractions.Fraction',
|
||||||
|
'scope': 'Numerical examples, parameter branches, link and Markdown structure; abstract proofs manually reviewed',
|
||||||
|
'warnings': warns,
|
||||||
|
'checks': checks}
|
||||||
|
(Path(__file__).resolve().parent / 'vector_learning_checks.json').write_text(json.dumps(report, ensure_ascii=False, indent=2)+'\n', encoding='utf-8')
|
||||||
|
print(f'PASS: {len(checks)} exact numerical and structural checks')
|
||||||
|
for w in warns:
|
||||||
|
print('WARN:', w)
|
||||||
@@ -0,0 +1,12 @@
|
|||||||
|
"""列出真题库 ch11(向量)的题目,供出题时对照。"""
|
||||||
|
import sqlite3
|
||||||
|
from pathlib import Path
|
||||||
|
|
||||||
|
ROOT = Path(__file__).resolve().parents[3]
|
||||||
|
p = ROOT / '试卷/Kaoyan-Math1-Papers/papers/近十年真题题库/kaoyan_math1.db'
|
||||||
|
c = sqlite3.connect(p.as_uri() + '?mode=ro', uri=True)
|
||||||
|
for row in c.execute(
|
||||||
|
"SELECT exam_year,question_no,knowledge_point,stem,answer FROM question "
|
||||||
|
"WHERE chapter_id=11 ORDER BY exam_year"
|
||||||
|
):
|
||||||
|
print(row)
|
||||||
File diff suppressed because it is too large
Load Diff
@@ -0,0 +1,308 @@
|
|||||||
|
{
|
||||||
|
"passed": 298,
|
||||||
|
"arithmetic": "fractions.Fraction",
|
||||||
|
"scope": "Numerical examples, parameter branches, link and Markdown structure; abstract proofs manually reviewed",
|
||||||
|
"warnings": [
|
||||||
|
"file size 01-知识点盘点.md: 17335 字符 > 13000"
|
||||||
|
],
|
||||||
|
"checks": [
|
||||||
|
"1.1 target",
|
||||||
|
"1.1 impossible target",
|
||||||
|
"1.2 nontrivial zero relation",
|
||||||
|
"1.5 reference coefficient relation",
|
||||||
|
"1.5 plus variant independent",
|
||||||
|
"1.6 2024 relation",
|
||||||
|
"1.6 2024 pair (0, 1)",
|
||||||
|
"1.6 2024 pair (0, 2)",
|
||||||
|
"1.6 2024 pair (1, 2)",
|
||||||
|
"2.1 rank and pivot columns",
|
||||||
|
"2.1 a2 relation",
|
||||||
|
"2.1 a4 relation",
|
||||||
|
"2.3 four dimensional rank",
|
||||||
|
"2.3 cycle relation",
|
||||||
|
"2.4 2017 rank",
|
||||||
|
"3.1 family -2",
|
||||||
|
"3.1 family 0",
|
||||||
|
"3.1 family 3/2",
|
||||||
|
"3.1 family 5",
|
||||||
|
"3.2 reference representation",
|
||||||
|
"3.3 determinant -3",
|
||||||
|
"3.3 classification -3",
|
||||||
|
"3.3 determinant -2",
|
||||||
|
"3.3 classification -2",
|
||||||
|
"3.3 determinant -1",
|
||||||
|
"3.3 classification -1",
|
||||||
|
"3.3 determinant 0",
|
||||||
|
"3.3 classification 0",
|
||||||
|
"3.3 determinant 1",
|
||||||
|
"3.3 classification 1",
|
||||||
|
"3.3 determinant 2",
|
||||||
|
"3.3 classification 2",
|
||||||
|
"3.3 determinant 3",
|
||||||
|
"3.3 classification 3",
|
||||||
|
"3.3 determinant 4",
|
||||||
|
"3.3 classification 4",
|
||||||
|
"3.3 determinant 5",
|
||||||
|
"3.3 classification 5",
|
||||||
|
"3.3 particular",
|
||||||
|
"3.3 homogeneous direction",
|
||||||
|
"4.3 first determinant -2",
|
||||||
|
"4.3 second determinant -2",
|
||||||
|
"4.3 equivalence branch -2",
|
||||||
|
"4.3 first determinant -1",
|
||||||
|
"4.3 second determinant -1",
|
||||||
|
"4.3 equivalence branch -1",
|
||||||
|
"4.3 first determinant 0",
|
||||||
|
"4.3 second determinant 0",
|
||||||
|
"4.3 equivalence branch 0",
|
||||||
|
"4.3 first determinant 1",
|
||||||
|
"4.3 second determinant 1",
|
||||||
|
"4.3 equivalence branch 1",
|
||||||
|
"4.3 first determinant 2",
|
||||||
|
"4.3 second determinant 2",
|
||||||
|
"4.3 equivalence branch 2",
|
||||||
|
"5.3 new coordinates",
|
||||||
|
"5.3 vector reconstruction",
|
||||||
|
"5.4 2019 parameters",
|
||||||
|
"5.4 2019 new basis",
|
||||||
|
"5.4 2019 requested transition direction",
|
||||||
|
"5.5 coordinate conversion",
|
||||||
|
"5.5 reconstruction",
|
||||||
|
"6.2 adapted source orthogonal",
|
||||||
|
"6.2 coefficient sum squares",
|
||||||
|
"6.2 projection value",
|
||||||
|
"6.2 residual orthogonal",
|
||||||
|
"6.3 2021 orthogonal",
|
||||||
|
"6.3 2021 coefficient subtraction",
|
||||||
|
"6.5 orthogonal before normalization",
|
||||||
|
"6.5 normalized numerators",
|
||||||
|
"7.2 first representation",
|
||||||
|
"7.2 second representation",
|
||||||
|
"7.3 2023 first representation",
|
||||||
|
"7.3 2023 second representation",
|
||||||
|
"7.3 ranks and intersection dimension",
|
||||||
|
"7.4 four dimensional intersection",
|
||||||
|
"7.4 four dimensional sum rank",
|
||||||
|
"7.5 direct sum branch 0",
|
||||||
|
"7.5 direct sum branch 1",
|
||||||
|
"7.5 direct sum branch 2",
|
||||||
|
"8.2A reference relation",
|
||||||
|
"8.3B Sylvester sharp example",
|
||||||
|
"8.4 Gram singular example",
|
||||||
|
"structure balanced details 01-知识点盘点.md",
|
||||||
|
"structure summaries 01-知识点盘点.md",
|
||||||
|
"structure no replacement chars 01-知识点盘点.md",
|
||||||
|
"structure math dollar parity 01-知识点盘点.md",
|
||||||
|
"link 01-知识点盘点.md -> 04-点3-线性表示.md#user-content-题-1--32方阵捷径一步答两问",
|
||||||
|
"link 01-知识点盘点.md -> 02-点1-线性相关与无关.md#user-content-题-1--定义与特例直接判相关性",
|
||||||
|
"link 01-知识点盘点.md -> 02-点1-线性相关与无关.md#user-content-题-1--定义与特例直接判相关性",
|
||||||
|
"link 01-知识点盘点.md -> 07-点6-内积正交与施密特.md#user-content-题-1--61组合的内积展开再消",
|
||||||
|
"link 01-知识点盘点.md -> 02-点1-线性相关与无关.md#user-content-题-2--判据①有一个向量可由其余表出--相关",
|
||||||
|
"link 01-知识点盘点.md -> 02-点1-线性相关与无关.md#user-content-题-3--判据②无关组--添一个向量变相关--唯一表示",
|
||||||
|
"link 01-知识点盘点.md -> 02-点1-线性相关与无关.md#user-content-题-4--判据②-的证明版把可表示证出来",
|
||||||
|
"link 01-知识点盘点.md -> 02-点1-线性相关与无关.md#user-content-题-5--判据③以少表多多的相关",
|
||||||
|
"link 01-知识点盘点.md -> 02-点1-线性相关与无关.md#user-content-题-6--判据③-的推论个数多于维数必相关",
|
||||||
|
"link 01-知识点盘点.md -> 09-点8-抽象推理与证明.md#user-content-题-4--83以少表多必相关秩法证明",
|
||||||
|
"link 01-知识点盘点.md -> 02-点1-线性相关与无关.md#user-content-题-7--判据④ax0-有非零解--相关",
|
||||||
|
"link 01-知识点盘点.md -> 02-点1-线性相关与无关.md#user-content-题-8--判据④--秩含参判相关并求此时的秩",
|
||||||
|
"link 01-知识点盘点.md -> 02-点1-线性相关与无关.md#user-content-题-9--判据④-的系数矩阵视角变换后的向量组",
|
||||||
|
"link 01-知识点盘点.md -> 02-点1-线性相关与无关.md#user-content-题-10--判据⑤raramidbeta-判断能否表出",
|
||||||
|
"link 01-知识点盘点.md -> 02-点1-线性相关与无关.md#user-content-题-11--判据⑤不能表出时增广矩阵秩恰好多-1",
|
||||||
|
"link 01-知识点盘点.md -> 04-点3-线性表示.md#user-content-题-1--32方阵捷径一步答两问",
|
||||||
|
"link 01-知识点盘点.md -> 02-点1-线性相关与无关.md#user-content-题-12--判据⑥整体无关--部分无关",
|
||||||
|
"link 01-知识点盘点.md -> 02-点1-线性相关与无关.md#user-content-题-13--判据⑦延长无关仍无关",
|
||||||
|
"link 01-知识点盘点.md -> 02-点1-线性相关与无关.md#user-content-题-14--判据⑦-的缩短版相关缩短仍相关",
|
||||||
|
"link 01-知识点盘点.md -> 09-点8-抽象推理与证明.md#user-content-题-2--81相关与无关的接力",
|
||||||
|
"link 01-知识点盘点.md -> 03-点2-秩与极大无关组.md#user-content-题-1--22标准四步求秩与极大无关组",
|
||||||
|
"link 01-知识点盘点.md -> 03-点2-秩与极大无关组.md#user-content-题-2--3先观察再动笔上下界夹逼",
|
||||||
|
"link 01-知识点盘点.md -> 03-点2-秩与极大无关组.md#user-content-题-3--3含参讨论秩",
|
||||||
|
"link 01-知识点盘点.md -> 03-点2-秩与极大无关组.md#user-content-题-4--3抽象条件-abo",
|
||||||
|
"link 01-知识点盘点.md -> 03-点2-秩与极大无关组.md#user-content-题-5--3abo-结论的直接应用-a2o",
|
||||||
|
"link 01-知识点盘点.md -> 09-点8-抽象推理与证明.md#user-content-题-3--82用内积证秩",
|
||||||
|
"link 01-知识点盘点.md -> 04-点3-线性表示.md#user-content-题-1--32方阵捷径一步答两问",
|
||||||
|
"link 01-知识点盘点.md -> 04-点3-线性表示.md#user-content-题-2--32含参分量比较最快",
|
||||||
|
"link 01-知识点盘点.md -> 04-点3-线性表示.md#user-content-题-3--32三种情形的完整分类",
|
||||||
|
"link 01-知识点盘点.md -> 04-点3-线性表示.md#user-content-题-4--32非方阵必须走秩",
|
||||||
|
"link 01-知识点盘点.md -> 05-点4-向量组等价.md#user-content-题-1--41--43四个说法的辨析",
|
||||||
|
"link 01-知识点盘点.md -> 05-点4-向量组等价.md#user-content-题-2--42具体两组判等价先找现成关系",
|
||||||
|
"link 01-知识点盘点.md -> 05-点4-向量组等价.md#user-content-题-3--42抽象单向--同秩能否推出等价",
|
||||||
|
"link 01-知识点盘点.md -> 05-点4-向量组等价.md#user-content-题-5--42传递性的直接应用",
|
||||||
|
"link 01-知识点盘点.md -> 09-点8-抽象推理与证明.md#user-content-题-5--84表出不增秩拼矩阵模板",
|
||||||
|
"link 01-知识点盘点.md -> 05-点4-向量组等价.md#user-content-题-1--41--43四个说法的辨析",
|
||||||
|
"link 01-知识点盘点.md -> 05-点4-向量组等价.md#user-content-题-4--43矩阵等价与向量组等价的分界",
|
||||||
|
"link 01-知识点盘点.md -> 08-点7-子空间和与交.md#user-content-题-1--71哪些是子空间",
|
||||||
|
"link 01-知识点盘点.md -> 06-点5-基坐标与过渡矩阵.md#user-content-题-1--51哪些是基",
|
||||||
|
"link 01-知识点盘点.md -> 06-点5-基坐标与过渡矩阵.md#user-content-题-2--52标准基到一般基过渡矩阵白送",
|
||||||
|
"link 01-知识点盘点.md -> 06-点5-基坐标与过渡矩阵.md#user-content-题-2--52标准基到一般基过渡矩阵白送",
|
||||||
|
"link 01-知识点盘点.md -> 06-点5-基坐标与过渡矩阵.md#user-content-题-3--52双向换算坐标",
|
||||||
|
"link 01-知识点盘点.md -> 06-点5-基坐标与过渡矩阵.md#user-content-题-4--52一般基到一般基",
|
||||||
|
"link 01-知识点盘点.md -> 07-点6-内积正交与施密特.md#user-content-题-1--61组合的内积展开再消",
|
||||||
|
"link 01-知识点盘点.md -> 09-点8-抽象推理与证明.md#user-content-题-3--82用内积证秩",
|
||||||
|
"link 01-知识点盘点.md -> 07-点6-内积正交与施密特.md#user-content-题-2--62--63--65正交长度规范正交基与坐标",
|
||||||
|
"link 01-知识点盘点.md -> 07-点6-内积正交与施密特.md#user-content-题-2--62--63--65正交长度规范正交基与坐标",
|
||||||
|
"link 01-知识点盘点.md -> 07-点6-内积正交与施密特.md#user-content-题-3--64两向量施密特",
|
||||||
|
"link 01-知识点盘点.md -> 07-点6-内积正交与施密特.md#user-content-题-4--64三向量施密特",
|
||||||
|
"link 01-知识点盘点.md -> 07-点6-内积正交与施密特.md#user-content-题-2--62--63--65正交长度规范正交基与坐标",
|
||||||
|
"link 01-知识点盘点.md -> 07-点6-内积正交与施密特.md#user-content-题-5--65正交矩阵的判断",
|
||||||
|
"link 01-知识点盘点.md -> 08-点7-子空间和与交.md#user-content-题-1--71哪些是子空间",
|
||||||
|
"link 01-知识点盘点.md -> 08-点7-子空间和与交.md#user-content-题-2--72--73四维空间里的和与交",
|
||||||
|
"link 01-知识点盘点.md -> 08-点7-子空间和与交.md#user-content-题-2--72--73四维空间里的和与交",
|
||||||
|
"link 01-知识点盘点.md -> 08-点7-子空间和与交.md#user-content-题-3--72--73交空间的基与维数公式",
|
||||||
|
"link 01-知识点盘点.md -> 08-点7-子空间和与交.md#user-content-题-2--72--73四维空间里的和与交",
|
||||||
|
"link 01-知识点盘点.md -> 08-点7-子空间和与交.md#user-content-题-3--72--73交空间的基与维数公式",
|
||||||
|
"link 01-知识点盘点.md -> 08-点7-子空间和与交.md#user-content-题-4--74含参何时为直和",
|
||||||
|
"link 01-知识点盘点.md -> 08-点7-子空间和与交.md#user-content-题-5--74直和的分解唯一性",
|
||||||
|
"link 01-知识点盘点.md -> 09-点8-抽象推理与证明.md#user-content-题-1--81替换定理",
|
||||||
|
"link 01-知识点盘点.md -> 09-点8-抽象推理与证明.md#user-content-题-2--81相关与无关的接力",
|
||||||
|
"link 01-知识点盘点.md -> 09-点8-抽象推理与证明.md#user-content-题-3--82用内积证秩",
|
||||||
|
"link 01-知识点盘点.md -> 09-点8-抽象推理与证明.md#user-content-题-4--83以少表多必相关秩法证明",
|
||||||
|
"link 01-知识点盘点.md -> 09-点8-抽象推理与证明.md#user-content-题-5--84表出不增秩拼矩阵模板",
|
||||||
|
"link 01-知识点盘点.md -> 02-点1-线性相关与无关.md",
|
||||||
|
"link 01-知识点盘点.md -> 09-点8-抽象推理与证明.md",
|
||||||
|
"structure balanced details 02-点1-线性相关与无关-知识点带题示范.md",
|
||||||
|
"structure summaries 02-点1-线性相关与无关-知识点带题示范.md",
|
||||||
|
"structure no replacement chars 02-点1-线性相关与无关-知识点带题示范.md",
|
||||||
|
"structure math dollar parity 02-点1-线性相关与无关-知识点带题示范.md",
|
||||||
|
"link 02-点1-线性相关与无关-知识点带题示范.md -> ../../../../参考仓库/Math/linear-algebra/knowledge/3-vector/vector.tex",
|
||||||
|
"structure balanced details 02-点1-线性相关与无关-考研试写.md",
|
||||||
|
"structure summaries 02-点1-线性相关与无关-考研试写.md",
|
||||||
|
"structure no replacement chars 02-点1-线性相关与无关-考研试写.md",
|
||||||
|
"structure math dollar parity 02-点1-线性相关与无关-考研试写.md",
|
||||||
|
"link 02-点1-线性相关与无关-考研试写.md -> #题2--四维向量相关且任意两个无关",
|
||||||
|
"link 02-点1-线性相关与无关-考研试写.md -> #题3--原组无关组合后的向量何时相关",
|
||||||
|
"link 02-点1-线性相关与无关-考研试写.md -> 03-点2-秩与极大无关组.md",
|
||||||
|
"link 02-点1-线性相关与无关-考研试写.md -> #题1--三个三维向量求相关参数还要确定秩",
|
||||||
|
"link 02-点1-线性相关与无关-考研试写.md -> #题4--选择题中的定理方向",
|
||||||
|
"link 02-点1-线性相关与无关-考研试写.md -> #题7--无关组添入一个向量相关条件能推出什么",
|
||||||
|
"link 02-点1-线性相关与无关-考研试写.md -> #题1--三个三维向量求相关参数还要确定秩",
|
||||||
|
"link 02-点1-线性相关与无关-考研试写.md -> #题6--以少表多不要求原组无关",
|
||||||
|
"link 02-点1-线性相关与无关-考研试写.md -> 03-点2-秩与极大无关组.md",
|
||||||
|
"link 02-点1-线性相关与无关-考研试写.md -> #题2--四维向量相关且任意两个无关",
|
||||||
|
"link 02-点1-线性相关与无关-考研试写.md -> #题5--范德蒙德型向量个数与维数分别讨论",
|
||||||
|
"link 02-点1-线性相关与无关-考研试写.md -> #题7--无关组添入一个向量相关条件能推出什么",
|
||||||
|
"link 02-点1-线性相关与无关-考研试写.md -> #题1--三个三维向量求相关参数还要确定秩",
|
||||||
|
"link 02-点1-线性相关与无关-考研试写.md -> #题4--选择题中的定理方向",
|
||||||
|
"link 02-点1-线性相关与无关-考研试写.md -> #题6--以少表多不要求原组无关",
|
||||||
|
"link 02-点1-线性相关与无关-考研试写.md -> #题3--原组无关组合后的向量何时相关",
|
||||||
|
"link 02-点1-线性相关与无关-考研试写.md -> #题5--范德蒙德型向量个数与维数分别讨论",
|
||||||
|
"link 02-点1-线性相关与无关-考研试写.md -> #题2--四维向量相关且任意两个无关",
|
||||||
|
"link 02-点1-线性相关与无关-考研试写.md -> #题4--选择题中的定理方向",
|
||||||
|
"link 02-点1-线性相关与无关-考研试写.md -> 04-点3-线性表示.md",
|
||||||
|
"link 02-点1-线性相关与无关-考研试写.md -> #题1--三个三维向量求相关参数还要确定秩",
|
||||||
|
"link 02-点1-线性相关与无关-考研试写.md -> #题2--四维向量相关且任意两个无关",
|
||||||
|
"link 02-点1-线性相关与无关-考研试写.md -> #题3--原组无关组合后的向量何时相关",
|
||||||
|
"link 02-点1-线性相关与无关-考研试写.md -> #题4--选择题中的定理方向",
|
||||||
|
"link 02-点1-线性相关与无关-考研试写.md -> #题5--范德蒙德型向量个数与维数分别讨论",
|
||||||
|
"link 02-点1-线性相关与无关-考研试写.md -> #题6--以少表多不要求原组无关",
|
||||||
|
"link 02-点1-线性相关与无关-考研试写.md -> #题7--无关组添入一个向量相关条件能推出什么",
|
||||||
|
"link 02-点1-线性相关与无关-考研试写.md -> ../../../../参考仓库/Math/linear-algebra/knowledge/3-vector/vector.tex",
|
||||||
|
"link 02-点1-线性相关与无关-考研试写.md -> ../../../../参考仓库/Math/linear-algebra/exercise/3-vector/vector.tex",
|
||||||
|
"structure balanced details 02-点1-线性相关与无关.md",
|
||||||
|
"structure summaries 02-点1-线性相关与无关.md",
|
||||||
|
"structure no replacement chars 02-点1-线性相关与无关.md",
|
||||||
|
"structure math dollar parity 02-点1-线性相关与无关.md",
|
||||||
|
"link 02-点1-线性相关与无关.md -> ../../../../参考仓库/Math/linear-algebra/knowledge/3-vector/vector.tex",
|
||||||
|
"link 02-点1-线性相关与无关.md -> ../../../../参考仓库/Math/linear-algebra/knowledge/3-vector/vector.tex",
|
||||||
|
"link 02-点1-线性相关与无关.md -> ../../../../参考仓库/Math/linear-algebra/exercise/3-vector/vector.tex",
|
||||||
|
"structure balanced details 03-点2-秩与极大无关组.md",
|
||||||
|
"structure summaries 03-点2-秩与极大无关组.md",
|
||||||
|
"structure no replacement chars 03-点2-秩与极大无关组.md",
|
||||||
|
"structure math dollar parity 03-点2-秩与极大无关组.md",
|
||||||
|
"link 03-点2-秩与极大无关组.md -> ../../../../参考仓库/Math/linear-algebra/knowledge/3-vector/vector.tex",
|
||||||
|
"link 03-点2-秩与极大无关组.md -> ../../../../参考仓库/Math/linear-algebra/exercise/3-vector/vector.tex",
|
||||||
|
"link 03-点2-秩与极大无关组.md -> ../../../../参考仓库/Math/linear-algebra/knowledge/3-vector/vector.tex",
|
||||||
|
"link 03-点2-秩与极大无关组.md -> ../../../../参考仓库/Math/linear-algebra/knowledge/2-matrix/matrix.tex",
|
||||||
|
"structure balanced details 04-点3-线性表示.md",
|
||||||
|
"structure summaries 04-点3-线性表示.md",
|
||||||
|
"structure no replacement chars 04-点3-线性表示.md",
|
||||||
|
"structure math dollar parity 04-点3-线性表示.md",
|
||||||
|
"link 04-点3-线性表示.md -> ../../../../参考仓库/Math/linear-algebra/knowledge/3-vector/vector.tex",
|
||||||
|
"link 04-点3-线性表示.md -> ../../../../参考仓库/Math/linear-algebra/exercise/3-vector/vector.tex",
|
||||||
|
"link 04-点3-线性表示.md -> ../../../../参考仓库/Math/linear-algebra/knowledge/3-vector/vector.tex",
|
||||||
|
"link 04-点3-线性表示.md -> ../../../../参考仓库/Math/linear-algebra/exercise/3-vector/vector.tex",
|
||||||
|
"structure balanced details 05-点4-向量组等价.md",
|
||||||
|
"structure summaries 05-点4-向量组等价.md",
|
||||||
|
"structure no replacement chars 05-点4-向量组等价.md",
|
||||||
|
"structure math dollar parity 05-点4-向量组等价.md",
|
||||||
|
"link 05-点4-向量组等价.md -> ../../../../参考仓库/Math/linear-algebra/knowledge/3-vector/vector.tex",
|
||||||
|
"link 05-点4-向量组等价.md -> ../../../../参考仓库/Math/linear-algebra/knowledge/3-vector/vector.tex",
|
||||||
|
"link 05-点4-向量组等价.md -> ../../../../参考仓库/Math/linear-algebra/exercise/3-vector/vector.tex",
|
||||||
|
"link 05-点4-向量组等价.md -> ../../../../参考仓库/Math/linear-algebra/knowledge/3-vector/vector.tex",
|
||||||
|
"structure balanced details 06-点5-基坐标与过渡矩阵.md",
|
||||||
|
"structure summaries 06-点5-基坐标与过渡矩阵.md",
|
||||||
|
"structure no replacement chars 06-点5-基坐标与过渡矩阵.md",
|
||||||
|
"structure math dollar parity 06-点5-基坐标与过渡矩阵.md",
|
||||||
|
"link 06-点5-基坐标与过渡矩阵.md -> ../../../../参考仓库/Math/linear-algebra/knowledge/3-vector/vector.tex",
|
||||||
|
"link 06-点5-基坐标与过渡矩阵.md -> ../../../../参考仓库/Math/linear-algebra/exercise/3-vector/vector.tex",
|
||||||
|
"link 06-点5-基坐标与过渡矩阵.md -> ../../../../参考仓库/Math/linear-algebra/knowledge/3-vector/vector.tex",
|
||||||
|
"link 06-点5-基坐标与过渡矩阵.md -> ../../../../参考仓库/Math/linear-algebra/exercise/3-vector/vector.tex",
|
||||||
|
"structure balanced details 07-点6-内积正交与施密特.md",
|
||||||
|
"structure summaries 07-点6-内积正交与施密特.md",
|
||||||
|
"structure no replacement chars 07-点6-内积正交与施密特.md",
|
||||||
|
"structure math dollar parity 07-点6-内积正交与施密特.md",
|
||||||
|
"link 07-点6-内积正交与施密特.md -> 01-知识点盘点.md#user-content-6-内积正交与施密特正交化",
|
||||||
|
"link 07-点6-内积正交与施密特.md -> 01-知识点盘点.md#user-content-61-内积与四条性质",
|
||||||
|
"link 07-点6-内积正交与施密特.md -> 01-知识点盘点.md#user-content-62-长度单位化夹角",
|
||||||
|
"link 07-点6-内积正交与施密特.md -> 01-知识点盘点.md#user-content-63-正交组与正交基",
|
||||||
|
"link 07-点6-内积正交与施密特.md -> 01-知识点盘点.md#user-content-64-施密特正交化算法",
|
||||||
|
"link 07-点6-内积正交与施密特.md -> 01-知识点盘点.md#user-content-65-正交矩阵",
|
||||||
|
"structure balanced details 08-点7-子空间和与交.md",
|
||||||
|
"structure summaries 08-点7-子空间和与交.md",
|
||||||
|
"structure no replacement chars 08-点7-子空间和与交.md",
|
||||||
|
"structure math dollar parity 08-点7-子空间和与交.md",
|
||||||
|
"link 08-点7-子空间和与交.md -> 01-知识点盘点.md#user-content-71-定义",
|
||||||
|
"link 08-点7-子空间和与交.md -> 01-知识点盘点.md#user-content-72-维数公式2019-大纲要求20237-考过",
|
||||||
|
"link 08-点7-子空间和与交.md -> 01-知识点盘点.md#user-content-73-交空间的求法四步",
|
||||||
|
"link 08-点7-子空间和与交.md -> ../../../../参考仓库/Math/linear-algebra/knowledge/4-linear-equations-system/linear-equations-system.tex",
|
||||||
|
"link 08-点7-子空间和与交.md -> 01-知识点盘点.md#user-content-74-直和",
|
||||||
|
"structure balanced details 09-点8-抽象推理与证明.md",
|
||||||
|
"structure summaries 09-点8-抽象推理与证明.md",
|
||||||
|
"structure no replacement chars 09-点8-抽象推理与证明.md",
|
||||||
|
"structure math dollar parity 09-点8-抽象推理与证明.md",
|
||||||
|
"link 09-点8-抽象推理与证明.md -> ../../../../参考仓库/Math/linear-algebra/knowledge/3-vector/vector.tex",
|
||||||
|
"link 09-点8-抽象推理与证明.md -> ../../../../参考仓库/Math/linear-algebra/exercise/3-vector/vector.tex",
|
||||||
|
"link 09-点8-抽象推理与证明.md -> ../../../../参考仓库/Math/linear-algebra/knowledge/4-linear-equations-system/linear-equations-system.tex",
|
||||||
|
"link 09-点8-抽象推理与证明.md -> ../../../../参考仓库/Math/linear-algebra/knowledge/3-vector/vector.tex",
|
||||||
|
"link 09-点8-抽象推理与证明.md -> ../../../../参考仓库/Math/linear-algebra/knowledge/3-vector/vector.tex",
|
||||||
|
"structure balanced details 10-速查卡.md",
|
||||||
|
"structure summaries 10-速查卡.md",
|
||||||
|
"structure no replacement chars 10-速查卡.md",
|
||||||
|
"structure math dollar parity 10-速查卡.md",
|
||||||
|
"link 10-速查卡.md -> 02-点1-线性相关与无关.md#user-content-题-10--判据⑤raramidbeta-判断能否表出",
|
||||||
|
"link 10-速查卡.md -> 04-点3-线性表示.md#user-content-题-1--32方阵捷径一步答两问",
|
||||||
|
"link 10-速查卡.md -> 05-点4-向量组等价.md#user-content-题-2--42具体两组判等价先找现成关系",
|
||||||
|
"link 10-速查卡.md -> 08-点7-子空间和与交.md#user-content-题-3--72--73交空间的基与维数公式",
|
||||||
|
"link 10-速查卡.md -> 02-点1-线性相关与无关.md#user-content-题-1--定义与特例直接判相关性",
|
||||||
|
"link 10-速查卡.md -> 07-点6-内积正交与施密特.md#user-content-题-1--61组合的内积展开再消",
|
||||||
|
"link 10-速查卡.md -> 02-点1-线性相关与无关.md#user-content-题-13--判据⑦延长无关仍无关",
|
||||||
|
"link 10-速查卡.md -> 02-点1-线性相关与无关.md#user-content-题-14--判据⑦-的缩短版相关缩短仍相关",
|
||||||
|
"link 10-速查卡.md -> 06-点5-基坐标与过渡矩阵.md#user-content-题-3--52双向换算坐标",
|
||||||
|
"link 10-速查卡.md -> 03-点2-秩与极大无关组.md#user-content-题-4--3抽象条件-abo",
|
||||||
|
"link 10-速查卡.md -> 03-点2-秩与极大无关组.md#user-content-题-5--3abo-结论的直接应用-a2o",
|
||||||
|
"link 10-速查卡.md -> 09-点8-抽象推理与证明.md#user-content-题-5--84表出不增秩拼矩阵模板",
|
||||||
|
"link 10-速查卡.md -> 07-点6-内积正交与施密特.md#user-content-题-2--62--63--65正交长度规范正交基与坐标",
|
||||||
|
"link 10-速查卡.md -> 07-点6-内积正交与施密特.md#user-content-题-5--65正交矩阵的判断",
|
||||||
|
"link 10-速查卡.md -> 09-点8-抽象推理与证明.md#user-content-题-3--82用内积证秩",
|
||||||
|
"link 10-速查卡.md -> 07-点6-内积正交与施密特.md#user-content-题-3--64两向量施密特",
|
||||||
|
"link 10-速查卡.md -> 07-点6-内积正交与施密特.md#user-content-题-4--64三向量施密特",
|
||||||
|
"link 10-速查卡.md -> 06-点5-基坐标与过渡矩阵.md#user-content-题-3--52双向换算坐标",
|
||||||
|
"link 10-速查卡.md -> 06-点5-基坐标与过渡矩阵.md#user-content-题-4--52一般基到一般基",
|
||||||
|
"link 10-速查卡.md -> 08-点7-子空间和与交.md#user-content-题-3--72--73交空间的基与维数公式",
|
||||||
|
"link 10-速查卡.md -> 02-点1-线性相关与无关.md#user-content-题-8--判据④--秩含参判相关并求此时的秩",
|
||||||
|
"link 10-速查卡.md -> 04-点3-线性表示.md#user-content-题-3--32三种情形的完整分类",
|
||||||
|
"link 10-速查卡.md -> 08-点7-子空间和与交.md#user-content-题-4--74含参何时为直和",
|
||||||
|
"link 10-速查卡.md -> 01-知识点盘点.md",
|
||||||
|
"link 10-速查卡.md -> 02-点1-线性相关与无关.md",
|
||||||
|
"link 10-速查卡.md -> 03-点2-秩与极大无关组.md",
|
||||||
|
"link 10-速查卡.md -> 04-点3-线性表示.md",
|
||||||
|
"link 10-速查卡.md -> 05-点4-向量组等价.md",
|
||||||
|
"link 10-速查卡.md -> 06-点5-基坐标与过渡矩阵.md",
|
||||||
|
"link 10-速查卡.md -> 07-点6-内积正交与施密特.md",
|
||||||
|
"link 10-速查卡.md -> 08-点7-子空间和与交.md",
|
||||||
|
"link 10-速查卡.md -> 09-点8-抽象推理与证明.md",
|
||||||
|
"structure balanced details README.md",
|
||||||
|
"structure summaries README.md",
|
||||||
|
"structure no replacement chars README.md",
|
||||||
|
"structure math dollar parity README.md"
|
||||||
|
]
|
||||||
|
}
|
||||||
Reference in New Issue
Block a user