Explore related knowledge and questions →

Question 12435: Check the Whole Finite Vertex Map for Bijectivity

On this page
  1. Original question and givens
  2. Definition and scope
  3. Step-by-step derivation
  4. Reverse checks
  5. Result
  6. This question review and source binding

Return to catalogue page 63

← Question derivation index · Original question batch

R0023-12435 · q-20261013-advance-20261026-r06-graph-isomorphism-0010

Original question and givens

The complete map on Fin(6)={0,…,5} has images=[0, 1, 3, 4, 5, 2] in source-label order, all in the target carrier of the same size. Give (n,mapping,bijective?). This family allows the unique empty map when n=0.

  • G001 — The complete map on Fin(6)={0,…,5} has images=[0, 1, 3, 4, 5, 2] in source-label order, all in the target carrier of the same size. Give (n,mapping,bijective?). This family allows the unique empty map when n=0.

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

complete mapping=[0, 1, 3, 4, 5, 2];target label=0

After

source fiber=[0];exactly one=Yes

Conditions: none

For a complete total map between equally sized finite carriers,every target needs exactly one preimage.Typedness alone is not bijectivity.

Step identifiers and dependencies

Rule: finite_vertex_map_each_target_fiber · Uses: G001

S002 · implies

Before

complete mapping=[0, 1, 3, 4, 5, 2];target label=1

After

source fiber=[1];exactly one=Yes

Conditions: none

For a complete total map between equally sized finite carriers,every target needs exactly one preimage.Typedness alone is not bijectivity.

Step identifiers and dependencies

Rule: finite_vertex_map_each_target_fiber · Uses: G001, S001

S003 · implies

Before

complete mapping=[0, 1, 3, 4, 5, 2];target label=2

After

source fiber=[5];exactly one=Yes

Conditions: none

For a complete total map between equally sized finite carriers,every target needs exactly one preimage.Typedness alone is not bijectivity.

Step identifiers and dependencies

Rule: finite_vertex_map_each_target_fiber · Uses: G001, S002

S004 · implies

Before

complete mapping=[0, 1, 3, 4, 5, 2];target label=3

After

source fiber=[2];exactly one=Yes

Conditions: none

For a complete total map between equally sized finite carriers,every target needs exactly one preimage.Typedness alone is not bijectivity.

Step identifiers and dependencies

Rule: finite_vertex_map_each_target_fiber · Uses: G001, S003

S005 · implies

Before

complete mapping=[0, 1, 3, 4, 5, 2];target label=4

After

source fiber=[3];exactly one=Yes

Conditions: none

For a complete total map between equally sized finite carriers,every target needs exactly one preimage.Typedness alone is not bijectivity.

Step identifiers and dependencies

Rule: finite_vertex_map_each_target_fiber · Uses: G001, S004

S006 · implies

Before

complete mapping=[0, 1, 3, 4, 5, 2];target label=5

After

source fiber=[4];exactly one=Yes

Conditions: none

For a complete total map between equally sized finite carriers,every target needs exactly one preimage.Typedness alone is not bijectivity.

Step identifiers and dependencies

Rule: finite_vertex_map_each_target_fiber · Uses: G001, S005

S007 · implies

Before

n=6;all target fibers=[[0], [1], [5], [2], [3], [4]]

After

bijective=Yes;empty carrier uses unique empty map

Conditions: none

The unique empty map is bijective on empty carriers.This checks the mapping obligation only,not adjacency.

Step identifiers and dependencies

Rule: whole_bijection_including_empty_carrier · Uses: G001, S006

Reverse checks

  • S007 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • 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

(6, [0, 1, 3, 4, 5, 2], Yes)

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: 0f7be61e2c22317a4075561dc822c87d881a50db
  • original question SHA-256: cb47063d537f55088678949c0812ed49380e53c5dfa5f62c3b2ea5ff89908839
  • candidate record SHA-256: d8de6f28d0b16fed3e5ac23033f06bfbcf322eefd964ab72bea3d46e80fa5e53
  • semantic review receipt SHA-256: f783e81f44ff0faa13dbf948657e9187244a59a809ebdf96f22cca24966649ff
  • question-first witness SHA-256: 49a50ed0550be55124d6562260c2ccf4fa6d3f316d7ad9d0d32174400e362e18
  • Lean: NOT_RUN · human review: NOT_PERFORMED
Same-source full JSON