Current library: Alpha v34, 4,223 checked-use theorems; Stable remains 432. Historical first admissions, original proof editions, and non-admitted aliases are preserved.
Signed one is code 2. Positive-only table graphs preserve arbitrary zeroth values, including N=0. The unit and divisor-sum identities are proved, never embedded in definitions. The separate inverse family proves the general unit-at-one criterion; multiplicative-function closure remains open.
Exact theorem in conservative defined notation
∀ N. ∀ F. ∀ E. ∀ n. ∀ a. KroneckerDeltaTable(N,E) → ¬n = 0 → Le(n,N) → ArithAt(F,n,a) → DirichletEntry(F,E,n,n,a)
Every linked abbreviation expands hygienically to the identical original native formula.
Definition DAG
Actual proof prerequisites
Complete tactic proof in conservative notation
All 53 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 (1)
01Fix variables and assumptionsL1–9
02Separate the logical casesL10–10
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L10
cases hd
03Establish hboundL11–19
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply le trans.
04Establish hxL20–26
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply divisor signed table lookup.
- L20
have hx : ∃ x. ArithAt(E,1,x)Definitions: ArithAt(E,1,x)Original native command in the exact edition - L21
specialize divisor_signed_table_lookup (N) - L22
specialize divisor_signed_table_lookup (E) - L23
specialize divisor_signed_table_lookup (1) - L24
apply divisor_signed_table_lookup - L25
exact hd_left - L26
exact hbound
05Separate the logical casesL27–27
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L27
cases hx
06Establish hvL28–37
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply dirichlet kronecker delta table one value.
- L28
have hv : x=2 - L29
specialize dirichlet_kronecker_delta_table_one_value (N) - L30
specialize dirichlet_kronecker_delta_table_one_value (E) - L31
specialize dirichlet_kronecker_delta_table_one_value (x) - L32
apply dirichlet_kronecker_delta_table_one_value - L33
exact hd - L34
exact hbound - L35
exact hx_witness - L36
rewrite hv at hx_witness - L37
rewrite hv at hx_witness
07Use earlier factsL38–47
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L38
specialize dirichlet_convolution_entry_from_quotient (F) - L39
specialize dirichlet_convolution_entry_from_quotient (E) - L40
specialize dirichlet_convolution_entry_from_quotient (n) - L41
specialize dirichlet_convolution_entry_from_quotient (n) - L42
specialize dirichlet_convolution_entry_from_quotient (1) - L43
specialize dirichlet_convolution_entry_from_quotient (a) - L44
specialize dirichlet_convolution_entry_from_quotient (2) - L45
specialize dirichlet_convolution_entry_from_quotient (a) - L46
apply dirichlet_convolution_entry_from_quotient - L47
exact hn
08Calculate and transport equalitiesL48–48
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L48
symm
Original defined command ledger · 53 lines
- 0001
intro N - 0002
intro F - 0003
intro E - 0004
intro n - 0005
intro a - 0006
intro hd - 0007
intro hn - 0008
intro hb - 0009
intro ha - 0010
cases hd - 0011
have hbound : Lt(0,N) - 0012
specialize le_trans (1) - 0013
specialize le_trans (n) - 0014
specialize le_trans (N) - 0015
apply le_trans - 0016
specialize one_le_of_ne_zero (n) - 0017
apply one_le_of_ne_zero - 0018
exact hn - 0019
exact hb - 0020
have hx : ∃ x. ArithAt(E,1,x) - 0021
specialize divisor_signed_table_lookup (N) - 0022
specialize divisor_signed_table_lookup (E) - 0023
specialize divisor_signed_table_lookup (1) - 0024
apply divisor_signed_table_lookup - 0025
exact hd_left - 0026
exact hbound - 0027
cases hx - 0028
have hv : x=2 - 0029
specialize dirichlet_kronecker_delta_table_one_value (N) - 0030
specialize dirichlet_kronecker_delta_table_one_value (E) - 0031
specialize dirichlet_kronecker_delta_table_one_value (x) - 0032
apply dirichlet_kronecker_delta_table_one_value - 0033
exact hd - 0034
exact hbound - 0035
exact hx_witness - 0036
rewrite hv at hx_witness - 0037
rewrite hv at hx_witness - 0038
specialize dirichlet_convolution_entry_from_quotient (F) - 0039
specialize dirichlet_convolution_entry_from_quotient (E) - 0040
specialize dirichlet_convolution_entry_from_quotient (n) - 0041
specialize dirichlet_convolution_entry_from_quotient (n) - 0042
specialize dirichlet_convolution_entry_from_quotient (1) - 0043
specialize dirichlet_convolution_entry_from_quotient (a) - 0044
specialize dirichlet_convolution_entry_from_quotient (2) - 0045
specialize dirichlet_convolution_entry_from_quotient (a) - 0046
apply dirichlet_convolution_entry_from_quotient - 0047
exact hn - 0048
symm - 0049
apply mul_one - 0050
exact ha - 0051
exact hx_witness - 0052
specialize signed_mul_one_right (a) - 0053
apply signed_mul_one_right