Explore related knowledge and questions →

Question 32390: Validity of a Finite Total-Function Table

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 162

← Question derivation index · Original question batch

R0063-32390 · q-20260930-r03-function-table-validity-0015

Original question and givens

For the explicit data A={2, 3, 4, 5}, B={-28, 0, 29}, ordered pairs=[(2, 29), (3, -28), (4, 0), (5, 29), (6, -28)], does the table define a complete total function f:A→B? Answer Yes or No.

  • G001 — For the explicit data A={2, 3, 4, 5}, B={-28, 0, 29}, ordered pairs=[(2, 29), (3, -28), (4, 0), (5, 29), (6, -28)], does the table define a complete total function f:A→B? Answer Yes or No.

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

source roles = [qf-function-table-validity, validity, no-required-domain, []]

After

derived = [[total_function_YesNo_STRING]]

Conditions: none

BASE sources do not acquire a generic legacy operation/domain or unknown-metadata ban.Retain metadata WITHOUT using it as an answer oracle.PULSE/legacy enforce their exact source keys,operation/domain.Do not impose universal tuples,/1 or input bounds.

Step identifiers and dependencies

Rule: R63_SOURCE_bank_keys_operation_domain_output_roles_metadata_not_oracle · Uses: G001

S002 · implies

Before

source roles = [A declared domain, pulse-function, [2, 3, 4, 5]]

After

derived = [[2, 3, 4, 5]]

Conditions: none

RAW A/B/C are distinct SAFE integers.Legacy injective limits100,but PULSE has NO such cap.Sort ONLY a derived work table,retaining original lists.

Step identifiers and dependencies

Rule: Map_RAW_distinct_SAFE_set_BANK_specific_cardinality_bound · Uses: G001, S001

S003 · implies

Before

source roles = [B declared codomain, pulse-function, [-28, 0, 29]]

After

derived = [[-28, 0, 29]]

Conditions: none

RAW A/B/C are distinct SAFE integers.Legacy injective limits100,but PULSE has NO such cap.Sort ONLY a derived work table,retaining original lists.

Step identifiers and dependencies

Rule: Map_RAW_distinct_SAFE_set_BANK_specific_cardinality_bound · Uses: G001, S002

S004 · implies

Before

source roles = [pulse-function, [[2, 29], [3, -28], [4, 0], [5, 29], [6, -28]]]

After

derived = [[[2, 29], [3, -28], [4, 0], [5, 29], [6, -28]]]

Conditions: none

PULSE rejects EXACT duplicate RAW rows BEFORE totality,not as a legal No.Legacy injective FIRST checks raw length≤200,then normalizes identical rows as one pair.Do not exchange these policies;type-check EVERY raw cell first.

Step identifiers and dependencies

Rule: Map_RAW_pairs_arity_SAFE_DUPLICATE_policy_BEFORE_totality · Uses: G001, S003

S005 · implies

Before

source roles = [pulse-function, 0, 2, 29, [2, 3, 4, 5], [-28, 0, 29]]

After

derived = [Yes, Yes, Yes]

Conditions: none

EVERY row input must belong to A and output to B,including unused/orphan rows.Even an empty A does not waive row typing.

Step identifiers and dependencies

Rule: Map_EACH_row_SOURCE_and_TARGET_membership_in_declared_sets · Uses: G001, S004

S006 · implies

Before

source roles = [pulse-function, 1, 3, -28, [2, 3, 4, 5], [-28, 0, 29]]

After

derived = [Yes, Yes, Yes]

Conditions: none

EVERY row input must belong to A and output to B,including unused/orphan rows.Even an empty A does not waive row typing.

Step identifiers and dependencies

Rule: Map_EACH_row_SOURCE_and_TARGET_membership_in_declared_sets · Uses: G001, S005

S007 · implies

Before

source roles = [pulse-function, 2, 4, 0, [2, 3, 4, 5], [-28, 0, 29]]

After

derived = [Yes, Yes, Yes]

Conditions: none

EVERY row input must belong to A and output to B,including unused/orphan rows.Even an empty A does not waive row typing.

Step identifiers and dependencies

Rule: Map_EACH_row_SOURCE_and_TARGET_membership_in_declared_sets · Uses: G001, S006

S008 · implies

Before

source roles = [pulse-function, 3, 5, 29, [2, 3, 4, 5], [-28, 0, 29]]

After

derived = [Yes, Yes, Yes]

Conditions: none

EVERY row input must belong to A and output to B,including unused/orphan rows.Even an empty A does not waive row typing.

Step identifiers and dependencies

Rule: Map_EACH_row_SOURCE_and_TARGET_membership_in_declared_sets · Uses: G001, S007

S009 · implies

Before

source roles = [pulse-function, 4, 6, -28, [2, 3, 4, 5], [-28, 0, 29]]

After

derived = [No, Yes, No]

Conditions: none

EVERY row input must belong to A and output to B,including unused/orphan rows.Even an empty A does not waive row typing.

Step identifiers and dependencies

Rule: Map_EACH_row_SOURCE_and_TARGET_membership_in_declared_sets · Uses: G001, S008

S010 · implies

Before

source roles = [pulse-function, 2, [[2, 29], [3, -28], [4, 0], [5, 29], [6, -28]]]

After

derived = [1, Yes]

Conditions: none

Count rows for EACH DECLARED A input;EXACTLY one is required for a total function.Missing rows/multiple distinct outputs fail;do not conceal them with a first-match lookup.

Step identifiers and dependencies

Rule: Map_EACH_declared_input_EXACTLY_one_normalized_row · Uses: G001, S009

S011 · implies

Before

