Explore related knowledge and questions →

Question 876: A Complete Attained Lower Bound Certifies Globality but Not Automatic Uniqueness

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 5

← Question derivation index · Original question batch

P1000-0876 · q-20261015-pulse-20261119-r07-0051

Original question and givens

Use the complete finite feasible carrier=[A, B, C, D] with aligned exact objective values=[1, 2, 3, 4], candidate=A. The declared global lower bound is=1. 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=[1, 2, 3, 4], candidate=A. The declared global lower bound is=1. 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, 1], [B, 2], [C, 3], [D, 4]]

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(1, 1)

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(2, 1)

After

f(B)−L = 1

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(3, 1)

After

f(C)−L = 2

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(4, 1)

After

f(D)−L = 3

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=1

After

f(A)=1=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, 1], [B, 2], [C, 3], [D, 4]], 1, A, 1, 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: 0f7be61e2c22317a4075561dc822c87d881a50db
  • original question SHA-256: 3444a07448c4e312c7d1d8badbaa8bb5bd2a02c3db7abcfe6e13ef092e263f3a
  • candidate record SHA-256: de186e37ee55f5ea98fc844ec705297d76771dcf0d1d5841f7580003eeac27c0
  • semantic review receipt SHA-256: 6c2c6d46aded7582a11ac41a8c0b3bdde2669a53bdb6e796eea2039994a02772
  • question-first witness SHA-256: 77e43898df9efdbf8094ad81fe4ab91cf4b4bd82f481eb9b4699b73cb4da612b
  • Lean: NOT_RUN · human review: NOT_PERFORMED
Same-source full JSON