PX0060

polynomial_diagonal_term_left_padding_left

A genuine left factor leading-zero padding shifts the antidiagonal position while preserving each actual natural product term.

Alpha v34 checked-use · first admitted v33 · 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.

Coefficients are highest-degree-first. The divisor has a nonzero decoded head; primality supplies its actual inverse. Empty quotients and remainders are included. Functionality compares the constructed execution lengths and decoded coefficients, never arbitrary beta codes. Formal polynomial equivalence compares every coefficient, not evaluations on a finite field. The formal identity and remainder-degree bound are proved separately, not assumed by the execution graph. Arbitrary quotient/remainder-pair uniqueness from a formal identity, multiplication associativity, gcd/Bezout, irreducible-polynomial existence, and the full G091 prime-power-field goal remain open. The seven displayed new names are conservative first-order notation, not new kernel primitives.

Exact theorem in conservative defined notation

∀ ab. ∀ ac. ∀ L. ∀ bb. ∀ bc. ∀ M. ∀ AB. ∀ AC. ∀ t. ∀ i. ∀ j. ∀ z. PolynomialLeftPad(ab,ac,L,t,AB,AC) → PolynomialDiagonalTerm(ab,ac,L,bb,bc,M,i,j,z) → PolynomialDiagonalTerm(AB,AC,t + L,bb,bc,M,t + i,t + j,z)

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

Definition DAG

PolynomialDiagonalTerm(ab,ac,L,bb,bc,M,i,j,t) · 2PolynomialLeftPad(b,c,L,t,d,e) · 1

Actual proof prerequisites

