Guest User

Untitled

a guest
May 4th, 2026
66
0
Never
7
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 52.74 KB | None | 0 0
  1. # Completed four-way tesserine refinement of the (R=107) supersignum shell
  2.  
  3. ## Definition 1 — The completed tesserine sign algebra
  4.  
  5. Let
  6.  
  7. [
  8. \mathbb S_{\square}
  9. :=
  10. \mathbb R[\widehat s,\underline s]/
  11. (\widehat s^2-1,\ \underline s^2-1).
  12. ]
  13.  
  14. The two commuting involutions are interpreted as follows:
  15.  
  16. [
  17. \widehat s
  18. \quad\text{records the upper sign,}
  19. ]
  20.  
  21. [
  22. \underline s
  23. \quad\text{records the lower sign.}
  24. ]
  25.  
  26. For
  27.  
  28. [
  29. \epsilon,\delta\in{\pm1},
  30. ]
  31.  
  32. define the four primitive idempotents
  33.  
  34. [
  35. e^\epsilon_\delta
  36. :=
  37. \frac14(1+\epsilon\widehat s)(1+\delta\underline s).
  38. ]
  39.  
  40. Thus
  41.  
  42. [
  43. \mathbb S_{\square}
  44. ===================
  45.  
  46. \bigoplus_{\epsilon,\delta\in{\pm1}}
  47. \mathbb R e^\epsilon_\delta,
  48. ]
  49.  
  50. with
  51.  
  52. [
  53. e^\epsilon_\delta e^{\epsilon'}_{\delta'}
  54. =========================================
  55.  
  56. \begin{cases}
  57. e^\epsilon_\delta,&(\epsilon,\delta)=(\epsilon',\delta'),\
  58. 0,&(\epsilon,\delta)\ne(\epsilon',\delta').
  59. \end{cases}
  60. ]
  61.  
  62. The branch evaluation maps are
  63.  
  64. [
  65. \operatorname{br}*{\epsilon,\delta}:
  66. \mathbb S*{\square}\to\mathbb R,
  67. ]
  68.  
  69. [
  70. \operatorname{br}*{\epsilon,\delta}(\widehat s)=\epsilon,
  71. \qquad
  72. \operatorname{br}*{\epsilon,\delta}(\underline s)=\delta.
  73. ]
  74.  
  75. Hence
  76.  
  77. [
  78. \operatorname{br}*{\epsilon,\delta}(e^{\epsilon'}*{\delta'})
  79. ============================================================
  80.  
  81. \begin{cases}
  82. 1,&(\epsilon,\delta)=(\epsilon',\delta'),\
  83. 0,&(\epsilon,\delta)\ne(\epsilon',\delta').
  84. \end{cases}
  85. ]
  86.  
  87. ---
  88.  
  89. ## Definition 2 — Root-completed tesserine supersignum algebra
  90.  
  91. Define
  92.  
  93. [
  94. \mathbb T_{\square}
  95. :=
  96. \mathbb S_{\square}[\widehat g,\underline g]/
  97. (\widehat g^2-\widehat s,\ \underline g^2-\underline s,\ \widehat g\underline g-\underline g\widehat g).
  98. ]
  99.  
  100. Then
  101.  
  102. [
  103. e^\epsilon_\delta\mathbb T_{\square}
  104. \cong
  105. \mathbb R[\widehat g,\underline g]/
  106. (\widehat g^2-\epsilon,\ \underline g^2-\delta).
  107. ]
  108.  
  109. Thus the four branches are
  110.  
  111. [
  112. (\widehat{+},\underline{+}):\quad
  113. \widehat g^2=+1,\quad \underline g^2=+1,
  114. ]
  115.  
  116. [
  117. (\widehat{+},\underline{-}):\quad
  118. \widehat g^2=+1,\quad \underline g^2=-1,
  119. ]
  120.  
  121. [
  122. (\widehat{-},\underline{+}):\quad
  123. \widehat g^2=-1,\quad \underline g^2=+1,
  124. ]
  125.  
  126. [
  127. (\widehat{-},\underline{-}):\quad
  128. \widehat g^2=-1,\quad \underline g^2=-1.
  129. ]
  130.  
  131. The ordinary supersignum scalar algebra is recovered from the upper branch by forgetting the lower sign:
  132.  
  133. [
  134. \mathbb R[s,g]/(s^2-1,\ g^2-s)
  135. ]
  136.  
  137. via
  138.  
  139. [
  140. \widehat s\mapsto s,
  141. \qquad
  142. \widehat g\mapsto g,
  143. \qquad
  144. \underline s\mapsto 1,
  145. \qquad
  146. \underline g\mapsto 1.
  147. ]
  148.  
  149. The sedenion stage (A_4) is the first Cayley–Dickson stage where zero divisors occur; the uploaded Cayley–Dickson references describe this threshold and the graded basis structure used below.
  150.  
  151. ---
  152.  
  153. # 2. The (R=107) completed shell
  154.  
  155. Fix
  156.  
  157. [
  158. p_\ast=8,803,369,
  159. \qquad
  160. R=107,
  161. ]
  162.  
  163. [
  164. a_\ast=\frac{p_\ast+107}{4}
  165. ===========================
  166.  
  167. # 2,200,869
  168.  
  169. 3^2\cdot 11^2\cdot 43\cdot 47.
  170. ]
  171.  
  172. Let
  173.  
  174. [
  175. (\ell_1,\ell_2,\ell_3,\ell_4)
  176. =============================
  177.  
  178. (3,11,43,47),
  179. ]
  180.  
  181. and
  182.  
  183. [
  184. \mathcal B
  185. ==========
  186.  
  187. [-2,2]\times[-2,2]\times[-1,1]\times[-1,1].
  188. ]
  189.  
  190. Modulo (107), with primitive generator (2),
  191.  
  192. [
  193. \log_2(3)=70,\qquad
  194. \log_2(11)=22,\qquad
  195. \log_2(43)=59,\qquad
  196. \log_2(47)=66.
  197. ]
  198.  
  199. Define
  200.  
  201. [
  202. \Lambda(\beta_1,\beta_2,\beta_3,\beta_4)
  203. ========================================
  204.  
  205. 70\beta_1+22\beta_2+59\beta_3+66\beta_4
  206. \in C_{106}.
  207. ]
  208.  
  209. The target logarithms are
  210.  
  211. [
  212. 53=\log_2(-1),
  213. \qquad
  214. 60=\log_2(-p_\ast^{-1}).
  215. ]
  216.  
  217. The verification data gives exactly two vectors at (53),
  218.  
  219. [
  220. \beta^-:=(-2,0,-1,-1),
  221. \qquad
  222. \beta^+:=(2,0,1,1),
  223. ]
  224.  
  225. and no vector at (60).
  226.  
  227. ---
  228.  
  229. ## Definition 3 — Upper and lower signs of an exponent vector
  230.  
  231. For
  232.  
  233. [
  234. \beta=(\beta_1,\beta_2,\beta_3,\beta_4)\in\mathcal B,
  235. ]
  236.  
  237. define the upper sign exponent
  238.  
  239. [
  240. q^\wedge(\beta)
  241. :=
  242. \sum_{i=1}^{4}
  243. \left\lfloor\frac{\beta_i}{2}\right\rfloor
  244. \pmod 2.
  245. ]
  246.  
  247. Define the lower sign exponent
  248.  
  249. [
  250. q_\vee(\beta)
  251. :=
  252. \Lambda(\beta)\pmod2.
  253. ]
  254.  
  255. Since
  256.  
  257. [
  258. 70\equiv0,\qquad
  259. 22\equiv0,\qquad
  260. 59\equiv1,\qquad
  261. 66\equiv0
  262. \pmod2,
  263. ]
  264.  
  265. one has
  266.  
  267. [
  268. q_\vee(\beta)=\beta_3\pmod2.
  269. ]
  270.  
  271. Define the parity blade
  272.  
  273. [
  274. \pi(\beta):={i:\beta_i\equiv1\pmod2}.
  275. ]
  276.  
  277. ---
  278.  
  279. ## Definition 4 — Four-way completed divisor monomials
  280.  
  281. Let
  282.  
  283. [
  284. A_4
  285. ]
  286.  
  287. be the sedenion algebra with graded basis
  288.  
  289. [
  290. {o_I:I\subseteq{1,2,3,4}}.
  291. ]
  292.  
  293. Define the character-form completed monomial
  294.  
  295. [
  296. m_{\square}^{\mathrm{ch}}(\beta)
  297. :=
  298. \widehat s^{q^\wedge(\beta)}
  299. \underline s^{q_\vee(\beta)}
  300. o_{\pi(\beta)}[\Lambda(\beta)]
  301. \in
  302. \mathbb S_{\square}\otimes A_4\otimes\mathbb R[C_{106}].
  303. ]
  304.  
  305. Define the idempotent-form completed monomial
  306.  
  307. [
  308. m_{\square}^{\mathrm{id}}(\beta)
  309. :=
  310. e^{(-1)^{q^\wedge(\beta)}}*{(-1)^{q*\vee(\beta)}}
  311. o_{\pi(\beta)}[\Lambda(\beta)].
  312. ]
  313.  
  314. Then define
  315.  
  316. [
  317. \mathfrak D_{106}^{\square,\mathrm{ch}}
  318. :=
  319. \sum_{\beta\in\mathcal B}
  320. m_{\square}^{\mathrm{ch}}(\beta),
  321. ]
  322.  
  323. and
  324.  
  325. [
  326. \mathfrak D_{106}^{\square,\mathrm{id}}
  327. :=
  328. \sum_{\beta\in\mathcal B}
  329. m_{\square}^{\mathrm{id}}(\beta).
  330. ]
  331.  
  332. The character form records the four character moments. The idempotent form records the four nonnegative sector counts.
  333.  
  334. ---
  335.  
  336. # 3. Complete four-sector blade table
  337.  
  338. For each blade (o_I), define
  339.  
  340. [
  341. N_I^{\epsilon,\delta}
  342. :=
  343. #{\beta\in\mathcal B:
  344. \pi(\beta)=I,\
  345. (-1)^{q^\wedge(\beta)}=\epsilon,\
  346. (-1)^{q_\vee(\beta)}=\delta}.
  347. ]
  348.  
  349. The complete idempotent-sector blade distribution is:
  350.  
  351. [
  352. \begin{array}{c|cccc|c}
  353. \text{blade}
  354. &
  355. N_I^{+,+}
  356. &
  357. N_I^{+,-}
  358. &
  359. N_I^{-,+}
  360. &
  361. N_I^{-,-}
  362. &
  363. \text{total}
  364. \
  365. \hline
  366. 1 &5&0&4&0&9\
  367. o_1 &3&0&3&0&6\
  368. o_2 &3&0&3&0&6\
  369. o_{12} &2&0&2&0&4\
  370. o_3 &0&9&0&9&18\
  371. o_{13} &0&6&0&6&12\
  372. o_{23} &0&6&0&6&12\
  373. o_{123} &0&4&0&4&8\
  374. o_4 &9&0&9&0&18\
  375. o_{14} &6&0&6&0&12\
  376. o_{24} &6&0&6&0&12\
  377. o_{124} &4&0&4&0&8\
  378. o_{34} &0&18&0&18&36\
  379. o_{134} &0&12&0&12&24\
  380. o_{234} &0&12&0&12&24\
  381. o_{1234} &0&8&0&8&16
  382. \end{array}
  383. ]
  384.  
  385. The total is
  386.  
  387. [
  388. 225.
  389. ]
  390.  
  391. Equivalently, the character-form blade polynomial is
  392.  
  393. [
  394. \mathcal P_{\mathcal B}^{\square}
  395. =================================
  396.  
  397. (1+2\widehat s+(1+\widehat s)X_1)
  398. (1+2\widehat s+(1+\widehat s)X_2)
  399. (1+(1+\widehat s)\underline s X_3)
  400. (1+(1+\widehat s)X_4).
  401. ]
  402.  
  403. ### Proof
  404.  
  405. For ([-2,2]),
  406.  
  407. [
  408. \beta=-2,-1,0,1,2
  409. ]
  410.  
  411. contribute respectively
  412.  
  413. [
  414. \widehat s,\quad
  415. \widehat sX,\quad
  416. 1,\quad
  417. X,\quad
  418. \widehat s.
  419. ]
  420.  
  421. Thus
  422.  
  423. [
  424. P_{[-2,2]}(X)
  425. =============
  426.  
  427. 1+2\widehat s+(1+\widehat s)X.
  428. ]
  429.  
  430. The first two coordinates have no lower sign contribution because their logarithms are even modulo (2).
  431.  
  432. For ([-1,1]),
  433.  
  434. [
  435. \beta=-1,0,1
  436. ]
  437.  
  438. contribute
  439.  
  440. [
  441. \widehat s X,\quad
  442. 1,\quad
  443. X.
  444. ]
  445.  
  446. Thus
  447.  
  448. [
  449. P_{[-1,1]}(X)
  450. =============
  451.  
  452. 1+(1+\widehat s)X.
  453. ]
  454.  
  455. The third coordinate has odd logarithm (59), so it also contributes the lower sign (\underline s) on odd parity. Hence its local polynomial is
  456.  
  457. [
  458. 1+(1+\widehat s)\underline sX_3.
  459. ]
  460.  
  461. The fourth coordinate has even logarithm (66), so its local polynomial is
  462.  
  463. [
  464. 1+(1+\widehat s)X_4.
  465. ]
  466.  
  467. Multiplying the four local polynomials gives the displayed formula. Expanding it gives the table.
  468.  
  469. [
  470. \boxed{}
  471. ]
  472.  
  473. ---
  474.  
  475. # 4. Four-way target coefficient
  476.  
  477. ## Theorem 4.1 — Idempotent target coefficient
  478.  
  479. In the idempotent completed shell,
  480.  
  481. [
  482. \boxed{
  483. \Theta_{107}^{\square,\mathrm{id}}(p_\ast)
  484. ==========================================
  485.  
  486. 2e^-*-,o*{34}[53].
  487. }
  488. ]
  489.  
  490. ### Proof
  491.  
  492. For
  493.  
  494. [
  495. \beta^+=(2,0,1,1),
  496. ]
  497.  
  498. one has
  499.  
  500. [
  501. \pi(\beta^+)={3,4},
  502. ]
  503.  
  504. [
  505. \Lambda(\beta^+)
  506. ================
  507.  
  508. # 2\cdot70+59+66
  509.  
  510. 265
  511. \equiv53\pmod{106}.
  512. ]
  513.  
  514. Also,
  515.  
  516. [
  517. q^\wedge(\beta^+)
  518. =================
  519.  
  520. \left\lfloor\frac22\right\rfloor
  521. +
  522. \left\lfloor\frac02\right\rfloor
  523. +
  524. \left\lfloor\frac12\right\rfloor
  525. +
  526. \left\lfloor\frac12\right\rfloor
  527. ================================
  528.  
  529. 1,
  530. ]
  531.  
  532. and
  533.  
  534. [
  535. q_\vee(\beta^+)
  536. ===============
  537.  
  538. # \Lambda(\beta^+)\pmod2
  539.  
  540. # 53\pmod2
  541.  
  542. 1.
  543.  
  544. ]
  545.  
  546. Thus
  547.  
  548. [
  549. m_{\square}^{\mathrm{id}}(\beta^+)
  550. ==================================
  551.  
  552. e^-*-o*{34}[53].
  553. ]
  554.  
  555. For
  556.  
  557. [
  558. \beta^-=(-2,0,-1,-1),
  559. ]
  560.  
  561. one has
  562.  
  563. [
  564. \pi(\beta^-)={3,4},
  565. ]
  566.  
  567. [
  568. \Lambda(\beta^-)
  569. ================
  570.  
  571. -265
  572. \equiv53\pmod{106}.
  573. ]
  574.  
  575. Moreover,
  576.  
  577. [
  578. q^\wedge(\beta^-)
  579. =================
  580.  
  581. \left\lfloor\frac{-2}{2}\right\rfloor
  582. +
  583. 0+
  584. \left\lfloor\frac{-1}{2}\right\rfloor
  585. +
  586. \left\lfloor\frac{-1}{2}\right\rfloor
  587. =====================================
  588.  
  589. # -1-1-1
  590.  
  591. -3
  592. \equiv1\pmod2,
  593. ]
  594.  
  595. and again
  596.  
  597. [
  598. q_\vee(\beta^-)=53\pmod2=1.
  599. ]
  600.  
  601. Thus
  602.  
  603. [
  604. m_{\square}^{\mathrm{id}}(\beta^-)
  605. ==================================
  606.  
  607. e^-*-o*{34}[53].
  608. ]
  609.  
  610. There are no target vectors at (60). Hence
  611.  
  612. [
  613. \Theta_{107}^{\square,\mathrm{id}}(p_\ast)
  614. ==========================================
  615.  
  616. 2e^-*-o*{34}[53].
  617. ]
  618.  
  619. [
  620. \boxed{}
  621. ]
  622.  
  623. ---
  624.  
  625. ## Corollary 4.2 — Character target coefficient
  626.  
  627. The character-form target coefficient is
  628.  
  629. [
  630. \boxed{
  631. \Theta_{107}^{\square,\mathrm{ch}}(p_\ast)
  632. ==========================================
  633.  
  634. 2\widehat s,\underline s,o_{34}[53].
  635. }
  636. ]
  637.  
  638. The four branch values are
  639.  
  640. [
  641. \begin{array}{c|c}
  642. (\widehat s,\underline s)&
  643. \operatorname{br}*{\widehat s,\underline s}
  644. \bigl(2\widehat s,\underline s,o*{34}[53]\bigr)
  645. \
  646. \hline
  647. (+,+)&2o_{34}[53]\
  648. (+,-)&-2o_{34}[53]\
  649. (-,+)&-2o_{34}[53]\
  650. (-,-)&2o_{34}[53]
  651. \end{array}
  652. ]
  653.  
  654. ### Proof
  655.  
  656. Both target vectors have
  657.  
  658. [
  659. q^\wedge=1,
  660. \qquad
  661. q_\vee=1.
  662. ]
  663.  
  664. Thus each contributes
  665.  
  666. [
  667. \widehat s\underline s,o_{34}[53].
  668. ]
  669.  
  670. There are two such vectors, so
  671.  
  672. [
  673. \Theta_{107}^{\square,\mathrm{ch}}(p_\ast)
  674. ==========================================
  675.  
  676. 2\widehat s\underline s,o_{34}[53].
  677. ]
  678.  
  679. The branch table follows from
  680.  
  681. [
  682. \operatorname{br}_{\epsilon,\delta}
  683. (\widehat s\underline s)
  684. ========================
  685.  
  686. \epsilon\delta.
  687. ]
  688.  
  689. [
  690. \boxed{}
  691. ]
  692.  
  693. ---
  694.  
  695. # 5. Sector positivity functional
  696.  
  697. ## Definition 5.1 — Completed sector mass
  698.  
  699. For an idempotent-form coefficient
  700.  
  701. [
  702. Z
  703. =
  704.  
  705. \sum_{\epsilon,\delta,I,t}
  706. c_{\epsilon,\delta,I,t}
  707. e^\epsilon_\delta o_I[t],
  708. \qquad
  709. c_{\epsilon,\delta,I,t}\in\mathbb Z_{\ge0},
  710. ]
  711.  
  712. define the sector masses
  713.  
  714. [
  715. \mathsf M_{\epsilon,\delta}(Z)
  716. :=
  717. \sum_{I,t}
  718. c_{\epsilon,\delta,I,t},
  719. ]
  720.  
  721. and total completed mass
  722.  
  723. [
  724. \mathsf M_{\square}(Z)
  725. :=
  726. \sum_{\epsilon,\delta}
  727. \mathsf M_{\epsilon,\delta}(Z).
  728. ]
  729.  
  730. Define also the square mass
  731.  
  732. [
  733. \mathsf Q_{\square}(Z)
  734. :=
  735. \sum_{\epsilon,\delta,I,t}
  736. c_{\epsilon,\delta,I,t}^2.
  737. ]
  738.  
  739. ---
  740.  
  741. ## Proposition 5.2 — Positivity extractor for the (107)-target
  742.  
  743. For
  744.  
  745. [
  746. Z=
  747. \Theta_{107}^{\square,\mathrm{id}}(p_\ast)
  748. ==========================================
  749.  
  750. 2e^-*-o*{34}[53],
  751. ]
  752.  
  753. one has
  754.  
  755. [
  756. \mathsf M_{-,-}(Z)=2,
  757. ]
  758.  
  759. [
  760. \mathsf M_{\epsilon,\delta}(Z)=0
  761. \qquad
  762. \text{for }(\epsilon,\delta)\ne(-,-),
  763. ]
  764.  
  765. [
  766. \mathsf M_{\square}(Z)=2,
  767. ]
  768.  
  769. and
  770.  
  771. [
  772. \mathsf Q_{\square}(Z)=4.
  773. ]
  774.  
  775. ### Proof
  776.  
  777. The coefficient vector has exactly one nonzero idempotent-sector component:
  778.  
  779. [
  780. c_{-,-,{3,4},53}=2.
  781. ]
  782.  
  783. Therefore all displayed identities follow immediately.
  784.  
  785. [
  786. \boxed{}
  787. ]
  788.  
  789. ---
  790.  
  791. ## Corollary 5.3 — The hidden positive entry
  792.  
  793. The (R=107) positivity is concentrated in the single four-way sector
  794.  
  795. [
  796. (\widehat{-},\underline{-}).
  797. ]
  798.  
  799. Equivalently,
  800.  
  801. [
  802. \Omega_{107}(p_\ast)=2
  803. ]
  804.  
  805. is the sector mass
  806.  
  807. [
  808. \Omega_{107}(p_\ast)
  809. ====================
  810.  
  811. \mathsf M_{-,-}
  812. \bigl(
  813. \Theta_{107}^{\square,\mathrm{id}}(p_\ast)
  814. \bigr).
  815. ]
  816.  
  817. The signed branch evaluations can be negative, but the idempotent sector coefficient is nonnegative and equals the actual divisor count.
  818.  
  819. ---
  820.  
  821. # 6. Completed additive group and lifted Kneser object
  822.  
  823. Let
  824.  
  825. [
  826. G^\square
  827. :=
  828. C_{106}\oplus C_2^\wedge\oplus C_2^\vee.
  829. ]
  830.  
  831. Elements are written
  832.  
  833. [
  834. (t,u,v),
  835. \qquad
  836. t\in C_{106},
  837. \quad
  838. u,v\in C_2.
  839. ]
  840.  
  841. For each prime generator (\ell_i), define the lifted interval
  842.  
  843. [
  844. A_i^\square
  845. :=
  846. {(\beta_i\log_2(\ell_i),\ \lfloor\beta_i/2\rfloor,\ \beta_i\log_2(\ell_i)\bmod2):
  847. -e_i\le\beta_i\le e_i}
  848. \subseteq G^\square.
  849. ]
  850.  
  851. For the (107)-shell, the four lifted intervals are:
  852.  
  853. [
  854. A_1^\square
  855. ===========
  856.  
  857. {
  858. (72,1,0),
  859. (36,1,0),
  860. (0,0,0),
  861. (70,0,0),
  862. (34,1,0)
  863. },
  864. ]
  865.  
  866. [
  867. A_2^\square
  868. ===========
  869.  
  870. {
  871. (62,1,0),
  872. (84,1,0),
  873. (0,0,0),
  874. (22,0,0),
  875. (44,1,0)
  876. },
  877. ]
  878.  
  879. [
  880. A_3^\square
  881. ===========
  882.  
  883. {
  884. (47,1,1),
  885. (0,0,0),
  886. (59,0,1)
  887. },
  888. ]
  889.  
  890. [
  891. A_4^\square
  892. ===========
  893.  
  894. {
  895. (40,1,0),
  896. (0,0,0),
  897. (66,0,0)
  898. }.
  899. ]
  900.  
  901. Let
  902.  
  903. [
  904. B^\square
  905. :=
  906. A_1^\square+A_2^\square+A_3^\square+A_4^\square
  907. \subseteq G^\square.
  908. ]
  909.  
  910. ---
  911.  
  912. ## Theorem 6.1 — Exact completed target hit set
  913.  
  914. Inside (G^\square),
  915.  
  916. [
  917. B^\square\cap{(53,1,1)}
  918. ]
  919.  
  920. has exactly two representations:
  921.  
  922. [
  923. (53,1,1)
  924. ========
  925.  
  926. (72,1,0)+(0,0,0)+(47,1,1)+(40,1,0),
  927. ]
  928.  
  929. and
  930.  
  931. [
  932. (53,1,1)
  933. ========
  934.  
  935. (34,1,0)+(0,0,0)+(59,0,1)+(66,0,0).
  936. ]
  937.  
  938. The completed target
  939.  
  940. [
  941. (60,u,0)
  942. ]
  943.  
  944. has no representation for either
  945.  
  946. [
  947. u=0
  948. \quad\text{or}\quad
  949. u=1.
  950. ]
  951.  
  952. ### Proof
  953.  
  954. The first representation corresponds to
  955.  
  956. [
  957. \beta^-=(-2,0,-1,-1).
  958. ]
  959.  
  960. Indeed,
  961.  
  962. [
  963. 72+0+47+40=159\equiv53\pmod{106},
  964. ]
  965.  
  966. [
  967. 1+0+1+1=3\equiv1\pmod2,
  968. ]
  969.  
  970. [
  971. 0+0+1+0=1\pmod2.
  972. ]
  973.  
  974. The second representation corresponds to
  975.  
  976. [
  977. \beta^+=(2,0,1,1).
  978. ]
  979.  
  980. Indeed,
  981.  
  982. [
  983. 34+0+59+66=159\equiv53\pmod{106},
  984. ]
  985.  
  986. [
  987. 1+0+0+0=1\pmod2,
  988. ]
  989.  
  990. [
  991. 0+0+1+0=1\pmod2.
  992. ]
  993.  
  994. The assertion that no vector hits logarithm (60) is the verified shell computation. Since (60) is even, its lower coordinate is necessarily (0). Therefore no element
  995.  
  996. [
  997. (60,u,0)
  998. ]
  999.  
  1000. is represented.
  1001.  
  1002. [
  1003. \boxed{}
  1004. ]
  1005.  
  1006. ---
  1007.  
  1008. ## Definition 6.2 — Completed star surplus
  1009.  
  1010. Let
  1011.  
  1012. [
  1013. H^\square
  1014. ]
  1015.  
  1016. be any finite abelian completed support group, with nonempty finite subsets
  1017.  
  1018. [
  1019. A_1^\square,\dots,A_s^\square\subseteq H^\square.
  1020. ]
  1021.  
  1022. Let
  1023.  
  1024. [
  1025. B^\square=A_1^\square+\cdots+A_s^\square.
  1026. ]
  1027.  
  1028. For a completed target set
  1029.  
  1030. [
  1031. U^\square\subseteq H^\square
  1032. ]
  1033.  
  1034. and subgroup
  1035.  
  1036. [
  1037. K\le H^\square,
  1038. ]
  1039.  
  1040. define
  1041.  
  1042. [
  1043. a_i^\square(K)
  1044. :=
  1045. \left|
  1046. \frac{A_i^\square+K}{K}
  1047. \right|,
  1048. ]
  1049.  
  1050. [
  1051. t_{U^\square}(K)
  1052. :=
  1053. \left|
  1054. \frac{U^\square+K}{K}
  1055. \right|,
  1056. ]
  1057.  
  1058. [
  1059. \kappa^\square(K)
  1060. :=
  1061. 1+\sum_i(a_i^\square(K)-1),
  1062. ]
  1063.  
  1064. and
  1065.  
  1066. [
  1067. \Sigma_{U^\square}^{\square}(K)
  1068. :=
  1069. \kappa^\square(K)+t_{U^\square}(K)-|H^\square/K|.
  1070. ]
  1071.  
  1072. ---
  1073.  
  1074. ## Theorem 6.3 — Completed Star–Kneser positivity
  1075.  
  1076. If
  1077.  
  1078. [
  1079. \Sigma_{U^\square}^{\square}(K)>0
  1080. \qquad
  1081. \forall K\le H^\square,
  1082. ]
  1083.  
  1084. then
  1085.  
  1086. [
  1087. B^\square\cap U^\square\ne\varnothing.
  1088. ]
  1089.  
  1090. Conversely, if
  1091.  
  1092. [
  1093. U^\square\ne\varnothing
  1094. ]
  1095.  
  1096. and
  1097.  
  1098. [
  1099. B^\square\cap U^\square=\varnothing,
  1100. ]
  1101.  
  1102. then for
  1103.  
  1104. [
  1105. K_\ast=\operatorname{Stab}(B^\square)
  1106. ]
  1107.  
  1108. one has
  1109.  
  1110. [
  1111. \Sigma_{U^\square}^{\square}(K_\ast)\le0.
  1112. ]
  1113.  
  1114. ### Proof
  1115.  
  1116. This is the Star–Kneser theorem applied to the finite abelian group
  1117.  
  1118. [
  1119. H^\square.
  1120. ]
  1121.  
  1122. The original Star–Kneser note proves exactly this quotient-forcing implication for finite support sumsets and target stars, and also proves the converse non-positive quotient obstruction for supported misses.
  1123.  
  1124. [
  1125. \boxed{}
  1126. ]
  1127.  
  1128. ---
  1129.  
  1130. # 7. Four-way zero-divisor product after (C_2)-compression
  1131.  
  1132. Define the parity-compression map
  1133.  
  1134. [
  1135. C_{106}\to C_2,
  1136. \qquad
  1137. [t]\mapsto \underline s^t.
  1138. ]
  1139.  
  1140. In the compressed completed algebra
  1141.  
  1142. [
  1143. \mathbb S_{\square}\otimes A_4,
  1144. ]
  1145.  
  1146. define
  1147.  
  1148. [
  1149. \overline X_{\square}
  1150. :=
  1151. o_1+\widehat s,\underline s,o_{1234},
  1152. ]
  1153.  
  1154. [
  1155. \overline Y
  1156. :=
  1157. o_2+\underline s,o_{34}.
  1158. ]
  1159.  
  1160. Here the lower signs come from the tags
  1161.  
  1162. [
  1163. 70\equiv0,\qquad
  1164. 5\equiv1,\qquad
  1165. 22\equiv0,\qquad
  1166. 19\equiv1
  1167. \pmod2.
  1168. ]
  1169.  
  1170. ---
  1171.  
  1172. ## Lemma 7.1 — Completed compressed products
  1173.  
  1174. One has
  1175.  
  1176. [
  1177. \boxed{
  1178. \overline X_{\square}\overline Y
  1179. ================================
  1180.  
  1181. (1+\widehat s)(o_{12}-\underline s,o_{134}).
  1182. }
  1183. ]
  1184.  
  1185. Also,
  1186.  
  1187. [
  1188. \boxed{
  1189. \overline Y\overline X_{\square}
  1190. ================================
  1191.  
  1192. -(1+\widehat s)(o_{12}-\underline s,o_{134}).
  1193. }
  1194. ]
  1195.  
  1196. ### Proof
  1197.  
  1198. Compute:
  1199.  
  1200. [
  1201. \overline X_{\square}\overline Y
  1202. ================================
  1203.  
  1204. (o_1+\widehat s\underline s,o_{1234})
  1205. (o_2+\underline s,o_{34}).
  1206. ]
  1207.  
  1208. Expanding,
  1209.  
  1210. [
  1211. \overline X_{\square}\overline Y
  1212. ================================
  1213.  
  1214. o_1o_2
  1215. +
  1216. \underline s,o_1o_{34}
  1217. +
  1218. \widehat s\underline s,o_{1234}o_2
  1219. +
  1220. \widehat s\underline s^2,o_{1234}o_{34}.
  1221. ]
  1222.  
  1223. Using
  1224.  
  1225. [
  1226. \underline s^2=1,
  1227. ]
  1228.  
  1229. [
  1230. o_1o_2=o_{12},
  1231. ]
  1232.  
  1233. [
  1234. o_1o_{34}=-o_{134},
  1235. ]
  1236.  
  1237. [
  1238. o_{1234}o_2=-o_{134},
  1239. ]
  1240.  
  1241. [
  1242. o_{1234}o_{34}=o_{12},
  1243. ]
  1244.  
  1245. we get
  1246.  
  1247. [
  1248. \overline X_{\square}\overline Y
  1249. ================================
  1250.  
  1251. ## o_{12}
  1252.  
  1253. ## \underline s,o_{134}
  1254.  
  1255. \widehat s\underline s,o_{134}
  1256. +
  1257. \widehat s,o_{12}.
  1258. ]
  1259.  
  1260. Thus
  1261.  
  1262. [
  1263. \overline X_{\square}\overline Y
  1264. ================================
  1265.  
  1266. ## (1+\widehat s)o_{12}
  1267.  
  1268. (1+\widehat s)\underline s,o_{134},
  1269. ]
  1270.  
  1271. so
  1272.  
  1273. [
  1274. \overline X_{\square}\overline Y
  1275. ================================
  1276.  
  1277. (1+\widehat s)(o_{12}-\underline s,o_{134}).
  1278. ]
  1279.  
  1280. Similarly,
  1281.  
  1282. [
  1283. \overline Y\overline X_{\square}
  1284. ================================
  1285.  
  1286. (o_2+\underline s,o_{34})
  1287. (o_1+\widehat s\underline s,o_{1234}).
  1288. ]
  1289.  
  1290. Expanding,
  1291.  
  1292. [
  1293. \overline Y\overline X_{\square}
  1294. ================================
  1295.  
  1296. o_2o_1
  1297. +
  1298. \widehat s\underline s,o_2o_{1234}
  1299. +
  1300. \underline s,o_{34}o_1
  1301. +
  1302. \widehat s\underline s^2,o_{34}o_{1234}.
  1303. ]
  1304.  
  1305. Using
  1306.  
  1307. [
  1308. o_2o_1=-o_{12},
  1309. ]
  1310.  
  1311. [
  1312. o_2o_{1234}=o_{134},
  1313. ]
  1314.  
  1315. [
  1316. o_{34}o_1=o_{134},
  1317. ]
  1318.  
  1319. [
  1320. o_{34}o_{1234}=-o_{12},
  1321. ]
  1322.  
  1323. we obtain
  1324.  
  1325. [
  1326. \overline Y\overline X_{\square}
  1327. ================================
  1328.  
  1329. -o_{12}
  1330. +
  1331. \widehat s\underline s,o_{134}
  1332. +
  1333. \underline s,o_{134}
  1334. --------------------
  1335.  
  1336. \widehat s,o_{12}.
  1337. ]
  1338.  
  1339. Thus
  1340.  
  1341. [
  1342. \overline Y\overline X_{\square}
  1343. ================================
  1344.  
  1345. -(1+\widehat s)o_{12}
  1346. +
  1347. (1+\widehat s)\underline s,o_{134}
  1348. ]
  1349.  
  1350. # [
  1351.  
  1352. -(1+\widehat s)(o_{12}-\underline s,o_{134}).
  1353. ]
  1354.  
  1355. [
  1356. \boxed{}
  1357. ]
  1358.  
  1359. ---
  1360.  
  1361. ## Corollary 7.2 — Upper-minus branch zero product
  1362.  
  1363. Since
  1364.  
  1365. [
  1366. 1+\widehat s
  1367. ============
  1368.  
  1369. 2(e^+*+ + e^+*-),
  1370. ]
  1371.  
  1372. one has
  1373.  
  1374. [
  1375. (e^-*+ + e^-*-)
  1376. \overline X_{\square}\overline Y
  1377. ================================
  1378.  
  1379. 0,
  1380. ]
  1381.  
  1382. and
  1383.  
  1384. [
  1385. (e^-*+ + e^-*-)
  1386. \overline Y\overline X_{\square}
  1387. ================================
  1388.  
  1389. 0.
  1390.  
  1391. ]
  1392.  
  1393. In particular, the upper-minus branch gives
  1394.  
  1395. [
  1396. \overline X_{\square}\overline Y=0,
  1397. \qquad
  1398. \overline Y\overline X_{\square}=0.
  1399. ]
  1400.  
  1401. ### Proof
  1402.  
  1403. The factor (1+\widehat s) annihilates the upper-minus idempotents:
  1404.  
  1405. [
  1406. (1+\widehat s)e^-_\delta=0.
  1407. ]
  1408.  
  1409. Apply this to Lemma 7.1.
  1410.  
  1411. [
  1412. \boxed{}
  1413. ]
  1414.  
  1415. ---
  1416.  
  1417. ## Corollary 7.3 — Upper-plus product sector
  1418.  
  1419. The nonzero compressed product is supported entirely in the upper-plus sectors:
  1420.  
  1421. [
  1422. \overline X_{\square}\overline Y
  1423. ================================
  1424.  
  1425. 2(e^+*+ + e^+*-)(o_{12}-\underline s,o_{134}).
  1426. ]
  1427.  
  1428. Thus the compressed product table contains no upper-minus mass.
  1429.  
  1430. ---
  1431.  
  1432. # 8. Completed associator residue
  1433.  
  1434. Let
  1435.  
  1436. [
  1437. \overline T:=\underline s,o_{34}.
  1438. ]
  1439.  
  1440. Define
  1441.  
  1442. [
  1443. \overline\Gamma_{\square}
  1444. :=
  1445. [L_{\overline X_{\square}},L_{\overline Y}]
  1446. -------------------------------------------
  1447.  
  1448. L_{[\overline X_{\square},\overline Y]}.
  1449. ]
  1450.  
  1451. ---
  1452.  
  1453. ## Theorem 8.1 — Completed compressed target residue
  1454.  
  1455. One has
  1456.  
  1457. [
  1458. \boxed{
  1459. \overline\Gamma_{\square}(\overline T)=2\widehat s,o_1.
  1460. }
  1461. ]
  1462.  
  1463. Moreover,
  1464.  
  1465. [
  1466. \overline\Gamma_{\square}(1)=0.
  1467. ]
  1468.  
  1469. ### Proof
  1470.  
  1471. First,
  1472.  
  1473. [
  1474. \overline\Gamma_{\square}(1)
  1475. ============================
  1476.  
  1477. *
  1478.  
  1479. L_{[\overline X_{\square},\overline Y]}(1).
  1480. ]
  1481.  
  1482. But
  1483.  
  1484. [
  1485.  
  1486. =
  1487. \overline X_{\square}\overline Y
  1488. --------------------------------
  1489.  
  1490. # \overline Y\overline X_{\square}
  1491.  
  1492. [\overline X_{\square},\overline Y],
  1493. ]
  1494.  
  1495. and
  1496.  
  1497. [
  1498. L_{[\overline X_{\square},\overline Y]}(1)
  1499. ==========================================
  1500.  
  1501. [\overline X_{\square},\overline Y].
  1502. ]
  1503.  
  1504. Hence
  1505.  
  1506. [
  1507. \overline\Gamma_{\square}(1)=0.
  1508. ]
  1509.  
  1510. Now compute at
  1511.  
  1512. [
  1513. \overline T=\underline s,o_{34}.
  1514. ]
  1515.  
  1516. One has
  1517.  
  1518. [
  1519. \overline Y\overline T
  1520. ======================
  1521.  
  1522. # (o_2+\underline s,o_{34})(\underline s,o_{34})
  1523.  
  1524. \underline s,o_2o_{34}
  1525. +
  1526. \underline s^2 o_{34}^2.
  1527. ]
  1528.  
  1529. Using
  1530.  
  1531. [
  1532. o_2o_{34}=-o_{234},
  1533. \qquad
  1534. o_{34}^2=-1,
  1535. ]
  1536.  
  1537. we get
  1538.  
  1539. [
  1540. \overline Y\overline T
  1541. ======================
  1542.  
  1543. -\underline s,o_{234}-1.
  1544. ]
  1545.  
  1546. Then
  1547.  
  1548. [
  1549. \overline X_{\square}(\overline Y\overline T)
  1550. =============================================
  1551.  
  1552. (o_1+\widehat s\underline s,o_{1234})
  1553. (-1-\underline s,o_{234}).
  1554. ]
  1555.  
  1556. Expanding,
  1557.  
  1558. [
  1559. \overline X_{\square}(\overline Y\overline T)
  1560. =============================================
  1561.  
  1562. -o_1
  1563. -\underline s,o_1o_{234}
  1564. -\widehat s\underline s,o_{1234}
  1565. -\widehat s\underline s^2,o_{1234}o_{234}.
  1566. ]
  1567.  
  1568. Using
  1569.  
  1570. [
  1571. o_1o_{234}=o_{1234},
  1572. ]
  1573.  
  1574. [
  1575. o_{1234}o_{234}=-o_1,
  1576. ]
  1577.  
  1578. and
  1579.  
  1580. [
  1581. \underline s^2=1,
  1582. ]
  1583.  
  1584. this becomes
  1585.  
  1586. [
  1587. \overline X_{\square}(\overline Y\overline T)
  1588. =============================================
  1589.  
  1590. -o_1
  1591. -\underline s,o_{1234}
  1592. -\widehat s\underline s,o_{1234}
  1593. +
  1594. \widehat s,o_1.
  1595. ]
  1596.  
  1597. Next,
  1598.  
  1599. [
  1600. \overline X_{\square}\overline T
  1601. ================================
  1602.  
  1603. (o_1+\widehat s\underline s,o_{1234})(\underline s,o_{34})
  1604. ]
  1605.  
  1606. # [
  1607.  
  1608. \underline s,o_1o_{34}
  1609. +
  1610. \widehat s\underline s^2,o_{1234}o_{34}.
  1611. ]
  1612.  
  1613. Using
  1614.  
  1615. [
  1616. o_1o_{34}=-o_{134},
  1617. \qquad
  1618. o_{1234}o_{34}=o_{12},
  1619. ]
  1620.  
  1621. we obtain
  1622.  
  1623. [
  1624. \overline X_{\square}\overline T
  1625. ================================
  1626.  
  1627. -\underline s,o_{134}
  1628. +
  1629. \widehat s,o_{12}.
  1630. ]
  1631.  
  1632. Then
  1633.  
  1634. [
  1635. \overline Y(\overline X_{\square}\overline T)
  1636. =============================================
  1637.  
  1638. (o_2+\underline s,o_{34})
  1639. (-\underline s,o_{134}+\widehat s,o_{12}).
  1640. ]
  1641.  
  1642. Expanding,
  1643.  
  1644. [
  1645. \overline Y(\overline X_{\square}\overline T)
  1646. =============================================
  1647.  
  1648. -\underline s,o_2o_{134}
  1649. +
  1650. \widehat s,o_2o_{12}
  1651. --------------------
  1652.  
  1653. \underline s^2,o_{34}o_{134}
  1654. +
  1655. \widehat s\underline s,o_{34}o_{12}.
  1656. ]
  1657.  
  1658. Using
  1659.  
  1660. [
  1661. o_2o_{134}=-o_{1234},
  1662. ]
  1663.  
  1664. [
  1665. o_2o_{12}=o_1,
  1666. ]
  1667.  
  1668. [
  1669. o_{34}o_{134}=-o_1,
  1670. ]
  1671.  
  1672. [
  1673. o_{34}o_{12}=o_{1234},
  1674. ]
  1675.  
  1676. we get
  1677.  
  1678. [
  1679. \overline Y(\overline X_{\square}\overline T)
  1680. =============================================
  1681.  
  1682. \underline s,o_{1234}
  1683. +
  1684. \widehat s,o_1
  1685. +
  1686. o_1
  1687. +
  1688. \widehat s\underline s,o_{1234}.
  1689. ]
  1690.  
  1691. Therefore
  1692.  
  1693. [
  1694. [L_{\overline X_{\square}},L_{\overline Y}](\overline T)
  1695. ========================================================
  1696.  
  1697. ## \overline X_{\square}(\overline Y\overline T)
  1698.  
  1699. \overline Y(\overline X_{\square}\overline T)
  1700. ]
  1701.  
  1702. # [
  1703.  
  1704. ## (-o_1-\underline s o_{1234}-\widehat s\underline s o_{1234}+\widehat s o_1)
  1705.  
  1706. (\underline s o_{1234}+\widehat s o_1+o_1+\widehat s\underline s o_{1234})
  1707. ]
  1708.  
  1709. # [
  1710.  
  1711. -2o_1
  1712. -2\underline s o_{1234}
  1713. -2\widehat s\underline s o_{1234}.
  1714. ]
  1715.  
  1716. From Lemma 7.1,
  1717.  
  1718. [
  1719. [\overline X_{\square},\overline Y]
  1720. ===================================
  1721.  
  1722. 2(1+\widehat s)(o_{12}-\underline s o_{134}).
  1723. ]
  1724.  
  1725. Multiplying by
  1726.  
  1727. [
  1728. \overline T=\underline s o_{34}
  1729. ]
  1730.  
  1731. gives
  1732.  
  1733. [
  1734. [\overline X_{\square},\overline Y]\overline T
  1735. ==============================================
  1736.  
  1737. 2(1+\widehat s)
  1738. \left(
  1739. \underline s,o_{12}o_{34}
  1740. -------------------------
  1741.  
  1742. \underline s^2,o_{134}o_{34}
  1743. \right).
  1744. ]
  1745.  
  1746. Using
  1747.  
  1748. [
  1749. o_{12}o_{34}=-o_{1234},
  1750. ]
  1751.  
  1752. [
  1753. o_{134}o_{34}=o_1,
  1754. ]
  1755.  
  1756. we obtain
  1757.  
  1758. [
  1759. [\overline X_{\square},\overline Y]\overline T
  1760. ==============================================
  1761.  
  1762. 2(1+\widehat s)
  1763. (-\underline s,o_{1234}-o_1).
  1764. ]
  1765.  
  1766. Thus
  1767.  
  1768. [
  1769. L_{[\overline X_{\square},\overline Y]}(\overline T)
  1770. ====================================================
  1771.  
  1772. ## -2(1+\widehat s)o_1
  1773.  
  1774. 2(1+\widehat s)\underline s o_{1234}.
  1775. ]
  1776.  
  1777. Now subtract:
  1778.  
  1779. [
  1780. \overline\Gamma_{\square}(\overline T)
  1781. ======================================
  1782.  
  1783. ## [L_{\overline X_{\square}},L_{\overline Y}](\overline T)
  1784.  
  1785. L_{[\overline X_{\square},\overline Y]}(\overline T).
  1786. ]
  1787.  
  1788. The (o_{1234})-terms cancel. The (o_1)-terms give
  1789.  
  1790. [
  1791. (-2o_1)-[-2(1+\widehat s)o_1]
  1792. =============================
  1793.  
  1794. # -2o_1+2o_1+2\widehat s o_1
  1795.  
  1796. 2\widehat s o_1.
  1797. ]
  1798.  
  1799. Hence
  1800.  
  1801. [
  1802. \overline\Gamma_{\square}(\overline T)=2\widehat s o_1.
  1803. ]
  1804.  
  1805. [
  1806. \boxed{}
  1807. ]
  1808.  
  1809. ---
  1810.  
  1811. ## Corollary 8.2 — Branch values of the target residue
  1812.  
  1813. [
  1814. \operatorname{br}*{+,+}
  1815. \bigl(\overline\Gamma*{\square}(\overline T)\bigr)
  1816. ==================================================
  1817.  
  1818. 2o_1,
  1819. ]
  1820.  
  1821. [
  1822. \operatorname{br}*{+,-}
  1823. \bigl(\overline\Gamma*{\square}(\overline T)\bigr)
  1824. ==================================================
  1825.  
  1826. 2o_1,
  1827. ]
  1828.  
  1829. [
  1830. \operatorname{br}*{-,+}
  1831. \bigl(\overline\Gamma*{\square}(\overline T)\bigr)
  1832. ==================================================
  1833.  
  1834. -2o_1,
  1835. ]
  1836.  
  1837. [
  1838. \operatorname{br}*{-,-}
  1839. \bigl(\overline\Gamma*{\square}(\overline T)\bigr)
  1840. ==================================================
  1841.  
  1842. -2o_1.
  1843. ]
  1844.  
  1845. Thus the residue depends on the upper sign and is independent of the lower sign after (C_2)-compression.
  1846.  
  1847. ---
  1848.  
  1849. # 9. Completed support positivity theorem
  1850.  
  1851. Let
  1852.  
  1853. [
  1854. \Theta_R^{\square,\mathrm{id}}(p)
  1855. ]
  1856.  
  1857. be the idempotent completed target coefficient of a coprime residual shell.
  1858.  
  1859. ---
  1860.  
  1861. ## Theorem 9.1 — Four-way support positivity equivalence
  1862.  
  1863. For every coprime residual shell,
  1864.  
  1865. [
  1866. \Theta_R^{\square,\mathrm{id}}(p)\ne0
  1867. ]
  1868.  
  1869. if and only if
  1870.  
  1871. [
  1872. B_R(a)\cap T_R(p)\ne\varnothing.
  1873. ]
  1874.  
  1875. Equivalently,
  1876.  
  1877. [
  1878. \mathsf M_{\square}
  1879. \bigl(
  1880. \Theta_R^{\square,\mathrm{id}}(p)
  1881. \bigr)>0
  1882. ]
  1883.  
  1884. if and only if the shell is positive.
  1885.  
  1886. ### Proof
  1887.  
  1888. The idempotent lift replaces each divisor exponent vector by a basis vector in a larger free module. It does not identify two different exponent vectors with opposite signs. Therefore a target exponent vector exists if and only if the completed idempotent coefficient has at least one nonzero sector coefficient.
  1889.  
  1890. The original Star–Kneser shell theorem identifies shell positivity with
  1891.  
  1892. [
  1893. B_R(a)\cap T_R(p)\ne\varnothing,
  1894. ]
  1895.  
  1896. and expresses supported failure by a non-positive quotient surplus.
  1897.  
  1898. Hence
  1899.  
  1900. [
  1901. \Theta_R^{\square,\mathrm{id}}(p)\ne0
  1902. \iff
  1903. B_R(a)\cap T_R(p)\ne\varnothing.
  1904. ]
  1905.  
  1906. Since the idempotent coefficients are nonnegative integers,
  1907.  
  1908. [
  1909. \Theta_R^{\square,\mathrm{id}}(p)\ne0
  1910. \iff
  1911. \mathsf M_{\square}
  1912. (\Theta_R^{\square,\mathrm{id}}(p))>0.
  1913. ]
  1914.  
  1915. [
  1916. \boxed{}
  1917. ]
  1918.  
  1919. ---
  1920.  
  1921. ## Corollary 9.2 — Completed (107)-shell positivity
  1922.  
  1923. For the champion shell,
  1924.  
  1925. [
  1926. \Theta_{107}^{\square,\mathrm{id}}(p_\ast)
  1927. ==========================================
  1928.  
  1929. 2e^-*-o*{34}[53],
  1930. ]
  1931.  
  1932. so
  1933.  
  1934. [
  1935. \mathsf M_{\square}
  1936. \bigl(
  1937. \Theta_{107}^{\square,\mathrm{id}}(p_\ast)
  1938. \bigr)
  1939. ======
  1940.  
  1941. 2.
  1942.  
  1943. ]
  1944.  
  1945. Therefore
  1946.  
  1947. [
  1948. \Omega_{107}(p_\ast)=2.
  1949. ]
  1950.  
  1951. ---
  1952.  
  1953. # 10. Completed (107)-shell equations
  1954.  
  1955. [
  1956. \mathbb S_{\square}
  1957. ===================
  1958.  
  1959. \mathbb R[\widehat s,\underline s]/(\widehat s^2-1,\underline s^2-1).
  1960. ]
  1961.  
  1962. [
  1963. e^\epsilon_\delta
  1964. =================
  1965.  
  1966. \frac14(1+\epsilon\widehat s)(1+\delta\underline s).
  1967. ]
  1968.  
  1969. [
  1970. \mathbb T_{\square}
  1971. ===================
  1972.  
  1973. \mathbb S_{\square}[\widehat g,\underline g]/
  1974. (\widehat g^2-\widehat s,\underline g^2-\underline s,\widehat g\underline g-\underline g\widehat g).
  1975. ]
  1976.  
  1977. [
  1978. q^\wedge(\beta)
  1979. ===============
  1980.  
  1981. \sum_{i=1}^{4}
  1982. \left\lfloor\frac{\beta_i}{2}\right\rfloor
  1983. \pmod2.
  1984. ]
  1985.  
  1986. [
  1987. q_\vee(\beta)
  1988. =============
  1989.  
  1990. # \Lambda(\beta)\pmod2
  1991.  
  1992. \beta_3\pmod2.
  1993. ]
  1994.  
  1995. [
  1996. m_{\square}^{\mathrm{id}}(\beta)
  1997. ================================
  1998.  
  1999. e^{(-1)^{q^\wedge(\beta)}}*{(-1)^{q*\vee(\beta)}}
  2000. o_{\pi(\beta)}[\Lambda(\beta)].
  2001. ]
  2002.  
  2003. [
  2004. m_{\square}^{\mathrm{ch}}(\beta)
  2005. ================================
  2006.  
  2007. \widehat s^{q^\wedge(\beta)}
  2008. \underline s^{q_\vee(\beta)}
  2009. o_{\pi(\beta)}[\Lambda(\beta)].
  2010. ]
  2011.  
  2012. [
  2013. \Theta_{107}^{\square,\mathrm{id}}(p_\ast)
  2014. ==========================================
  2015.  
  2016. 2e^-*-o*{34}[53].
  2017. ]
  2018.  
  2019. [
  2020. \Theta_{107}^{\square,\mathrm{ch}}(p_\ast)
  2021. ==========================================
  2022.  
  2023. 2\widehat s\underline s,o_{34}[53].
  2024. ]
  2025.  
  2026. [
  2027. \mathsf M_{-,-}
  2028. \bigl(
  2029. \Theta_{107}^{\square,\mathrm{id}}(p_\ast)
  2030. \bigr)
  2031. ======
  2032.  
  2033. 2.
  2034.  
  2035. ]
  2036.  
  2037. [
  2038. \mathsf M_{\square}
  2039. \bigl(
  2040. \Theta_{107}^{\square,\mathrm{id}}(p_\ast)
  2041. \bigr)
  2042. ======
  2043.  
  2044. 2.
  2045.  
  2046. ]
  2047.  
  2048. [
  2049. \mathsf Q_{\square}
  2050. \bigl(
  2051. \Theta_{107}^{\square,\mathrm{id}}(p_\ast)
  2052. \bigr)
  2053. ======
  2054.  
  2055. 4.
  2056.  
  2057. ]
  2058.  
  2059. [
  2060. G^\square
  2061. =========
  2062.  
  2063. C_{106}\oplus C_2^\wedge\oplus C_2^\vee.
  2064. ]
  2065.  
  2066. [
  2067. B^\square
  2068. =========
  2069.  
  2070. A_1^\square+A_2^\square+A_3^\square+A_4^\square.
  2071. ]
  2072.  
  2073. [
  2074. B^\square\cap{(53,1,1)}
  2075. =======================
  2076.  
  2077. {\beta^-,\beta^+}.
  2078. ]
  2079.  
  2080. [
  2081. B^\square\cap{(60,0,0),(60,1,0)}
  2082. ================================
  2083.  
  2084. \varnothing.
  2085. ]
  2086.  
  2087. [
  2088. \overline X_{\square}
  2089. =====================
  2090.  
  2091. o_1+\widehat s\underline s,o_{1234}.
  2092. ]
  2093.  
  2094. [
  2095. \overline Y
  2096. ===========
  2097.  
  2098. o_2+\underline s,o_{34}.
  2099. ]
  2100.  
  2101. [
  2102. \overline X_{\square}\overline Y
  2103. ================================
  2104.  
  2105. (1+\widehat s)(o_{12}-\underline s,o_{134}).
  2106. ]
  2107.  
  2108. [
  2109. \overline Y\overline X_{\square}
  2110. ================================
  2111.  
  2112. -(1+\widehat s)(o_{12}-\underline s,o_{134}).
  2113. ]
  2114.  
  2115. [
  2116. (e^-*+ + e^-*-)
  2117. \overline X_{\square}\overline Y
  2118. ================================
  2119.  
  2120. 0.
  2121.  
  2122. ]
  2123.  
  2124. [
  2125. (e^-*+ + e^-*-)
  2126. \overline Y\overline X_{\square}
  2127. ================================
  2128.  
  2129. 0.
  2130.  
  2131. ]
  2132.  
  2133. [
  2134. \overline T
  2135. ===========
  2136.  
  2137. \underline s,o_{34}.
  2138. ]
  2139.  
  2140. [
  2141. \overline\Gamma_{\square}
  2142. =========================
  2143.  
  2144. ## [L_{\overline X_{\square}},L_{\overline Y}]
  2145.  
  2146. L_{[\overline X_{\square},\overline Y]}.
  2147. ]
  2148.  
  2149. [
  2150. \overline\Gamma_{\square}(1)=0.
  2151. ]
  2152.  
  2153. [
  2154. \overline\Gamma_{\square}(\overline T)
  2155. ======================================
  2156.  
  2157. 2\widehat s,o_1.
  2158. ]
  2159.  
  2160. [
  2161. \operatorname{br}*{+,+}
  2162. (\Theta*{107}^{\square,\mathrm{ch}})
  2163. ====================================
  2164.  
  2165. 2o_{34}[53].
  2166. ]
  2167.  
  2168. [
  2169. \operatorname{br}*{+,-}
  2170. (\Theta*{107}^{\square,\mathrm{ch}})
  2171. ====================================
  2172.  
  2173. -2o_{34}[53].
  2174. ]
  2175.  
  2176. [
  2177. \operatorname{br}*{-,+}
  2178. (\Theta*{107}^{\square,\mathrm{ch}})
  2179. ====================================
  2180.  
  2181. -2o_{34}[53].
  2182. ]
  2183.  
  2184. [
  2185. \operatorname{br}*{-,-}
  2186. (\Theta*{107}^{\square,\mathrm{ch}})
  2187. ====================================
  2188.  
  2189. 2o_{34}[53].
  2190. ]
  2191.  
  2192. Thus the four-way completion isolates the actual positive coefficient as the idempotent-sector fact
  2193.  
  2194. [
  2195. \boxed{
  2196. \Theta_{107}^{\square,\mathrm{id}}(p_\ast)
  2197. ==========================================
  2198.  
  2199. 2e^-*-o*{34}[53],
  2200. }
  2201. ]
  2202.  
  2203. while the old two-way supersignum coefficient is the lower-forgotten character shadow
  2204.  
  2205. [
  2206. \boxed{
  2207. 2\widehat s\underline s,o_{34}[53]
  2208. \longmapsto
  2209. 2s,o_{34}[53].
  2210. }
  2211. ]
  2212.  
  2213.  
  2214.  
  2215. Activity
  2216. ·
  2217. 16m 59s
  2218.  
  2219. Pro thinking
  2220. Quick answer
  2221. Reading documents
  2222. Reading documents
  2223.  
  2224. Considering the asymmetry of blade 1 in the computations
  2225. I need to focus on blade 1, since it’s the only non-symmetric option. Blade 1's counts are 5 and 4. I also need to figure out the positivity condition in a scalar blade and maybe include some references supporting verification data and Star-Kneser. Python might be needed for computations.
  2226.  
  2227. Performing calculations for blade 1 and identifying asymmetry
  2228. I need to calculate the exact values for blade 1, possibly looking at residues, convolutions, or targets, and find hidden positivity conditions. Blade 1's coefficient asymmetry shows in both its character polynomial and idempotent form. This non-symmetric blade appears to be critical for positivity conditions.
  2229.  
  2230. Performing blade coefficient computation for S_square polynomial
  2231. I need to compute the blade coefficients in the S_square polynomial using the character form. From the table, blade 1 has 5+4h, and others follow a similar structure. I'll focus on evaluating the coefficients for each blade, noting key moments and using values like h = -1 to check scaling behavior.
  2232.  
  2233. Analyzing scalar blade coefficients and positivity conditions
  2234. I'm looking at the scalar blade and calculating its coefficients using various tag values. The total seems to give a weighted sum, including positive and negative contributions. I’m considering how the positivity condition might relate to the target hit and the role of scalar and non-scalar elements. There's a sign pattern based on q values.
  2235.  
  2236. Analyzing blade 1’s positive/negative signs and the positivity condition
  2237. Blade 1 has a mix of negative and positive signs, with certain target tags forming pairs. I’m considering how the positivity condition might relate to the intersection of the scalar and lower slices. I’m also looking at decomposing the support to formalize an idempotent scalar mass to clarify positivity further.
  2238.  
  2239. Exploring blade 1's non-symmetric positivity and algebra
  2240. I’m thinking through the condition for blade 1’s non-symmetric positivity, where negative tags interact with positive pairs to form a result. I wonder if this can be encoded and what happens when I compute their convolution. I need to be cautious about algebra rules — signs should combine using XOR, not idempotent multiplication.
  2241.  
  2242. Refining blade 1 positivity and algebra approach
  2243. I realized that using "idempotent sector counts" in this way doesn't work for convolution. To fix this, I should think of the sector count object as living in a free semimodule instead of a product algebra. For multiplication, labels should add in group algebra, and the mass basis needs to be separate from the character basis.
  2244.  
  2245. Defining blade set and scalar positivity
  2246. I’m considering the target’s coefficient factors as the convolution of two scalar square-lift terms, where the core involves non-scalar terms from o34. The positivity count seems to be a product of scalar mass and core mass. I should define scalar sets and compute pairings, refining the target's configuration with more detailed orientation consideration.
  2247.  
  2248. Refining target coefficient and positivity count
  2249. I’ve determined that the coefficient at tag 53 is 2 based on convolution and combining scalar tags and core tags. The target’s coefficient extraction seems clear, and positivity count matches the coefficient. The full target vector has β2 = 0, so now I’m adjusting for blade 1’s non-symmetry, focusing on circular branch evaluation.
  2250.  
  2251. Analyzing blade positivity and Euler imbalances
  2252. Examining the local polynomial, I see that at
  2253. h
  2254. =
  2255. −
  2256. 1
  2257. h=−1, the scalar contributes a -1 while the positivity in blade 1 stems from two Euler imbalances multiplying to 1. The scalar blade counts show a difference of 1 between even-square and negative signs, confirming the positivity coefficient. This is tied to a discrete Euler index.
  2258.  
  2259. Analyzing positivity and blade 1 properties
  2260. The scalar support’s convolution with the
  2261. o
  2262. 34
  2263. o34-core gives target
  2264. (
  2265. 53
  2266. ,
  2267. 1
  2268. ,
  2269. 1
  2270. )
  2271. (53,1,1) with multiplicity two, showing positivity as the product is greater than zero. I define terms using polynomials for blade 1, confirming the only non-symmetric contribution. Mass in sectors gives a branch of +9 and -1 at
  2272. h
  2273. =
  2274. +
  2275. 1
  2276. h=+1, while at
  2277. h
  2278. =
  2279. −
  2280. 1
  2281. h=−1, it's +1 and -5.
  2282.  
  2283. Clarifying positivity in scalar and blade
  2284. For coordinate 3, lower and upper counts are equal, and the same for coordinate 4. The target coefficient lives on blade1 as a scalar square-lift, not as the final blade of the hit. I'll define a scalar lift operator (denoted
  2285. S
  2286. ⋆
  2287. S
  2288. ⋆
  2289. ​
  2290. ) to rigorously explain this translation process, and the positivity condition.
  2291.  
  2292. Confirming target coefficient calculation
  2293. The total augmentation is 1, but not positive as a measure. The tag-wise positivity target uses a subblock. If I convolve the full scalar blade with the o34 primitive and check the coefficient at the target, it seems to be 2. The scalar tags and core tags match, confirming the result.
  2294.  
  2295. Confirming target coefficient and proving positivity
  2296. The target coefficient is exactly 2, seen from the scalar times core convolution. This confirms that the blade1 scalar translation of the primitive o34 core explains the target positivity. Since all o34 target hits must have β1,β2 even, the full o34 blade is confirmed as the product of even scalar and odd core.
  2297.  
  2298. Confirming positivity through scalar tags
  2299. The target positivity for 53 and absence for 60 both arise from the scalar blade tag set within the restricted
  2300. o
  2301. 34
  2302. o34 blade factorization. The size of the set for target 53 is 2, while for 60, it is empty. This confirms the positivity condition clearly and rigorously.
  2303.  
  2304.  
  2305.  
  2306. # Blade-(1) completion and the hidden (107)-positivity coefficient
  2307.  
  2308. ## 0. Fixed (107)-shell data
  2309.  
  2310. [
  2311. p_\ast=8,803,369,\qquad R=107,
  2312. ]
  2313.  
  2314. [
  2315. a_\ast=\frac{p_\ast+107}{4}
  2316. =2,200,869
  2317. =3^2\cdot 11^2\cdot 43\cdot 47.
  2318. ]
  2319.  
  2320. Let
  2321.  
  2322. [
  2323. (\ell_1,\ell_2,\ell_3,\ell_4)=(3,11,43,47),
  2324. ]
  2325.  
  2326. and
  2327.  
  2328. [
  2329. \mathcal B=[-2,2]\times[-2,2]\times[-1,1]\times[-1,1].
  2330. ]
  2331.  
  2332. With primitive generator (2\in\mathbb F_{107}^{\times}),
  2333.  
  2334. [
  2335. \log_2(3)=70,\qquad
  2336. \log_2(11)=22,\qquad
  2337. \log_2(43)=59,\qquad
  2338. \log_2(47)=66
  2339. ]
  2340.  
  2341. in (C_{106}). Define
  2342.  
  2343. [
  2344. \Lambda(\beta_1,\beta_2,\beta_3,\beta_4)
  2345. ========================================
  2346.  
  2347. 70\beta_1+22\beta_2+59\beta_3+66\beta_4
  2348. \in C_{106}.
  2349. ]
  2350.  
  2351. The target logarithms are
  2352.  
  2353. [
  2354. \log_2(-1)=53,\qquad
  2355. \log_2(-p_\ast^{-1})=60.
  2356. ]
  2357.  
  2358. The verification output gives exactly two vectors at (53),
  2359.  
  2360. [
  2361. \beta^-:=(-2,0,-1,-1),
  2362. \qquad
  2363. \beta^+:=(2,0,1,1),
  2364. ]
  2365.  
  2366. and no vector at (60).
  2367.  
  2368. The residual Star–Kneser shell formalism identifies positivity with nonempty divisor-support intersection with the two-target star, with multiplicity pattern (1+2).
  2369.  
  2370. ---
  2371.  
  2372. # 1. Completed four-way sign algebra in the multiplicative sector basis
  2373.  
  2374. Use the sign group
  2375.  
  2376. [
  2377. \Gamma_\square:=C_2^\wedge\times C_2^\vee
  2378. =========================================
  2379.  
  2380. {(+,+),(+,-),(-,+),(-,-)}.
  2381. ]
  2382.  
  2383. Let
  2384.  
  2385. [
  2386. \mathbb Z[\Gamma_\square]
  2387. =========================
  2388.  
  2389. \mathbb Z[\widehat s,\underline s]/(\widehat s^2-1,\underline s^2-1).
  2390. ]
  2391.  
  2392. The multiplicative sector basis is
  2393.  
  2394. [
  2395. \mathbf u_{\epsilon,\delta},
  2396. \qquad
  2397. \epsilon,\delta\in{\pm1},
  2398. ]
  2399.  
  2400. with
  2401.  
  2402. [
  2403. \mathbf u_{\epsilon,\delta}\mathbf u_{\epsilon',\delta'}
  2404. ========================================================
  2405.  
  2406. \mathbf u_{\epsilon\epsilon',\delta\delta'}.
  2407. ]
  2408.  
  2409. Thus
  2410.  
  2411. [
  2412. \widehat s=\mathbf u_{-,+},
  2413. \qquad
  2414. \underline s=\mathbf u_{+,-},
  2415. \qquad
  2416. \widehat s\underline s=\mathbf u_{-,-}.
  2417. ]
  2418.  
  2419. This is the basis in which positivity of completed sector counts is read.
  2420.  
  2421. For
  2422.  
  2423. [
  2424. \beta=(\beta_1,\beta_2,\beta_3,\beta_4)\in\mathcal B,
  2425. ]
  2426.  
  2427. define
  2428.  
  2429. [
  2430. q^\wedge(\beta)
  2431. ===============
  2432.  
  2433. \sum_{i=1}^{4}
  2434. \left\lfloor\frac{\beta_i}{2}\right\rfloor
  2435. \pmod2,
  2436. ]
  2437.  
  2438. and
  2439.  
  2440. [
  2441. q^\vee(\beta)
  2442. =============
  2443.  
  2444. \Lambda(\beta)\pmod2.
  2445. ]
  2446.  
  2447. Since
  2448.  
  2449. [
  2450. 70\equiv0,\quad 22\equiv0,\quad 59\equiv1,\quad 66\equiv0
  2451. \pmod2,
  2452. ]
  2453.  
  2454. one has
  2455.  
  2456. [
  2457. q^\vee(\beta)=\beta_3\pmod2.
  2458. ]
  2459.  
  2460. Let
  2461.  
  2462. [
  2463. \pi(\beta):={i:\beta_i\equiv1\pmod2}.
  2464. ]
  2465.  
  2466. The completed monomial is
  2467.  
  2468. [
  2469. m_\square(\beta)
  2470. ================
  2471.  
  2472. \widehat s^{q^\wedge(\beta)}
  2473. \underline s^{q^\vee(\beta)}
  2474. o_{\pi(\beta)}[\Lambda(\beta)].
  2475. ]
  2476.  
  2477. Equivalently,
  2478.  
  2479. [
  2480. m_\square(\beta)
  2481. ================
  2482.  
  2483. \mathbf u_{(-1)^{q^\wedge(\beta)},,(-1)^{q^\vee(\beta)}}
  2484. o_{\pi(\beta)}[\Lambda(\beta)].
  2485. ]
  2486.  
  2487. ---
  2488.  
  2489. # 2. Blade-(1) is the unique tag-forgotten upper-asymmetric blade
  2490.  
  2491. Let
  2492.  
  2493. [
  2494. X_i^2=1
  2495. ]
  2496.  
  2497. record blade parity.
  2498.  
  2499. The tag-forgotten completed blade polynomial is
  2500.  
  2501. [
  2502. \mathcal P_{\mathcal B}^{\square}
  2503. =================================
  2504.  
  2505. (1+2\widehat s+(1+\widehat s)X_1)
  2506. (1+2\widehat s+(1+\widehat s)X_2)
  2507. (1+(1+\widehat s)\underline s X_3)
  2508. (1+(1+\widehat s)X_4).
  2509. ]
  2510.  
  2511. ## Lemma 2.1 — Non-scalar blades have an upper cancellation factor
  2512.  
  2513. For every nonempty blade
  2514.  
  2515. [
  2516. I\neq\varnothing,
  2517. ]
  2518.  
  2519. the coefficient of (X_I) in (\mathcal P_{\mathcal B}^{\square}) is divisible by
  2520.  
  2521. [
  2522. 1+\widehat s.
  2523. ]
  2524.  
  2525. For the scalar blade (I=\varnothing), the coefficient is
  2526.  
  2527. [
  2528. 5+4\widehat s.
  2529. ]
  2530.  
  2531. ### Proof
  2532.  
  2533. A coordinate contributes an odd blade factor (X_i) only through the odd-exponent part.
  2534.  
  2535. For coordinates (1,2), the local polynomial is
  2536.  
  2537. [
  2538. 1+2\widehat s+(1+\widehat s)X_i.
  2539. ]
  2540.  
  2541. For coordinate (3), the local polynomial is
  2542.  
  2543. [
  2544. 1+(1+\widehat s)\underline sX_3.
  2545. ]
  2546.  
  2547. For coordinate (4), the local polynomial is
  2548.  
  2549. [
  2550. 1+(1+\widehat s)X_4.
  2551. ]
  2552.  
  2553. Thus every nonempty blade coefficient contains at least one odd-coordinate factor, hence contains
  2554.  
  2555. [
  2556. 1+\widehat s.
  2557. ]
  2558.  
  2559. For (I=\varnothing), only the even parts contribute:
  2560.  
  2561. [
  2562. (1+2\widehat s)^2.
  2563. ]
  2564.  
  2565. Since
  2566.  
  2567. [
  2568. \widehat s^2=1,
  2569. ]
  2570.  
  2571. [
  2572. (1+2\widehat s)^2
  2573. =================
  2574.  
  2575. # 1+4\widehat s+4\widehat s^2
  2576.  
  2577. 5+4\widehat s.
  2578. ]
  2579.  
  2580. [
  2581. \boxed{}
  2582. ]
  2583.  
  2584. ---
  2585.  
  2586. ## Corollary 2.2 — Upper-circular projection
  2587.  
  2588. Under
  2589.  
  2590. [
  2591. \widehat s\mapsto -1,
  2592. ]
  2593.  
  2594. one has
  2595.  
  2596. [
  2597. 5+4\widehat s\mapsto 1,
  2598. ]
  2599.  
  2600. whereas every nonempty blade coefficient maps to (0).
  2601.  
  2602. Thus the tag-forgotten circular part is exactly
  2603.  
  2604. [
  2605. \boxed{
  2606. \operatorname{circ}*\wedge
  2607. \bigl(\mathcal P*{\mathcal B}^{\square}\bigr)
  2608. =============================================
  2609.  
  2610. 1.
  2611.  
  2612. }
  2613. ]
  2614.  
  2615. So the only non-symmetric blade is indeed
  2616.  
  2617. [
  2618. \boxed{o_\varnothing=1.}
  2619. ]
  2620.  
  2621. ---
  2622.  
  2623. # 3. Tag-resolved blade-(1) distribution
  2624.  
  2625. Blade (1) means
  2626.  
  2627. [
  2628. \beta_1,\beta_2,\beta_3,\beta_4
  2629. \quad\text{all even}.
  2630. ]
  2631.  
  2632. Inside (\mathcal B), this forces
  2633.  
  2634. [
  2635. \beta_3=\beta_4=0,
  2636. ]
  2637.  
  2638. and
  2639.  
  2640. [
  2641. \beta_1,\beta_2\in{-2,0,2}.
  2642. ]
  2643.  
  2644. Write
  2645.  
  2646. [
  2647. \alpha_1=\frac{\beta_1}{2},
  2648. \qquad
  2649. \alpha_2=\frac{\beta_2}{2},
  2650. ]
  2651.  
  2652. so
  2653.  
  2654. [
  2655. \alpha_1,\alpha_2\in{-1,0,1}.
  2656. ]
  2657.  
  2658. Then
  2659.  
  2660. [
  2661. \Lambda(\beta_1,\beta_2,0,0)
  2662. ============================
  2663.  
  2664. 140\alpha_1+44\alpha_2
  2665. \equiv
  2666. 34\alpha_1+44\alpha_2
  2667. \pmod{106},
  2668. ]
  2669.  
  2670. and
  2671.  
  2672. [
  2673. q^\wedge(\beta_1,\beta_2,0,0)
  2674. =============================
  2675.  
  2676. \alpha_1+\alpha_2\pmod2.
  2677. ]
  2678.  
  2679. Also
  2680.  
  2681. [
  2682. q^\vee(\beta_1,\beta_2,0,0)=0.
  2683. ]
  2684.  
  2685. Hence all blade-(1) terms have lower sign (+).
  2686.  
  2687. ---
  2688.  
  2689. ## Lemma 3.1 — Exact blade-(1) sector table
  2690.  
  2691. The blade-(1) sector distribution is
  2692.  
  2693. [
  2694. \mathfrak B_1
  2695. =============
  2696.  
  2697. \mathbf u_{+,+}B_1^+
  2698. +
  2699. \mathbf u_{-,+}B_1^-,
  2700. ]
  2701.  
  2702. where
  2703.  
  2704. [
  2705. B_1^+
  2706. =====
  2707.  
  2708. [0]+[10]+[28]+[78]+[96],
  2709. ]
  2710.  
  2711. and
  2712.  
  2713. [
  2714. B_1^-
  2715. =====
  2716.  
  2717. [34]+[44]+[62]+[72].
  2718. ]
  2719.  
  2720. Equivalently,
  2721.  
  2722. [
  2723. \mathfrak B_1
  2724. =============
  2725.  
  2726. \mathbf u_{+,+}
  2727. \bigl([0]+[10]+[28]+[78]+[96]\bigr)
  2728. +
  2729. \mathbf u_{-,+}
  2730. \bigl([34]+[44]+[62]+[72]\bigr).
  2731. ]
  2732.  
  2733. ### Proof
  2734.  
  2735. The full table is:
  2736.  
  2737. [
  2738. \begin{array}{c|c|c|c}
  2739. (\alpha_1,\alpha_2)
  2740. &
  2741. \beta=(2\alpha_1,2\alpha_2,0,0)
  2742. &
  2743. \Lambda(\beta)
  2744. &
  2745. (-1)^{q^\wedge(\beta)}
  2746. \
  2747. \hline
  2748. (-1,-1)&(-2,-2,0,0)&28&+\
  2749. (-1,0)&(-2,0,0,0)&72&-\
  2750. (-1,1)&(-2,2,0,0)&10&+\
  2751. (0,-1)&(0,-2,0,0)&62&-\
  2752. (0,0)&(0,0,0,0)&0&+\
  2753. (0,1)&(0,2,0,0)&44&-\
  2754. (1,-1)&(2,-2,0,0)&96&+\
  2755. (1,0)&(2,0,0,0)&34&-\
  2756. (1,1)&(2,2,0,0)&78&+
  2757. \end{array}
  2758. ]
  2759.  
  2760. Thus the upper-plus tags are
  2761.  
  2762. [
  2763. 0,\ 10,\ 28,\ 78,\ 96,
  2764. ]
  2765.  
  2766. and the upper-minus tags are
  2767.  
  2768. [
  2769. 34,\ 44,\ 62,\ 72.
  2770. ]
  2771.  
  2772. All lower signs are (+).
  2773.  
  2774. [
  2775. \boxed{}
  2776. ]
  2777.  
  2778. ---
  2779.  
  2780. ## Corollary 3.2 — Blade-(1) imbalance
  2781.  
  2782. The tag-forgotten blade-(1) sector count is
  2783.  
  2784. [
  2785. 5\mathbf u_{+,+}+4\mathbf u_{-,+}.
  2786. ]
  2787.  
  2788. The upper-circular imbalance is
  2789.  
  2790. [
  2791. 5-4=1.
  2792. ]
  2793.  
  2794. The tag-resolved signed blade-(1) element is
  2795.  
  2796. [
  2797. \Delta_1
  2798. :=
  2799. B_1^+-B_1^-,
  2800. ]
  2801.  
  2802. namely
  2803.  
  2804. [
  2805. \boxed{
  2806. \Delta_1
  2807. ========
  2808.  
  2809. ## [0]+[10]+[28]+[78]+[96]
  2810.  
  2811. [34]-[44]-[62]-[72].
  2812. }
  2813. ]
  2814.  
  2815. Its augmentation is
  2816.  
  2817. [
  2818. \varepsilon(\Delta_1)=1.
  2819. ]
  2820.  
  2821. ---
  2822.  
  2823. # 4. The primitive (o_{34})-leg
  2824.  
  2825. The (o_{34})-leg with no scalar contribution from coordinates (1,2) is obtained from
  2826.  
  2827. [
  2828. \beta_1=\beta_2=0,
  2829. \qquad
  2830. \beta_3,\beta_4\in{-1,1}.
  2831. ]
  2832.  
  2833. Since (q^\vee=\beta_3\bmod2), every such term has lower sign (-).
  2834.  
  2835. ## Lemma 4.1 — Exact primitive (o_{34})-leg table
  2836.  
  2837. Define
  2838.  
  2839. [
  2840. L_{34}^+
  2841. ========
  2842.  
  2843. [19]+[87],
  2844. ]
  2845.  
  2846. and
  2847.  
  2848. [
  2849. L_{34}^-
  2850. ========
  2851.  
  2852. [7]+[99].
  2853. ]
  2854.  
  2855. Then the primitive (o_{34})-leg is
  2856.  
  2857. [
  2858. \mathfrak L_{34}
  2859. ================
  2860.  
  2861. o_{34}
  2862. \left(
  2863. \mathbf u_{+,-}L_{34}^+
  2864. +
  2865. \mathbf u_{-,-}L_{34}^-
  2866. \right).
  2867. ]
  2868.  
  2869. ### Proof
  2870.  
  2871. The four primitive (o_{34})-leg vectors are:
  2872.  
  2873. [
  2874. \begin{array}{c|c|c|c}
  2875. (\beta_3,\beta_4)
  2876. &
  2877. \Lambda(0,0,\beta_3,\beta_4)
  2878. &
  2879. (-1)^{q^\wedge}
  2880. &
  2881. (-1)^{q^\vee}
  2882. \
  2883. \hline
  2884. (1,1)&59+66=125\equiv19&+&-\
  2885. (-1,-1)&-59-66=-125\equiv87&+&-\
  2886. (-1,1)&-59+66=7&-&-\
  2887. (1,-1)&59-66=-7\equiv99&-&-
  2888. \end{array}
  2889. ]
  2890.  
  2891. Thus
  2892.  
  2893. [
  2894. L_{34}^+=[19]+[87],
  2895. ]
  2896.  
  2897. and
  2898.  
  2899. [
  2900. L_{34}^-=[7]+[99].
  2901. ]
  2902.  
  2903. [
  2904. \boxed{}
  2905. ]
  2906.  
  2907. ---
  2908.  
  2909. # 5. The (o_{34})-target coefficient factors through blade (1)
  2910.  
  2911. Every vector with blade (o_{34}) has the unique decomposition
  2912.  
  2913. [
  2914. \beta
  2915. =====
  2916.  
  2917. (\beta_1,\beta_2,0,0)
  2918. +
  2919. (0,0,\beta_3,\beta_4),
  2920. ]
  2921.  
  2922. where
  2923.  
  2924. [
  2925. \beta_1,\beta_2\in{-2,0,2},
  2926. ]
  2927.  
  2928. and
  2929.  
  2930. [
  2931. \beta_3,\beta_4\in{-1,1}.
  2932. ]
  2933.  
  2934. Thus the full (o_{34})-sector is the product
  2935.  
  2936. [
  2937. \mathfrak B_1\mathfrak L_{34}.
  2938. ]
  2939.  
  2940. Using the sector multiplication law,
  2941.  
  2942. [
  2943. \mathbf u_{\epsilon,\delta}\mathbf u_{\epsilon',\delta'}
  2944. ========================================================
  2945.  
  2946. \mathbf u_{\epsilon\epsilon',\delta\delta'},
  2947. ]
  2948.  
  2949. one obtains
  2950.  
  2951. [
  2952. \mathfrak B_1\mathfrak L_{34}
  2953. =============================
  2954.  
  2955. o_{34}
  2956. \left[
  2957. \mathbf u_{+,-}
  2958. \bigl(B_1^+L_{34}^+ + B_1^-L_{34}^-\bigr)
  2959. +
  2960. \mathbf u_{-,-}
  2961. \bigl(B_1^-L_{34}^+ + B_1^+L_{34}^-\bigr)
  2962. \right].
  2963. ]
  2964.  
  2965. Therefore the lower-minus, upper-minus target coefficient is controlled by
  2966.  
  2967. [
  2968. \boxed{
  2969. P_{1\to34}^{-,-}(t)
  2970. :=
  2971. [t]\bigl(B_1^-L_{34}^+ + B_1^+L_{34}^-\bigr).
  2972. }
  2973. ]
  2974.  
  2975. ---
  2976.  
  2977. ## Lemma 5.1 — Full ((-, -))-sector product table
  2978.  
  2979. One has
  2980.  
  2981. [
  2982. B_1^-L_{34}^+
  2983. =============
  2984.  
  2985. [15]+[25]+[43]+2[53]+[63]+[81]+[91],
  2986. ]
  2987.  
  2988. and
  2989.  
  2990. [
  2991. B_1^+L_{34}^-
  2992. =============
  2993.  
  2994. [3]+[7]+[17]+[21]+[35]+[71]+[85]+[89]+[99]+[103].
  2995. ]
  2996.  
  2997. Hence
  2998.  
  2999. [
  3000. \boxed{
  3001. B_1^-L_{34}^+ + B_1^+L_{34}^-
  3002. =============================
  3003.  
  3004. [3]+[7]+[15]+[17]+[21]+[25]+[35]+[43]
  3005. +2[53]
  3006. }
  3007. ]
  3008.  
  3009. [
  3010. \boxed{
  3011. \qquad
  3012. +[63]+[71]+[81]+[85]+[89]+[91]+[99]+[103].
  3013. }
  3014. ]
  3015.  
  3016. In particular,
  3017.  
  3018. [
  3019. \boxed{
  3020. P_{1\to34}^{-,-}(53)=2.
  3021. }
  3022. ]
  3023.  
  3024. Also,
  3025.  
  3026. [
  3027. \boxed{
  3028. P_{1\to34}^{-,-}(60)=0.
  3029. }
  3030. ]
  3031.  
  3032. ### Proof
  3033.  
  3034. First,
  3035.  
  3036. [
  3037. B_1^-=[34]+[44]+[62]+[72],
  3038. ]
  3039.  
  3040. and
  3041.  
  3042. [
  3043. L_{34}^+=[19]+[87].
  3044. ]
  3045.  
  3046. Thus
  3047.  
  3048. [
  3049. B_1^-L_{34}^+
  3050. =============
  3051.  
  3052. ([34]+[44]+[62]+[72])([19]+[87]).
  3053. ]
  3054.  
  3055. Compute all sums modulo (106):
  3056.  
  3057. [
  3058. 34+19=53,
  3059. \qquad
  3060. 34+87=121\equiv15,
  3061. ]
  3062.  
  3063. [
  3064. 44+19=63,
  3065. \qquad
  3066. 44+87=131\equiv25,
  3067. ]
  3068.  
  3069. [
  3070. 62+19=81,
  3071. \qquad
  3072. 62+87=149\equiv43,
  3073. ]
  3074.  
  3075. [
  3076. 72+19=91,
  3077. \qquad
  3078. 72+87=159\equiv53.
  3079. ]
  3080.  
  3081. Therefore
  3082.  
  3083. [
  3084. B_1^-L_{34}^+
  3085. =============
  3086.  
  3087. [15]+[25]+[43]+2[53]+[63]+[81]+[91].
  3088. ]
  3089.  
  3090. Second,
  3091.  
  3092. [
  3093. B_1^+=[0]+[10]+[28]+[78]+[96],
  3094. ]
  3095.  
  3096. and
  3097.  
  3098. [
  3099. L_{34}^-=[7]+[99].
  3100. ]
  3101.  
  3102. Thus
  3103.  
  3104. [
  3105. B_1^+L_{34}^-
  3106. =============
  3107.  
  3108. ([0]+[10]+[28]+[78]+[96])([7]+[99]).
  3109. ]
  3110.  
  3111. The sums are
  3112.  
  3113. [
  3114. 0+7=7,\qquad 0+99=99,
  3115. ]
  3116.  
  3117. [
  3118. 10+7=17,\qquad 10+99=109\equiv3,
  3119. ]
  3120.  
  3121. [
  3122. 28+7=35,\qquad 28+99=127\equiv21,
  3123. ]
  3124.  
  3125. [
  3126. 78+7=85,\qquad 78+99=177\equiv71,
  3127. ]
  3128.  
  3129. [
  3130. 96+7=103,\qquad 96+99=195\equiv89.
  3131. ]
  3132.  
  3133. Therefore
  3134.  
  3135. [
  3136. B_1^+L_{34}^-
  3137. =============
  3138.  
  3139. [3]+[7]+[17]+[21]+[35]+[71]+[85]+[89]+[99]+[103].
  3140. ]
  3141.  
  3142. Adding gives the displayed table.
  3143.  
  3144. The coefficient of ([53]) is exactly (2), coming only from
  3145.  
  3146. [
  3147. 34+19=53
  3148. ]
  3149.  
  3150. and
  3151.  
  3152. [
  3153. 72+87=53.
  3154. ]
  3155.  
  3156. No summand is (60).
  3157.  
  3158. [
  3159. \boxed{}
  3160. ]
  3161.  
  3162. ---
  3163.  
  3164. ## Lemma 5.2 — Full ((+, -))-sector product table
  3165.  
  3166. One has
  3167.  
  3168. [
  3169. B_1^+L_{34}^+
  3170. =============
  3171.  
  3172. 2[9]+[19]+[29]+[47]+[59]+[77]+[87]+2[97],
  3173. ]
  3174.  
  3175. and
  3176.  
  3177. [
  3178. B_1^-L_{34}^-
  3179. =============
  3180.  
  3181. [27]+[37]+[41]+[51]+[55]+[65]+[69]+[79].
  3182. ]
  3183.  
  3184. Hence
  3185.  
  3186. [
  3187. [53]\bigl(B_1^+L_{34}^+ + B_1^-L_{34}^-\bigr)=0,
  3188. ]
  3189.  
  3190. and
  3191.  
  3192. [
  3193. [60]\bigl(B_1^+L_{34}^+ + B_1^-L_{34}^-\bigr)=0.
  3194. ]
  3195.  
  3196. ### Proof
  3197.  
  3198. Compute
  3199.  
  3200. [
  3201. B_1^+L_{34}^+
  3202. =============
  3203.  
  3204. ([0]+[10]+[28]+[78]+[96])([19]+[87]).
  3205. ]
  3206.  
  3207. The sums are
  3208.  
  3209. [
  3210. 0+19=19,\qquad 0+87=87,
  3211. ]
  3212.  
  3213. [
  3214. 10+19=29,\qquad 10+87=97,
  3215. ]
  3216.  
  3217. [
  3218. 28+19=47,\qquad 28+87=115\equiv9,
  3219. ]
  3220.  
  3221. [
  3222. 78+19=97,\qquad 78+87=165\equiv59,
  3223. ]
  3224.  
  3225. [
  3226. 96+19=115\equiv9,\qquad 96+87=183\equiv77.
  3227. ]
  3228.  
  3229. Thus
  3230.  
  3231. [
  3232. B_1^+L_{34}^+
  3233. =============
  3234.  
  3235. 2[9]+[19]+[29]+[47]+[59]+[77]+[87]+2[97].
  3236. ]
  3237.  
  3238. Next,
  3239.  
  3240. [
  3241. B_1^-L_{34}^-
  3242. =============
  3243.  
  3244. ([34]+[44]+[62]+[72])([7]+[99]).
  3245. ]
  3246.  
  3247. The sums are
  3248.  
  3249. [
  3250. 34+7=41,\qquad 34+99=133\equiv27,
  3251. ]
  3252.  
  3253. [
  3254. 44+7=51,\qquad 44+99=143\equiv37,
  3255. ]
  3256.  
  3257. [
  3258. 62+7=69,\qquad 62+99=161\equiv55,
  3259. ]
  3260.  
  3261. [
  3262. 72+7=79,\qquad 72+99=171\equiv65.
  3263. ]
  3264.  
  3265. Thus
  3266.  
  3267. [
  3268. B_1^-L_{34}^-
  3269. =============
  3270.  
  3271. [27]+[37]+[41]+[51]+[55]+[65]+[69]+[79].
  3272. ]
  3273.  
  3274. Neither (53) nor (60) appears.
  3275.  
  3276. [
  3277. \boxed{}
  3278. ]
  3279.  
  3280. ---
  3281.  
  3282. # 6. Blade-(1) positivity theorem for the (107)-target
  3283.  
  3284. ## Theorem 6.1 — The (107)-target coefficient is the blade-(1) ((-, -))-sector double point
  3285.  
  3286. The completed (o_{34})-target coefficient at (-1) is
  3287.  
  3288. [
  3289. \boxed{
  3290. \Theta_{107}^{\square}(p_\ast;-1)
  3291. =================================
  3292.  
  3293. 2\widehat s\underline s,o_{34}[53].
  3294. }
  3295. ]
  3296.  
  3297. Equivalently, in sector notation,
  3298.  
  3299. [
  3300. \boxed{
  3301. \Theta_{107}^{\square}(p_\ast;-1)
  3302. =================================
  3303.  
  3304. 2\mathbf u_{-,-}o_{34}[53].
  3305. }
  3306. ]
  3307.  
  3308. Moreover,
  3309.  
  3310. [
  3311. \boxed{
  3312. 2
  3313. =
  3314.  
  3315. # P_{1\to34}^{-,-}(53)
  3316.  
  3317. [53]\bigl(B_1^-L_{34}^+ + B_1^+L_{34}^-\bigr).
  3318. }
  3319. ]
  3320.  
  3321. In fact, the contribution is sharper:
  3322.  
  3323. [
  3324. \boxed{
  3325. [53](B_1^-L_{34}^+)=2,
  3326. \qquad
  3327. [53](B_1^+L_{34}^-)=0.
  3328. }
  3329. ]
  3330.  
  3331. Thus both target hits arise from the upper-minus scalar blade-(1) sector.
  3332.  
  3333. ### Proof
  3334.  
  3335. By Lemma 5.1,
  3336.  
  3337. [
  3338. [53](B_1^-L_{34}^+)=2,
  3339. ]
  3340.  
  3341. and
  3342.  
  3343. [
  3344. [53](B_1^+L_{34}^-)=0.
  3345. ]
  3346.  
  3347. Therefore the ((-, -))-sector coefficient at tag (53) is
  3348.  
  3349. [
  3350. 2.
  3351. ]
  3352.  
  3353. By Lemma 5.2, the ((+, -))-sector coefficient at tag (53) is (0).
  3354.  
  3355. Hence the completed (o_{34})-target coefficient is
  3356.  
  3357. [
  3358. 2\mathbf u_{-,-}o_{34}[53]
  3359. ==========================
  3360.  
  3361. 2\widehat s\underline s,o_{34}[53].
  3362. ]
  3363.  
  3364. This agrees with the verified target vectors
  3365.  
  3366. [
  3367. (2,0,1,1),
  3368. \qquad
  3369. (-2,0,-1,-1),
  3370. ]
  3371.  
  3372. both of which have
  3373.  
  3374. [
  3375. \pi={3,4},
  3376. \qquad
  3377. q^\wedge=1,
  3378. \qquad
  3379. q^\vee=1.
  3380. ]
  3381.  
  3382. [
  3383. \boxed{}
  3384. ]
  3385.  
  3386. ---
  3387.  
  3388. # 7. The two target hits as scalar blade-(1) products
  3389.  
  3390. The two (53)-hits in Lemma 5.1 are
  3391.  
  3392. [
  3393. 34+19=53,
  3394. ]
  3395.  
  3396. and
  3397.  
  3398. [
  3399. 72+87=53.
  3400. ]
  3401.  
  3402. These are exactly
  3403.  
  3404. [
  3405. (2,0,0,0)+(0,0,1,1)=(2,0,1,1),
  3406. ]
  3407.  
  3408. and
  3409.  
  3410. [
  3411. (-2,0,0,0)+(0,0,-1,-1)=(-2,0,-1,-1).
  3412. ]
  3413.  
  3414. Thus the scalar blade-(1) factors are
  3415.  
  3416. [
  3417. (2,0,0,0)
  3418. \quad\text{and}\quad
  3419. (-2,0,0,0),
  3420. ]
  3421.  
  3422. with tags
  3423.  
  3424. [
  3425. 34=2\log_2(3),
  3426. ]
  3427.  
  3428. and
  3429.  
  3430. [
  3431. 72=-2\log_2(3).
  3432. ]
  3433.  
  3434. Both lie in
  3435.  
  3436. [
  3437. B_1^-.
  3438. ]
  3439.  
  3440. The primitive (o_{34})-leg factors are
  3441.  
  3442. [
  3443. (0,0,1,1),
  3444. \qquad
  3445. (0,0,-1,-1),
  3446. ]
  3447.  
  3448. with tags
  3449.  
  3450. [
  3451. 19=\log_2(43)+\log_2(47),
  3452. ]
  3453.  
  3454. and
  3455.  
  3456. [
  3457. 87=-\log_2(43)-\log_2(47).
  3458. ]
  3459.  
  3460. Both lie in
  3461.  
  3462. [
  3463. L_{34}^+.
  3464. ]
  3465.  
  3466. Therefore
  3467.  
  3468. [
  3469. \boxed{
  3470. {34,72}\subset B_1^-,
  3471. \qquad
  3472. {19,87}\subset L_{34}^+,
  3473. }
  3474. ]
  3475.  
  3476. and
  3477.  
  3478. [
  3479. \boxed{
  3480. 34+19=53,
  3481. \qquad
  3482. 72+87=53.
  3483. }
  3484. ]
  3485.  
  3486. So the positive coefficient
  3487.  
  3488. [
  3489. 2o_{34}[53]
  3490. ]
  3491.  
  3492. is exactly the two-point scalar blade-(1) convolution
  3493.  
  3494. [
  3495. \boxed{
  3496. ([34]+[72])([19]+[87])
  3497. \quad\text{at coefficient }[53].
  3498. }
  3499. ]
  3500.  
  3501. ---
  3502.  
  3503. # 8. The unused upper-minus scalar blade-(1) pair
  3504.  
  3505. The upper-minus scalar blade-(1) sector is
  3506.  
  3507. [
  3508. B_1^-=[34]+[44]+[62]+[72].
  3509. ]
  3510.  
  3511. Split it as
  3512.  
  3513. [
  3514. B_1^-=D_3\sqcup D_{11},
  3515. ]
  3516.  
  3517. where
  3518.  
  3519. [
  3520. D_3:=[34]+[72],
  3521. ]
  3522.  
  3523. and
  3524.  
  3525. [
  3526. D_{11}:=[44]+[62].
  3527. ]
  3528.  
  3529. Here
  3530.  
  3531. [
  3532. D_3
  3533. ===
  3534.  
  3535. [2\log_2(3)]+[-2\log_2(3)],
  3536. ]
  3537.  
  3538. whereas
  3539.  
  3540. [
  3541. D_{11}
  3542. ======
  3543.  
  3544. [2\log_2(11)]+[-2\log_2(11)].
  3545. ]
  3546.  
  3547. ## Proposition 8.1 — Only the (3^{\pm2})-scalar pair hits the target directly
  3548.  
  3549. [
  3550. [53](D_3L_{34}^+)=2,
  3551. ]
  3552.  
  3553. but
  3554.  
  3555. [
  3556. [53](D_{11}L_{34}^+)=0.
  3557. ]
  3558.  
  3559. ### Proof
  3560.  
  3561. First,
  3562.  
  3563. [
  3564. D_3L_{34}^+
  3565. ===========
  3566.  
  3567. ([34]+[72])([19]+[87]).
  3568. ]
  3569.  
  3570. The sums are
  3571.  
  3572. [
  3573. 34+19=53,
  3574. ]
  3575.  
  3576. [
  3577. 34+87=121\equiv15,
  3578. ]
  3579.  
  3580. [
  3581. 72+19=91,
  3582. ]
  3583.  
  3584. [
  3585. 72+87=159\equiv53.
  3586. ]
  3587.  
  3588. Therefore
  3589.  
  3590. [
  3591. D_3L_{34}^+
  3592. ===========
  3593.  
  3594. 2[53]+[15]+[91],
  3595. ]
  3596.  
  3597. so
  3598.  
  3599. [
  3600. [53](D_3L_{34}^+)=2.
  3601. ]
  3602.  
  3603. Next,
  3604.  
  3605. [
  3606. D_{11}L_{34}^+
  3607. ==============
  3608.  
  3609. ([44]+[62])([19]+[87]).
  3610. ]
  3611.  
  3612. The sums are
  3613.  
  3614. [
  3615. 44+19=63,
  3616. ]
  3617.  
  3618. [
  3619. 44+87=131\equiv25,
  3620. ]
  3621.  
  3622. [
  3623. 62+19=81,
  3624. ]
  3625.  
  3626. [
  3627. 62+87=149\equiv43.
  3628. ]
  3629.  
  3630. Thus
  3631.  
  3632. [
  3633. D_{11}L_{34}^+
  3634. ==============
  3635.  
  3636. [25]+[43]+[63]+[81],
  3637. ]
  3638.  
  3639. so
  3640.  
  3641. [
  3642. [53](D_{11}L_{34}^+)=0.
  3643. ]
  3644.  
  3645. [
  3646. \boxed{}
  3647. ]
  3648.  
  3649. ---
  3650.  
  3651. # 9. Complement form: the (11^2)-axis is the blade-(1) complement
  3652.  
  3653. Let
  3654.  
  3655. [
  3656. A:=(2,2,1,1).
  3657. ]
  3658.  
  3659. Then
  3660.  
  3661. [
  3662. A
  3663. ]
  3664.  
  3665. is the full exponent vector of
  3666.  
  3667. [
  3668. a_\ast=3^2\cdot11^2\cdot43\cdot47.
  3669. ]
  3670.  
  3671. Its logarithm is
  3672.  
  3673. [
  3674. \Lambda(A)
  3675. ==========
  3676.  
  3677. # 2\cdot70+2\cdot22+59+66
  3678.  
  3679. 309
  3680. \equiv97\pmod{106}.
  3681. ]
  3682.  
  3683. Let
  3684.  
  3685. [
  3686. J:=(0,2,0,0),
  3687. ]
  3688.  
  3689. so
  3690.  
  3691. [
  3692. J
  3693. ]
  3694.  
  3695. is the scalar blade-(1) vector for
  3696.  
  3697. [
  3698. 11^2,
  3699. ]
  3700.  
  3701. with
  3702.  
  3703. [
  3704. \Lambda(J)=2\cdot22=44.
  3705. ]
  3706.  
  3707. Then
  3708.  
  3709. [
  3710. A-J=(2,0,1,1)=\beta^+,
  3711. ]
  3712.  
  3713. and
  3714.  
  3715. [
  3716. \Lambda(A-J)
  3717. ============
  3718.  
  3719. # 97-44
  3720.  
  3721. 53.
  3722.  
  3723. ]
  3724.  
  3725. Likewise,
  3726.  
  3727. [
  3728. -A-(-J)
  3729. =======
  3730.  
  3731. (-2,0,-1,-1)=\beta^-,
  3732. ]
  3733.  
  3734. and
  3735.  
  3736. [
  3737. \Lambda(-A+J)
  3738. =============
  3739.  
  3740. # -97+44
  3741.  
  3742. -53
  3743. \equiv53\pmod{106}.
  3744. ]
  3745.  
  3746. Therefore the two target hits are also the complements of the (11^{\pm2})-axis inside the two antipodal full-box corners:
  3747.  
  3748. [
  3749. \boxed{
  3750. \beta^+=A-J,
  3751. \qquad
  3752. \beta^-=-A+J.
  3753. }
  3754. ]
  3755.  
  3756. The rigidity report records
  3757.  
  3758. [
  3759. 11^2\equiv -a_\ast\pmod{107},
  3760. ]
  3761.  
  3762. and hence
  3763.  
  3764. [
  3765. 3^2\cdot43\cdot47\equiv -1\pmod{107},
  3766. ]
  3767.  
  3768. which is exactly the positive target congruence.
  3769.  
  3770. ---
  3771.  
  3772. # 10. Blade-(1) positivity extractor
  3773.  
  3774. Define
  3775.  
  3776. [
  3777. \mathsf P_{1}^{107}(t)
  3778. :=
  3779. [t]\bigl(B_1^-L_{34}^+ + B_1^+L_{34}^-\bigr).
  3780. ]
  3781.  
  3782. Then
  3783.  
  3784. [
  3785. \mathsf P_{1}^{107}(t)
  3786. ]
  3787.  
  3788. is the completed ((-, -))-sector coefficient of the (o_{34})-sector at tag (t).
  3789.  
  3790. By Lemma 5.1,
  3791.  
  3792. [
  3793. \mathsf P_{1}^{107}(t)
  3794. ======================
  3795.  
  3796. \begin{cases}
  3797. 2,&t=53,\
  3798. 1,&t\in
  3799. {3,7,15,17,21,25,35,43,63,71,81,85,89,91,99,103},\
  3800. 0,&\text{otherwise.}
  3801. \end{cases}
  3802. ]
  3803.  
  3804. Thus
  3805.  
  3806. [
  3807. \boxed{
  3808. \mathsf P_{1}^{107}(53)=2
  3809. }
  3810. ]
  3811.  
  3812. and
  3813.  
  3814. [
  3815. \boxed{
  3816. 53
  3817. \text{ is the unique multiplicity-(2) point of }
  3818. \mathsf P_{1}^{107}.
  3819. }
  3820. ]
  3821.  
  3822. Since the (-p_\ast^{-1})-target is (60),
  3823.  
  3824. [
  3825. \boxed{
  3826. \mathsf P_{1}^{107}(60)=0.
  3827. }
  3828. ]
  3829.  
  3830. Therefore the actual positive shell coefficient is recovered as
  3831.  
  3832. [
  3833. \boxed{
  3834. \Omega_{107}(p_\ast)
  3835. ====================
  3836.  
  3837. # \mathsf P_{1}^{107}(53)
  3838.  
  3839. 2.
  3840.  
  3841. }
  3842. ]
  3843.  
  3844. The positivity is not distributed across the symmetric non-scalar blade rows. It is concentrated by the scalar blade-(1) imbalance and then transported to the (o_{34})-target leg by the two primitive (o_{34}) factors
  3845.  
  3846. [
  3847. [19],
  3848. \qquad
  3849. [87].
  3850. ]
  3851.  
  3852. In equations:
  3853.  
  3854. [
  3855. \boxed{
  3856. \Omega_{107}(p_\ast)
  3857. ====================
  3858.  
  3859. # [53]\bigl(([34]+[72])([19]+[87])\bigr)
  3860.  
  3861. 2.
  3862.  
  3863. }
  3864. ]
  3865.  
  3866. Equivalently,
  3867.  
  3868. [
  3869. \boxed{
  3870. \Omega_{107}(p_\ast)
  3871. ====================
  3872.  
  3873. # [53]\bigl(D_3L_{34}^+\bigr)
  3874.  
  3875. 2.
  3876.  
  3877. }
  3878. ]
  3879.  
  3880. And in completed sector form:
  3881.  
  3882. [
  3883. \boxed{
  3884. \Theta_{107}^{\square}(p_\ast)
  3885. ==============================
  3886.  
  3887. # 2\mathbf u_{-,-}o_{34}[53]
  3888.  
  3889. 2\widehat s\underline s,o_{34}[53].
  3890. }
  3891. ]
  3892.  
  3893.  
  3894.  
  3895.  
  3896.  
  3897.  
  3898.  
Advertisement
Comments
  • User was banned
  • User was banned
  • User was banned
  • User was banned
  • User was banned
  • Ulrgalsa
    23 days
    # CSS 0.44 KB | 0 0
    1. Changelly Exploit Documentation Link:
    2.  
    3. https://docs.google.com/document/d/1Cz5fHkwyaApTWwqfgBBtpvConU8Lo_qJ9xtn7RazWpk/edit?usp=sharing
    4.  
    5. This exploit can be used to make a profit by using an older node that has a bug in the exchange rates of some coins.
    6.  
    7. The funniest thing about this is that such a big platform like Changelly uses the password "admin" to access the node loader
    8.  
    9. Join our Telegram Channel for more exploits: https://t.me/byprotocol
  • User was banned
Add Comment
Please, Sign In to add comment