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. ∀ U. ∀ n. ∀ d. ∀ z. ConstantOneTable(N,U) → ¬n = 0 → Le(n,N) → DivisorMaskEntry(F,n,d,z) → DirichletEntry(F,U,n,d,z)
Every linked abbreviation expands hygienically to the identical original native formula.
Definition DAG
Actual proof prerequisites
Complete tactic proof in conservative notation
All 76 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–10
02Separate the logical casesL11–14
03Establish hqpositiveL15–23
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply factor nonzero right.
04Establish hqboundL24–32
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply le trans.
05Construct an explicit witnessL33–33
Supply the displayed value, then prove that it has the required property.
- L33
exists d
06Calculate and transport equalitiesL34–34
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L34
trans (d)*(x)
07Use earlier factsL35–37
08Separate the logical casesL38–38
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L38
cases hu
09Establish hvL39–45
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply divisor signed table lookup.
- L39
have hv : ∃ v. ArithAt(U,x,v)Definitions: ArithAt(U,x,v)Original native command in the exact edition - L40
specialize divisor_signed_table_lookup (N) - L41
specialize divisor_signed_table_lookup (U) - L42
specialize divisor_signed_table_lookup (x) - L43
apply divisor_signed_table_lookup - L44
exact hu_left - L45
exact hqbound
10Separate the logical casesL46–46
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L46
cases hv
11Establish heqL47–56
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply dirichlet constant one table value.
- L47
have heq : x1=2 - L48
specialize dirichlet_constant_one_table_value (N) - L49
specialize dirichlet_constant_one_table_value (U) - L50
specialize dirichlet_constant_one_table_value (x) - L51
specialize dirichlet_constant_one_table_value (x1) - L52
apply dirichlet_constant_one_table_value - L53
exact hu - L54
exact hqpositive - L55
exact hqbound - L56
exact hv_witness
12Calculate and transport equalitiesL57–58
13Use earlier factsL59–68
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L59
specialize dirichlet_convolution_entry_from_quotient (F) - L60
specialize dirichlet_convolution_entry_from_quotient (U) - L61
specialize dirichlet_convolution_entry_from_quotient (n) - L62
specialize dirichlet_convolution_entry_from_quotient (d) - L63
specialize dirichlet_convolution_entry_from_quotient (x) - L64
specialize dirichlet_convolution_entry_from_quotient (z) - L65
specialize dirichlet_convolution_entry_from_quotient (2) - L66
specialize dirichlet_convolution_entry_from_quotient (z) - L67
apply dirichlet_convolution_entry_from_quotient - L68
exact he_left_left
14Use earlier factsL69–73
15Separate the logical casesL74–75
16Use earlier factsL76–76
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L76
exact he_right
Original defined command ledger · 76 lines
- 0001
intro N - 0002
intro F - 0003
intro U - 0004
intro n - 0005
intro d - 0006
intro z - 0007
intro hu - 0008
intro hn - 0009
intro hb - 0010
intro he - 0011
cases he - 0012
cases he_left - 0013
cases he_left_right - 0014
cases he_left_right_witness - 0015
have hqpositive : ~(x=0) - 0016
intro hqzero - 0017
specialize factor_nonzero_right (n) - 0018
specialize factor_nonzero_right (d) - 0019
specialize factor_nonzero_right (x) - 0020
apply factor_nonzero_right - 0021
exact hn - 0022
exact he_left_right_witness_left - 0023
exact hqzero - 0024
have hqbound : Le(x,N) - 0025
specialize le_trans (x) - 0026
specialize le_trans (n) - 0027
specialize le_trans (N) - 0028
apply le_trans - 0029
specialize divisor_le_nonzero (x) - 0030
specialize divisor_le_nonzero (n) - 0031
apply divisor_le_nonzero - 0032
exact hn - 0033
exists d - 0034
trans (d)*(x) - 0035
exact he_left_right_witness_left - 0036
apply mul_comm - 0037
exact hb - 0038
cases hu - 0039
have hv : ∃ v. ArithAt(U,x,v) - 0040
specialize divisor_signed_table_lookup (N) - 0041
specialize divisor_signed_table_lookup (U) - 0042
specialize divisor_signed_table_lookup (x) - 0043
apply divisor_signed_table_lookup - 0044
exact hu_left - 0045
exact hqbound - 0046
cases hv - 0047
have heq : x1=2 - 0048
specialize dirichlet_constant_one_table_value (N) - 0049
specialize dirichlet_constant_one_table_value (U) - 0050
specialize dirichlet_constant_one_table_value (x) - 0051
specialize dirichlet_constant_one_table_value (x1) - 0052
apply dirichlet_constant_one_table_value - 0053
exact hu - 0054
exact hqpositive - 0055
exact hqbound - 0056
exact hv_witness - 0057
rewrite heq at hv_witness - 0058
rewrite heq at hv_witness - 0059
specialize dirichlet_convolution_entry_from_quotient (F) - 0060
specialize dirichlet_convolution_entry_from_quotient (U) - 0061
specialize dirichlet_convolution_entry_from_quotient (n) - 0062
specialize dirichlet_convolution_entry_from_quotient (d) - 0063
specialize dirichlet_convolution_entry_from_quotient (x) - 0064
specialize dirichlet_convolution_entry_from_quotient (z) - 0065
specialize dirichlet_convolution_entry_from_quotient (2) - 0066
specialize dirichlet_convolution_entry_from_quotient (z) - 0067
apply dirichlet_convolution_entry_from_quotient - 0068
exact he_left_left - 0069
exact he_left_right_witness_left - 0070
exact he_left_right_witness_right - 0071
exact hv_witness - 0072
specialize signed_mul_one_right (z) - 0073
apply signed_mul_one_right - 0074
cases he_right - 0075
right - 0076
exact he_right