Explore related knowledge and questions →

Question 13927: A Usable Uniform Bound May Be Nonoptimal

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 70

← Question derivation index · Original question batch

R0026-13927 · q-20261014-advance-20261028-r05-bounded-linear-operator-0077

Original question and givens

Use the explicit rectangular integer matrix A=[[-11, -2, -2], [-1, 11, -1]] as a linear map between its column- and row-coordinate real spaces. Both ends use the same stated l1 or linfinity norm. A single C≥0 must bound every input: norm(A*x)≤C*norm(x). The exact l1 induced norm is the maximum absolute column sum; the exact linfinity induced norm is the maximum absolute row sum. An instance pass or a nonoptimal usable bound is not the exact operator norm. norm_name=linfinity, proposed C=16. Give (norm_name,exact_operator_norm,C,uniform_bound?,optimal?,boundary). A sufficient C yields uniform_bound_certificate; a smaller C yields bound_too_small.

  • G001 — Use the explicit rectangular integer matrix A=[[-11, -2, -2], [-1, 11, -1]] as a linear map between its column- and row-coordinate real spaces. Both ends use the same stated l1 or linfinity norm. A single C≥0 must bound every input: norm(A*x)≤C*norm(x). The exact l1 induced norm is the maximum absolute column sum; the exact linfinity induced norm is the maximum absolute row sum. An instance pass or a nonoptimal usable bound is not the exact operator norm. norm_name=linfinity, proposed C=16. Give (norm_name,exact_operator_norm,C,uniform_bound?,optimal?,boundary). A sufficient C yields uniform_bound_certificate; a smaller C yields bound_too_small.

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

original row index=0;ordered entries=[-11, -2, -2]

After

absolute entries=[11, 2, 2]

Conditions: none

For l1 sum down each column;for linfinity sum across each row.Preserve axis order and do not transpose rectangular roles.

Step identifiers and dependencies

Rule: operator_correct_axis_absolute_sum · Uses: G001

S002 · calculation

Before

operator row0 absolute sum := sum(11, 2, 2)

After

operator row0 absolute sum = 15

Conditions: none

Compute exactly from original roles and established intermediates,retaining coordinates,coefficients,signs and necessary guards.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S001

S003 · implies

Before

original row index=1;ordered entries=[-1, 11, -1]

After

absolute entries=[1, 11, 1]

Conditions: none

For l1 sum down each column;for linfinity sum across each row.Preserve axis order and do not transpose rectangular roles.

Step identifiers and dependencies

Rule: operator_correct_axis_absolute_sum · Uses: G001, S002

S004 · calculation

Before

operator row1 absolute sum := sum(1, 11, 1)

After

operator row1 absolute sum = 13

Conditions: none

Compute exactly from original roles and established intermediates,retaining coordinates,coefficients,signs and necessary guards.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S003

S005 · implies

Before

all absolute row sums=[15, 13]

After

maximum=15;first maximizing row=0

Conditions: none

Compute every required axis sum before taking a maximum.The value must have both a universal upper bound and an attaining unit input.

Step identifiers and dependencies

Rule: operator_maximum_axis_sum · Uses: G001, S004

S006 · implies

Before

arbitrary x in R^3;all row sums<=15

After

each abs((Ax)i)<=sum_j abs(Aij)*normInfinity(x)<=15*normInfinity(x);take maximum_i

Conditions: none

Each input coordinate is bounded by its maximum norm.Bound each row and then maximize over outputs to obtain a universal uniform bound.

Step identifiers and dependencies

Rule: operator_linfinity_universal_row_bound · Uses: G001, S005

S007 · implies

Before

attaining unit input image:matrix=[[-11, -2, -2], [-1, 11, -1]];input=[-1, -1, -1]

After

input dimension=3;output dimension=2;rows dot input

Conditions: none

Retain column-input/row-output roles for rectangular matrices.Computed values can exceed raw input bounds and are not clipped.

Step identifiers and dependencies

Rule: matrix_row_column_roles · Uses: G001, S006

S008 · calculation

Before

attaining unit input image row0 column0 product := mul(-11, -1)

After

attaining unit input image row0 column0 product = 11

Conditions: none

Compute exactly from original roles and established intermediates,retaining coordinates,coefficients,signs and necessary guards.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S007

S009 · calculation

Before

attaining unit input image row0 column1 product := mul(-2, -1)

After

attaining unit input image row0 column1 product = 2

Conditions: none

Compute exactly from original roles and established intermediates,retaining coordinates,coefficients,signs and necessary guards.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S008

S010 · calculation

Before

attaining unit input image row0 column2 product := mul(-2, -1)

After

attaining unit input image row0 column2 product = 2

Conditions: none

Compute exactly from original roles and established intermediates,retaining coordinates,coefficients,signs and necessary guards.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S009

S011 · calculation

Before

attaining unit input image row0 sum := sum(11, 2, 2)

After

attaining unit input image row0 sum = 15

Conditions: none

Compute exactly from original roles and established intermediates,retaining coordinates,coefficients,signs and necessary guards.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S010

S012 · calculation

Before

attaining unit input image row1 column0 product := mul(-1, -1)

After

attaining unit input image row1 column0 product = 1

Conditions: none

Compute exactly from original roles and established intermediates,retaining coordinates,coefficients,signs and necessary guards.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S011

