Current library: Alpha v34, 4,223 checked-use theorems; Stable remains 432. Historical first admissions, original proof editions, and non-admitted aliases are preserved.
A genuine divisor mask has S n entries, indexed zero through n, and forces its zeroth entry to zero regardless of F(0). Möbius values remain positive-domain only. This family constructs divisor sums and Möbius tables; cancellation and the full G007 endpoint are separately proved later in the same release.
Exact theorem in conservative defined notation
∀ N. ∀ F. ∀ G. ∀ l. ∀ i. ∀ z. ArithTable(N,G) → ArithTableEqual(F,G,l) → Le(i,N) → Lt(i,l) → ArithAt(F,i,z) → ArithAt(G,i,z)
Every linked abbreviation expands hygienically to the identical original native formula.
Definition DAG
Actual proof prerequisites
Complete tactic proof in conservative notation
All 31 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–10
02Fix variables and assumptionsL11–11
Work with arbitrary variables or the premises of the current implication.
- L11
intro hz
03Establish hbL12–18
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply divisor signed table lookup.
- L12
have hb : ∃ b. ArithAt(G,i,b)Definitions: ArithAt(G,i,b)Original native command in the exact edition - L13
specialize divisor_signed_table_lookup (N) - L14
specialize divisor_signed_table_lookup (G) - L15
specialize divisor_signed_table_lookup (i) - L16
apply divisor_signed_table_lookup - L17
exact ht - L18
exact hiN
04Separate the logical casesL19–19
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L19
cases hb
05Establish heqL20–29
06Calculate and transport equalitiesL30–30
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L30
rewrite heq at hb_witness
07Use earlier factsL31–31
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L31
exact hb_witness
Original defined command ledger · 31 lines
- 0001
intro N - 0002
intro F - 0003
intro G - 0004
intro l - 0005
intro i - 0006
intro z - 0007
intro ht - 0008
intro he - 0009
intro hiN - 0010
intro hil - 0011
intro hz - 0012
have hb : ∃ b. ArithAt(G,i,b) - 0013
specialize divisor_signed_table_lookup (N) - 0014
specialize divisor_signed_table_lookup (G) - 0015
specialize divisor_signed_table_lookup (i) - 0016
apply divisor_signed_table_lookup - 0017
exact ht - 0018
exact hiN - 0019
cases hb - 0020
have heq : x = z - 0021
symm - 0022
specialize he (i) - 0023
specialize he (z) - 0024
specialize he (x) - 0025
apply he - 0026
exact hil - 0027
exact hz - 0028
exact hb_witness - 0029
rewrite heq at hb_witness - 0030
rewrite heq at hb_witness - 0031
exact hb_witness