# Question 12826: A Space-Wide Certificate Is Not a List of Successful Sequences

[Return to catalogue page 65](https://ocme.evemisslab.com/en/questions/page/65/)

[← Question derivation index](https://ocme.evemisslab.com/en/questions/) · [Original question batch](https://ocme.evemisslab.com/en/practice/batch-20261014-advance-20261027-r03-complete-metric-space-foundations/#q-20261014-advance-20261027-r03-complete-metric-space-0076)

This teaching derivation has second-context AI mathematical and bilingual semantic review, limited to the model and assumptions stated in this question. It has no human review or new Lean proof and does not promote the original question or MKO to Canonical truth.

R0024-12826 · q-20261014-advance-20261027-r03-complete-metric-space-0076



## Original question and givens

Use the complete qualified finite metric table=[[0, 3, 4, 5], [3, 0, 5, 6], [4, 5, 0, 7], [5, 6, 7, 0]] on Fin(4)={0,…,3}, with at least two points for this minimum-positive-distance protocol. Completeness quantifies over every Cauchy sequence and requires a limit in this same space, not merely an ambient space. Testing finitely many sequences or terms is insufficient. evidence_mode=sampled_sequences. Give (n,min_positive_distance,evidence_mode,sufficient?,boundary). finite_minimum_separation yields universal_finite_certificate; sampled_sequences yields sampled_sequences_insufficient.


- G001 — Use the complete qualified finite metric table=[[0, 3, 4, 5], [3, 0, 5, 6], [4, 5, 0, 7], [5, 6, 7, 0]] on Fin(4)={0,…,3}, with at least two points for this minimum-positive-distance protocol. Completeness quantifies over every Cauchy sequence and requires a limit in this same space, not merely an ambient space. Testing finitely many sequences or terms is insufficient. evidence_mode=sampled_sequences. Give (n,min_positive_distance,evidence_mode,sufficient?,boundary). finite_minimum_separation yields universal_finite_certificate; sampled_sequences yields sampled_sequences_insufficient.





## 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.


- [mko-complete-metric-space](https://ocme.evemisslab.com/en/mko/mko-complete-metric-space/)





## Step-by-step derivation

S001 · impliesBefore

carrier Fin(4);complete nonnegative integer metric candidate=[[0, 3, 4, 5], [3, 0, 5, 6], [4, 5, 0, 7], [5, 6, 7, 0]]

After

zero iff equal=Yes;symmetric=Yes

Conditions: none

First qualify nonnegativity,diagonal/off-diagonal separation and symmetry on the entire table,not only queried cells.At least two points is a premise of this minimum-positive-distance protocol,not a claim that a singleton is incomplete.

Step identifiers and dependenciesRule: complete_metric_separation_and_symmetry · Uses: G001





S002 · impliesBefore

endpoints=[0, 0];direct distance=0;all intermediate labels=[0, 1, 2, 3]

After

all two-leg distances=[0, 6, 8, 10];direct<=every two-leg=Yes

Conditions: none

For each ordered endpoint pair inspect every intermediate point.All triangle obligations must hold;this complete finite audit is not a few sampled triangles.

Step identifiers and dependenciesRule: complete_metric_all_triangle_intermediates · Uses: G001, S001





S003 · impliesBefore

endpoints=[0, 1];direct distance=3;all intermediate labels=[0, 1, 2, 3]

After

all two-leg distances=[3, 3, 9, 11];direct<=every two-leg=Yes

Conditions: none

For each ordered endpoint pair inspect every intermediate point.All triangle obligations must hold;this complete finite audit is not a few sampled triangles.

Step identifiers and dependenciesRule: complete_metric_all_triangle_intermediates · Uses: G001, S002





S004 · impliesBefore

endpoints=[0, 2];direct distance=4;all intermediate labels=[0, 1, 2, 3]

After

all two-leg distances=[4, 8, 4, 12];direct<=every two-leg=Yes

Conditions: none

For each ordered endpoint pair inspect every intermediate point.All triangle obligations must hold;this complete finite audit is not a few sampled triangles.

Step identifiers and dependenciesRule: complete_metric_all_triangle_intermediates · Uses: G001, S003





S005 · impliesBefore

endpoints=[0, 3];direct distance=5;all intermediate labels=[0, 1, 2, 3]

After

all two-leg distances=[5, 9, 11, 5];direct<=every two-leg=Yes

Conditions: none

For each ordered endpoint pair inspect every intermediate point.All triangle obligations must hold;this complete finite audit is not a few sampled triangles.

Step identifiers and dependenciesRule: complete_metric_all_triangle_intermediates · Uses: G001, S004





S006 · impliesBefore

endpoints=[1, 0];direct distance=3;all intermediate labels=[0, 1, 2, 3]

After

all two-leg distances=[3, 3, 9, 11];direct<=every two-leg=Yes

Conditions: none

For each ordered endpoint pair inspect every intermediate point.All triangle obligations must hold;this complete finite audit is not a few sampled triangles.

Step identifiers and dependenciesRule: complete_metric_all_triangle_intermediates · Uses: G001, S005





S007 · impliesBefore

endpoints=[1, 1];direct distance=0;all intermediate labels=[0, 1, 2, 3]

After

all two-leg distances=[6, 0, 10, 12];direct<=every two-leg=Yes

Conditions: none

For each ordered endpoint pair inspect every intermediate point.All triangle obligations must hold;this complete finite audit is not a few sampled triangles.

Step identifiers and dependenciesRule: complete_metric_all_triangle_intermediates · Uses: G001, S006





S008 · impliesBefore

endpoints=[1, 2];direct distance=5;all intermediate labels=[0, 1, 2, 3]

After

all two-leg distances=[7, 5, 5, 13];direct<=every two-leg=Yes

Conditions: none

For each ordered endpoint pair inspect every intermediate point.All triangle obligations must hold;this complete finite audit is not a few sampled triangles.

Step identifiers and dependenciesRule: complete_metric_all_triangle_intermediates · Uses: G001, S007





S009 · impliesBefore

endpoints=[1, 3];direct distance=6;all intermediate labels=[0, 1, 2, 3]

After

all two-leg distances=[8, 6, 12, 6];direct<=every two-leg=Yes

Conditions: none

For each ordered endpoint pair inspect every intermediate point.All triangle obligations must hold;this complete finite audit is not a few sampled triangles.

Step identifiers and dependenciesRule: complete_metric_all_triangle_intermediates · Uses: G001, S008





S010 · impliesBefore

endpoints=[2, 0];direct distance=4;all intermediate labels=[0, 1, 2, 3]

After

all two-leg distances=[4, 8, 4, 12];direct<=every two-leg=Yes

Conditions: none

For each ordered endpoint pair inspect every intermediate point.All triangle obligations must hold;this complete finite audit is not a few sampled triangles.

Step identifiers and dependenciesRule: complete_metric_all_triangle_intermediates · Uses: G001, S009





S011 · impliesBefore

endpoints=[2, 1];direct distance=5;all intermediate labels=[0, 1, 2, 3]

After

all two-leg distances=[7, 5, 5, 13];direct<=every two-leg=Yes

Conditions: none

For each ordered endpoint pair inspect every intermediate point.All triangle obligations must hold;this complete finite audit is not a few sampled triangles.

Step identifiers and dependenciesRule: complete_metric_all_triangle_intermediates · Uses: G001, S010





S012 · impliesBefore

endpoints=[2, 2];direct distance=0;all intermediate labels=[0, 1, 2, 3]

After

all two-leg distances=[8, 10, 0, 14];direct<=every two-leg=Yes

Conditions: none

For each ordered endpoint pair inspect every intermediate point.All triangle obligations must hold;this complete finite audit is not a few sampled triangles.

Step identifiers and dependenciesRule: complete_metric_all_triangle_intermediates · Uses: G001, S011





S013 · impliesBefore

endpoints=[2, 3];direct distance=7;all intermediate labels=[0, 1, 2, 3]

After

all two-leg distances=[9, 11, 7, 7];direct<=every two-leg=Yes

Conditions: none

For each ordered endpoint pair inspect every intermediate point.All triangle obligations must hold;this complete finite audit is not a few sampled triangles.

Step identifiers and dependenciesRule: complete_metric_all_triangle_intermediates · Uses: G001, S012





S014 · impliesBefore

endpoints=[3, 0];direct distance=5;all intermediate labels=[0, 1, 2, 3]

After

all two-leg distances=[5, 9, 11, 5];direct<=every two-leg=Yes

Conditions: none

For each ordered endpoint pair inspect every intermediate point.All triangle obligations must hold;this complete finite audit is not a few sampled triangles.

Step identifiers and dependenciesRule: complete_metric_all_triangle_intermediates · Uses: G001, S013





S015 · impliesBefore

endpoints=[3, 1];direct distance=6;all intermediate labels=[0, 1, 2, 3]

After

all two-leg distances=[8, 6, 12, 6];direct<=every two-leg=Yes

Conditions: none

For each ordered endpoint pair inspect every intermediate point.All triangle obligations must hold;this complete finite audit is not a few sampled triangles.

Step identifiers and dependenciesRule: complete_metric_all_triangle_intermediates · Uses: G001, S014





S016 · impliesBefore

endpoints=[3, 2];direct distance=7;all intermediate labels=[0, 1, 2, 3]

After

all two-leg distances=[9, 11, 7, 7];direct<=every two-leg=Yes

Conditions: none

For each ordered endpoint pair inspect every intermediate point.All triangle obligations must hold;this complete finite audit is not a few sampled triangles.

Step identifiers and dependenciesRule: complete_metric_all_triangle_intermediates · Uses: G001, S015





S017 · impliesBefore

endpoints=[3, 3];direct distance=0;all intermediate labels=[0, 1, 2, 3]

After

all two-leg distances=[10, 12, 14, 0];direct<=every two-leg=Yes

Conditions: none

For each ordered endpoint pair inspect every intermediate point.All triangle obligations must hold;this complete finite audit is not a few sampled triangles.

Step identifiers and dependenciesRule: complete_metric_all_triangle_intermediates · Uses: G001, S016





S018 · impliesBefore

all off-diagonal positive distances=[3, 4, 5, 3, 5, 6, 4, 5, 7, 5, 6, 7]

After

minimum positive distance delta=3>0

Conditions: none

A finite nonempty list of positive distances has a positive minimum.This is the space-wide scale for the universal Cauchy certificate,not a threshold guessed from a sequence.

Step identifiers and dependenciesRule: finite_metric_positive_minimum_separation · Uses: G001, S017





S019 · impliesBefore

qualified finite metric;delta=3;selected evidence mode=sampled_sequences

After

selected evidence sufficient=No;space completeness is not denied by sample insufficiency

Conditions: none

Minimum separation covers every Cauchy sequence;finite samples do not provide that quantifier coverage.No in sample mode means insufficient evidence,not that this qualified finite space is incomplete.

Step identifiers and dependenciesRule: complete_evidence_mode_not_truth_of_incompleteness · Uses: G001, S018









## Reverse checks


- S019 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
- S018 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
- S017 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
- S016 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
- S015 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
- S014 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
- S013 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
- S012 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
- 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 — Check against the original data and this step's premises; a one-way implication is not an equivalence.
- S008 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
- 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

(4, 3, sampled_sequences, No, sampled_sequences_insufficient)

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: 0f2498d5b43127d1649e6abfcb0015608eed139e8328362ce1a042267468a827
- candidate record SHA-256: d1a92dc7a571efc3dba84f36d92751e15f06447a54e19064b929fedbf75d5344
- semantic review receipt SHA-256: 1c8f6c2c6c75852cb93c08235684ce9f32ebe86065c58c693a04257e772c2d35
- question-first witness SHA-256: 05fd764b5f9f7fff6185003efe576d87632f6daf40606ac3839a7feafe4f80d8
- Lean: NOT_RUN · human review: NOT_PERFORMED

[Same-source full JSON](https://ocme.evemisslab.com/data/question-derivations/questions/q-20261014-advance-20261027-r03-complete-metric-space-0076.json)




