ND0334

PolynomialLeftPad(b,c,L,t,d,e)

The target has t actual leading zero entries and then copies the L decoded source entries. It has annotated length t+L. This is left padding in highest-degree-first order, not right padding or multiplication by X. Canonical coefficients, a field modulus and formal polynomial equality are not assumptions of this graph.

Conservative notation; not a theorem, primitive, or axiom.

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

Definition in prerequisite notation

(∀ x. Lt(x,t)BetaAt(d,e,x,0)) ∧ (∀ x. ∀ y. Lt(x,L)BetaAt(b,c,x,y)BetaAt(d,e,t + x,y))

Only definitions earlier in this acyclic notation graph are used here.

Hygienic expanded first-order definition
((forall pfp_repeat_index_working_euclidean_definitionzeros. (exists pfa_gap_working_euclidean_definitionzerosindex. pfa_gap_working_euclidean_definitionzerosindex + S (pfp_repeat_index_working_euclidean_definitionzeros) = ((t))) -> (((exists ff_h_pfp_working_euclidean_definitionzerosentry. ff_h_pfp_working_euclidean_definitionzerosentry + S (0) = S ((S (pfp_repeat_index_working_euclidean_definitionzeros)) * (e))) /\ exists ff_q_pfp_working_euclidean_definitionzerosentry. (d) = ff_q_pfp_working_euclidean_definitionzerosentry * S ((S (pfp_repeat_index_working_euclidean_definitionzeros)) * (e)) + (0)))) /\ ((forall pfrep_index_working_euclidean_definition pfrep_value_working_euclidean_definition. (exists pfa_gap_working_euclidean_definitionbound. pfa_gap_working_euclidean_definitionbound + S (pfrep_index_working_euclidean_definition) = ((L))) -> (((exists ff_h_pfp_working_euclidean_definitioninput. ff_h_pfp_working_euclidean_definitioninput + S (pfrep_value_working_euclidean_definition) = S ((S (pfrep_index_working_euclidean_definition)) * (c))) /\ exists ff_q_pfp_working_euclidean_definitioninput. (b) = ff_q_pfp_working_euclidean_definitioninput * S ((S (pfrep_index_working_euclidean_definition)) * (c)) + (pfrep_value_working_euclidean_definition))) -> (((exists ff_h_pfp_working_euclidean_definitionoutput. ff_h_pfp_working_euclidean_definitionoutput + S (pfrep_value_working_euclidean_definition) = S ((S (((t))+pfrep_index_working_euclidean_definition)) * (e))) /\ exists ff_q_pfp_working_euclidean_definitionoutput. (d) = ff_q_pfp_working_euclidean_definitionoutput * S ((S (((t))+pfrep_index_working_euclidean_definition)) * (e)) + (pfrep_value_working_euclidean_definition))))))

The unchanged native kernel never receives this surface symbol. Binder-safe expansion produces only its existing first-order syntax.

Direct definition dependencies

Definitions depending on this notation

none

Checked theorems using this definition

PX0013 · prime_field_polynomial_left_pad_zeroPX0014 · prime_field_polynomial_left_pad_existsPX0015 · prime_field_polynomial_left_pad_entryPX0016 · prime_field_polynomial_left_pad_boundedPX0017 · prime_field_polynomial_left_pad_functionalPX0018 · prime_field_polynomial_zero_suffix_left_padPX0019 · prime_field_polynomial_trim_left_padPX001A · prime_field_polynomial_left_pad_power_coefficientPX001B · prime_field_polynomial_left_pad_equivalentPX001D · prime_field_polynomial_left_pad_transportPX001E · prime_field_polynomial_add_left_pad_transportPX001F · prime_field_polynomial_subtract_left_pad_transportPX0020 · prime_field_polynomial_scale_left_pad_transportPX005B · polynomial_zero_extended_left_pad_shiftPX005C · polynomial_zero_extended_left_pad_beforePX005D · polynomial_left_pad_zero_prefixPX005E · polynomial_left_pad_natural_sum_invariantPX0060 · polynomial_diagonal_term_left_padding_leftPX0061 · polynomial_diagonal_term_left_padding_rightPX0062 · polynomial_diagonal_term_left_padding_zero_leftPX0063 · polynomial_diagonal_term_left_padding_zero_rightPX0064 · polynomial_diagonal_left_padding_leftPX0065 · polynomial_diagonal_left_padding_rightPX0066 · prime_field_convolution_coefficient_left_padding_leftPX0067 · prime_field_convolution_coefficient_left_padding_rightPX0068 · prime_field_convolution_coefficient_before_left_padding_leftPX0069 · prime_field_convolution_coefficient_before_left_padding_rightPX006C · prime_field_polynomial_convolution_left_padding_nonempty_leftPX006D · prime_field_polynomial_convolution_left_padding_nonempty_rightPX006E · prime_field_polynomial_convolution_left_padding_equivalent_leftPX006F · prime_field_polynomial_convolution_left_padding_equivalent_rightPX0070 · prime_field_polynomial_convolution_both_left_paddings_equivalentPX0071 · prime_field_polynomial_convolution_both_left_paddings_existsPX0072 · prime_field_polynomial_equivalent_implies_left_padPX0073 · prime_field_polynomial_add_left_pad_outputPX0074 · prime_field_polynomial_subtract_left_pad_outputPX0075 · prime_field_polynomial_add_equivalent_congruentPX0076 · prime_field_polynomial_subtract_equivalent_congruentPX0077 · prime_field_polynomial_convolution_equivalent_congruent_leftPX0078 · prime_field_polynomial_convolution_equivalent_congruent_right