PP0010

prime_field_polynomial_add_functional

The sum is unique as a coefficient prefix; arbitrary beta recodings remain admissible.

Alpha v34 checked-use · first admitted v31 · independently kernel and Lean verified; not Stable

Current library: Alpha v34, 4,223 checked-use theorems; Stable remains 432. Historical first admissions, original proof editions, and non-admitted aliases are preserved.

Length is representation length, not polynomial degree. Leading zeros and the empty zero polynomial are allowed; the canonical argument guard x<p also applies to the empty case. Evaluation is defined by actual field-operation steps, not an assumed residue invariant. Polynomial division, gcd, irreducibles and general prime-power extension fields remain open; this does not close G091.

Exact theorem in conservative defined notation

∀ p. ∀ ab. ∀ ac. ∀ bb. ∀ bc. ∀ cb. ∀ cc. ∀ db. ∀ dc. ∀ l. FpPolyAdd(p,ab,ac,bb,bc,cb,cc,l) → FpPolyAdd(p,ab,ac,bb,bc,db,dc,l) → BetaPrefixEqual(cb,cc,db,dc,l)

Every linked abbreviation expands hygienically to the identical original native formula.

Definition DAG

BetaPrefixEqual(b,c,d,e,l) · 1FpPolyAdd(p,ab,ac,bb,bc,cb,cc,l) · 2BetaAt(b,c,i,x) · 3

Actual proof prerequisites