add_assoc · checked external prerequisitepolynomial_zero_extended_left_pad_shift
Original expanded first-order statement 
forall ab ac L bb bc M AB AC t i j z. (((forall pfp_repeat_index_term_padding_leftzeros. (exists pfa_gap_term_padding_leftzerosindex. pfa_gap_term_padding_leftzerosindex + S (pfp_repeat_index_term_padding_leftzeros) = (t)) -> (((exists ff_h_pfp_term_padding_leftzerosentry. ff_h_pfp_term_padding_leftzerosentry + S (0) = S ((S (pfp_repeat_index_term_padding_leftzeros)) * AC)) /\ exists ff_q_pfp_term_padding_leftzerosentry. AB = ff_q_pfp_term_padding_leftzerosentry * S ((S (pfp_repeat_index_term_padding_leftzeros)) * AC) + (0)))) /\ ((forall pfrep_index_term_padding_left pfrep_value_term_padding_left. (exists pfa_gap_term_padding_leftbound. pfa_gap_term_padding_leftbound + S (pfrep_index_term_padding_left) = (L)) -> (((exists ff_h_pfp_term_padding_leftinput. ff_h_pfp_term_padding_leftinput + S (pfrep_value_term_padding_left) = S ((S (pfrep_index_term_padding_left)) * ac)) /\ exists ff_q_pfp_term_padding_leftinput. ab = ff_q_pfp_term_padding_leftinput * S ((S (pfrep_index_term_padding_left)) * ac) + (pfrep_value_term_padding_left))) -> (((exists ff_h_pfp_term_padding_leftoutput. ff_h_pfp_term_padding_leftoutput + S (pfrep_value_term_padding_left) = S ((S ((t)+pfrep_index_term_padding_left)) * AC)) /\ exists ff_q_pfp_term_padding_leftoutput. AB = ff_q_pfp_term_padding_leftoutput * S ((S ((t)+pfrep_index_term_padding_left)) * AC) + (pfrep_value_term_padding_left))))))) -> (exists pfc_complement_term_original_left pfc_left_term_original_left pfc_right_term_original_left. (((j)+pfc_complement_term_original_left=(i)) /\ ((((((exists pfa_gap_term_original_leftleftinside. pfa_gap_term_original_leftleftinside + S (j) = (L)) /\ ((((exists ff_h_pfp_term_original_leftleftentry. ff_h_pfp_term_original_leftleftentry + S (pfc_left_term_original_left) = S ((S (j)) * ac)) /\ exists ff_q_pfp_term_original_leftleftentry. ab = ff_q_pfp_term_original_leftleftentry * S ((S (j)) * ac) + (pfc_left_term_original_left)))))) \/ (((exists pfc_gap_term_original_leftleftoutside. pfc_gap_term_original_leftleftoutside+(L)=(j)) /\ (((pfc_left_term_original_left)=0))))) /\ ((((((exists pfa_gap_term_original_leftrightinside. pfa_gap_term_original_leftrightinside + S (pfc_complement_term_original_left) = (M)) /\ ((((exists ff_h_pfp_term_original_leftrightentry. ff_h_pfp_term_original_leftrightentry + S (pfc_right_term_original_left) = S ((S (pfc_complement_term_original_left)) * bc)) /\ exists ff_q_pfp_term_original_leftrightentry. bb = ff_q_pfp_term_original_leftrightentry * S ((S (pfc_complement_term_original_left)) * bc) + (pfc_right_term_original_left)))))) \/ (((exists pfc_gap_term_original_leftrightoutside. pfc_gap_term_original_leftrightoutside+(M)=(pfc_complement_term_original_left)) /\ (((pfc_right_term_original_left)=0))))) /\ (((z)=pfc_left_term_original_left*pfc_right_term_original_left)))))))) -> (exists pfc_complement_term_shifted_left pfc_left_term_shifted_left pfc_right_term_shifted_left. (((t+j)+pfc_complement_term_shifted_left=(t+i)) /\ ((((((exists pfa_gap_term_shifted_leftleftinside. pfa_gap_term_shifted_leftleftinside + S (t+j) = (t+L)) /\ ((((exists ff_h_pfp_term_shifted_leftleftentry. ff_h_pfp_term_shifted_leftleftentry + S (pfc_left_term_shifted_left) = S ((S (t+j)) * AC)) /\ exists ff_q_pfp_term_shifted_leftleftentry. AB = ff_q_pfp_term_shifted_leftleftentry * S ((S (t+j)) * AC) + (pfc_left_term_shifted_left)))))) \/ (((exists pfc_gap_term_shifted_leftleftoutside. pfc_gap_term_shifted_leftleftoutside+(t+L)=(t+j)) /\ (((pfc_left_term_shifted_left)=0))))) /\ ((((((exists pfa_gap_term_shifted_leftrightinside. pfa_gap_term_shifted_leftrightinside + S (pfc_complement_term_shifted_left) = (M)) /\ ((((exists ff_h_pfp_term_shifted_leftrightentry. ff_h_pfp_term_shifted_leftrightentry + S (pfc_right_term_shifted_left) = S ((S (pfc_complement_term_shifted_left)) * bc)) /\ exists ff_q_pfp_term_shifted_leftrightentry. bb = ff_q_pfp_term_shifted_leftrightentry * S ((S (pfc_complement_term_shifted_left)) * bc) + (pfc_right_term_shifted_left)))))) \/ (((exists pfc_gap_term_shifted_leftrightoutside. pfc_gap_term_shifted_leftrightoutside+(M)=(pfc_complement_term_shifted_left)) /\ (((pfc_right_term_shifted_left)=0))))) /\ (((z)=pfc_left_term_shifted_left*pfc_right_term_shifted_left))))))))

Complete tactic proof in conservative notation

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

44 script commands · 14 reading checkpoints · 0 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)
polynomial zero extended left pad shift
01Fix variables and assumptionsL1–10

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

  1. L1
    intro ab
  2. L2
    intro ac
  3. L3
    intro L
  4. L4
    intro bb
  5. L5
    intro bc
  6. L6
    intro M
  7. L7
    intro AB
  8. L8
    intro AC
  9. L9
    intro t
  10. L10
    intro i
02Fix variables and assumptionsL11–14

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

  1. L11
    intro j
  2. L12
    intro z
  3. L13
    intro hp
  4. L14
    intro ht
