Original question and givens
Use the quadratic candidate coefficients=[11, 1, -1, 4, 1, 1] in fixed order [1,x,y,x²,x*y,y²]. Rectangle bounds [x_min,x_max,y_min,y_max]=[-25, 25, -24, 26]. Left/right fix x, leaving y; bottom/top fix y, leaving x. Boundary polynomials use ascending coefficients [constant,linear,quadratic]. Compare every coefficient for an edge identity, not a few sampled boundary values. Selected edge=top; supplied coefficients=[661, 27, 4]. Give (bounds,edge,remaining variable,restriction coefficients,supplied coefficients,coefficientwise identity?,declared_edge_only). Interior PDE and boundary data are separate obligations. Symbolic success covers only this candidate and declared BVP, not a general existence, uniqueness, stability, regularity or well-posedness theorem.
G001 — Use the quadratic candidate coefficients=[11, 1, -1, 4, 1, 1] in fixed order [1,x,y,x²,x*y,y²]. Rectangle bounds [x_min,x_max,y_min,y_max]=[-25, 25, -24, 26]. Left/right fix x, leaving y; bottom/top fix y, leaving x. Boundary polynomials use ascending coefficients [constant,linear,quadratic]. Compare every coefficient for an edge identity, not a few sampled boundary values. Selected edge=top; supplied coefficients=[661, 27, 4]. Give (bounds,edge,remaining variable,restriction coefficients,supplied coefficients,coefficientwise identity?,declared_edge_only). Interior PDE and boundary data are separate obligations. Symbolic success covers only this candidate and declared BVP, not a general existence, uniqueness, stability, regularity or well-posedness theorem.
Step-by-step derivation
S001 · implies
Before
original coefficients=[11, 1, -1, 4, 1, 1];basis=[1,x,y,x^2,xy,y^2]
After
u(x,y)=(11)+(1)*x+(-1)*y+(4)*x^2+(1)*x*y+(1)*y^2
Conditions: none
Read the six coefficients in their fixed monomial order,not the descending[a,b,c] order of a univariate quadratic.
Step identifiers and dependencies
Rule: bivariate_scalar_polynomial_basis_roles · Uses: G001
S002 · calculation
Before
selected boundary fixed coordinate squared := mul(26, 26)
After
selected boundary fixed coordinate squared = 676
Conditions: none
Compute exactly from this step's original roles and established intermediates,retaining signs,denominators and coefficient order.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S001
S003 · calculation
Before
selected boundary fixed linear term := mul(-1, 26)
After
selected boundary fixed linear term = -26
Conditions: none
Compute exactly from this step's original roles and established intermediates,retaining signs,denominators and coefficient order.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S002
S004 · calculation
Before
selected boundary fixed square term := mul(1, 676)
After
selected boundary fixed square term = 676
Conditions: none
Compute exactly from this step's original roles and established intermediates,retaining signs,denominators and coefficient order.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S003
S005 · calculation
Before
selected boundary constant coefficient := sum(11, -26, 676)
After
selected boundary constant coefficient = 661
Conditions: none
Compute exactly from this step's original roles and established intermediates,retaining signs,denominators and coefficient order.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S004
S006 · calculation
Before
selected boundary cross contribution := mul(1, 26)
After
selected boundary cross contribution = 26
Conditions: none
Compute exactly from this step's original roles and established intermediates,retaining signs,denominators and coefficient order.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S005
S007 · calculation
Before
selected boundary linear coefficient := sum(1, 26)
After
selected boundary linear coefficient = 27
Conditions: none
Compute exactly from this step's original roles and established intermediates,retaining signs,denominators and coefficient order.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S006
S008 · implies
Before
selected boundary:vary x;fix y=26;original coefficients=[11, 1, -1, 4, 1, 1]
After
ascending x slice coefficients=[661, 27, 4]
Conditions: none
Substitute the fixed other coordinate first,collecting constant,linear and quadratic terms separately.The two coordinates do not vary together.
Step identifiers and dependencies
Rule: fixed_other_coordinate_before_derivative · Uses: G001, S007
S009 · calculation
Before
selected boundary coefficient residual0 := sub(661, 661)
After
selected boundary coefficient residual0 = 0
Conditions: none
Compute exactly from this step's original roles and established intermediates,retaining signs,denominators and coefficient order.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S008
S010 · calculation
Before
selected boundary coefficient residual1 := sub(27, 27)
After
selected boundary coefficient residual1 = 0
Conditions: none
Compute exactly from this step's original roles and established intermediates,retaining signs,denominators and coefficient order.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S009
S011 · calculation
Before
selected boundary coefficient residual2 := sub(4, 4)
After
selected boundary coefficient residual2 = 0
Conditions: none
Compute exactly from this step's original roles and established intermediates,retaining signs,denominators and coefficient order.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S010
S012 · implies
Before
selected boundary:edge=top;bounds=[-25, 25, -24, 26];remaining variable=x;restriction=[661, 27, 4];supplied=[661, 27, 4]
After
all coefficient residuals=[0, 0, 0];polynomial identity=Yes
Conditions: none
Compare all three coefficients of the restriction polynomial,not sampled boundary values.This protocol audits a polynomial identity.If an edge collapses to a point,a coefficient mismatch rejects this stronger certificate but does not by itself refute equality at that single point.
Step identifiers and dependencies
Rule: whole_edge_polynomial_coefficient_certificate · Uses: G001, S011
Result
([-25, 25, -24, 26], top, x, [661, 27, 4], [661, 27, 4], Yes, declared_edge_only)
The full substitutions and premise checks give the original answer; source identity,format and status are unchanged.