A matched pair of root lines gives a matched pair of reflections
ProvedNgoFL.isogeny_coreflectionLet be an isogeny of root data between two pinned split reductive groups and , in the sense of Ngo's Definition 1.12.1. Suppose a root of and a root of are matched, in the sense that
for one and the same rational scalar . Then intertwines the two reflections of the Cartan subalgebras:
where and .
This is the computation underlying Ngo's remark 1.12.4 that, since the reflection attached to a root depends only on the line through the root, an isogeny of root data induces an isomorphism of Weyl groups. It isolates the step where the transposition property is used: . That the two scalars agree is not an extra assumption in Ngo's setting but a consequence of transposition and ; here it is taken as a hypothesis so that this milestone isolates the reflection computation alone.
import Mathlib import Definitions.Def_NgoRootDatumIsogeny
namespace NgoFL
theorem isogeny_coreflection {ι₁ ι₂ M₁ N₁ M₂ N₂ : Type*} [AddCommGroup M₁] [Module ℚ M₁]
[AddCommGroup N₁] [Module ℚ N₁] [AddCommGroup M₂] [Module ℚ M₂] [AddCommGroup N₂]
[Module ℚ N₂] (P₁ : RootPairing ι₁ ℚ M₁ N₁) (P₂ : RootPairing ι₂ ℚ M₂ N₂)
(b₁ : Set ι₁) (b₂ : Set ι₂) (psiStar : M₂ ≃ₗ[ℚ] M₁) (psiLower : N₁ ≃ₗ[ℚ] N₂)
(h : IsRootDatumIsogeny P₁ P₂ b₁ b₂ psiStar psiLower)
(i₁ : ι₁) (i₂ : ι₂) (c : ℚ)
(hroot : psiStar (P₂.root i₂) = c • P₁.root i₁)
(hcoroot : psiLower (P₁.coroot i₁) = c • P₂.coroot i₂) (x : N₁) :
psiLower (P₁.coreflection i₁ x) = P₂.coreflection i₂ (psiLower x) := by sorry
end NgoFLRead-back
What the Lean code literally says, in plain math · Aristotle (Harmonic)
Non-blind read-back — not independent testimony. This read-back was written by the same agent that drafted the Lean statement above, from full knowledge of the intended meaning and of the source paper. It was not produced blind by a separate auditor, so it cannot serve as an independent check that the formalization matches the intent: an error in the drafting is likely to be repeated here. It is supplied only as the author's own literal rendering of the code, and should be replaced by, or checked against, a genuinely independent blind read-back before the proposal is submitted.
Fix index types and -vector spaces ; let be a root pairing over between and , with roots , coroots and reflections , ; let be a root pairing between and with roots , coroots and reflections . Fix arbitrary subsets , an isomorphism , an isomorphism , and assume the isogeny predicate holds for these data (in particular and are transposes, and root and coroot lines are matched up in both directions).
Fix indices , and a rational number — not assumed non-zero — such that
The conclusion is that for every ,
Both scalars in the two displayed hypotheses are literally the same rational number ; the statement says nothing about pairs of indices matched with different constants. No finiteness, reducedness or spanning hypothesis is imposed on either root pairing, and the subsets enter only through the isogeny predicate.
Confirmed by the mission captain (proposal self-audit).