# Question 20587: An Upper Bound Still Needs Leastness to Be the Supremum [Return to catalogue page 103](https://ocme.evemisslab.com/en/questions/page/103/) [← Question derivation index](https://ocme.evemisslab.com/en/questions/) · [Original question batch](https://ocme.evemisslab.com/en/practice/batch-20261014-advance-20261107-r02-supremum-and-infimum-foundations/#q-20261014-advance-20261107-r02-supremum-and-infimum-0037) 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. R0040-20587 · q-20261014-advance-20261107-r02-supremum-and-infimum-0037 ## Original question and givens The ordered rational values=[12/13, -13/14, 25/15] denote a complete nonempty finite real set. Duplicate listed values do not change its bounds; retain supplied order in the output. Empty, unbounded and extended-real sets are outside this slice. Candidate=5/3. Give (candidate, is_upper_bound, supremum, equals_supremum, boundary). - G001 — The ordered rational values=[12/13, -13/14, 25/15] denote a complete nonempty finite real set. Duplicate listed values do not change its bounds; retain supplied order in the output. Empty, unbounded and extended-real sets are outside this slice. Candidate=5/3. Give (candidate, is_upper_bound, supremum, equals_supremum, boundary). ## 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. - [mko-supremum-and-infimum](https://ocme.evemisslab.com/en/mko/mko-supremum-and-infimum/) ## Step-by-step derivation S001 · impliesBefore source operation=supinf-upper-bound-leastness;original snapshot and mathematics retained After explicit ordered source output fields=[candidate, is_upper_bound, supremum, equals_supremum, boundary] Conditions: none Keep the historical interface marker in the original snapshot while listing source fields here without JavaScript or external lookup.Labels are not mathematical evidence,and No retains its source claim scope. Step identifiers and dependenciesRule: source_ordered_interface_explicit_without_javascript · Uses: G001 S002 · impliesBefore ORIGINAL complete ordered nonempty finite real-value list=[12/13, -13/14, 5/3] After initialize upper/lower extremum candidates at ORIGINAL first value;duplicates retained and do not change set bounds Conditions: none This is the supplied complete finite set list,not a sample of an unspecified set.Duplicates do not alter bounds but remain in original output order;do not sort the data first. Step identifiers and dependenciesRule: supinf_complete_nonempty_finite_set_not_samples_or_sorting · Uses: G001, S001 S003 · calculationBefore supinf original value1 minus previous maximum := sub(-13/14, 12/13) After supinf original value1 minus previous maximum = -337/182 Conditions: none Substitute original roles and established intermediates exactly,retaining indices,set positions,orientation,signs and applicability conditions. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S002 S004 · calculationBefore supinf original value1 minus previous minimum := sub(-13/14, 12/13) After supinf original value1 minus previous minimum = -337/182 Conditions: none Substitute original roles and established intermediates exactly,retaining indices,set positions,orientation,signs and applicability conditions. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S003 S005 · impliesBefore ORIGINAL next index=1;value=-13/14;previous extremum values=[12/13, 12/13];differences=[-337/182, -337/182] After prefix maximum=12/13 attained at original index0;prefix minimum=-13/14 attained at original index1 Conditions: none Compare every original value,preserving prefix maximum/minimum invariants and updating witnesses only for strict improvement.No original value is omitted. Step identifiers and dependenciesRule: supinf_every_value_extremum_prefix_invariant · Uses: G001, S004 S006 · calculationBefore supinf original value2 minus previous maximum := sub(5/3, 12/13) After supinf original value2 minus previous maximum = 29/39 Conditions: none Substitute original roles and established intermediates exactly,retaining indices,set positions,orientation,signs and applicability conditions. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S005 S007 · calculationBefore supinf original value2 minus previous minimum := sub(5/3, -13/14) After supinf original value2 minus previous minimum = 109/42 Conditions: none Substitute original roles and established intermediates exactly,retaining indices,set positions,orientation,signs and applicability conditions. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S006 S008 · impliesBefore ORIGINAL next index=2;value=5/3;previous extremum values=[12/13, -13/14];differences=[29/39, 109/42] After prefix maximum=5/3 attained at original index2;prefix minimum=-13/14 attained at original index1 Conditions: none Compare every original value,preserving prefix maximum/minimum invariants and updating witnesses only for strict improvement.No original value is omitted. Step identifiers and dependenciesRule: supinf_every_value_extremum_prefix_invariant · Uses: G001, S007 S009 · impliesBefore ALL original values processed;actual maximum witness=[2, 5/3];actual minimum witness=[1, -13/14] After EVERY listed value between-13/14 and5/3;ANY upper bound must>=actual maximum in the set;ANY lower bound must<=actual minimum;sup=5/3,inf=-13/14,BOTH attained Conditions: none Because the maximum is itself in the set,no upper bound can be smaller;the minimum similarly bounds every lower bound above.This proves both bounding and leastness/greatestness.Attainment uses finiteness and nonemptiness and is not inferred for arbitrary bounded sets. Step identifiers and dependenciesRule: supinf_bounds_and_least_greatest_by_actual_attaining_points · Uses: G001, S008 S010 · calculationBefore supinf candidate bound test original value0 := sub(5/3, 12/13) After supinf candidate bound test original value0 = 29/39 Conditions: none Substitute original roles and established intermediates exactly,retaining indices,set positions,orientation,signs and applicability conditions. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S009 S011 · calculationBefore supinf candidate bound test original value1 := sub(5/3, -13/14) After supinf candidate bound test original value1 = 109/42 Conditions: none Substitute original roles and established intermediates exactly,retaining indices,set positions,orientation,signs and applicability conditions. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S010 S012 · calculationBefore supinf candidate bound test original value2 := sub(5/3, 5/3) After supinf candidate bound test original value2 = 0 Conditions: none Substitute original roles and established intermediates exactly,retaining indices,set positions,orientation,signs and applicability conditions. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S011 S013 · impliesBefore ORIGINAL candidate=5/3;upper-bound flags for EVERY original value=[Yes, Yes, Yes];separate actual extremum=5/3 After candidate is bound=Yes;candidate equals SUP=Yes;a loose bound and a failed candidate are not the extremum Conditions: none Audit the candidate against every value.Equality with the established sup/inf gives the tight bound.A failed candidate does not make the set unbounded,and a loose passing bound is not the least upper/greatest lower bound. Step identifiers and dependenciesRule: supinf_candidate_bound_and_least_greatest_separate_flags · Uses: G001, S012 ## Reverse checks - S013 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S012 · premise_and_result_audit — Recompute supinf candidate bound test original value2 with exact rational arithmetic, not rounded decimals. - S011 · premise_and_result_audit — Recompute supinf candidate bound test original value1 with exact rational arithmetic, not rounded decimals. - S010 · premise_and_result_audit — Recompute supinf candidate bound test original value0 with exact rational arithmetic, not rounded decimals. - S009 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S008 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S007 · premise_and_result_audit — Recompute supinf original value2 minus previous minimum with exact rational arithmetic, not rounded decimals. - S006 · premise_and_result_audit — Recompute supinf original value2 minus previous maximum with exact rational arithmetic, not rounded decimals. - S005 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S004 · premise_and_result_audit — Recompute supinf original value1 minus previous minimum with exact rational arithmetic, not rounded decimals. - S003 · premise_and_result_audit — Recompute supinf original value1 minus previous maximum with exact rational arithmetic, not rounded decimals. - 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 (5/3, Yes, 5/3, Yes, upper_bound_and_leastness_are_separate) 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: fd452327e8e89bbc8420f26affcdc20efa7125ac0f17ea919129b53cf4d53256 - candidate record SHA-256: d59d5ed7cbc3a272bec708a86df70812855694b30d1b28d3b8d2ea8a17ee28a9 - semantic review receipt SHA-256: c6483ed1229af9183fe5c704a2627b1558ad9a31bfbb0d2ee2d5c1a1c299ab4d - question-first witness SHA-256: e81f9a560d630fcb23441146f008c4feca7aceab3ebe4de2cf1997c061375ef7 - Lean: NOT_RUN · human review: NOT_PERFORMED [Same-source full JSON](https://ocme.evemisslab.com/data/question-derivations/questions/q-20261014-advance-20261107-r02-supremum-and-infimum-0037.json)