Current library: Alpha v34, 4,223 checked-use theorems; Stable remains 432. Historical first admissions, original proof editions, and non-admitted aliases are preserved.
Each retained summand has a witnessed n=d*q and actual signed multiplication. Zero and nondivisors contribute zero. Input and output values at zero are unrestricted; uniqueness is for positive represented values. The separate inverse family proves the unit-at-one criterion. Full G009 multiplicative-function closure is now admitted in the separate Alpha-v32 multiplicative-convolution family.
Exact theorem in conservative defined notation
∀ F. ∀ G. ∀ n. ∀ L. ∀ M. ¬n = 0 → DirichletPrefix(F,G,n,L,M) → SignedZeroWindow(M,S n,S L)
Every linked abbreviation expands hygienically to the identical original native formula.
Definition DAG
Actual proof prerequisites
Complete tactic proof in conservative notation
All 34 original proof lines are preserved. Only local proposition formulas are abbreviated; every abbreviation has an exact binder-safe expansion check. The linked exact edition contains the unchanged replay script.
Read the argument
Proof checkpoints
This is a reading aid, not a new proof or a proof-tree certificate. Checkpoint groups are consecutive commands, not inferred branch boundaries. Every step links to the preserved script.
Named ingredients (2)
01Fix variables and assumptionsL1–10
02Fix variables and assumptionsL11–12
03Use earlier factsL13–22
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L13
specialize dirichlet_convolution_entry_past_support_zero (F) - L14
specialize dirichlet_convolution_entry_past_support_zero (G) - L15
specialize dirichlet_convolution_entry_past_support_zero (n) - L16
specialize dirichlet_convolution_entry_past_support_zero (i) - L17
specialize dirichlet_convolution_entry_past_support_zero (z) - L18
apply dirichlet_convolution_entry_past_support_zero - L19
exact hn - L20
exact hni - L21
specialize dirichlet_convolution_prefix_lookup (F) - L22
specialize dirichlet_convolution_prefix_lookup (G)
04Use earlier factsL23–32
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L23
specialize dirichlet_convolution_prefix_lookup (n) - L24
specialize dirichlet_convolution_prefix_lookup (L) - L25
specialize dirichlet_convolution_prefix_lookup (M) - L26
specialize dirichlet_convolution_prefix_lookup (i) - L27
specialize dirichlet_convolution_prefix_lookup (z) - L28
apply dirichlet_convolution_prefix_lookup - L29
exact hp - L30
specialize le_of_succ_le_succ (i) - L31
specialize le_of_succ_le_succ (L) - L32
apply le_of_succ_le_succ
Original defined command ledger · 34 lines
- 0001
intro F - 0002
intro G - 0003
intro n - 0004
intro L - 0005
intro M - 0006
intro hn - 0007
intro hp - 0008
intro i - 0009
intro z - 0010
intro hni - 0011
intro hiL - 0012
intro hz - 0013
specialize dirichlet_convolution_entry_past_support_zero (F) - 0014
specialize dirichlet_convolution_entry_past_support_zero (G) - 0015
specialize dirichlet_convolution_entry_past_support_zero (n) - 0016
specialize dirichlet_convolution_entry_past_support_zero (i) - 0017
specialize dirichlet_convolution_entry_past_support_zero (z) - 0018
apply dirichlet_convolution_entry_past_support_zero - 0019
exact hn - 0020
exact hni - 0021
specialize dirichlet_convolution_prefix_lookup (F) - 0022
specialize dirichlet_convolution_prefix_lookup (G) - 0023
specialize dirichlet_convolution_prefix_lookup (n) - 0024
specialize dirichlet_convolution_prefix_lookup (L) - 0025
specialize dirichlet_convolution_prefix_lookup (M) - 0026
specialize dirichlet_convolution_prefix_lookup (i) - 0027
specialize dirichlet_convolution_prefix_lookup (z) - 0028
apply dirichlet_convolution_prefix_lookup - 0029
exact hp - 0030
specialize le_of_succ_le_succ (i) - 0031
specialize le_of_succ_le_succ (L) - 0032
apply le_of_succ_le_succ - 0033
exact hiL - 0034
exact hz