source roles = [pulse-function, 3, [[2, 29], [3, -28], [4, 0], [5, 29], [6, -28]]]

After

derived = [1, Yes]

Conditions: none

Count rows for EACH DECLARED A input;EXACTLY one is required for a total function.Missing rows/multiple distinct outputs fail;do not conceal them with a first-match lookup.

Step identifiers and dependencies

Rule: Map_EACH_declared_input_EXACTLY_one_normalized_row · Uses: G001, S010

S012 · implies

Before

source roles = [pulse-function, 4, [[2, 29], [3, -28], [4, 0], [5, 29], [6, -28]]]

After

derived = [1, Yes]

Conditions: none

Count rows for EACH DECLARED A input;EXACTLY one is required for a total function.Missing rows/multiple distinct outputs fail;do not conceal them with a first-match lookup.

Step identifiers and dependencies

Rule: Map_EACH_declared_input_EXACTLY_one_normalized_row · Uses: G001, S011

S013 · implies

Before

source roles = [pulse-function, 5, [[2, 29], [3, -28], [4, 0], [5, 29], [6, -28]]]

After

derived = [1, Yes]

Conditions: none

Count rows for EACH DECLARED A input;EXACTLY one is required for a total function.Missing rows/multiple distinct outputs fail;do not conceal them with a first-match lookup.

Step identifiers and dependencies

Rule: Map_EACH_declared_input_EXACTLY_one_normalized_row · Uses: G001, S012

S014 · implies

Before

source roles = [pulse-function, [2, 3, 4, 5], [-28, 0, 29], [[2, 29], [3, -28], [4, 0], [5, 29], [6, -28]], No]

After

derived = [[Yes, Yes, Yes, Yes, No], [1, 1, 1, 1], No]

Conditions: none

A total function needs BOTH every declared input AND every row qualified.PULSE validity may legally return No;other queries and legacy injective REQUIRE actual totality BEFORE lookup.Empty A/table can be valid;unattained B labels remain.

Step identifiers and dependencies

Rule: Map_TOTAL_all_declared_inputs_AND_ALL_rows_before_any_lookup · Uses: G001, S013

Reverse checks

  • S014 · premise_and_result_audit — Reverse-check ORIGINAL inputs,types,domain and premises;the conclusion need not uniquely recover its premises.Keep source-bound candidates,independent review,formal proof and publication separate.
  • S013 · premise_and_result_audit — Reverse-check ORIGINAL inputs,types,domain and premises;the conclusion need not uniquely recover its premises.Keep source-bound candidates,independent review,formal proof and publication separate.
  • S012 · premise_and_result_audit — Reverse-check ORIGINAL inputs,types,domain and premises;the conclusion need not uniquely recover its premises.Keep source-bound candidates,independent review,formal proof and publication separate.
  • S011 · premise_and_result_audit — Reverse-check ORIGINAL inputs,types,domain and premises;the conclusion need not uniquely recover its premises.Keep source-bound candidates,independent review,formal proof and publication separate.
  • S010 · premise_and_result_audit — Reverse-check ORIGINAL inputs,types,domain and premises;the conclusion need not uniquely recover its premises.Keep source-bound candidates,independent review,formal proof and publication separate.
  • S009 · premise_and_result_audit — Reverse-check ORIGINAL inputs,types,domain and premises;the conclusion need not uniquely recover its premises.Keep source-bound candidates,independent review,formal proof and publication separate.
  • S008 · premise_and_result_audit — Reverse-check ORIGINAL inputs,types,domain and premises;the conclusion need not uniquely recover its premises.Keep source-bound candidates,independent review,formal proof and publication separate.
  • S007 · premise_and_result_audit — Reverse-check ORIGINAL inputs,types,domain and premises;the conclusion need not uniquely recover its premises.Keep source-bound candidates,independent review,formal proof and publication separate.
  • S006 · premise_and_result_audit — Reverse-check ORIGINAL inputs,types,domain and premises;the conclusion need not uniquely recover its premises.Keep source-bound candidates,independent review,formal proof and publication separate.
  • S005 · premise_and_result_audit — Reverse-check ORIGINAL inputs,types,domain and premises;the conclusion need not uniquely recover its premises.Keep source-bound candidates,independent review,formal proof and publication separate.
  • S004 · premise_and_result_audit — Reverse-check ORIGINAL inputs,types,domain and premises;the conclusion need not uniquely recover its premises.Keep source-bound candidates,independent review,formal proof and publication separate.
  • S003 · premise_and_result_audit — Reverse-check ORIGINAL inputs,types,domain and premises;the conclusion need not uniquely recover its premises.Keep source-bound candidates,independent review,formal proof and publication separate.
  • S002 · premise_and_result_audit — Reverse-check ORIGINAL inputs,types,domain and premises;the conclusion need not uniquely recover its premises.Keep source-bound candidates,independent review,formal proof and publication separate.
  • S001 · premise_and_result_audit — Reverse-check ORIGINAL inputs,types,domain and premises;the conclusion need not uniquely recover its premises.Keep source-bound candidates,independent review,formal proof and publication separate.

Result

No

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: a49b6356ceb5e8bca424ecd361ee515a086f0150c78c0061593e2155877fa5ea
  • candidate record SHA-256: 7e1f19903fe7fe1c7409c331e910e260dc46989636902117eb144726a2a3f3e2
  • semantic review receipt SHA-256: acf03b776f4855e3869810bcbecf1116e3a2b11dfb1e2a5dfbcf8135ad24a7d0
  • question-first witness SHA-256: eadbbac3220988b52754f32450fb536d627217306d1ce28a49134f56c21bfa88
  • Lean: NOT_RUN · human review: NOT_PERFORMED
Same-source full JSON