Step-by-step derivation
S001 · implies
Before
source operation=supinf-lower-bound-greatestness;original snapshot and mathematics retained
After
explicit ordered source output fields=[candidate, is_lower_bound, infimum, equals_infimum, 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 dependencies
Rule: source_ordered_interface_explicit_without_javascript · Uses: G001
S002 · implies
Before
ORIGINAL complete ordered nonempty finite real-value list=[11/12, -12/13, 23/14]
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 dependencies
Rule: supinf_complete_nonempty_finite_set_not_samples_or_sorting · Uses: G001, S001
S003 · calculation
Before
supinf original value1 minus previous maximum := sub(-12/13, 11/12)
After
supinf original value1 minus previous maximum = -287/156
Conditions: none
Substitute original roles and established intermediates exactly,retaining indices,set positions,orientation,signs and applicability conditions.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S002
S004 · calculation
Before
supinf original value1 minus previous minimum := sub(-12/13, 11/12)
After
supinf original value1 minus previous minimum = -287/156
Conditions: none
Substitute original roles and established intermediates exactly,retaining indices,set positions,orientation,signs and applicability conditions.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S003
S005 · implies
Before
ORIGINAL next index=1;value=-12/13;previous extremum values=[11/12, 11/12];differences=[-287/156, -287/156]
After
prefix maximum=11/12 attained at original index0;prefix minimum=-12/13 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 dependencies
Rule: supinf_every_value_extremum_prefix_invariant · Uses: G001, S004
S006 · calculation
Before
supinf original value2 minus previous maximum := sub(23/14, 11/12)
After
supinf original value2 minus previous maximum = 61/84
Conditions: none
Substitute original roles and established intermediates exactly,retaining indices,set positions,orientation,signs and applicability conditions.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S005
S007 · calculation
Before
supinf original value2 minus previous minimum := sub(23/14, -12/13)
After
supinf original value2 minus previous minimum = 467/182
Conditions: none
Substitute original roles and established intermediates exactly,retaining indices,set positions,orientation,signs and applicability conditions.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S006
S008 · implies
Before
ORIGINAL next index=2;value=23/14;previous extremum values=[11/12, -12/13];differences=[61/84, 467/182]
After
prefix maximum=23/14 attained at original index2;prefix minimum=-12/13 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 dependencies
Rule: supinf_every_value_extremum_prefix_invariant · Uses: G001, S007
S009 · implies
Before
ALL original values processed;actual maximum witness=[2, 23/14];actual minimum witness=[1, -12/13]
After
EVERY listed value between-12/13 and23/14;ANY upper bound must>=actual maximum in the set;ANY lower bound must<=actual minimum;sup=23/14,inf=-12/13,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 dependencies
Rule: supinf_bounds_and_least_greatest_by_actual_attaining_points · Uses: G001, S008
S010 · calculation
Before
supinf candidate bound test original value0 := sub(11/12, -12/13)
After
supinf candidate bound test original value0 = 287/156
Conditions: none
Substitute original roles and established intermediates exactly,retaining indices,set positions,orientation,signs and applicability conditions.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S009
S011 · calculation
Before
supinf candidate bound test original value1 := sub(-12/13, -12/13)
After
supinf candidate bound test original value1 = 0
Conditions: none
Substitute original roles and established intermediates exactly,retaining indices,set positions,orientation,signs and applicability conditions.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S010
S012 · calculation
Before
supinf candidate bound test original value2 := sub(23/14, -12/13)
After
supinf candidate bound test original value2 = 467/182
Conditions: none
Substitute original roles and established intermediates exactly,retaining indices,set positions,orientation,signs and applicability conditions.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S011
S013 · implies
Before
ORIGINAL candidate=-12/13;lower-bound flags for EVERY original value=[Yes, Yes, Yes];separate actual extremum=-12/13
After
candidate is bound=Yes;candidate equals INF=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 dependencies
Rule: supinf_candidate_bound_and_least_greatest_separate_flags · Uses: G001, S012