03Separate the logical casesL15–20

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

  1. L15
    cases ht
  2. L16
    cases ht_witness
  3. L17
    cases ht_witness_witness
  4. L18
    cases ht_witness_witness_witness
  5. L19
    cases ht_witness_witness_witness_right
  6. L20
    cases ht_witness_witness_witness_right_right
04Construct an explicit witnessL21–23

Supply the displayed value, then prove that it has the required property.

  1. L21
    exists x
  2. L22
    exists x1
  3. L23
    exists x2
05Separate the logical casesL24–24

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

  1. L24
    split
06Calculate and transport equalitiesL25–25

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

  1. L25
    trans t+(j+x)
07Use earlier factsL26–26

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

  1. L26
    apply add_assoc
08Calculate and transport equalitiesL27–28

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

  1. L27
    congr
  2. L28
    refl
09Use earlier factsL29–29

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

  1. L29
    exact ht_witness_witness_witness_left
10Separate the logical casesL30–30

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

  1. L30
    split
11Use earlier factsL31–40

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

  1. L31
    specialize polynomial_zero_extended_left_pad_shift (ab)
  2. L32
    specialize polynomial_zero_extended_left_pad_shift (ac)
  3. L33
    specialize polynomial_zero_extended_left_pad_shift (L)
  4. L34
    specialize polynomial_zero_extended_left_pad_shift (t)
  5. L35
    specialize polynomial_zero_extended_left_pad_shift (AB)
  6. L36
    specialize polynomial_zero_extended_left_pad_shift (AC)
  7. L37
    specialize polynomial_zero_extended_left_pad_shift (j)
  8. L38
    specialize polynomial_zero_extended_left_pad_shift (x1)
  9. L39
    apply polynomial_zero_extended_left_pad_shift
  10. L40
    exact hp
12Use earlier factsL41–41

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

  1. L41
    exact ht_witness_witness_witness_right_left
13Separate the logical casesL42–42

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

  1. L42
    split
14Use earlier factsL43–44

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

  1. L43
    exact ht_witness_witness_witness_right_right_left
  2. L44
    exact ht_witness_witness_witness_right_right_right

Library-wide reading audit

Original defined command ledger · 44 lines
  1. 0001intro ab
  2. 0002intro ac
  3. 0003intro L
  4. 0004intro bb
  5. 0005intro bc
  6. 0006intro M
  7. 0007intro AB
  8. 0008intro AC
  9. 0009intro t
  10. 0010intro i
  11. 0011intro j
  12. 0012intro z
  13. 0013intro hp
  14. 0014intro ht
  15. 0015cases ht
  16. 0016cases ht_witness
  17. 0017cases ht_witness_witness
  18. 0018cases ht_witness_witness_witness
  19. 0019cases ht_witness_witness_witness_right
  20. 0020cases ht_witness_witness_witness_right_right
  21. 0021exists x
  22. 0022exists x1
  23. 0023exists x2
  24. 0024split
  25. 0025trans t+(j+x)
  26. 0026apply add_assoc
  27. 0027congr
  28. 0028refl
  29. 0029exact ht_witness_witness_witness_left
  30. 0030split
  31. 0031specialize polynomial_zero_extended_left_pad_shift (ab)
  32. 0032specialize polynomial_zero_extended_left_pad_shift (ac)
  33. 0033specialize polynomial_zero_extended_left_pad_shift (L)
  34. 0034specialize polynomial_zero_extended_left_pad_shift (t)
  35. 0035specialize polynomial_zero_extended_left_pad_shift (AB)
  36. 0036specialize polynomial_zero_extended_left_pad_shift (AC)
  37. 0037specialize polynomial_zero_extended_left_pad_shift (j)
  38. 0038specialize polynomial_zero_extended_left_pad_shift (x1)
  39. 0039apply polynomial_zero_extended_left_pad_shift
  40. 0040exact hp
  41. 0041exact ht_witness_witness_witness_right_left
  42. 0042split
  43. 0043exact ht_witness_witness_witness_right_right_left
  44. 0044exact ht_witness_witness_witness_right_right_right