Original question and givens
Use complete finite unique vertices=[v0, v1, v2, v3, v4, v5, v6, v7], loop-free simple undirected edges=[[v0, v1], [v0, v2], [v0, v3], [v0, v4], [v0, v5], [v0, v6], [v0, v7]] and unique candidate subset=[v0, v1, v2, v3, v4, v5, v7]. Edges normalize to sorted unordered pairs and are duplicate-free. A cover selects at least one endpoint of every edge; isolated vertices need not be selected. Give (vertices, edges, candidate, edge_coverage_rows, cover, uncovered_edge_or_null, certificate).
G001 — Use complete finite unique vertices=[v0, v1, v2, v3, v4, v5, v6, v7], loop-free simple undirected edges=[[v0, v1], [v0, v2], [v0, v3], [v0, v4], [v0, v5], [v0, v6], [v0, v7]] and unique candidate subset=[v0, v1, v2, v3, v4, v5, v7]. Edges normalize to sorted unordered pairs and are duplicate-free. A cover selects at least one endpoint of every edge; isolated vertices need not be selected. Give (vertices, edges, candidate, edge_coverage_rows, cover, uncovered_edge_or_null, certificate).
Step-by-step derivation
S001 · implies
Before
source roles = [vcover-complete-edge-audit]
After
derived = [[vertices, edges, candidate, edge_coverage_rows, cover, uncovered_edge_or_null, certificate]]
Conditions: none
List the full source field order without JavaScript.LP boundary modes all have6 fields but select different roles from the original mode,not answer shape.
Step identifiers and dependencies
Rule: source_ordered_fields_without_JS · Uses: G001
S002 · implies
Before
source roles = [[v0, v1, v2, v3, v4, v5, v6, v7], [[v0, v1], [v0, v2], [v0, v3], [v0, v4], [v0, v5], [v0, v6], [v0, v7]], [v0, v1, v2, v3, v4, v5, v7]]
After
derived = [[v0, v1, v2, v3, v4, v5, v6, v7], [[v0, v1], [v0, v2], [v0, v3], [v0, v4], [v0, v5], [v0, v6], [v0, v7]], [v0, v1, v2, v3, v4, v5, v7]]
Conditions: none
The carrier is nonempty with at most12 vertices.Normalize endpoints by JS UTF16<,then source English canonical edge order.Reject loops/reversed duplicate edges;this is not a directed graph or edge cover.
Step identifiers and dependencies
Rule: Vcover_complete_simple_undirected_graph_UTF16_then_English_order · Uses: G001, S001
S003 · implies
Before
source roles = [0, [v0, v1], [v0, v1, v2, v3, v4, v5, v7]]
After
derived = [[Yes, Yes], Yes]
Conditions: none
This edge is covered iff at least one endpoint is selected.Check the entire edge table,not vertex count.
Step identifiers and dependencies
Rule: Vcover_EVERY_edge_selected_endpoint_disjunction · Uses: G001, S002
S004 · implies
Before
source roles = [1, [v0, v2], [v0, v1, v2, v3, v4, v5, v7]]
After
derived = [[Yes, Yes], Yes]
Conditions: none
This edge is covered iff at least one endpoint is selected.Check the entire edge table,not vertex count.
Step identifiers and dependencies
Rule: Vcover_EVERY_edge_selected_endpoint_disjunction · Uses: G001, S003
S005 · implies
Before
source roles = [2, [v0, v3], [v0, v1, v2, v3, v4, v5, v7]]
After
derived = [[Yes, Yes], Yes]
Conditions: none
This edge is covered iff at least one endpoint is selected.Check the entire edge table,not vertex count.
Step identifiers and dependencies
Rule: Vcover_EVERY_edge_selected_endpoint_disjunction · Uses: G001, S004
S006 · implies
Before
source roles = [3, [v0, v4], [v0, v1, v2, v3, v4, v5, v7]]
After
derived = [[Yes, Yes], Yes]
Conditions: none
This edge is covered iff at least one endpoint is selected.Check the entire edge table,not vertex count.
Step identifiers and dependencies
Rule: Vcover_EVERY_edge_selected_endpoint_disjunction · Uses: G001, S005
S007 · implies
Before
source roles = [4, [v0, v5], [v0, v1, v2, v3, v4, v5, v7]]
After
derived = [[Yes, Yes], Yes]
Conditions: none
This edge is covered iff at least one endpoint is selected.Check the entire edge table,not vertex count.
Step identifiers and dependencies
Rule: Vcover_EVERY_edge_selected_endpoint_disjunction · Uses: G001, S006
S008 · implies
Before
source roles = [5, [v0, v6], [v0, v1, v2, v3, v4, v5, v7]]
After
derived = [[Yes, No], Yes]
Conditions: none
This edge is covered iff at least one endpoint is selected.Check the entire edge table,not vertex count.
Step identifiers and dependencies
Rule: Vcover_EVERY_edge_selected_endpoint_disjunction · Uses: G001, S007
S009 · implies
Before
source roles = [6, [v0, v7], [v0, v1, v2, v3, v4, v5, v7]]
After
derived = [[Yes, Yes], Yes]
Conditions: none
This edge is covered iff at least one endpoint is selected.Check the entire edge table,not vertex count.
Step identifiers and dependencies
Rule: Vcover_EVERY_edge_selected_endpoint_disjunction · Uses: G001, S008
S010 · implies
Before
source roles = [[[[v0, v1], Yes], [[v0, v2], Yes], [[v0, v3], Yes], [[v0, v4], Yes], [[v0, v5], Yes], [[v0, v6], Yes], [[v0, v7], Yes]]]
After
derived = [Yes, null, []]
Conditions: none
Conjoin all edges and retain the first uncovered edge in source order,or null,notFalse.Isolated vertices have no incident coverage obligation and are optional.
Step identifiers and dependencies
Rule: Vcover_COMPLETE_edge_conjunction_FIRST_uncovered_or_NULL · Uses: G001, S009
Result
([v0, v1, v2, v3, v4, v5, v6, v7], [[v0, v1], [v0, v2], [v0, v3], [v0, v4], [v0, v5], [v0, v6], [v0, v7]], [v0, v1, v2, v3, v4, v5, v7], [[[v0, v1], Yes], [[v0, v2], Yes], [[v0, v3], Yes], [[v0, v4], Yes], [[v0, v5], Yes], [[v0, v6], Yes], [[v0, v7], Yes]], Yes, null, vertex_cover_requires_every_edge_to_have_at_least_one_selected_endpoint)
The full substitutions and premise checks give the original answer; source identity,format and status are unchanged.