OAI/NumberTheory/Ostmann/Characters/CharacterScheduleRoles.lean
22 declarations, 0 contain sorry, 0 declared as axioms
The finite role set used in the nonquadratic character argument
A positive word, finitely many pivot groups, two fresh anchors at each step, and one filler have independent negative copies. Only the positive word, pivots and anchors participate in the copy schedule.
- abbrev
OAI.Ostmann.CharacterCellline 15 - abbrev
OAI.Ostmann.CharacterRoleline 16 - def
OAI.Ostmann.characterPositiveRoleline 18 - def
OAI.Ostmann.characterRoleline 24 - def
OAI.Ostmann.characterCellSizeline 27 - def
OAI.Ostmann.characterSizeline 32 - def
OAI.Ostmann.characterPivotAtomline 35 - def
OAI.Ostmann.characterAnchorAtomline 38 - theorem
OAI.Ostmann.characterRole_wordline 41 - theorem
OAI.Ostmann.characterRole_pivotline 42 - theorem
OAI.Ostmann.characterRole_anchorline 44 - theorem
OAI.Ostmann.characterSize_wordline 47 - theorem
OAI.Ostmann.characterSize_pivotline 49 - theorem
OAI.Ostmann.characterSize_anchorline 51 - def
OAI.Ostmann.characterWordEquivline 55Source documentation
The actual positive word, including its one top label.
noncomputable def characterWordEquiv {k : ℕ} (m : ℕ) (r : Fin k → ℕ) (f : ℕ) : Fin (m + 1) ≃ {i : Σ v, Fin (characterSize m r f v) // characterRole k i.1 = .word} := …Mentions: OAI.Ostmann.characterSize, OAI.Ostmann.characterRole
- theorem
OAI.Ostmann.characterPivotAtom_uniqueline 74 - def
OAI.Ostmann.characterPivotline 92Source documentation
Extend the finitely many real pivots by an arbitrary existing word slot. All transfer theorems use only the genuine prefix.
noncomputable def characterPivot {k : ℕ} (m : ℕ) (r : Fin k → ℕ) (f : ℕ) (hr : ∀ j, 0 < r j) (j : ℕ) : Σ v, Fin (characterSize m r f v) := …Mentions: OAI.Ostmann.characterSize
- theorem
OAI.Ostmann.characterPivot_roleline 97 - def
OAI.Ostmann.characterAnchorline 102 - theorem
OAI.Ostmann.characterAnchor_roleline 106 - theorem
OAI.Ostmann.characterAnchor_neline 109 - theorem
OAI.Ostmann.characterSchedule_matchingline 118Source documentation
Every retained H permutation preserves the original signed character.
theorem characterSchedule_matching {k : ℕ} (m : ℕ) (r : Fin k → ℕ) (f : ℕ) (χ : ∀ p : ℕ, DirichletCharacter ℂ p) (n : ℕ) (e : Equiv.Perm (CopyScheduleH (fun i : Σ v, Fin (characterSize m r f v) => characterRole k i.1) n)) (h : CopyScheduleH (fun i : Σ v, Fin (characterSize m r f v) => characterRole k i.1) n) : signedAtomCharacter (initialWordSize (m + 1) (characterCellSize r f)) χ (copyScheduleOrigin n (e h).val) = signedAtomCharacter (initialWordSize (m + 1) (characterCellSize r f)) χ (copyScheduleOrigin n h.val) := …Mentions: OAI.Ostmann.CopyScheduleH, OAI.Ostmann.characterSize, OAI.Ostmann.characterRole, OAI.Ostmann.signedAtomCharacter, OAI.Ostmann.initialWordSize, OAI.Ostmann.characterCellSize, OAI.Ostmann.copyScheduleOrigin