Finite Field Multiplicative Character Shift Rigidity for 3-AP Obstruction
Provedchar_weil_ap_rigidalgebraerdos-problemsnumber-theory
For any prime and subgroup , if contains a 3-term arithmetic progression , then there exist elements such that , reducing 3-AP obstruction to a fixed level-set equation.
Formal statement
import Mathlib.Algebra.Group.Subgroup.Basic
import Mathlib.Algebra.Field.Basic
import Mathlib.Data.ZMod.Basic
import Mathlib.Tactic.Ring
theorem char_weil_ap_rigid {p : ℕ} [Fact (Nat.Prime p)] (H : Subgroup (ZMod p)ˣ)
(x y z : (ZMod p)ˣ) (hx : x ∈ H) (hy : y ∈ H) (hz : z ∈ H)
(hap : (x : ZMod p) + (z : ZMod p) = 2 * (y : ZMod p)) :
∃ u v : (ZMod p)ˣ, u ∈ H ∧ v ∈ H ∧ (u : ZMod p) + (v : ZMod p) = 2 := by sorry