Step-by-step derivation
S001 · implies
Before
source roles = [qf-sequence-prefix, [L, d, operation, u]]
After
derived = [prefix, no-invented-domain]
Conditions: none
Keep EACH bank’s keys/operation/domain distinct:LDL/PULSE/function legacy table underscores,TREE full tree_* with its declared domain,and permissive BASE signed without invented op/domain.All arithmetic respects the binary-primitive contract.
Step identifiers and dependencies
Rule: R69_SOURCE_specific_keys_operation_domain_AND_binary_contract · Uses: G001
S002 · implies
Before
source roles = [-6, 3, 7, prefix]
After
derived = [a_0=u, a_n=u+n*d, zero based]
Conditions: none
Type ALL RAW u/d/count fields EVEN for prefix L=0.Indices start at0 and the formula/recurrence is GIVEN;do not infer a general rule from finite samples.
Step identifiers and dependencies
Rule: Sequence_ALL_RAW_initial_step_and_count_EVEN_empty_prefix · Uses: G001, S001
S003 · calculation
Before
Sequence prefix ORIGINAL index times step j=0 := mul(0, 3)
After
Sequence prefix ORIGINAL index times step j=0 = 0
Conditions: none
Use ORIGINAL operands exactly;mul/sub/div have EXPLICITLY TWO operands so the old binary primitive cannot ignore a third.Keep RAW SAFE bounds separate from unbounded derived BigInts;do not approximate to force answers.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S002
S004 · calculation
Before
Sequence prefix ORIGINAL complete term j=0 := sum(-6, 0)
After
Sequence prefix ORIGINAL complete term j=0 = -6
Conditions: none
Use ORIGINAL operands exactly;mul/sub/div have EXPLICITLY TWO operands so the old binary primitive cannot ignore a third.Keep RAW SAFE bounds separate from unbounded derived BigInts;do not approximate to force answers.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S003
S005 · calculation
Before
Sequence prefix ORIGINAL index times step j=1 := mul(1, 3)
After
Sequence prefix ORIGINAL index times step j=1 = 3
Conditions: none
Use ORIGINAL operands exactly;mul/sub/div have EXPLICITLY TWO operands so the old binary primitive cannot ignore a third.Keep RAW SAFE bounds separate from unbounded derived BigInts;do not approximate to force answers.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S004
S006 · calculation
Before
Sequence prefix ORIGINAL complete term j=1 := sum(-6, 3)
After
Sequence prefix ORIGINAL complete term j=1 = -3
Conditions: none
Use ORIGINAL operands exactly;mul/sub/div have EXPLICITLY TWO operands so the old binary primitive cannot ignore a third.Keep RAW SAFE bounds separate from unbounded derived BigInts;do not approximate to force answers.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S005
S007 · calculation
Before
Sequence prefix ORIGINAL index times step j=2 := mul(2, 3)
After
Sequence prefix ORIGINAL index times step j=2 = 6
Conditions: none
Use ORIGINAL operands exactly;mul/sub/div have EXPLICITLY TWO operands so the old binary primitive cannot ignore a third.Keep RAW SAFE bounds separate from unbounded derived BigInts;do not approximate to force answers.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S006
S008 · calculation
Before
Sequence prefix ORIGINAL complete term j=2 := sum(-6, 6)
After
Sequence prefix ORIGINAL complete term j=2 = 0
Conditions: none
Use ORIGINAL operands exactly;mul/sub/div have EXPLICITLY TWO operands so the old binary primitive cannot ignore a third.Keep RAW SAFE bounds separate from unbounded derived BigInts;do not approximate to force answers.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S007
S009 · calculation
Before
Sequence prefix ORIGINAL index times step j=3 := mul(3, 3)
After
Sequence prefix ORIGINAL index times step j=3 = 9
Conditions: none
Use ORIGINAL operands exactly;mul/sub/div have EXPLICITLY TWO operands so the old binary primitive cannot ignore a third.Keep RAW SAFE bounds separate from unbounded derived BigInts;do not approximate to force answers.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S008
S010 · calculation
Before
Sequence prefix ORIGINAL complete term j=3 := sum(-6, 9)
After
Sequence prefix ORIGINAL complete term j=3 = 3
Conditions: none
Use ORIGINAL operands exactly;mul/sub/div have EXPLICITLY TWO operands so the old binary primitive cannot ignore a third.Keep RAW SAFE bounds separate from unbounded derived BigInts;do not approximate to force answers.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S009
S011 · calculation
Before
Sequence prefix ORIGINAL index times step j=4 := mul(4, 3)
After
Sequence prefix ORIGINAL index times step j=4 = 12
Conditions: none
Use ORIGINAL operands exactly;mul/sub/div have EXPLICITLY TWO operands so the old binary primitive cannot ignore a third.Keep RAW SAFE bounds separate from unbounded derived BigInts;do not approximate to force answers.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S010
S012 · calculation
Before
Sequence prefix ORIGINAL complete term j=4 := sum(-6, 12)
After
Sequence prefix ORIGINAL complete term j=4 = 6
Conditions: none
Use ORIGINAL operands exactly;mul/sub/div have EXPLICITLY TWO operands so the old binary primitive cannot ignore a third.Keep RAW SAFE bounds separate from unbounded derived BigInts;do not approximate to force answers.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S011
S013 · calculation
Before
Sequence prefix ORIGINAL index times step j=5 := mul(5, 3)
After
Sequence prefix ORIGINAL index times step j=5 = 15
Conditions: none
Use ORIGINAL operands exactly;mul/sub/div have EXPLICITLY TWO operands so the old binary primitive cannot ignore a third.Keep RAW SAFE bounds separate from unbounded derived BigInts;do not approximate to force answers.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S012
S014 · calculation
Before
Sequence prefix ORIGINAL complete term j=5 := sum(-6, 15)
After
Sequence prefix ORIGINAL complete term j=5 = 9
Conditions: none
Use ORIGINAL operands exactly;mul/sub/div have EXPLICITLY TWO operands so the old binary primitive cannot ignore a third.Keep RAW SAFE bounds separate from unbounded derived BigInts;do not approximate to force answers.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S013
S015 · calculation
Before
Sequence prefix ORIGINAL index times step j=6 := mul(6, 3)
After
Sequence prefix ORIGINAL index times step j=6 = 18
Conditions: none
Use ORIGINAL operands exactly;mul/sub/div have EXPLICITLY TWO operands so the old binary primitive cannot ignore a third.Keep RAW SAFE bounds separate from unbounded derived BigInts;do not approximate to force answers.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S014
S016 · calculation
Before
Sequence prefix ORIGINAL complete term j=6 := sum(-6, 18)
After
Sequence prefix ORIGINAL complete term j=6 = 12
Conditions: none
Use ORIGINAL operands exactly;mul/sub/div have EXPLICITLY TWO operands so the old binary primitive cannot ignore a third.Keep RAW SAFE bounds separate from unbounded derived BigInts;do not approximate to force answers.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S015
S017 · implies
Before
source roles = [-6, 3, 7]
After
derived = [[-6, -3, 0, 3, 6, 9, 12], [-6, -3, 0, 3, 6, 9, 12]]
Conditions: none
Take EXACTLY L terms in index order from a0 through a_(L−1),NOT through aL.L=0 displays[].The GIVEN formula determines these terms;the prefix alone need not determine an unknown rule.
Step identifiers and dependencies
Rule: Sequence_PREFIX_EXACT_length_L_indices0_to_Lminus1 · Uses: G001, S016