Current library: Alpha v34, 4,223 checked-use theorems; Stable remains 432. Historical first admissions, original proof editions, and non-admitted aliases are preserved.
The strict remainder is an actual inclusive prefix through k with an S k-entry fold; the future input at S k is excluded. A genuine table extension supplies the endpoint. The at-one identity inspects or constructs the real two-entry masked sum. No recurrence, inverse, or omitted summand value is assumed as a conclusion-bearing premise.
Exact theorem in conservative defined notation
∀ F. ∀ G. ∀ n. ∀ M. DirichletPrefix(F,G,n,0,M) → SignedPrefixSum(M,1,0)
Every linked abbreviation expands hygienically to the identical original native formula.
Definition DAG
Actual proof prerequisites
Complete tactic proof in conservative notation
All 40 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.
01Fix variables and assumptionsL1–5
02Separate the logical casesL6–6
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L6
cases hm
03Use earlier factsL7–10
04Fix variables and assumptionsL11–15
05Establish hi0L16–25
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply le zero.
06Calculate and transport equalitiesL26–26
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L26
rewrite hi0 at hz
07Use earlier factsL27–32
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L27
specialize dirichlet_convolution_entry_omitted_value (F) - L28
specialize dirichlet_convolution_entry_omitted_value (G) - L29
specialize dirichlet_convolution_entry_omitted_value (n) - L30
specialize dirichlet_convolution_entry_omitted_value (0) - L31
specialize dirichlet_convolution_entry_omitted_value (z) - L32
apply dirichlet_convolution_entry_omitted_value
08Separate the logical casesL33–33
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L33
left
09Calculate and transport equalitiesL34–34
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L34
refl
Original defined command ledger · 40 lines
- 0001
intro F - 0002
intro G - 0003
intro n - 0004
intro M - 0005
intro hm - 0006
cases hm - 0007
specialize signed_prefix_sum_zero_exists (M) - 0008
specialize signed_prefix_sum_zero_exists (1) - 0009
apply signed_prefix_sum_zero_exists - 0010
exact hm_left - 0011
intro i - 0012
intro z - 0013
intro hlo - 0014
intro hi - 0015
intro hz - 0016
have hi0 : i=0 - 0017
specialize le_zero (i) - 0018
apply le_zero - 0019
specialize le_of_succ_le_succ (i) - 0020
specialize le_of_succ_le_succ (0) - 0021
apply le_of_succ_le_succ - 0022
exact hi - 0023
rewrite hi0 at hz - 0024
rewrite hi0 at hz - 0025
rewrite hi0 at hz - 0026
rewrite hi0 at hz - 0027
specialize dirichlet_convolution_entry_omitted_value (F) - 0028
specialize dirichlet_convolution_entry_omitted_value (G) - 0029
specialize dirichlet_convolution_entry_omitted_value (n) - 0030
specialize dirichlet_convolution_entry_omitted_value (0) - 0031
specialize dirichlet_convolution_entry_omitted_value (z) - 0032
apply dirichlet_convolution_entry_omitted_value - 0033
left - 0034
refl - 0035
specialize hm_right (0) - 0036
specialize hm_right (z) - 0037
apply hm_right - 0038
specialize le_refl (0) - 0039
apply le_refl - 0040
exact hz