beta_at_exists · checked external prerequisiteprime_field_polynomial_add_entryprime_field_add_functional · checked external prerequisite
Original expanded first-order statement 
forall p ab ac bb bc cb cc db dc l. (forall pfp_index_add_functional_first. (exists pfa_gap_add_functional_firstindex. pfa_gap_add_functional_firstindex + S (pfp_index_add_functional_first) = (l)) -> exists pfp_left_add_functional_first pfp_right_add_functional_first pfp_value_add_functional_first. ((((exists ff_h_pfp_add_functional_firstleft. ff_h_pfp_add_functional_firstleft + S (pfp_left_add_functional_first) = S ((S (pfp_index_add_functional_first)) * ac)) /\ exists ff_q_pfp_add_functional_firstleft. ab = ff_q_pfp_add_functional_firstleft * S ((S (pfp_index_add_functional_first)) * ac) + (pfp_left_add_functional_first))) /\ (((((exists ff_h_pfp_add_functional_firstright. ff_h_pfp_add_functional_firstright + S (pfp_right_add_functional_first) = S ((S (pfp_index_add_functional_first)) * bc)) /\ exists ff_q_pfp_add_functional_firstright. bb = ff_q_pfp_add_functional_firstright * S ((S (pfp_index_add_functional_first)) * bc) + (pfp_right_add_functional_first))) /\ (((((exists ff_h_pfp_add_functional_firsttarget. ff_h_pfp_add_functional_firsttarget + S (pfp_value_add_functional_first) = S ((S (pfp_index_add_functional_first)) * cc)) /\ exists ff_q_pfp_add_functional_firsttarget. cb = ff_q_pfp_add_functional_firsttarget * S ((S (pfp_index_add_functional_first)) * cc) + (pfp_value_add_functional_first))) /\ ((((exists pfa_gap_add_functional_firstoperationleft. pfa_gap_add_functional_firstoperationleft + S (pfp_left_add_functional_first) = (p)) /\ (((exists pfa_gap_add_functional_firstoperationright. pfa_gap_add_functional_firstoperationright + S (pfp_right_add_functional_first) = (p)) /\ ((((exists pfa_gap_add_functional_firstoperationresultbound. pfa_gap_add_functional_firstoperationresultbound + S (pfp_value_add_functional_first) = (p)) /\ ((exists pfa_offset_left_add_functional_firstoperationresultcongruence pfa_offset_right_add_functional_firstoperationresultcongruence. ((pfp_left_add_functional_first) + (pfp_right_add_functional_first)) + (p) * pfa_offset_left_add_functional_firstoperationresultcongruence = (pfp_value_add_functional_first) + (p) * pfa_offset_right_add_functional_firstoperationresultcongruence)))))))))))))))) -> (forall pfp_index_add_functional_second. (exists pfa_gap_add_functional_secondindex. pfa_gap_add_functional_secondindex + S (pfp_index_add_functional_second) = (l)) -> exists pfp_left_add_functional_second pfp_right_add_functional_second pfp_value_add_functional_second. ((((exists ff_h_pfp_add_functional_secondleft. ff_h_pfp_add_functional_secondleft + S (pfp_left_add_functional_second) = S ((S (pfp_index_add_functional_second)) * ac)) /\ exists ff_q_pfp_add_functional_secondleft. ab = ff_q_pfp_add_functional_secondleft * S ((S (pfp_index_add_functional_second)) * ac) + (pfp_left_add_functional_second))) /\ (((((exists ff_h_pfp_add_functional_secondright. ff_h_pfp_add_functional_secondright + S (pfp_right_add_functional_second) = S ((S (pfp_index_add_functional_second)) * bc)) /\ exists ff_q_pfp_add_functional_secondright. bb = ff_q_pfp_add_functional_secondright * S ((S (pfp_index_add_functional_second)) * bc) + (pfp_right_add_functional_second))) /\ (((((exists ff_h_pfp_add_functional_secondtarget. ff_h_pfp_add_functional_secondtarget + S (pfp_value_add_functional_second) = S ((S (pfp_index_add_functional_second)) * dc)) /\ exists ff_q_pfp_add_functional_secondtarget. db = ff_q_pfp_add_functional_secondtarget * S ((S (pfp_index_add_functional_second)) * dc) + (pfp_value_add_functional_second))) /\ ((((exists pfa_gap_add_functional_secondoperationleft. pfa_gap_add_functional_secondoperationleft + S (pfp_left_add_functional_second) = (p)) /\ (((exists pfa_gap_add_functional_secondoperationright. pfa_gap_add_functional_secondoperationright + S (pfp_right_add_functional_second) = (p)) /\ ((((exists pfa_gap_add_functional_secondoperationresultbound. pfa_gap_add_functional_secondoperationresultbound + S (pfp_value_add_functional_second) = (p)) /\ ((exists pfa_offset_left_add_functional_secondoperationresultcongruence pfa_offset_right_add_functional_secondoperationresultcongruence. ((pfp_left_add_functional_second) + (pfp_right_add_functional_second)) + (p) * pfa_offset_left_add_functional_secondoperationresultcongruence = (pfp_value_add_functional_second) + (p) * pfa_offset_right_add_functional_secondoperationresultcongruence)))))))))))))))) -> (forall mdr_i_pfp_add_functional_result mdr_a_pfp_add_functional_result. (exists mdr_gap_pfp_add_functional_resultb. mdr_gap_pfp_add_functional_resultb + S (mdr_i_pfp_add_functional_result) = (l)) -> (((exists ff_h_mdr_pfp_add_functional_resulto. ff_h_mdr_pfp_add_functional_resulto + S (mdr_a_pfp_add_functional_result) = S ((S (mdr_i_pfp_add_functional_result)) * cc)) /\ exists ff_q_mdr_pfp_add_functional_resulto. cb = ff_q_mdr_pfp_add_functional_resulto * S ((S (mdr_i_pfp_add_functional_result)) * cc) + (mdr_a_pfp_add_functional_result))) -> (((exists ff_h_mdr_pfp_add_functional_resultn. ff_h_mdr_pfp_add_functional_resultn + S (mdr_a_pfp_add_functional_result) = S ((S (mdr_i_pfp_add_functional_result)) * dc)) /\ exists ff_q_mdr_pfp_add_functional_resultn. db = ff_q_mdr_pfp_add_functional_resultn * S ((S (mdr_i_pfp_add_functional_result)) * dc) + (mdr_a_pfp_add_functional_result))))

Complete tactic proof in conservative notation

All 80 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

80 script commands · 15 reading checkpoints · 4 local claims

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.

Definition notation is shown below. Open the paired exact edition for the original native formulas. Source pairing is not a new equivalence certificate.

Named ingredients (1)
prime field polynomial add entry
01Fix variables and assumptionsL1–10

Work with arbitrary variables or the premises of the current implication.

  1. L1
    intro p
  2. L2
    intro ab
  3. L3
    intro ac
  4. L4
    intro bb
  5. L5
    intro bc
  6. L6
    intro cb
  7. L7
    intro cc
  8. L8
    intro db
  9. L9
    intro dc
  10. L10
    intro l
02Fix variables and assumptionsL11–16

Work with arbitrary variables or the premises of the current implication.

  1. L11
    intro hc
  2. L12
    intro hd
  3. L13
    intro i
  4. L14
    intro r
  5. L15
    intro hi
  6. L16
    intro hr
03Establish haL17–21

