Explore related knowledge and questions →
Question 12602: The Norm of an Ordered Vector Difference 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 64
← 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.
R0024-12602 · q-20261013-advance-20261026-r02-real-normed-vector-space-0077
Original question and givens Only the named real-coordinate formulas l1(v)=sum_i |v_i| and linfinity(v)=max_i |v_i| are supported here. Their universal algebraic certificates, not a finite sample, supply the norm axioms. An unsupported name is outside this protocol, not a claim that every other formula fails to be a norm. norm_name=linfinity, left=[-11, -2, -2], right=[11, -1, -1] with equal dimension. Give (norm_name,left,right,left−right,distance).
G001 — Only the named real-coordinate formulas l1(v)=sum_i |v_i| and linfinity(v)=max_i |v_i| are supported here. Their universal algebraic certificates, not a finite sample, supply the norm axioms. An unsupported name is outside this protocol, not a claim that every other formula fails to be a norm. norm_name=linfinity, left=[-11, -2, -2], right=[11, -1, -1] with equal dimension. Give (norm_name,left,right,left−right,distance).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 · calculation Before
distance coordinate0 left-minus-right := sub(-11, 11) After
distance coordinate0 left-minus-right = -22 Conditions: none
Compute exactly from the original roles and complete established operands,without changing pairings,order or replacing guards by approximation.
Step identifiers and dependencies Rule: exact_rational_arithmetic · Uses: G001
S002 · calculation Before
distance coordinate1 left-minus-right := sub(-2, -1) After
distance coordinate1 left-minus-right = -1 Conditions: none
Compute exactly from the original roles and complete established operands,without changing pairings,order or replacing guards by approximation.
Step identifiers and dependencies Rule: exact_rational_arithmetic · Uses: G001, S001
S003 · calculation Before
distance coordinate2 left-minus-right := sub(-2, -1) After
distance coordinate2 left-minus-right = -1 Conditions: none
Compute exactly from the original roles and complete established operands,without changing pairings,order or replacing guards by approximation.
Step identifiers and dependencies Rule: exact_rational_arithmetic · Uses: G001, S002
S004 · implies Before
named certified norm=linfinity;left=[-11, -2, -2];right=[11, -1, -1] After
ordered difference=[-22, -1, -1];distance=norm(left-right) Conditions: none
Use the same named norm on the same coordinate space and retain the difference direction.This does not assert every metric is norm-induced,or add completeness or inner-product claims.
Step identifiers and dependencies Rule: fixed_norm_induced_distance_scope · Uses: G001, S003
S005 · implies Before
induced distance:coordinate=0;signed value=-22 After
absolute value=22 Conditions: none
Take the absolute value of each entire coordinate.Negative coordinates are not summed or maximized as signed values;retain the original signed vector.
Step identifiers and dependencies Rule: named_norm_each_coordinate_absolute_value · Uses: G001, S004
S006 · implies Before
induced distance:coordinate=1;signed value=-1 After
absolute value=1 Conditions: none
Take the absolute value of each entire coordinate.Negative coordinates are not summed or maximized as signed values;retain the original signed vector.
Step identifiers and dependencies Rule: named_norm_each_coordinate_absolute_value · Uses: G001, S005
S007 · implies Before
induced distance:coordinate=2;signed value=-1 After
absolute value=1 Conditions: none
Take the absolute value of each entire coordinate.Negative coordinates are not summed or maximized as signed values;retain the original signed vector.
Step identifiers and dependencies Rule: named_norm_each_coordinate_absolute_value · Uses: G001, S006
S008 · implies Before
induced distance:all coordinate absolute values=[22, 1, 1] After
maximum=22;attained coordinate=0 Conditions: none
In a nonempty finite list,the maximum bounds every value and is attained at a listed coordinate.It is not the largest signed coordinate.
Step identifiers and dependencies Rule: linfinity_complete_maximum_witness · Uses: G001, S007
Reverse checks 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 — 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 — Check against the original data and this step's premises; a one-way implication is not an equivalence.S003 · premise_and_result_audit — Recompute distance coordinate2 left-minus-right with exact rational arithmetic, not rounded decimals.S002 · premise_and_result_audit — Recompute distance coordinate1 left-minus-right with exact rational arithmetic, not rounded decimals.S001 · premise_and_result_audit — Recompute distance coordinate0 left-minus-right with exact rational arithmetic, not rounded decimals.Result (linfinity, [-11, -2, -2], [11, -1, -1], [-22, -1, -1], 22) 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: 0f7be61e2c22317a4075561dc822c87d881a50dboriginal question SHA-256: 71e5e91bd1236fed06fb3ecd5bad4dcd2d7e1ee3ad9b5bbe12ab742a0351a315candidate record SHA-256: a42faf9faf15004b5f1cf1e19c1ee347df5ad967f031740afa06a0144eef57adsemantic review receipt SHA-256: 1c8f6c2c6c75852cb93c08235684ce9f32ebe86065c58c693a04257e772c2d35question-first witness SHA-256: 05fd764b5f9f7fff6185003efe576d87632f6daf40606ac3839a7feafe4f80d8Lean: NOT_RUN · human review: NOT_PERFORMEDSame-source full JSON