S013 · calculation

Before

attaining unit input image row1 column1 product := mul(11, -1)

After

attaining unit input image row1 column1 product = -11

Conditions: none

Compute exactly from original roles and established intermediates,retaining coordinates,coefficients,signs and necessary guards.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S012

S014 · calculation

Before

attaining unit input image row1 column2 product := mul(-1, -1)

After

attaining unit input image row1 column2 product = 1

Conditions: none

Compute exactly from original roles and established intermediates,retaining coordinates,coefficients,signs and necessary guards.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S013

S015 · calculation

Before

attaining unit input image row1 sum := sum(1, -11, 1)

After

attaining unit input image row1 sum = -9

Conditions: none

Compute exactly from original roles and established intermediates,retaining coordinates,coefficients,signs and necessary guards.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S014

S016 · implies

Before

attaining input:signed vector=[-1, -1, -1];norm=linfinity

After

coordinate absolute values=[1, 1, 1]

Conditions: none

Take absolute values of whole coordinates without changing their pairing.This also accepts computed matrix images without clipping to raw input bounds.

Step identifiers and dependencies

Rule: operator_named_norm_original_signs · Uses: G001, S015

S017 · implies

Before

attaining input:all absolute coordinates=[1, 1, 1]

After

maximum=1;first attaining coordinate=0

Conditions: none

The finite nonempty maximum must bound every value and be attained,not be the largest signed coordinate.

Step identifiers and dependencies

Rule: operator_linfinity_full_maximum · Uses: G001, S016

S018 · implies

Before

attaining output:signed vector=[15, -9];norm=linfinity

After

coordinate absolute values=[15, 9]

Conditions: none

Take absolute values of whole coordinates without changing their pairing.This also accepts computed matrix images without clipping to raw input bounds.

Step identifiers and dependencies

Rule: operator_named_norm_original_signs · Uses: G001, S017

S019 · implies

Before

attaining output:all absolute coordinates=[15, 9]

After

maximum=15;first attaining coordinate=0

Conditions: none

The finite nonempty maximum must bound every value and be attained,not be the largest signed coordinate.

Step identifiers and dependencies

Rule: operator_linfinity_full_maximum · Uses: G001, S018

S020 · implies

Before

explicit input=[-1, -1, -1];input norm=1;image=[15, -9];output norm=15

After

uniform upper bound=15 and attained ratio=15;exact induced norm=15

Conditions: none

For l1 take the maximizing column's basis vector;for linfinity take signs of a maximizing row.For a zero matrix still choose a nonzero unit vector.The universal bound L and an attained unit ratio L exclude every smaller constant,establishing the exact norm.

Step identifiers and dependencies

Rule: operator_attainment_proves_least_uniform_constant · Uses: G001, S019

S021 · implies

Before

exact induced norm=15;proposed nonnegative C=16;attaining unit input=[-1, -1, -1]

After

uniform bound=Yes;optimal bound=No

Conditions: none

For C≥L,nonnegativity of the input norm permits relaxing the universal bound to C.For C<L,the attaining unit input is a counterexample.Only equality is optimal;a usable larger C is not the exact norm.

Step identifiers and dependencies

Rule: operator_usable_bound_distinct_from_exact_optimum · Uses: G001, S020

Reverse checks

  • S021 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S020 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S019 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S018 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S017 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S016 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S015 · premise_and_result_audit — Recompute attaining unit input image row1 sum with exact rational arithmetic, not rounded decimals.
  • S014 · premise_and_result_audit — Recompute attaining unit input image row1 column2 product with exact rational arithmetic, not rounded decimals.
  • S013 · premise_and_result_audit — Recompute attaining unit input image row1 column1 product with exact rational arithmetic, not rounded decimals.
  • S012 · premise_and_result_audit — Recompute attaining unit input image row1 column0 product with exact rational arithmetic, not rounded decimals.
  • S011 · premise_and_result_audit — Recompute attaining unit input image row0 sum with exact rational arithmetic, not rounded decimals.
  • S010 · premise_and_result_audit — Recompute attaining unit input image row0 column2 product with exact rational arithmetic, not rounded decimals.
  • S009 · premise_and_result_audit — Recompute attaining unit input image row0 column1 product with exact rational arithmetic, not rounded decimals.
  • S008 · premise_and_result_audit — Recompute attaining unit input image row0 column0 product with exact rational arithmetic, not rounded decimals.
  • S007 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S006 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • 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 operator row1 absolute sum with exact rational arithmetic, not rounded decimals.
  • 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 — Recompute operator row0 absolute sum with exact rational arithmetic, not rounded decimals.
  • S001 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.

Result

(linfinity, 15, 16, Yes, No, uniform_bound_certificate)

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: 2cd533662fd0f46d2dcc0b565bd800617cd979dd9aa5ee402c3bc5d2329b2e17
  • candidate record SHA-256: 239c9bb5a24ae9186611259f275a67aab0d3601602abdefc37a3f11ecf18c93d
  • semantic review receipt SHA-256: f335caca08574c9f949c141083c66655fee51c227d45d80a3ddb7d78f862d798
  • question-first witness SHA-256: cc7ba54738af91a6871fc1c20e45ad8f2b434392273fa334bd16a3b2238f4a77
  • Lean: NOT_RUN · human review: NOT_PERFORMED
Same-source full JSON