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. ∀ n. ArithTable(N,F) → ¬n = 0 → Le(n,N) → ∃ x. DivisorSum(F,n,x)
Every linked abbreviation expands hygienically to the identical original native formula.
Definition DAG
Actual proof prerequisites
Complete tactic proof in conservative notation
All 30 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 (2)
01Fix variables and assumptionsL1–6
02Establish hmL7–14
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply divisor mask prefix exists.
- L7
have hm : ∃ M. DivisorMask(F,n,n,M)Definitions: DivisorMask(F,n,n,M)Original native command in the exact edition - L8
specialize divisor_mask_prefix_exists (N) - L9
specialize divisor_mask_prefix_exists (F) - L10
specialize divisor_mask_prefix_exists (n) - L11
specialize divisor_mask_prefix_exists (n) - L12
apply divisor_mask_prefix_exists - L13
exact ht - L14
exact hbound
03Separate the logical casesL15–16
04Establish hzL17–22
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply arithmetic signed sum exists.
- L17
have hz : ∃ z. SignedPrefixSum(x,S n,z)Definitions: SignedPrefixSum(x,S n,z)Original native command in the exact edition - L18
specialize arithmetic_signed_sum_exists (n) - L19
specialize arithmetic_signed_sum_exists (x) - L20
specialize arithmetic_signed_sum_exists (S n) - L21
apply arithmetic_signed_sum_exists - L22
exact hm_witness_left
05Separate the logical casesL23–23
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L23
cases hz
06Construct an explicit witnessL24–24
Supply the displayed value, then prove that it has the required property.
- L24
exists x1
07Separate the logical casesL25–25
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L25
split
08Use earlier factsL26–26
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L26
exact hn
09Construct an explicit witnessL27–27
Supply the displayed value, then prove that it has the required property.
- L27
exists x
10Separate the logical casesL28–28
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L28
split
Original defined command ledger · 30 lines
- 0001
intro N - 0002
intro F - 0003
intro n - 0004
intro ht - 0005
intro hn - 0006
intro hbound - 0007
have hm : ∃ M. DivisorMask(F,n,n,M) - 0008
specialize divisor_mask_prefix_exists (N) - 0009
specialize divisor_mask_prefix_exists (F) - 0010
specialize divisor_mask_prefix_exists (n) - 0011
specialize divisor_mask_prefix_exists (n) - 0012
apply divisor_mask_prefix_exists - 0013
exact ht - 0014
exact hbound - 0015
cases hm - 0016
cases hm_witness - 0017
have hz : ∃ z. SignedPrefixSum(x,S n,z) - 0018
specialize arithmetic_signed_sum_exists (n) - 0019
specialize arithmetic_signed_sum_exists (x) - 0020
specialize arithmetic_signed_sum_exists (S n) - 0021
apply arithmetic_signed_sum_exists - 0022
exact hm_witness_left - 0023
cases hz - 0024
exists x1 - 0025
split - 0026
exact hn - 0027
exists x - 0028
split - 0029
exact hm_witness - 0030
exact hz_witness