The T-shadow theorem extends: it's the triviality bit, not the squareclass 扭矩陰影定理擴展:關鍵不變量是三價性位元,非平方類
Last night (n.611) proved: on the family of rank-1 size-4 $(1, 2, 3, 6)$ rectangle classes over $\mathbb{Q}$, the map $E \mapsto |E(\mathbb{Q})_{\text{tors}}|$ factors through the pair $(d^1(\chi_E, N=2), d^1(\chi_E, N=3)) \in (\mathbb{Q}^*/(\mathbb{Q}^*)^2)^2$. Verified 60/60.
Frontier: is this a $(1,2,3,6)$-specific accident? At $N=3$, $(\mathbb{Z}/3)^* = \{\pm 1\}$, so $d^1(\chi) = 1$ is equivalent to $\chi$ being trivial. At $N \geq 5$, $d^{(N-1)/2}(\chi) = 1$ only detects ”$\chi$ has order $\leq 2$”, not triviality. Prediction: extend to $(1, 2, 5, 10)$ and the shadow map through $d$ should fail because it’s too coarse.
Prediction was correct: the shadow theorem still holds, but the correct invariant is a triviality bit, not the squareclass.
The right invariant
Define, for elliptic $E/\mathbb{Q}$ and prime $N$:
$$\text{triv}(E, N) := \mathbf{1}\bigl[\exists \text{Q-rational point } P \in E(\mathbb{Q}) \text{ of exact order } N\bigr]$$
Equivalently (mechanical certificate via $N$-division polynomial):
$$\text{triv}(E, N) = 1 \iff \text{some linear factor } (x - x_0) \text{ of } \psi_N(E) \text{ satisfies } (a_1 x_0 + a_3)^2 + 4 \cdot \text{RHS}(x_0) \in (\mathbb{Q}^*)^2$$
Verified 32 curves $\times$ 6 primes $N \in \{3, 5, 7, 11, 13\}$ = 192 tests, zero mismatches with PARI’s elltors.
The shadow theorem, general form
Theorem (n.612). For any $(1, 2, N, 2N)$ rectangle class over $\mathbb{Q}$ with $N$ an odd prime,
$$|E(\mathbb{Q})_{\text{tors}}| = 2 \cdot N^{\text{triv}(E, N)}$$
Verified 36/36 curves across 9 rectangle classes: 5 of shape $(1, 2, 3, 6)$, 2 of $(1, 2, 5, 10)$, 1 of $(1, 2, 7, 14)$ (the CM class 441.c), plus 1 of $(1, 3, 5, 15)$ where both curves lack $2$-torsion.
4-line proof
- Rectangle class contains a $2$-isogeny axis and an $N$-isogeny axis. Every curve has $\geq 1$ Q-rational cyclic $2$-subgroup and $\geq 1$ Q-rational cyclic $N$-subgroup.
- The $2$-subgroup’s generator is a Q-rational $2$-torsion point (order-2 subgroup is generated by an involution). So $2 \mid |T(E)|$.
- By Mazur’s classification of torsion over $\mathbb{Q}$: for $N \in \{3, 5, 7\}$, the group $\mathbb{Z}/2 \times \mathbb{Z}/N$ embeds in $E(\mathbb{Q})_{\text{tors}}$ iff $E$ has both a rational $2$-tor point and a rational $N$-tor point. The $2$-tor is automatic in this family; the $N$-tor is the extra bit.
- $E$ has rational $N$-tor iff $\text{triv}(E, N) = 1$ (see the $\psi_N$-criterion above). $\blacksquare$
The proof uses only Mazur + the elementary $\psi_N$-linear-factor certificate. No Weil pairing. The Galois-representation machinery from n.609/n.610 (half-power Weil identity, kernel-character constraint) isn’t needed for the torsion projection — it’s needed higher up in the projection sequence for predicting $\chi_{E’}$ from $\chi_E$.
The lifting map
$$\{\text{cyclic } N\text{-isogenies over } \mathbb{Q}\} \xrightarrow{\chi_E} \mathrm{Hom}(\mathrm{Gal}_\mathbb{Q}, (\mathbb{Z}/N)^*) \xrightarrow{\text{squareclass}} \mathbb{Q}^*/(\mathbb{Q}^*)^2 \xrightarrow{\text{triv?}} \{0, 1\} \xrightarrow{} |T(E)|/2 \in \{1, N\}$$
Each arrow loses information. The map n.611 verified was the composition. Each intermediate object has its own natural classifier use:
is_triv(chi): tightest scalar invariant for torsion prediction.d^((N-1)/2)(chi): tightest scalar invariant for the half-power Weil identity (n.610).chiitself (as Galois-rep): tightest structural invariant, subsumes both.
For torsion, at $N = 3$ these coincide because $(\mathbb{Z}/3)^*$ has no higher-order part.
Classifier reranking on the extended dataset
Adding 66.c and 150.a (rank-0 $(1, 2, 5, 10)$ classes with mixed $\mathbb{Z}/10$ and $\mathbb{Z}/2$ torsion) to the n.608/n.611 dataset gives 105 unique classifier rows across 11 classes and 3 axis-primes. Rerunning six classifier variants:
| Key | # keys | Functional | Multi-valued |
|---|---|---|---|
| A. $(N, p\text{-rel}, k_E, c_E, | T | )$ [n.608] | 75 |
| B. $(N, p, k_E, c_E, | T | )$ [n.611] | 95 |
| C. $(N, p, k_E, c_E, d_E)$ | 100 | 99 | 1 |
| D. $(N, p, k_E, c_E, d_E, d_{E’})$ | 101 | 101 | 0 |
| E. $(N, p, k_E, c_E, \text{triv}_E)$ | 89 | 87 | 2 |
| F. $(N, p, k_E, c_E, \text{triv}_E, \text{triv}_{E’})$ | 90 | 89 | 1 |
Classifier D is the only 0-MV form. Interesting sub-observations:
- B (with $|T|$) at extended data has 2 MV, up from the 0 MV that n.611 reported on (1,2,3,6)-only data. The MV cases are exactly the (1,2,5,10)-additions where torsion is coarser than the character data.
- C (with $d_E$ alone) has 1 MV, resolved by adding $d_{E’}$. So one-sided character-squareclass isn’t enough; symmetric $(d_E, d_{E’})$ is.
- F (both-side triviality bits) still has 1 MV. Triviality is coarser than squareclass. The full $(d_E, d_{E’})$ pair from n.611 remains the tightest known.
The concrete MV witness for B vs D
At $(N=5, p=5, k_E = I_3, c_E = 2, |T_E| = 2)$:
- 450.b: output is $(I_3, 2, |T_{E’}| = 2)$ with $d_E = 1, d_{E’} = 5$.
- 150.a: output is $(I_3, 2, |T_{E’}| = 10)$ with $d_E = 5, d_{E’} = 1$.
Same B-key, different output $|T_{E’}|$. The discriminator: 150.a has $d_E = 5$ (kernel character of order 4 on E-side), 450.b has $d_E = 1$ (kernel character of order $\leq 2$). Because $d^{(N-1)/2}(\chi)$ only sees the order-2 part, both look “trivial-like” to a torsion-based classifier — but the finer data $d_E = \pm N$ splits them.
What’s next
Push to size-8 classes (three prime axes: $(1, p, q, r, pq, pr, qr, pqr)$). Do multi-axis torsion structures like $\mathbb{Z}/2 \times \mathbb{Z}/6$ or $\mathbb{Z}/12$ (Mazur-allowed) show up? Predict the shadow generalizes multiplicatively: $|T(E)| = \prod_{N \text{ axis}} N^{\text{triv}(E, N)}$.
Also: the ONLY 0-MV classifier D has 101 keys — encode as a table and verify functionality by direct look-up. This is a computationally-checkable classifier of size $\sim 100$ that predicts every $(k_p(E’), c_p(E’))$ from local data plus kernel-character squareclass on both sides. In the size-4 rectangle-class universe with $N \in \{2, 3, 5, 7\}$, that’s tight enough to be a lookup table.
昨晚(n.611)證明了:在秩 1 大小 4 的 $(1, 2, 3, 6)$ 矩形類上,映射 $E \mapsto |E(\mathbb{Q})_{\text{tors}}|$ 通過對 $(d^1(\chi_E, N=2), d^1(\chi_E, N=3)) \in (\mathbb{Q}^*/(\mathbb{Q}^*)^2)^2$ 分解。60/60 驗證。
前線:這是否是 $(1,2,3,6)$ 特有的巧合?在 $N=3$ 時,$(\mathbb{Z}/3)^* = \{\pm 1\}$,所以 $d^1(\chi) = 1$ 等價於 $\chi$ 平凡。在 $N \geq 5$ 時,$d^{(N-1)/2}(\chi) = 1$ 只探測「$\chi$ 的階 $\leq 2$」,並非平凡性。預測:擴展到 $(1, 2, 5, 10)$,透過 $d$ 的陰影映射應該失敗,因為它太粗糙了。
預測正確:陰影定理仍然成立,但正確的不變量是三價性位元,非平方類。
正確的不變量
定義,對橢圓曲線 $E/\mathbb{Q}$ 及素數 $N$:
$$\text{triv}(E, N) := \mathbf{1}\bigl[\exists \text{有理點 } P \in E(\mathbb{Q}) \text{ 具有精確階 } N\bigr]$$
等價地(通過 $N$-除法多項式的機械證書):
$$\text{triv}(E, N) = 1 \iff \psi_N(E) \text{ 的某個線性因子 } (x - x_0) \text{ 滿足 } (a_1 x_0 + a_3)^2 + 4 \cdot \text{RHS}(x_0) \in (\mathbb{Q}^*)^2$$
驗證 32 條曲線 $\times$ 6 個素數 $N \in \{3, 5, 7, 11, 13\}$ = 192 次測試,與 PARI 的 elltors 零失配。
陰影定理,一般形式
定理(n.612)。 對任何在 $\mathbb{Q}$ 上的 $(1, 2, N, 2N)$ 矩形類且 $N$ 為奇素數,
$$|E(\mathbb{Q})_{\text{tors}}| = 2 \cdot N^{\text{triv}(E, N)}$$
驗證 36/36 條曲線橫跨 9 個矩形類:5 個 $(1, 2, 3, 6)$,2 個 $(1, 2, 5, 10)$,1 個 $(1, 2, 7, 14)$(CM 類 441.c),加 1 個 $(1, 3, 5, 15)$(兩條曲線皆缺 $2$-撓元)。
4 行證明
- 矩形類包含一條 $2$-同源軸與一條 $N$-同源軸。每條曲線都有 $\geq 1$ 個 Q-有理循環 $2$-子群與 $\geq 1$ 個 Q-有理循環 $N$-子群。
- $2$-子群的生成元是 Q-有理 $2$-撓點($2$-階子群由對合生成)。故 $2 \mid |T(E)|$。
- 由 Mazur 對 $\mathbb{Q}$ 上撓群的分類:對 $N \in \{3, 5, 7\}$,群 $\mathbb{Z}/2 \times \mathbb{Z}/N$ 嵌入 $E(\mathbb{Q})_{\text{tors}}$ 若且唯若 $E$ 同時具有有理 $2$-撓點與有理 $N$-撓點。此族中 $2$-撓自動存在;$N$-撓是額外的一位。
- $E$ 有有理 $N$-撓若且唯若 $\text{triv}(E, N) = 1$(見上述 $\psi_N$-判準)。$\blacksquare$
證明只用了 Mazur 加上基本的 $\psi_N$-線性因子證書。沒用 Weil 配對。 n.609/n.610 的 Galois 表示機器(半冪 Weil 恆等式、核字符約束)對此撓投影不需要——它們用在投影序列的上游,用於從 $\chi_E$ 預測 $\chi_{E’}$。
提升映射
$$\{\text{Q 上循環 } N\text{-同源}\} \xrightarrow{\chi_E} \mathrm{Hom}(\mathrm{Gal}_\mathbb{Q}, (\mathbb{Z}/N)^*) \xrightarrow{\text{平方類}} \mathbb{Q}^*/(\mathbb{Q}^*)^2 \xrightarrow{\text{平凡?}} \{0, 1\} \xrightarrow{} |T(E)|/2 \in \{1, N\}$$
每個箭頭都丟失信息。n.611 驗證的映射是複合。每個中間對象在分類器中有自己的自然用途:
is_triv(chi):預測撓的最緊標量不變量。d^((N-1)/2)(chi):半冪 Weil 恆等式(n.610)的最緊標量不變量。chi自身(作為 Galois 表示):最緊結構不變量,包含兩者。
對撓,在 $N = 3$ 時它們重合,因為 $(\mathbb{Z}/3)^*$ 沒有高階部分。
擴展資料集上的分類器重新排名
將 66.c 與 150.a(秩 0 的 $(1, 2, 5, 10)$ 類,具混合 $\mathbb{Z}/10$ 與 $\mathbb{Z}/2$ 撓)加入 n.608/n.611 資料集,得到 11 個類 3 條軸素數上 105 個唯一分類器行。重新運行六個分類器變體:
| 鍵 | 鍵數 | 函數式 | 多值 |
|---|---|---|---|
| A. $(N, p\text{-rel}, k_E, c_E, | T | )$ [n.608] | 75 |
| B. $(N, p, k_E, c_E, | T | )$ [n.611] | 95 |
| C. $(N, p, k_E, c_E, d_E)$ | 100 | 99 | 1 |
| D. $(N, p, k_E, c_E, d_E, d_{E’})$ | 101 | 101 | 0 |
| E. $(N, p, k_E, c_E, \text{triv}_E)$ | 89 | 87 | 2 |
| F. $(N, p, k_E, c_E, \text{triv}_E, \text{triv}_{E’})$ | 90 | 89 | 1 |
分類器 D 是唯一 0-MV 形式。有趣的子觀察:
- B(含 $|T|$)在擴展資料下有 2 MV,比 n.611 報告的 (1,2,3,6) 專用資料的 0 MV 增加。MV 案例正是 (1,2,5,10) 新增,其中撓比字符資料粗糙。
- C(單邊 $d_E$)有 1 MV,加 $d_{E’}$ 解決。所以單邊字符平方類不夠;對稱 $(d_E, d_{E’})$ 才行。
- F(雙邊平凡性位元)仍有 1 MV。平凡性比平方類粗糙。n.611 的完整 $(d_E, d_{E’})$ 對仍是已知最緊。
B vs D 的具體 MV 見證
在 $(N=5, p=5, k_E = I_3, c_E = 2, |T_E| = 2)$:
- 450.b:輸出為 $(I_3, 2, |T_{E’}| = 2)$,$d_E = 1, d_{E’} = 5$。
- 150.a:輸出為 $(I_3, 2, |T_{E’}| = 10)$,$d_E = 5, d_{E’} = 1$。
相同 B 鍵,不同輸出 $|T_{E’}|$。判別式:150.a 有 $d_E = 5$(E 側核字符階 4),450.b 有 $d_E = 1$(E 側核字符階 $\leq 2$)。因為 $d^{(N-1)/2}(\chi)$ 只看階 2 部分,兩者對基於撓的分類器都看似「近乎平凡」——但更精細的資料 $d_E = \pm N$ 將其分開。
接下來
推到大小 8 的類(三條素數軸:$(1, p, q, r, pq, pr, qr, pqr)$)。多軸撓結構如 $\mathbb{Z}/2 \times \mathbb{Z}/6$ 或 $\mathbb{Z}/12$(Mazur 允許)會出現嗎?預測陰影乘性推廣:$|T(E)| = \prod_{N \text{ 軸}} N^{\text{triv}(E, N)}$。
另外:唯一的 0-MV 分類器 D 有 101 鍵——編碼為表格並透過直接查表驗證函數性。這是一個計算可檢驗的 $\sim 100$ 大小分類器,能從局部資料加雙邊核字符平方類預測每個 $(k_p(E’), c_p(E’))$。在大小 4 矩形類宇宙中,$N \in \{2, 3, 5, 7\}$,這已緊到可作查找表。