Establish this local claim before using it. It is not an additional assumption. The following proof commands apply beta at exists.

  1. L17
    have ha : ∃ a. BetaAt(ab,ac,i,a)Definitions: BetaAt(ab,ac,i,a)Original native command in the exact edition
  2. L18
    specialize beta_at_exists (ab)
  3. L19
    specialize beta_at_exists (ac)
  4. L20
    specialize beta_at_exists (i)
  5. L21
    apply beta_at_exists
04Separate the logical casesL22–22

Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.

  1. L22
    cases ha
05Establish hbL23–27

Establish this local claim before using it. It is not an additional assumption. The following proof commands apply beta at exists.

  1. L23
    have hb : ∃ b. BetaAt(bb,bc,i,b)Definitions: BetaAt(bb,bc,i,b)Original native command in the exact edition
  2. L24
    specialize beta_at_exists (bb)
  3. L25
    specialize beta_at_exists (bc)
  4. L26
    specialize beta_at_exists (i)
  5. L27
    apply beta_at_exists
06Separate the logical casesL28–28

Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.

  1. L28
    cases hb
07Establish hsL29–33

Establish this local claim before using it. It is not an additional assumption. The following proof commands apply beta at exists.

  1. L29
    have hs : ∃ s. BetaAt(db,dc,i,s)Definitions: BetaAt(db,dc,i,s)Original native command in the exact edition
  2. L30
    specialize beta_at_exists (db)
  3. L31
    specialize beta_at_exists (dc)
  4. L32
    specialize beta_at_exists (i)
  5. L33
    apply beta_at_exists
08Separate the logical casesL34–34

Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.

  1. L34
    cases hs
09Establish heqL35–44

Establish this local claim before using it. It is not an additional assumption. The following proof commands apply prime field add functional.

  1. L35
    have heq : r=x2
  2. L36
    specialize prime_field_add_functional (p)
  3. L37
    specialize prime_field_add_functional (x)
  4. L38
    specialize prime_field_add_functional (x1)
  5. L39
    specialize prime_field_add_functional (r)
  6. L40
    specialize prime_field_add_functional (x2)
  7. L41
    apply prime_field_add_functional
  8. L42
    specialize prime_field_polynomial_add_entry (p)
  9. L43
    specialize prime_field_polynomial_add_entry (ab)
  10. L44
    specialize prime_field_polynomial_add_entry (ac)
10Use earlier factsL45–54

Instantiate or apply named facts and discharge the corresponding proof obligations.

  1. L45
    specialize prime_field_polynomial_add_entry (bb)
  2. L46
    specialize prime_field_polynomial_add_entry (bc)
  3. L47
    specialize prime_field_polynomial_add_entry (cb)
  4. L48
    specialize prime_field_polynomial_add_entry (cc)
  5. L49
    specialize prime_field_polynomial_add_entry (l)
  6. L50
    specialize prime_field_polynomial_add_entry (i)
  7. L51
    specialize prime_field_polynomial_add_entry (x)
  8. L52
    specialize prime_field_polynomial_add_entry (x1)
  9. L53
    specialize prime_field_polynomial_add_entry (r)
  10. L54
    apply prime_field_polynomial_add_entry
11Use earlier factsL55–64

Instantiate or apply named facts and discharge the corresponding proof obligations.

  1. L55
    exact hc
  2. L56
    exact hi
  3. L57
    exact ha_witness
  4. L58
    exact hb_witness
  5. L59
    exact hr
  6. L60
    specialize prime_field_polynomial_add_entry (p)
  7. L61
    specialize prime_field_polynomial_add_entry (ab)
  8. L62
    specialize prime_field_polynomial_add_entry (ac)
  9. L63
    specialize prime_field_polynomial_add_entry (bb)
  10. L64
    specialize prime_field_polynomial_add_entry (bc)
12Use earlier factsL65–74

Instantiate or apply named facts and discharge the corresponding proof obligations.

  1. L65
    specialize prime_field_polynomial_add_entry (db)
  2. L66
    specialize prime_field_polynomial_add_entry (dc)
  3. L67
    specialize prime_field_polynomial_add_entry (l)
  4. L68
    specialize prime_field_polynomial_add_entry (i)
  5. L69
    specialize prime_field_polynomial_add_entry (x)
  6. L70
    specialize prime_field_polynomial_add_entry (x1)
  7. L71
    specialize prime_field_polynomial_add_entry (x2)
  8. L72
    apply prime_field_polynomial_add_entry
  9. L73
    exact hd
  10. L74
    exact hi
