Explore related knowledge and questions →

Question 11192: A Universal Closed-Interval Convexity Certificate

On this page
  1. Original question and givens
  2. Definition and scope
  3. Step-by-step derivation
  4. Reverse checks
  5. Result
  6. This question review and source binding

Return to catalogue page 56

← Question derivation index · Original question batch

R0021-11192 · q-20261013-advance-20261024-r07-convex-set-0017

Original question and givens

Convexity means every pair of set members and every lambda in [0,1] has lambda*left+(1−lambda)*right in the set. Positive cases use complete algebraic certificates, not sampled lambda values. One exact counterexample suffices to refute convexity; a failed counterexample does not prove convexity. Nonempty closed interval [lower,upper] has lower=-18, upper=19, allowing equality. Give (lower,upper,all x,y in interval and all lambda in [0,1],convex?).

  • G001 — Convexity means every pair of set members and every lambda in [0,1] has lambda*left+(1−lambda)*right in the set. Positive cases use complete algebraic certificates, not sampled lambda values. One exact counterexample suffices to refute convexity; a failed counterexample does not prove convexity. Nonempty closed interval [lower,upper] has lower=-18, upper=19, allowing equality. Give (lower,upper,all x,y in interval and all lambda in [0,1],convex?).

Definition and scope

Use the original question domain, assumptions and cited MKO definitions. This item has second-context mathematical and bilingual review, with the model, answer and every arithmetic step independently recomputed from the original parameters; the source question remains a candidate.

Step-by-step derivation

S001 · implies

Before

interval:closed bounds=[-18,19];arbitrary x,y in these bounds;arbitrary 0<=lambda<=1

After

lambda>=0;1-lambda>=0;x--18>=0;y--18>=0;19-x>=0;19-y>=0

Conditions: none

Choose arbitrary interval members and any permitted lambda.All four endpoint slacks are nonnegative;equal bounds are valid.

Step identifiers and dependencies

Rule: universal_interval_arbitrary_members · Uses: G001

S002 · implies

Before

z=lambda*x+(1-lambda)*y;lambda+(1-lambda)=1;bounds=[-18,19]

After

z--18=lambda*(x--18)+(1-lambda)*(y--18)>=0

Conditions: none

Use the weights'unit sum to expand z minus the lower bound as a sum of nonnegative products.This is not sampling.

Step identifiers and dependencies

Rule: universal_interval_lower_identity · Uses: G001, S001

S003 · implies

Before

z=lambda*x+(1-lambda)*y;lambda+(1-lambda)=1;bounds=[-18,19]

After

19-z=lambda*(19-x)+(1-lambda)*(19-y)>=0

Conditions: none

Likewise the upper bound minus z is nonnegative,so both bounding inequalities hold.

Step identifiers and dependencies

Rule: universal_interval_upper_identity · Uses: G001, S002

S004 · implies

Before

interval:both symbolic slack identities hold for every chosen x,y,lambda

After

all x,y in [-18,19] and all lambda in [0,1] give z in [-18,19]

Conditions: none

No special restriction was added to the arbitrary endpoints or lambda.Discharge their universal quantifiers to obtain convexity of the whole closed interval.

Step identifiers and dependencies

Rule: universal_interval_quantifier_discharge · Uses: G001, S003

Reverse checks

  • S004 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S003 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S002 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S001 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.

Result

(-18, 19, all x,y in interval and all lambda in [0,1], Yes)

The full substitutions and premise checks give the original answer; source identity,format and status are unchanged.

This question review and source binding

Review date: 2026-10-26

Original questions, answers, step expressions, numeric ASTs and historical records are retained. Source candidate labels remain historical and are not overwritten as formal proof.

Source hashes and review receipts
  • input commit: 0f7be61e2c22317a4075561dc822c87d881a50db
  • original question SHA-256: 5fb086d543fe66f3eeae0f1a27e3ae914eec38f9a6cec180c748838a1bfdbdbc
  • candidate record SHA-256: a86eacc7a0f7aceb07be21bb3413499754010fcb7ddfe6d2906cc932a17ca772
  • semantic review receipt SHA-256: 47d23d3735987d68e27733b051bdfa80a3616d44fb223b82bf2e6c8e46d49258
  • question-first witness SHA-256: a857db558000724020d2d5e815cb6bc3e2c9e2933df295bf33eb478d3c695139
  • Lean: NOT_RUN · human review: NOT_PERFORMED
Same-source full JSON