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. ∀ z. DirichletPrefix(F,G,n,l,M) → DirichletEntry(F,G,n,S l,z) → ∃ x. DirichletPrefix(F,G,n,S l,x) ∧ ArithTableEqual(M,x,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 85 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–8
02Separate the logical casesL9–9
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L9
cases hm
03Establish hextL10–15
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply arithmetic signed table append.
- L10
have hext : ∃ H. ArithTable(S l,H) ∧ (ArithTableEqual(M,H,S l) ∧ ArithAt(H,S l,z))Definitions: ArithTable(S l,H)ArithTableEqual(M,H,S l)ArithAt(H,S l,z)Original native command in the exact edition - L11
specialize arithmetic_signed_table_append (l) - L12
specialize arithmetic_signed_table_append (M) - L13
specialize arithmetic_signed_table_append (z) - L14
apply arithmetic_signed_table_append - L15
exact hm_left
04Separate the logical casesL16–18
05Construct an explicit witnessL19–19
Supply the displayed value, then prove that it has the required property.
- L19
exists x
06Separate the logical casesL20–21
07Use earlier factsL22–22
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L22
exact hext_witness_left
08Fix variables and assumptionsL23–26
09Establish hcL27–31
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply le eq or lt.
10Separate the logical casesL32–32
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L32
cases hc
11Calculate and transport equalitiesL33–36
12Establish heqL37–46
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply divisor signed table at functional.
- L37
have heq : z=u - L38
specialize divisor_signed_table_at_functional (x) - L39
specialize divisor_signed_table_at_functional (S l) - L40
specialize divisor_signed_table_at_functional (z) - L41
specialize divisor_signed_table_at_functional (u) - L42
apply divisor_signed_table_at_functional - L43
exact hext_witness_right_right - L44
exact hu - L45
rewrite heq at hz - L46
rewrite heq at hz
13Calculate and transport equalitiesL47–55
14Use earlier factsL56–56
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L56
exact hz
15Establish hboundL57–61
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply le of succ le succ.
16Establish hvL62–68
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply divisor signed table lookup.
- L62
have hv : ∃ v. ArithAt(M,d,v)Definitions: ArithAt(M,d,v)Original native command in the exact edition - L63
specialize divisor_signed_table_lookup (l) - L64
specialize divisor_signed_table_lookup (M) - L65
specialize divisor_signed_table_lookup (d) - L66
apply divisor_signed_table_lookup - L67
exact hm_left - L68
exact hbound
17Separate the logical casesL69–69
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L69
cases hv
18Establish heqL70–79
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply hext witness right left.
Original defined command ledger · 85 lines
- 0001
intro F - 0002
intro G - 0003
intro n - 0004
intro l - 0005
intro M - 0006
intro z - 0007
intro hm - 0008
intro hz - 0009
cases hm - 0010
have hext : ∃ H. ArithTable(S l,H) ∧ (ArithTableEqual(M,H,S l) ∧ ArithAt(H,S l,z)) - 0011
specialize arithmetic_signed_table_append (l) - 0012
specialize arithmetic_signed_table_append (M) - 0013
specialize arithmetic_signed_table_append (z) - 0014
apply arithmetic_signed_table_append - 0015
exact hm_left - 0016
cases hext - 0017
cases hext_witness - 0018
cases hext_witness_right - 0019
exists x - 0020
split - 0021
split - 0022
exact hext_witness_left - 0023
intro d - 0024
intro u - 0025
intro hd - 0026
intro hu - 0027
have hc : d = S l ∨ Lt(d,S l) - 0028
specialize le_eq_or_lt (d) - 0029
specialize le_eq_or_lt (S l) - 0030
apply le_eq_or_lt - 0031
exact hd - 0032
cases hc - 0033
rewrite hc_left at hu - 0034
rewrite hc_left at hu - 0035
rewrite hc_left at hu - 0036
rewrite hc_left at hu - 0037
have heq : z=u - 0038
specialize divisor_signed_table_at_functional (x) - 0039
specialize divisor_signed_table_at_functional (S l) - 0040
specialize divisor_signed_table_at_functional (z) - 0041
specialize divisor_signed_table_at_functional (u) - 0042
apply divisor_signed_table_at_functional - 0043
exact hext_witness_right_right - 0044
exact hu - 0045
rewrite heq at hz - 0046
rewrite heq at hz - 0047
rewrite heq at hz - 0048
rewrite hc_left - 0049
rewrite hc_left - 0050
rewrite hc_left - 0051
rewrite hc_left - 0052
rewrite hc_left - 0053
rewrite hc_left - 0054
rewrite hc_left - 0055
rewrite hc_left - 0056
exact hz - 0057
have hbound : Le(d,l) - 0058
specialize le_of_succ_le_succ (d) - 0059
specialize le_of_succ_le_succ (l) - 0060
apply le_of_succ_le_succ - 0061
exact hc_right - 0062
have hv : ∃ v. ArithAt(M,d,v) - 0063
specialize divisor_signed_table_lookup (l) - 0064
specialize divisor_signed_table_lookup (M) - 0065
specialize divisor_signed_table_lookup (d) - 0066
apply divisor_signed_table_lookup - 0067
exact hm_left - 0068
exact hbound - 0069
cases hv - 0070
have heq : x1=u - 0071
specialize hext_witness_right_left (d) - 0072
specialize hext_witness_right_left (x1) - 0073
specialize hext_witness_right_left (u) - 0074
apply hext_witness_right_left - 0075
exact hc_right - 0076
exact hv_witness - 0077
exact hu - 0078
rewrite heq at hv_witness - 0079
rewrite heq at hv_witness - 0080
specialize hm_right (d) - 0081
specialize hm_right (u) - 0082
apply hm_right - 0083
exact hbound - 0084
exact hv_witness - 0085
exact hext_witness_right_left