13Use earlier factsL75–77

Instantiate or apply named facts and discharge the corresponding proof obligations.

  1. L75
    exact ha_witness
  2. L76
    exact hb_witness
  3. L77
    exact hs_witness
14Calculate and transport equalitiesL78–79

Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.

  1. L78
    rewrite heq
  2. L79
    rewrite heq
15Use earlier factsL80–80

Instantiate or apply named facts and discharge the corresponding proof obligations.

  1. L80
    exact hs_witness

Library-wide reading audit

Original defined command ledger · 80 lines
  1. 0001intro p
  2. 0002intro ab
  3. 0003intro ac
  4. 0004intro bb
  5. 0005intro bc
  6. 0006intro cb
  7. 0007intro cc
  8. 0008intro db
  9. 0009intro dc
  10. 0010intro l
  11. 0011intro hc
  12. 0012intro hd
  13. 0013intro i
  14. 0014intro r
  15. 0015intro hi
  16. 0016intro hr
  17. 0017have ha : ∃ a. BetaAt(ab,ac,i,a)
  18. 0018specialize beta_at_exists (ab)
  19. 0019specialize beta_at_exists (ac)
  20. 0020specialize beta_at_exists (i)
  21. 0021apply beta_at_exists
  22. 0022cases ha
  23. 0023have hb : ∃ b. BetaAt(bb,bc,i,b)
  24. 0024specialize beta_at_exists (bb)
  25. 0025specialize beta_at_exists (bc)
  26. 0026specialize beta_at_exists (i)
  27. 0027apply beta_at_exists
  28. 0028cases hb
  29. 0029have hs : ∃ s. BetaAt(db,dc,i,s)
  30. 0030specialize beta_at_exists (db)
  31. 0031specialize beta_at_exists (dc)
  32. 0032specialize beta_at_exists (i)
  33. 0033apply beta_at_exists
  34. 0034cases hs
  35. 0035have heq : r=x2
  36. 0036specialize prime_field_add_functional (p)
  37. 0037specialize prime_field_add_functional (x)
  38. 0038specialize prime_field_add_functional (x1)
  39. 0039specialize prime_field_add_functional (r)
  40. 0040specialize prime_field_add_functional (x2)
  41. 0041apply prime_field_add_functional
  42. 0042specialize prime_field_polynomial_add_entry (p)
  43. 0043specialize prime_field_polynomial_add_entry (ab)
  44. 0044specialize prime_field_polynomial_add_entry (ac)
  45. 0045specialize prime_field_polynomial_add_entry (bb)
  46. 0046specialize prime_field_polynomial_add_entry (bc)
  47. 0047specialize prime_field_polynomial_add_entry (cb)
  48. 0048specialize prime_field_polynomial_add_entry (cc)
  49. 0049specialize prime_field_polynomial_add_entry (l)
  50. 0050specialize prime_field_polynomial_add_entry (i)
  51. 0051specialize prime_field_polynomial_add_entry (x)
  52. 0052specialize prime_field_polynomial_add_entry (x1)
  53. 0053specialize prime_field_polynomial_add_entry (r)
  54. 0054apply prime_field_polynomial_add_entry
  55. 0055exact hc
  56. 0056exact hi
  57. 0057exact ha_witness
  58. 0058exact hb_witness
  59. 0059exact hr
  60. 0060specialize prime_field_polynomial_add_entry (p)
  61. 0061specialize prime_field_polynomial_add_entry (ab)
  62. 0062specialize prime_field_polynomial_add_entry (ac)
  63. 0063specialize prime_field_polynomial_add_entry (bb)
  64. 0064specialize prime_field_polynomial_add_entry (bc)
  65. 0065specialize prime_field_polynomial_add_entry (db)
  66. 0066specialize prime_field_polynomial_add_entry (dc)
  67. 0067specialize prime_field_polynomial_add_entry (l)
  68. 0068specialize prime_field_polynomial_add_entry (i)
  69. 0069specialize prime_field_polynomial_add_entry (x)
  70. 0070specialize prime_field_polynomial_add_entry (x1)
  71. 0071specialize prime_field_polynomial_add_entry (x2)
  72. 0072apply prime_field_polynomial_add_entry
  73. 0073exact hd
  74. 0074exact hi
  75. 0075exact ha_witness
  76. 0076exact hb_witness
  77. 0077exact hs_witness
  78. 0078rewrite heq
  79. 0079rewrite heq
  80. 0080exact hs_witness