§7 · Root · root: registry, redirects, synthesis · 2026-10-18T03:29:10Z

Remark 7.1 · Registry after three returns: the theorem in characteristic \(p\) reduces to (A3a)(A3a) Rank-one models over O (Sakellaridis's Axiom 2.2.1): for every Borel orbit Y of maximal rank and every simple root α, the O-scheme YP_α/R(P_α) is one of the four standard PGL2-spaces over O, with his scheme structure on Y, and YP_α is the closure of its generic fibre minus the closure of the generic boundary.; audits launched

open audit: correct

Second audit: correct. Checked each registry entry against the cited steps and the agents' records: Theorem 4.8 is stated modulo (I_Λ) (the [Sa08] condition surfaced only later, in Audit 5.5), A3's status matches Remark 3.11/Summary 3.12 (all but (A3a)(A3a) Rank-one models over O (Sakellaridis's Axiom 2.2.1): for every Borel orbit Y of maximal rank and every simple root α, the O-scheme YP_α/R(P_α) is one of the four standard PGL2-spaces over O, with his scheme structure on Y, and YP_α is the closure of its generic fibre minus the closure of the generic boundary. and the analytic Statement 6.3.1), A2 had not yet returned (03:33 > 03:29) and A1's relaunch and A5's launch match the agent record. The Cartan decomposition K\X(F_q((t))) ≃ Λ_S^+ is indeed reached by two distinct arguments, Theorem 3.8 (Delorme–Sécherre applied in characteristic p plus the one-class lemma Proposition 3.4) and Proposition 4.5 (orbit counting from F'_e, with Delorme–Sécherre and Kneser used only in characteristic 0); they are independent with respect to the characteristic-p risk, although both rest on Delorme–Sécherre's theorem (at different fields) and on S4-13's realization of W_X in K. The Chen–Yi remark is confirmed in chen-yi-v4 (the proof of Prop. 17(i) cites [GN10, Thm 8.2.9] and [Nad04, Thm 4.2], results over C, while the paper works over F_p-bar). The decision (the transfer bypasses the analytic Statement 6.3.1 because it uses Sakellaridis's theorem only at p-adic fields; (A3a)(A3a) Rank-one models over O (Sakellaridis's Axiom 2.2.1): for every Borel orbit Y of maximal rank and every simple root α, the O-scheme YP_α/R(P_α) is one of the four standard PGL2-spaces over O, with his scheme structure on Y, and YP_α is the closure of its generic fibre minus the closure of the generic boundary. is the input every route needs) is an accurate reading of Theorem 4.8, Dead end 4.10 and Remark 3.11 at that time.

Two agents proved the Cartan decomposition over \(\mathbb F_q(\!(t)\!)\) by different routes, and the close-field transfer gave Sakellaridis's theorem there modulo (A3a)(A3a) Rank-one models over O (Sakellaridis's Axiom 2.2.1): for every Borel orbit Y of maximal rank and every simple root α, the O-scheme YP_α/R(P_α) is one of the four standard PGL2-spaces over O, with his scheme structure on Y, and YP_α is the closure of its generic fibre minus the closure of the generic boundary. over \(W(\mathbb F_q)\). The direct rerun was relaunched after a failed first attempt, and the first auditor was assigned.

Independent evidence. The Cartan decomposition \(K\backslash X(\mathbb F_q(\!(t)\!))\simeq\Lambda_S^+\) was reached twice: by Delorme–Sécherre with a direct one-class lemma (Theorem 3.8), and by counting orbits over close fields (Proposition 4.5). Both agents also found that Chen–Yi prove their Prop. 17(i), the pages' input D0D0 · Orbit geometry over F̄_q, p ≠ 2 (Chen–Yi, Prop. 17, Thm 18): orbits indexed by Λ_S^+, closures, the support bound and the stabilizers., by citing results over \(\mathbb C\).

Decision. The open analytic Statement 6.3.1 is bypassed by the transfer, which uses Sakellaridis's theorem only over \(p\)-adic fields. The one input every route needs is (A3a)(A3a) Rank-one models over O (Sakellaridis's Axiom 2.2.1): for every Borel orbit Y of maximal rank and every simple root α, the O-scheme YP_α/R(P_α) is one of the four standard PGL2-spaces over O, with his scheme structure on Y, and YP_α is the closure of its generic fibre minus the closure of the generic boundary.. Launch the audit of A4 and A3 (agent A5).

Builds on

Built on by

  • —