Step-by-step derivation
S001 · implies
Before
ordered column vectors=[[1, -11], [0, 1]]
After
homogeneous coefficient matrix=[[1, 0], [-11, 1]];unknown count=2
Conditions: none
Use vectors as columns in original order.Independence means this homogeneous system has only the zero coefficient solution;row operations must preserve its solution set.
Step identifiers and dependencies
Rule: column_matrix_homogeneous_equations · Uses: G001
S002 · implies
Before
matrix=[[1, 0], [-11, 1]];next pivot column=0;swap rows 0,0
After
matrix=[[1, 0], [-11, 1]]
Conditions: none
Swapping rows only reorders equations;the same swap reverses it.It does not exchange the original vector columns.
Step identifiers and dependencies
Rule: invertible_row_swap · Uses: G001, S001
S003 · calculation
Before
pivot0 normalized column0 := div(1, 1)
After
pivot0 normalized column0 = 1
Conditions: none
Compute exactly with this step's specified roles,retaining signs,denominators and original pairings.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S002
S004 · calculation
Before
pivot0 normalized column1 := div(0, 1)
After
pivot0 normalized column1 = 0
Conditions: none
Compute exactly with this step's specified roles,retaining signs,denominators and original pairings.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S003
S005 · implies
Before
row=0;old row=[1, 0];nonzero divisor=1
After
new row=[1, 0]
Conditions: none
The pivot is known nonzero before division of the whole row.Multiplication by it reverses the operation,so the homogeneous solution set is unchanged.
Step identifiers and dependencies
Rule: nonzero_row_scaling_solution_equivalence · Uses: G001, S004
S006 · calculation
Before
eliminate pivot0 row1 column0 scaled := mul(-11, 1)
After
eliminate pivot0 row1 column0 scaled = -11
Conditions: none
Compute exactly with this step's specified roles,retaining signs,denominators and original pairings.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S005
S007 · calculation
Before
eliminate pivot0 row1 column0 residual := sub(-11, -11)
After
eliminate pivot0 row1 column0 residual = 0
Conditions: none
Compute exactly with this step's specified roles,retaining signs,denominators and original pairings.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S006
S008 · calculation
Before
eliminate pivot0 row1 column1 scaled := mul(-11, 0)
After
eliminate pivot0 row1 column1 scaled = 0
Conditions: none
Compute exactly with this step's specified roles,retaining signs,denominators and original pairings.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S007
S009 · calculation
Before
eliminate pivot0 row1 column1 residual := sub(1, 0)
After
eliminate pivot0 row1 column1 residual = 1
Conditions: none
Compute exactly with this step's specified roles,retaining signs,denominators and original pairings.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S008
S010 · implies
Before
target row=1;old=[-11, 1];pivot row=[1, 0];factor=-11
After
new row=[0, 1];matrix=[[1, 0], [0, 1]]
Conditions: none
Subtract factor times the pivot row to eliminate this entry.Adding it back recovers the original equation;no solutions are created or lost.
Step identifiers and dependencies
Rule: invertible_pivot_row_subtraction · Uses: G001, S009
S011 · implies
Before
matrix=[[1, 0], [0, 1]];next pivot column=1;swap rows 1,1
After
matrix=[[1, 0], [0, 1]]
Conditions: none
Swapping rows only reorders equations;the same swap reverses it.It does not exchange the original vector columns.
Step identifiers and dependencies
Rule: invertible_row_swap · Uses: G001, S010
S012 · calculation
Before
pivot1 normalized column0 := div(0, 1)
After
pivot1 normalized column0 = 0
Conditions: none
Compute exactly with this step's specified roles,retaining signs,denominators and original pairings.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S011
S013 · calculation
Before
pivot1 normalized column1 := div(1, 1)
After
pivot1 normalized column1 = 1
Conditions: none
Compute exactly with this step's specified roles,retaining signs,denominators and original pairings.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S012
S014 · implies
Before
row=1;old row=[0, 1];nonzero divisor=1
After
new row=[0, 1]
Conditions: none
The pivot is known nonzero before division of the whole row.Multiplication by it reverses the operation,so the homogeneous solution set is unchanged.
Step identifiers and dependencies
Rule: nonzero_row_scaling_solution_equivalence · Uses: G001, S013
S015 · implies
Before
reduced matrix=[[1, 0], [0, 1]];pivot columns=[0, 1];unknown count=2
After
rank=2;free variables=0;independent=Yes
Conditions: none
Rank is the pivot count.If every column pivots,the homogeneous solution is zero only.Otherwise set one free variable to1,the other free variables to0,and back-substitute pivot variables to obtain a nontrivial zero combination.
Step identifiers and dependencies
Rule: rank_free_variables_and_independence · Uses: G001, S014
S016 · implies
Before
ambient space=R2;rank=2;family size=2
After
independent=Yes;spans_R2=Yes;basis_R2=Yes
Conditions: none
Invertible row operations preserve image dimension;rank2 is required to span R².An independent singleton does not span the plane,and redundant spanning vectors are not a basis.
Step identifiers and dependencies
Rule: basis_independence_and_spanning_separate · Uses: G001, S015