ND0336

PolynomialEquivalent(b,c,L,d,e,M)

At every natural power, every actual decoded coefficient of the two length-annotated polynomials agrees. Different representation lengths and beta encodings are allowed. This does not identify polynomials merely because their evaluations agree over a finite field; coefficient existence and equivalence laws are separate theorems.

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

∀ pfrep_power_working_euclidean_definition. ∀ pfrep_left_working_euclidean_definition. ∀ pfrep_right_working_euclidean_definition. PolynomialPowerCoefficient(b,c,L,pfrep_power_working_euclidean_definition,pfrep_left_working_euclidean_definition)PolynomialPowerCoefficient(d,e,M,pfrep_power_working_euclidean_definition,pfrep_right_working_euclidean_definition) → pfrep_left_working_euclidean_definition = pfrep_right_working_euclidean_definition

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

Hygienic expanded first-order definition
forall pfrep_power_working_euclidean_definition pfrep_left_working_euclidean_definition pfrep_right_working_euclidean_definition. ((exists pfrep_position_working_euclidean_definitionfirst. ((pfrep_position_working_euclidean_definitionfirst+S (pfrep_power_working_euclidean_definition)=((L))) /\ ((((exists ff_h_pfp_working_euclidean_definitionfirstentry. ff_h_pfp_working_euclidean_definitionfirstentry + S (pfrep_left_working_euclidean_definition) = S ((S (pfrep_position_working_euclidean_definitionfirst)) * (c))) /\ exists ff_q_pfp_working_euclidean_definitionfirstentry. (b) = ff_q_pfp_working_euclidean_definitionfirstentry * S ((S (pfrep_position_working_euclidean_definitionfirst)) * (c)) + (pfrep_left_working_euclidean_definition)))))) \/ (((exists pfrep_gap_working_euclidean_definitionfirstoutside. pfrep_gap_working_euclidean_definitionfirstoutside+((L))=(pfrep_power_working_euclidean_definition)) /\ (((pfrep_left_working_euclidean_definition)=0))))) -> ((exists pfrep_position_working_euclidean_definitionsecond. ((pfrep_position_working_euclidean_definitionsecond+S (pfrep_power_working_euclidean_definition)=((M))) /\ ((((exists ff_h_pfp_working_euclidean_definitionsecondentry. ff_h_pfp_working_euclidean_definitionsecondentry + S (pfrep_right_working_euclidean_definition) = S ((S (pfrep_position_working_euclidean_definitionsecond)) * (e))) /\ exists ff_q_pfp_working_euclidean_definitionsecondentry. (d) = ff_q_pfp_working_euclidean_definitionsecondentry * S ((S (pfrep_position_working_euclidean_definitionsecond)) * (e)) + (pfrep_right_working_euclidean_definition)))))) \/ (((exists pfrep_gap_working_euclidean_definitionsecondoutside. pfrep_gap_working_euclidean_definitionsecondoutside+((M))=(pfrep_power_working_euclidean_definition)) /\ (((pfrep_right_working_euclidean_definition)=0))))) -> pfrep_left_working_euclidean_definition=pfrep_right_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

Checked theorems using this definition

PG000C · prime_field_polynomial_convolution_shift_right_equivalentPG000D · prime_field_polynomial_convolution_shift_right_existsPG001E · prime_field_polynomial_convolution_right_append_equivalentPG001F · prime_field_polynomial_convolution_right_append_existsPG0020 · prime_field_polynomial_shift_equivalent_congruentPG0021 · prime_field_polynomial_convolution_shift_scale_aligned_equivalentPG0022 · prime_field_polynomial_shift_scale_aligned_congruentPG0023 · prime_field_polynomial_convolution_associativity_append_stepPG0024 · prime_field_polynomial_nested_empty_right_equivalentPG0025 · prime_field_polynomial_convolution_associative_equivalentPG0026 · prime_field_polynomial_right_divides_from_productPG0029 · prime_field_polynomial_right_divides_equivalent_targetPG002B · prime_field_polynomial_right_divides_equivalent_divisorPG002C · prime_field_polynomial_right_divides_transitivePG0032 · prime_field_polynomial_convolution_left_unit_equivalentPG0033 · prime_field_polynomial_convolution_left_unit_existsPG0034 · prime_field_polynomial_right_divides_reflexivePG0035 · prime_field_polynomial_bounded_representative_at_length_existsPG0037 · prime_field_polynomial_common_representatives_transportPG0038 · prime_field_polynomial_common_representatives_at_length_existsPG003A · prime_field_polynomial_common_representatives_functionalPG003C · prime_field_polynomial_aligned_add_from_commonPG003F · prime_field_polynomial_aligned_add_transportPG0041 · prime_field_polynomial_aligned_add_functionalPG0043 · prime_field_polynomial_aligned_add_realizePG0046 · prime_field_polynomial_aligned_add_cancel_leftPG0047 · prime_field_polynomial_aligned_add_associativePG0048 · prime_field_polynomial_aligned_subtract_functionalPG0049 · prime_field_polynomial_add_trim_alignedPG0057 · prime_field_polynomial_normalized_right_associate_existsPG0058 · prime_field_polynomial_right_divides_aligned_addPG0059 · prime_field_polynomial_right_divides_aligned_subtractPG005D · prime_field_polynomial_euclidean_backward_coefficient_identityPG0062 · prime_field_polynomial_bezout_equivalent_transportPG0065 · prime_field_polynomial_reduced_representative_existsPG0067 · prime_field_polynomial_gcd_bezout_equivalent_secondPG0069 · prime_field_polynomial_gcd_bezout_exists_up_toPG006D · prime_field_polynomial_nonzero_leading_equivalent_length_boundPG006E · prime_field_polynomial_equivalent_represented_degrees_equalPG006F · prime_field_polynomial_product_equivalent_nonzero_left_nonemptyPG0070 · prime_field_polynomial_right_divides_represented_factorizationPG0071 · prime_field_polynomial_right_divides_represented_degree_boundPG0072 · prime_field_polynomial_monic_singleton_multiple_equivalentPG0073 · prime_field_polynomial_monic_equal_degree_right_divides_equivalentPG0074 · prime_field_polynomial_monic_right_associates_equivalentPG0075 · prime_field_polynomial_empty_right_divisor_implies_equivalent_zeroPG0076 · prime_field_polynomial_normal_right_associates_equivalentPG0077 · prime_field_polynomial_normalized_gcd_equivalent_unique