Step-by-step derivation
S001 · implies
Before
source roles = [contract-picard-orbit]
After
derived = [[start, steps, orbit, fixed_point, distances_to_fixed_point, certificate]]
Conditions: none
List the full source field order without JavaScript.Original modes select contract6/4/6/6 and IVT8/7/8 roles,without padding or answer-shape inference.
Step identifiers and dependencies
Rule: source_ordered_fields_without_JS · Uses: G001
S002 · implies
Before
source roles = [[[0, 18, 54], [18, 0, 36], [54, 36, 0]]]
After
derived = [3, Yes, Yes, Yes, [[0, 0, 0, 0, 0, Yes], [0, 0, 1, 18, 18, Yes], [0, 0, 2, 54, 54, Yes], [0, 1, 0, 0, 36, Yes], [0, 1, 1, 18, 18, Yes], [0, 1, 2, 54, 54, Yes], [0, 2, 0, 0, 108, Yes], [0, 2, 1, 18, 90, Yes], [0, 2, 2, 54, 54, Yes], [1, 0, 0, 18, 18, Yes], [1, 0, 1, 0, 36, Yes], [1, 0, 2, 36, 72, Yes], [1, 1, 0, 18, 18, Yes], [1, 1, 1, 0, 0, Yes], [1, 1, 2, 36, 36, Yes], [1, 2, 0, 18, 90, Yes], [1, 2, 1, 0, 72, Yes], [1, 2, 2, 36, 36, Yes], [2, 0, 0, 54, 54, Yes], [2, 0, 1, 36, 72, Yes], [2, 0, 2, 0, 108, Yes], [2, 1, 0, 54, 54, Yes], [2, 1, 1, 36, 36, Yes], [2, 1, 2, 0, 72, Yes], [2, 2, 0, 54, 54, Yes], [2, 2, 1, 36, 36, Yes], [2, 2, 2, 0, 0, Yes]], Yes]
Conditions: none
Check every triangle triple,not sampled metric behavior.A nonempty finite metric is complete:trivial for a singleton;otherwise the minimum positive distance delta forces a Cauchy tail with distances<delta to be constant,with limit in X.
Step identifiers and dependencies
Rule: Contraction_COMPLETE_metric_axioms_ALL_triangles_finite_completeness · Uses: G001, S001
S003 · calculation
Before
Contraction ORIGINAL pair0,0 q times distance := mul(1/2, 0)
After
Contraction ORIGINAL pair0,0 q times distance = 0
Conditions: none
Substitute original roles and established intermediates exactly,without rounding;extra teaching identities do not restrict the source domain.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S002
S004 · calculation
Before
Contraction ORIGINAL pair0,1 q times distance := mul(1/2, 18)
After
Contraction ORIGINAL pair0,1 q times distance = 9
Conditions: none
Substitute original roles and established intermediates exactly,without rounding;extra teaching identities do not restrict the source domain.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S003
S005 · calculation
Before
Contraction ORIGINAL pair0,2 q times distance := mul(1/2, 54)
After
Contraction ORIGINAL pair0,2 q times distance = 27
Conditions: none
Substitute original roles and established intermediates exactly,without rounding;extra teaching identities do not restrict the source domain.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S004
S006 · calculation
Before
Contraction ORIGINAL pair1,0 q times distance := mul(1/2, 18)
After
Contraction ORIGINAL pair1,0 q times distance = 9
Conditions: none
Substitute original roles and established intermediates exactly,without rounding;extra teaching identities do not restrict the source domain.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S005
S007 · calculation
Before
Contraction ORIGINAL pair1,1 q times distance := mul(1/2, 0)
After
Contraction ORIGINAL pair1,1 q times distance = 0
Conditions: none
Substitute original roles and established intermediates exactly,without rounding;extra teaching identities do not restrict the source domain.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S006
S008 · calculation
Before
Contraction ORIGINAL pair1,2 q times distance := mul(1/2, 36)
After
Contraction ORIGINAL pair1,2 q times distance = 18
Conditions: none
Substitute original roles and established intermediates exactly,without rounding;extra teaching identities do not restrict the source domain.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S007
S009 · calculation
Before
Contraction ORIGINAL pair2,0 q times distance := mul(1/2, 54)
After
Contraction ORIGINAL pair2,0 q times distance = 27
Conditions: none
Substitute original roles and established intermediates exactly,without rounding;extra teaching identities do not restrict the source domain.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S008
S010 · calculation
Before
Contraction ORIGINAL pair2,1 q times distance := mul(1/2, 36)
After
Contraction ORIGINAL pair2,1 q times distance = 18
Conditions: none
Substitute original roles and established intermediates exactly,without rounding;extra teaching identities do not restrict the source domain.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S009
S011 · calculation
Before
Contraction ORIGINAL pair2,2 q times distance := mul(1/2, 0)
After
Contraction ORIGINAL pair2,2 q times distance = 0
Conditions: none
Substitute original roles and established intermediates exactly,without rounding;extra teaching identities do not restrict the source domain.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S010
S012 · implies
Before
source roles = [[0, 0, 1], 1/2, [[0, 18, 54], [18, 0, 36], [54, 36, 0]]]
After
derived = [Yes, Yes, [[0, 0, 0, 0, Yes], [0, 1, 0, 9, Yes], [0, 2, 18, 27, Yes], [1, 0, 0, 9, Yes], [1, 1, 0, 0, Yes], [1, 2, 18, 18, Yes], [2, 0, 18, 27, Yes], [2, 1, 18, 18, Yes], [2, 2, 0, 0, Yes]], Yes, [0]]
Conditions: none
Separate self-map,0<=q<1 and all pair inequalities.Nonself maps have empty source pair rows;self maps retain actual pair results even when q-range fails.Array length or samples do not prove global contraction.
Step identifiers and dependencies
Rule: Contraction_selfmap_q_range_ALL_ordered_pairs_separate · Uses: G001, S011
S013 · implies
Before
source roles = [0, 2, [0, 0, 1]]
After
derived = [1, 18]
Conditions: none
Apply the same complete map at every step,retaining the start and all iterates rather than guessing a fixed point from a short prefix.
Step identifiers and dependencies
Rule: Contraction_EACH_Picard_iterate_original_total_map · Uses: G001, S012
S014 · implies
Before
source roles = [1, 1, [0, 0, 1]]
After
derived = [0, 0]
Conditions: none
Apply the same complete map at every step,retaining the start and all iterates rather than guessing a fixed point from a short prefix.
Step identifiers and dependencies
Rule: Contraction_EACH_Picard_iterate_original_total_map · Uses: G001, S013
S015 · implies
Before
source roles = [2, 0, [0, 0, 1]]
After
derived = [0, 0]
Conditions: none
Apply the same complete map at every step,retaining the start and all iterates rather than guessing a fixed point from a short prefix.
Step identifiers and dependencies
Rule: Contraction_EACH_Picard_iterate_original_total_map · Uses: G001, S014
S016 · implies
Before
source roles = [3, 0, [0, 0, 1]]
After
derived = [0, 0]
Conditions: none
Apply the same complete map at every step,retaining the start and all iterates rather than guessing a fixed point from a short prefix.
Step identifiers and dependencies
Rule: Contraction_EACH_Picard_iterate_original_total_map · Uses: G001, S015
S017 · implies
Before
source roles = [1/2, [0], 2, [2, 1, 0, 0, 0]]
After
derived = [[54, 18, 0, 0, 0], d(x_(n+k),x_n)<=q^n*(1-q^k)/(1-q)*d(x1,x0), complete limit fixed;two fixed points obey(1-q)d<=0 hence coincide]
Conditions: none
Successive distances shrink by q;the triangle inequality sums the finite geometric tail,making Picard Cauchy.Completeness gives a limit and Lipschitz continuity makes it fixed.Two fixed points satisfy distance<=q*distance,so q<1 forces equality.This pedagogical argument does not label a finite orbit a general formal proof.
Step identifiers and dependencies
Rule: Contraction_GENERAL_geometric_tail_complete_limit_and_unique_fixed · Uses: G001, S016