Explore related knowledge and questions →
Question 8052: Toggle a Typed Nonloop Edge and Compute Degree Changes 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 41
← 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.
R0015-08052 · q-20261012-advance-20261017-r05-graph-0052
Original question and givens Use a complete simple undirected graph on Fin(2)={0,…,1} with raw edges=[]. Endpoints are typed and loops are prohibited. Reversed or repeated edges count once; normalize endpoints and edge order. Do not infer adjacency from a drawing. Toggle edge=[0, 1]. Give (original normalized edges, normalized toggled edge, removed/added action, new edges, old degrees, new degrees, degree differences, degree-sum difference).
G001 — Use a complete simple undirected graph on Fin(2)={0,…,1} with raw edges=[]. Endpoints are typed and loops are prohibited. Reversed or repeated edges count once; normalize endpoints and edge order. Do not infer adjacency from a drawing. Toggle edge=[0, 1]. Give (original normalized edges, normalized toggled edge, removed/added action, new edges, old degrees, new degrees, degree differences, degree-sum difference).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 · implies Before
n=2;raw edges=[] After
canonical edges=[] Conditions: none
Validate every simple undirected edge for typed distinct endpoints.Sort endpoints and count reversed or repeated edges once;do not infer adjacency from a drawing.
Step identifiers and dependencies Rule: simple_graph_edge_normalization · Uses: G001
S002 · implies Before
phase=original;vertex=0;all edges=[] After
neighbors=[];degree=0 Conditions: none
Scan all canonical edges.An incident edge contributes its other endpoint as a distinct neighbor.Keep original vertex labels.
Step identifiers and dependencies Rule: complete_graph_neighbor_inventory · Uses: G001, S001
S003 · implies Before
phase=original;vertex=1;all edges=[] After
neighbors=[];degree=0 Conditions: none
Scan all canonical edges.An incident edge contributes its other endpoint as a distinct neighbor.Keep original vertex labels.
Step identifiers and dependencies Rule: complete_graph_neighbor_inventory · Uses: G001, S002
S004 · implies Before
typed candidate=[0, 1];old edges=[] After
action=added;new edges=[[0, 1]] Conditions: none
Normalize a reversed candidate first,then decide addition/removal from the original edge set.Exactly one undirected edge changes.
Step identifiers and dependencies Rule: toggle_one_undirected_nonloop_edge · Uses: G001, S003
S005 · implies Before
phase=toggled;vertex=0;all edges=[[0, 1]] After
neighbors=[1];degree=1 Conditions: none
Scan all canonical edges.An incident edge contributes its other endpoint as a distinct neighbor.Keep original vertex labels.
Step identifiers and dependencies Rule: complete_graph_neighbor_inventory · Uses: G001, S004
S006 · implies Before
phase=toggled;vertex=1;all edges=[[0, 1]] After
neighbors=[0];degree=1 Conditions: none
Scan all canonical edges.An incident edge contributes its other endpoint as a distinct neighbor.Keep original vertex labels.
Step identifiers and dependencies Rule: complete_graph_neighbor_inventory · Uses: G001, S005
S007 · calculation Before
degree delta0 := sub(1, 0) After
degree delta0 = 1 Conditions: none
Substitute the source data exactly in the stated operand order;division requires a nonzero denominator.
Step identifiers and dependencies Rule: exact_rational_arithmetic · Uses: G001, S006
S008 · calculation Before
degree delta1 := sub(1, 0) After
degree delta1 = 1 Conditions: none
Substitute the source data exactly in the stated operand order;division requires a nonzero denominator.
Step identifiers and dependencies Rule: exact_rational_arithmetic · Uses: G001, S007
S009 · calculation Before
degree delta sum := sum(1, 1) After
degree delta sum = 2 Conditions: none
Substitute the source data exactly in the stated operand order;division requires a nonzero denominator.
Step identifiers and dependencies Rule: exact_rational_arithmetic · Uses: G001, S008
Reverse checks S009 · premise_and_result_audit — Recompute degree delta sum with exact rational arithmetic, not rounded decimals.S008 · premise_and_result_audit — Recompute degree delta1 with exact rational arithmetic, not rounded decimals.S007 · premise_and_result_audit — Recompute degree delta0 with exact rational arithmetic, not rounded decimals.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 — Check against the original data and this step's premises; a one-way implication is not an equivalence.S002 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.S001 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.Result ([], [0, 1], added, [[0, 1]], [0, 0], [1, 1], [1, 1], 2) 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: a14a54dc4eeb157bc4616e271357d044c72bfc7ac8ecf7bd9484e3854c1678cecandidate record SHA-256: 347ae006b91fda4ccd6d3c262b298c14ffe93227f40830f40dc1239aa8281f51semantic review receipt SHA-256: 6ecad9d909199221a07e923f87425e80b3bdec3eed46fe5910d04fca694cae18question-first witness SHA-256: e8f00458977a09493b5f9f05ab9e6feec72debaf4c7d1c609d1fc95900a35a1bLean: NOT_RUN · human review: NOT_PERFORMEDSame-source full JSON