Explore related knowledge and questions →

Question 10207: Listing a Finite Function Graph

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 52

← Question derivation index · Original question batch

R0019-10207 · q-20261003-r06-function-graph-0057

Original question and givens

In a fixed Cartesian coordinate system, D={-6, -5, -4} and f:D→R is given by f(x)=(-1)x+(1). List the complete graph in increasing order of first coordinate, listing identical points once.

  • G001 — In a fixed Cartesian coordinate system, D={-6, -5, -4} and f:D→R is given by f(x)=(-1)x+(1). List the complete graph in increasing order of first coordinate, listing identical points once.

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

raw domain=[-6, -5, -4]

After

sorted distinct declared domain=[-6, -5, -4]

Conditions: none

The domain is the declared finite integer subset,not automatically all R.The input list must already be distinct.The first coordinate is input,the second output.

Step identifiers and dependencies

Rule: function_graph_declared_domain_scope · Uses: G001

S002 · calculation

Before

domain input-6 m*x := mul(-1, -6)

After

domain input-6 m*x = 6

Conditions: none

Compute exactly from this step's original operands in the specified order,retaining signs and denominator conditions.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S001

S003 · calculation

Before

domain input-6 m*x+b := sum(6, 1)

After

domain input-6 m*x+b = 7

Conditions: none

Compute exactly from this step's original operands in the specified order,retaining signs and denominator conditions.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S002

S004 · implies

Before

legal input=-6;formula value=7

After

graph point=(-6, 7)

Conditions: none

Evaluate once per legal input and list its ordered point without extending the graph outside its declared domain.

Step identifiers and dependencies

Rule: each_legal_affine_graph_point · Uses: G001, S003

S005 · calculation

Before

domain input-5 m*x := mul(-1, -5)

After

domain input-5 m*x = 5

Conditions: none

Compute exactly from this step's original operands in the specified order,retaining signs and denominator conditions.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S004

S006 · calculation

Before

domain input-5 m*x+b := sum(5, 1)

After

domain input-5 m*x+b = 6

Conditions: none

Compute exactly from this step's original operands in the specified order,retaining signs and denominator conditions.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S005

S007 · implies

Before

legal input=-5;formula value=6

After

graph point=(-5, 6)

Conditions: none

Evaluate once per legal input and list its ordered point without extending the graph outside its declared domain.

Step identifiers and dependencies

Rule: each_legal_affine_graph_point · Uses: G001, S006

S008 · calculation

Before

domain input-4 m*x := mul(-1, -4)

After

domain input-4 m*x = 4

Conditions: none

Compute exactly from this step's original operands in the specified order,retaining signs and denominator conditions.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S007

S009 · calculation

Before

domain input-4 m*x+b := sum(4, 1)

After

domain input-4 m*x+b = 5

Conditions: none

Compute exactly from this step's original operands in the specified order,retaining signs and denominator conditions.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S008

S010 · implies

Before

legal input=-4;formula value=5

After

graph point=(-4, 5)

Conditions: none

Evaluate once per legal input and list its ordered point without extending the graph outside its declared domain.

Step identifiers and dependencies

Rule: each_legal_affine_graph_point · Uses: G001, S009

S011 · implies

Before

complete legal-input points=[[-6, 7], [-5, 6], [-4, 5]]

After

finite graph={(-6, 7), (-5, 6), (-4, 5)}

Conditions: none

List the complete set in increasing first-coordinate order.An empty domain gives∅,not an invented(0,0).

Step identifiers and dependencies

Rule: complete_finite_graph_set · Uses: G001, S010

Reverse checks

  • S011 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S010 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S009 · premise_and_result_audit — Recompute domain input-4 m*x+b with exact rational arithmetic, not rounded decimals.
  • S008 · premise_and_result_audit — Recompute domain input-4 m*x with exact rational arithmetic, not rounded decimals.
  • 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 — Recompute domain input-5 m*x+b with exact rational arithmetic, not rounded decimals.
  • S005 · premise_and_result_audit — Recompute domain input-5 m*x with exact rational arithmetic, not rounded decimals.
  • 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 — Recompute domain input-6 m*x+b with exact rational arithmetic, not rounded decimals.
  • S002 · premise_and_result_audit — Recompute domain input-6 m*x with exact rational arithmetic, not rounded decimals.
  • 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, 7), (-5, 6), (-4, 5)}

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: 0509b6b75b2e45fff4675df30c988a8a38c1d58decc23023a041122f43f15d5b
  • candidate record SHA-256: b8116a21907bb4d937a86b2bd7032b08822e301e0df96e5b64dc9fd8f55a23ec
  • semantic review receipt SHA-256: eeb35dc5daab92234bf72827627392b47f38ead4cfb574d4373bebc43c09fbf5
  • question-first witness SHA-256: 3cf8e0d3a00b0df1994db2bfde81f4a31b382e170bdda83ea3d0b68da64e8419
  • Lean: NOT_RUN · human review: NOT_PERFORMED
Same-source full JSON