Explore related knowledge and questions →
Question 891: A Complete Attained Lower Bound Certifies Globality but Not Automatic Uniqueness On this page Original question and givens Definition and scope Step-by-step derivation Reverse checks Result This question review and source binding Return to catalogue page 5
← Question derivation index · Original question batch
This teaching derivation has second-context AI mathematical and bilingual semantic review, limited to the model and assumptions stated in this question. It has no human review or new Lean proof and does not promote the original question or MKO to Canonical truth.
P1000-0891 · q-20261015-pulse-20261119-r07-0066
Original question and givens Use the complete finite feasible carrier=[A, B, C, D] with aligned exact objective values=[16, 32, 48, 64], candidate=A. The declared global lower bound is=16. Give (complete_objective_table, lower_bound, candidate, candidate_value, all_values_above_bound, bound_attained, global_optimum, unique, all_global_minimizers, certificate_scope).
G001 — Use the complete finite feasible carrier=[A, B, C, D] with aligned exact objective values=[16, 32, 48, 64], candidate=A. The declared global lower bound is=16. Give (complete_objective_table, lower_bound, candidate, candidate_value, all_values_above_bound, bound_attained, global_optimum, unique, all_global_minimizers, certificate_scope).Definition and scope A complete lower bound attained at the candidate proves global minimality; uniqueness is decided separately by the attaining set.
Step-by-step derivation S001 · implies Before
complete feasible domain After
[[A, 16], [B, 32], [C, 48], [D, 64]] Conditions: none
Fix the complete table and minimization direction; sampling a few points is not a global certificate.
Step identifiers and dependencies Rule: complete_objective_data · Uses: G001
S002 · calculation Before
f(A)−L := sub(16, 16) After
f(A)−L = 0 Conditions: none
Check pointwise that this bounds the entire feasible domain below.
Step identifiers and dependencies Rule: exact_rational_arithmetic · Uses: G001, S001
S003 · calculation Before
f(B)−L := sub(32, 16) After
f(B)−L = 16 Conditions: none
Check pointwise that this bounds the entire feasible domain below.
Step identifiers and dependencies Rule: exact_rational_arithmetic · Uses: G001, S002
S004 · calculation Before
f(C)−L := sub(48, 16) After
f(C)−L = 32 Conditions: none
Check pointwise that this bounds the entire feasible domain below.
Step identifiers and dependencies Rule: exact_rational_arithmetic · Uses: G001, S003
S005 · calculation Before
f(D)−L := sub(64, 16) After
f(D)−L = 48 Conditions: none
Check pointwise that this bounds the entire feasible domain below.
Step identifiers and dependencies Rule: exact_rational_arithmetic · Uses: G001, S004
S006 · implies Before
all f(x)≥L=16 After
f(A)=16=L; attained=Yes Conditions: none
A lower bound alone does not guarantee attainment; verify the designated candidate's value separately.
Step identifiers and dependencies Rule: lower_bound_attainment · Uses: G001, S005
S007 · implies Before
all attaining points=[A] After
global=true; unique=Yes Conditions: none
A complete lower bound plus attainment certifies global minimality; uniqueness separately depends on the complete attaining set.
Step identifiers and dependencies Rule: global_certificate_and_uniqueness · Uses: G001, S006
Reverse checks S007 · premise_and_result_audit — Completeness, neighborhoods, attainment and uniqueness are separate obligations; local data do not license a global conclusion.S006 · premise_and_result_audit — Completeness, neighborhoods, attainment and uniqueness are separate obligations; local data do not license a global conclusion.S005 · premise_and_result_audit — Recompute f(D)−L with exact rational arithmetic, not rounded decimals.S004 · premise_and_result_audit — Recompute f(C)−L with exact rational arithmetic, not rounded decimals.S003 · premise_and_result_audit — Recompute f(B)−L with exact rational arithmetic, not rounded decimals.S002 · premise_and_result_audit — Recompute f(A)−L with exact rational arithmetic, not rounded decimals.S001 · premise_and_result_audit — Completeness, neighborhoods, attainment and uniqueness are separate obligations; local data do not license a global conclusion.Result ([[A, 16], [B, 32], [C, 48], [D, 64]], 16, A, 16, Yes, Yes, Yes, Yes, [A], complete_lower_bound_plus_attainment_certifies_global_but_not_automatic_uniqueness) The full substitutions and premise audits recover the original answer, retaining its field order and verdict meanings.
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: 0f7be61e2c22317a4075561dc822c87d881a50dboriginal question SHA-256: 00daad7a3af73240b0c666088e86d275086379929a3e95a109e3ad2fa73474bdcandidate record SHA-256: 214756d2bccc09d13b75ff074f82b96bdf30b0179dce48b84e53348477bbdcf6semantic review receipt SHA-256: 6c2c6d46aded7582a11ac41a8c0b3bdde2669a53bdb6e796eea2039994a02772question-first witness SHA-256: 77e43898df9efdbf8094ad81fe4ab91cf4b4bd82f481eb9b4699b73cb4da612bLean: NOT_RUN · human review: NOT_PERFORMEDSame-source full JSON