Skip to content

RootSystem: supply interval bounds directly in the pairing proof #654

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
Vilin97 merged 1 commit into from
Oct 14, 2026
Merged

RootSystem: supply interval bounds directly in the pairing proof #654

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
5 changes: 4 additions & 1 deletion LeanPool/RootSystem/An.lean
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -236,8 +236,11 @@ theorem pairing_formula {n : ℕ} [NeZero n] (J K : SignedInterval n) :
aesop;
· lia;
rw [← Finset.mul_sum _ _ _]
-- Package the bounds separately to preserve the existing generated proof declarations.
let intervalBounds : J.i ≤ J.j ∧ K.i ≤ K.j := by
as_aux_lemma => exact ⟨J.hij, K.hij⟩
simp_all +decide [Finset.sum_add_distrib, Finset.sum_sub_distrib]
grind +suggestions
grind only [Fin.le_def, Fin.lt_def]

theorem pairing_self {n : ℕ} [NeZero n] (J : SignedInterval n) :
(ZnPairing n (α J)) (αDual J) = 2 := by
Expand Down
Loading