Original question and givens
Use the one-variable quadratic f(t)=a*t²+b*t+c with coefficients [a,b,c]=[-1, 8, 3], not ascending-power order. The declared interval [lower,upper]=[-22, 23] belongs to the function data. Give (coefficients,interval,lower<upper?,leading coefficient,rhs-lhs=a*lambda*(1-lambda)*(x-y)^2,qualified convex certificate?). This family requires a nondegenerate interval and a≥0. A No for a singleton or reversed interval means this certificate is unqualified, not that the function on a singleton is nonconvex. A positive convexity certificate must cover all endpoint pairs in the convex domain and every lambda in [0,1]. One Jensen violation can refute convexity, but one successful instance cannot prove it.
G001 — Use the one-variable quadratic f(t)=a*t²+b*t+c with coefficients [a,b,c]=[-1, 8, 3], not ascending-power order. The declared interval [lower,upper]=[-22, 23] belongs to the function data. Give (coefficients,interval,lower<upper?,leading coefficient,rhs-lhs=a*lambda*(1-lambda)*(x-y)^2,qualified convex certificate?). This family requires a nondegenerate interval and a≥0. A No for a singleton or reversed interval means this certificate is unqualified, not that the function on a singleton is nonconvex. A positive convexity certificate must cover all endpoint pairs in the convex domain and every lambda in [0,1]. One Jensen violation can refute convexity, but one successful instance cannot prove it.
Step-by-step derivation
S001 · implies
Before
declared interval record=[-22, 23]
After
ordered_nonempty=Yes;nondegenerate=Yes
Conditions: none
This nonempty-interval protocol uses lower≤upper;the nondegenerate certificate additionally needs lower<upper.A reversed record is unqualified,not a declaration that the abstract empty set is nonconvex.A singleton interval is convex.
Step identifiers and dependencies
Rule: interval_certificate_qualification_not_empty_set_nonconvexity · Uses: G001
S002 · implies
Before
arbitrary x,y in [-22,23];0<=lambda<=1;z=lambda*x+(1-lambda)*y
After
z--22=lambda*(x--22)+(1-lambda)*(y--22)>=0;23-z=lambda*(23-x)+(1-lambda)*(23-y)>=0
Conditions: none
Both slacks are nonnegative sums,hence lower≤z≤upper for every endpoint pair and every permitted lambda.No sampling is used;endpoints and singleton cases are included.
Step identifiers and dependencies
Rule: interval_all_segments_slack_identity · Uses: G001, S001
S003 · implies
Before
univariate quadratic coefficients=[-1, 8, 3];order=[a,b,c]
After
f(t)=(-1)*t^2+(8)*t+(3)
Conditions: none
These are quadratic,linear,constant coefficients in descending order,not the constant-first boundary-polynomial order.Retain zero leading coefficients.
Step identifiers and dependencies
Rule: quadratic_descending_coefficient_order · Uses: G001, S002
S004 · implies
Before
f(t)=(-1)*t^2+(8)*t+(3);z=lambda*x+(1-lambda)*y
After
rhs-lhs=(-1)*(lambda*x^2+(1-lambda)*y^2-(lambda*x+(1-lambda)*y)^2)
Conditions: none
Expand both Jensen sides.The unit weight sum cancels the linear and constant terms exactly,leaving only the quadratic part.
Step identifiers and dependencies
Rule: jensen_linear_and_constant_terms_cancel · Uses: G001, S003
S005 · implies
Before
lambda*x^2+(1-lambda)*y^2-(lambda*x+(1-lambda)*y)^2
After
lambda*(1-lambda)*(x-y)^2;full gap=(-1)*lambda*(1-lambda)*(x-y)^2
Conditions: none
Expand the square and collect x²,xy,y².The coefficients are lambda(1−lambda),−2lambda(1−lambda),lambda(1−lambda),yielding the(x−y)^2 factor for all real endpoints.
Step identifiers and dependencies
Rule: jensen_gap_full_symbolic_factorization · Uses: G001, S004
S006 · calculation
Before
negative quadratic endpoint difference := sub(-22, 23)
After
negative quadratic endpoint difference = -45
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
negative quadratic endpoint square := mul(-45, -45)
After
negative quadratic endpoint square = 2025
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 · calculation
Before
negative quadratic weighted square := mul(-1, 2025)
After
negative quadratic weighted square = -2025
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, S007
S009 · calculation
Before
negative quadratic midpoint Jensen gap := div(-2025, 4)
After
negative quadratic midpoint Jensen gap = -2025/4
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 · implies
Before
x=-22;y=23;lambda=1/2;gap=-2025/4
After
negative Jensen gap refutes convexity on this nondegenerate interval
Conditions: none
A nondegenerate interval supplies distinct endpoints.The midpoint weight gives a strictly negative gap:an exact counterexample,not just a coefficient mnemonic.
Step identifiers and dependencies
Rule: negative_leading_coefficient_actual_counterexample · Uses: G001, S009
S011 · implies
Before
interval=[-22, 23];nondegenerate=Yes;leading=-1
After
qualified universal quadratic certificate=No
Conditions: none
If a≥0,the nonnegative weight product and square make every Jensen gap nonnegative.This certificate separately requires a nondegenerate interval.No for a singleton or reversed record does not classify a singleton function as nonconvex.
Step identifiers and dependencies
Rule: quadratic_global_sign_and_nondegenerate_guard · Uses: G001, S010
Result
([-1, 8, 3], [-22, 23], Yes, -1, rhs-lhs=a*lambda*(1-lambda)*(x-y)^2, No)
The full substitutions and premise checks give the original answer; source identity,format and status are unchanged.