Current library: Alpha v34, 4,223 checked-use theorems; Stable remains 432. Historical first admissions, original proof editions, and non-admitted aliases are preserved.
The zero window is half-open and its order hypothesis is essential. All folds retain actual beta-coded traces. These are support lemmas for the separately verified full inversion endpoint.
Exact theorem in conservative defined notation
∀ F. ∀ l. ArithTable(0,F) → SignedZeroWindow(F,0,l) → SignedPrefixSum(F,l,0)
Every linked abbreviation expands hygienically to the identical original native formula.
Definition DAG
Actual proof prerequisites
Complete tactic proof in conservative notation
All 21 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–4
02Establish hsL5–10
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply arithmetic signed sum exists.
- L5
have hs : ∃ z. SignedPrefixSum(F,l,z)Definitions: SignedPrefixSum(F,l,z)Original native command in the exact edition - L6
specialize arithmetic_signed_sum_exists (0) - L7
specialize arithmetic_signed_sum_exists (F) - L8
specialize arithmetic_signed_sum_exists (l) - L9
apply arithmetic_signed_sum_exists - L10
exact hF
03Separate the logical casesL11–11
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L11
cases hs
04Establish hvL12–21
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply signed prefix sum zero value.
Original defined command ledger · 21 lines
- 0001
intro F - 0002
intro l - 0003
intro hF - 0004
intro hz - 0005
have hs : ∃ z. SignedPrefixSum(F,l,z) - 0006
specialize arithmetic_signed_sum_exists (0) - 0007
specialize arithmetic_signed_sum_exists (F) - 0008
specialize arithmetic_signed_sum_exists (l) - 0009
apply arithmetic_signed_sum_exists - 0010
exact hF - 0011
cases hs - 0012
have hv : x=0 - 0013
specialize signed_prefix_sum_zero_value (F) - 0014
specialize signed_prefix_sum_zero_value (l) - 0015
specialize signed_prefix_sum_zero_value (x) - 0016
apply signed_prefix_sum_zero_value - 0017
exact hz - 0018
exact hs_witness - 0019
rewrite hv at hs_witness - 0020
rewrite hv at hs_witness - 0021
exact hs_witness