Original question and givens
The binary relation has source A={-3, -2, -1}, target B={1, 2, 3}, and R={(-3, 2), (-2, 2)}⊆A×B. After exchanging source and target, list the converse R⁻¹ as ordered pairs sorted by first and then second component, with duplicates removed.
G001 — The binary relation has source A={-3, -2, -1}, target B={1, 2, 3}, and R={(-3, 2), (-2, 2)}⊆A×B. After exchanging source and target, list the converse R⁻¹ as ordered pairs sorted by first and then second component, with duplicates removed.
Step-by-step derivation
S001 · implies
Before
source roles = [qf-relation-converse-set, [A, B, R, operation]]
After
derived = [converse, no-invented-domain]
Conditions: none
Separate source banks:legacy RAW SAFE with unbounded derived BigInts versus BASE Number.isInteger without invented SAFE/million caps.Operations,domains and permissive/exact keys follow THIS bank.Keep ORIGINAL JSON intact.
Step identifiers and dependencies
Rule: R68_BANK_specific_keys_operations_and_numeric_guards · Uses: G001
S002 · implies
Before
source roles = [relation ORIGINAL source A, [-3, -2, -1]]
After
derived = [[-3, -2, -1]]
Conditions: none
THIS LDL set has0..100 DISTINCT RAW SAFE labels,with the empty set allowed.Sort only the derived representation;preserve original JSON order.Do not import another BASE set protocol.
Step identifiers and dependencies
Rule: LDL_RAW_distinct_SAFE_set_empty_allowed · Uses: G001, S001
S003 · implies
Before
source roles = [relation ORIGINAL target B, [1, 2, 3]]
After
derived = [[1, 2, 3]]
Conditions: none
THIS LDL set has0..100 DISTINCT RAW SAFE labels,with the empty set allowed.Sort only the derived representation;preserve original JSON order.Do not import another BASE set protocol.
Step identifiers and dependencies
Rule: LDL_RAW_distinct_SAFE_set_empty_allowed · Uses: G001, S002
S004 · implies
Before
source roles = [0, [-3, 2]]
After
derived = [[-3, 2]]
Conditions: none
Type EVERY raw R pair as EXACTLY TWO SAFE coordinates BEFORE deduplication.Identical repeated pairs are legal,but deduplication must not hide an unvalidated cell.
Step identifiers and dependencies
Rule: Relation_RAW_EVERY_pair_typed_BEFORE_dedup · Uses: G001, S003
S005 · implies
Before
source roles = [1, [-2, 2]]
After
derived = [[-2, 2]]
Conditions: none
Type EVERY raw R pair as EXACTLY TWO SAFE coordinates BEFORE deduplication.Identical repeated pairs are legal,but deduplication must not hide an unvalidated cell.
Step identifiers and dependencies
Rule: Relation_RAW_EVERY_pair_typed_BEFORE_dedup · Uses: G001, S004
S006 · implies
Before
source roles = [[-3, -2, -1], [1, 2, 3], [[-3, 2], [-2, 2]]]
After
derived = [Yes]
Conditions: none
FIRST qualify the COMPLETE R⊆A×B.A relation need not be total,single-valued,injective or onto.Empty R/carriers are allowed when typed.Keep ORIGINAL raw duplicates/order in the source copy.
Step identifiers and dependencies
Rule: Relation_COMPLETE_typed_subset_A_cross_B_NO_function_assumption · Uses: G001, S005
S007 · implies
Before
source roles = [-3, 2, A x B]
After
derived = [2, -3, B x A]
Conditions: none
Swap EACH ORIGINAL(x,y)to(y,x),exchanging source/target roles too.This is not merely reversing the list order.
Step identifiers and dependencies
Rule: Relation_CONVERSE_EACH_pair_swaps_roles_and_carriers · Uses: G001, S006
S008 · implies
Before
source roles = [-2, 2, A x B]
After
derived = [2, -2, B x A]
Conditions: none
Swap EACH ORIGINAL(x,y)to(y,x),exchanging source/target roles too.This is not merely reversing the list order.
Step identifiers and dependencies
Rule: Relation_CONVERSE_EACH_pair_swaps_roles_and_carriers · Uses: G001, S007
S009 · implies
Before
source roles = [[1, 2, 3], [-3, -2, -1], [[2, -3], [2, -2]]]
After
derived = [{(2, -3), (2, -2)}]Conditions: none
Display in NUMERIC lexicographic order by first,then second coordinate,without duplicates.R⁻¹ is a converse RELATION,not automatically an inverse FUNCTION.Empty R stays empty;do not invent a bijection premise.
Step identifiers and dependencies
Rule: Relation_CONVERSE_numeric_lex_order_not_inverse_FUNCTION · Uses: G001, S008