Explore related knowledge and questions →

Question 8372: Relation Single-Valuedness versus Total-Function Qualification

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 42

← Question derivation index · Original question batch

R0015-08372 · q-20261012-advance-20261017-r03-relation-0097

Original question and givens

The explicitly typed relation R⊆Fin(3)×Fin(3) has ordered pairs=[[0, 0], [1, 1]]. Normalize repeated pairs as a set, in lexicographic order. A relation need not be single-valued or total; its converse need not be an inverse function. Give ([n,m], normalized pairs, each source fiber size, at-most-one value per source?, exactly-one value per source?, total image table or not-a-total-function).

  • G001 — The explicitly typed relation R⊆Fin(3)×Fin(3) has ordered pairs=[[0, 0], [1, 1]]. Normalize repeated pairs as a set, in lexicographic order. A relation need not be single-valued or total; its converse need not be an inverse function. Give ([n,m], normalized pairs, each source fiber size, at-most-one value per source?, exactly-one value per source?, total image table or not-a-total-function).

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

types=(3,3);raw ordered pairs=[[0, 0], [1, 1]]

After

normalized relation=[[0, 0], [1, 1]]

Conditions: none

Validate both types of every ordered pair,then deduplicate identical pairs.Swapping coordinates forms the converse,not a sorting of one pair.A relation may be multivalued or partial.

Step identifiers and dependencies

Rule: typed_relation_set_normalization · Uses: G001

S002 · implies

Before

source=0;pairs=[[0, 0], [1, 1]]

After

outgoing values=[0];count=1

Conditions: none

Collect all distinct outgoing targets of every declared source;an absent source has an empty fiber.

Step identifiers and dependencies

Rule: relation_each_source_value_fiber · Uses: G001, S001

S003 · implies

Before

source=1;pairs=[[0, 0], [1, 1]]

After

outgoing values=[1];count=1

Conditions: none

Collect all distinct outgoing targets of every declared source;an absent source has an empty fiber.

Step identifiers and dependencies

Rule: relation_each_source_value_fiber · Uses: G001, S002

S004 · implies

Before

source=2;pairs=[[0, 0], [1, 1]]

After

outgoing values=[];count=0

Conditions: none

Collect all distinct outgoing targets of every declared source;an absent source has an empty fiber.

Step identifiers and dependencies

Rule: relation_each_source_value_fiber · Uses: G001, S003

S005 · implies

Before

source fiber sizes=[1, 1, 0]

After

single-valued=Yes;exactly-one total=No;table/status=not a total function

Conditions: none

At most one value permits missing sources;exactly one makes a total function.On an empty source both universal conditions are true and the table is empty.Repeating a pair does not increase a fiber size.

Step identifiers and dependencies

Rule: partial_single_valued_not_total · Uses: G001, S004

Reverse checks

  • 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

([3, 3], [[0, 0], [1, 1]], [1, 1, 0], Yes, No, not-a-total-function)

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: 7d43ed40c6ccf3e11ec7d38314fcd2b5f26a2cc19b41d243365ccd8998ff0afe
  • candidate record SHA-256: 371d546a6eb5e98326cebf2e36a1e21532f7e24d737d767772de64560dd699a5
  • semantic review receipt SHA-256: 6ecad9d909199221a07e923f87425e80b3bdec3eed46fe5910d04fca694cae18
  • question-first witness SHA-256: e8f00458977a09493b5f9f05ab9e6feec72debaf4c7d1c609d1fc95900a35a1b
  • Lean: NOT_RUN · human review: NOT_PERFORMED
Same-source full JSON