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) → DirichletEntry(F,U,n,d,z) → DivisorMaskEntry(F,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 74 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–18
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
03Establish hqpositiveL19–27
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply factor nonzero right.
04Establish hqboundL28–36
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply le trans.
05Construct an explicit witnessL37–37
Supply the displayed value, then prove that it has the required property.
- L37
exists d
06Calculate and transport equalitiesL38–38
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L38
trans (d)*(x)
07Use earlier factsL39–41
08Establish hvL42–51
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply dirichlet constant one table value.
- L42
have hv : x2=2 - L43
specialize dirichlet_constant_one_table_value (N) - L44
specialize dirichlet_constant_one_table_value (U) - L45
specialize dirichlet_constant_one_table_value (x) - L46
specialize dirichlet_constant_one_table_value (x2) - L47
apply dirichlet_constant_one_table_value - L48
exact hu - L49
exact hqpositive - L50
exact hqbound - L51
exact he_left_right_witness_witness_witness_right_right_left
09Calculate and transport equalitiesL52–53
10Establish heqL54–62
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply signed mul functional.
- L54
have heq : z=x1 - L55
specialize signed_mul_functional (x1) - L56
specialize signed_mul_functional (2) - L57
specialize signed_mul_functional (z) - L58
specialize signed_mul_functional (x1) - L59
apply signed_mul_functional - L60
exact he_left_right_witness_witness_witness_right_right_right - L61
specialize signed_mul_one_right (x1) - L62
apply signed_mul_one_right
11Separate the logical casesL63–64
12Use earlier factsL65–65
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L65
exact he_left_left
13Construct an explicit witnessL66–66
Supply the displayed value, then prove that it has the required property.
- L66
exists x
14Separate the logical casesL67–67
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L67
split
15Use earlier factsL68–68
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L68
exact he_left_right_witness_witness_witness_left
16Calculate and transport equalitiesL69–70
17Use earlier factsL71–71
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L71
exact he_left_right_witness_witness_witness_right_left
18Separate the logical casesL72–73
19Use earlier factsL74–74
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L74
exact he_right
Original defined command ledger · 74 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
cases he_left_right_witness_witness - 0016
cases he_left_right_witness_witness_witness - 0017
cases he_left_right_witness_witness_witness_right - 0018
cases he_left_right_witness_witness_witness_right_right - 0019
have hqpositive : ~(x=0) - 0020
intro hqzero - 0021
specialize factor_nonzero_right (n) - 0022
specialize factor_nonzero_right (d) - 0023
specialize factor_nonzero_right (x) - 0024
apply factor_nonzero_right - 0025
exact hn - 0026
exact he_left_right_witness_witness_witness_left - 0027
exact hqzero - 0028
have hqbound : Le(x,N) - 0029
specialize le_trans (x) - 0030
specialize le_trans (n) - 0031
specialize le_trans (N) - 0032
apply le_trans - 0033
specialize divisor_le_nonzero (x) - 0034
specialize divisor_le_nonzero (n) - 0035
apply divisor_le_nonzero - 0036
exact hn - 0037
exists d - 0038
trans (d)*(x) - 0039
exact he_left_right_witness_witness_witness_left - 0040
apply mul_comm - 0041
exact hb - 0042
have hv : x2=2 - 0043
specialize dirichlet_constant_one_table_value (N) - 0044
specialize dirichlet_constant_one_table_value (U) - 0045
specialize dirichlet_constant_one_table_value (x) - 0046
specialize dirichlet_constant_one_table_value (x2) - 0047
apply dirichlet_constant_one_table_value - 0048
exact hu - 0049
exact hqpositive - 0050
exact hqbound - 0051
exact he_left_right_witness_witness_witness_right_right_left - 0052
rewrite hv at he_left_right_witness_witness_witness_right_right_right - 0053
rewrite hv at he_left_right_witness_witness_witness_right_right_right - 0054
have heq : z=x1 - 0055
specialize signed_mul_functional (x1) - 0056
specialize signed_mul_functional (2) - 0057
specialize signed_mul_functional (z) - 0058
specialize signed_mul_functional (x1) - 0059
apply signed_mul_functional - 0060
exact he_left_right_witness_witness_witness_right_right_right - 0061
specialize signed_mul_one_right (x1) - 0062
apply signed_mul_one_right - 0063
left - 0064
split - 0065
exact he_left_left - 0066
exists x - 0067
split - 0068
exact he_left_right_witness_witness_witness_left - 0069
rewrite heq - 0070
rewrite heq - 0071
exact he_left_right_witness_witness_witness_right_left - 0072
cases he_right - 0073
right - 0074
exact he_right