# Question 11311: Row-Stochastic Qualification before Any Markov Step

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

[← Question derivation index](https://ocme.evemisslab.com/en/questions/) · [Original question batch](https://ocme.evemisslab.com/en/practice/batch-20261013-advance-20261024-r03-finite-markov-chain-foundations/#q-20261013-advance-20261024-r03-finite-markov-chain-0011)

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.

R0021-11311 · q-20261013-advance-20261024-r03-finite-markov-chain-0011



## Original question and givens

Use one fixed finite time-homogeneous transition table=[[11/13, 2/13], [6/7, 1/7]]. Rows denote the current state and columns the next state; row entries must be nonnegative and sum exactly to 1 before stepping. State order stays fixed. Use exact rational arithmetic, reduce fractions to positive denominators and omit /1 for integer outputs. No stationary, irreducibility, ergodicity or long-term convergence claim follows. This qualification family also admits negative or non-unit-row candidate entries for rejection. Give (size,normalized transition table,all entries nonnegative?,exact row sums,row-stochastic?,rows=current state, columns=next state).


- G001 — Use one fixed finite time-homogeneous transition table=[[11/13, 2/13], [6/7, 1/7]]. Rows denote the current state and columns the next state; row entries must be nonnegative and sum exactly to 1 before stepping. State order stays fixed. Use exact rational arithmetic, reduce fractions to positive denominators and omit /1 for integer outputs. No stationary, irreducibility, ergodicity or long-term convergence claim follows. This qualification family also admits negative or non-unit-row candidate entries for rejection. Give (size,normalized transition table,all entries nonnegative?,exact row sums,row-stochastic?,rows=current state, columns=next state).





## 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-finite-markov-chain](https://ocme.evemisslab.com/en/mko/mko-finite-markov-chain/)





## Step-by-step derivation

S001 · impliesBefore

transition row0:raw rational pairs=[[11, 13], [2, 13]]

After

transition row0:normalized=[11/13, 2/13]

Conditions: none

Every original denominator must be nonzero.Reduce fractions to positive denominators without decimal approximation.

Step identifiers and dependenciesRule: exact_weight_normalization · Uses: G001





S002 · calculationBefore

transition row0 total := sum(11/13, 2/13)

After

transition row0 total = 1

Conditions: none

Compute exactly with this step's specified roles,retaining signs,denominators and original pairings.

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





S003 · impliesBefore

transition row0:weights=[11/13, 2/13];sum=1

After

nonnegative=Yes;total_one=Yes;qualified=Yes

Conditions: none

Check nonnegativity and exact total one separately.Zero weights are allowed;negative weights or near-one totals are not repaired.

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





S004 · impliesBefore

transition row1:raw rational pairs=[[6, 7], [1, 7]]

After

transition row1:normalized=[6/7, 1/7]

Conditions: none

Every original denominator must be nonzero.Reduce fractions to positive denominators without decimal approximation.

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





S005 · calculationBefore

transition row1 total := sum(6/7, 1/7)

After

transition row1 total = 1

Conditions: none

Compute exactly with this step's specified roles,retaining signs,denominators and original pairings.

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





S006 · impliesBefore

transition row1:weights=[6/7, 1/7];sum=1

After

nonnegative=Yes;total_one=Yes;qualified=Yes

Conditions: none

Check nonnegativity and exact total one separately.Zero weights are allowed;negative weights or near-one totals are not repaired.

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





S007 · impliesBefore

complete transition matrix=[[11/13, 2/13], [6/7, 1/7]];row sums=[1, 1]

After

nonnegative=Yes;row_stochastic=Yes;rows=current state, columns=next state

Conditions: none

Every complete row must be nonnegative with exact sum1;column sums are not the convention.This fixed time-homogeneous Markov model gives no stationary,ergodic or long-term convergence theorem.

Step identifiers and dependenciesRule: whole_row_stochastic_kernel_convention · 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 — Recompute transition row1 total 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 — Check against the original data and this step's premises; a one-way implication is not an equivalence.
- S002 · premise_and_result_audit — Recompute transition row0 total 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

(2, [[11/13, 2/13], [6/7, 1/7]], Yes, [1, 1], Yes, rows=current state, columns=next state)

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: 24e625cae45ccb56ce3e2edc691ba3a745141d2f2ae94be4c2f153b18c863f3c
- candidate record SHA-256: 1bc23bdc485048f534321df60d2d5fad3e327d46959e406eb0b54646c154d115
- semantic review receipt SHA-256: 47d23d3735987d68e27733b051bdfa80a3616d44fb223b82bf2e6c8e46d49258
- question-first witness SHA-256: a857db558000724020d2d5e815cb6bc3e2c9e2933df295bf33eb478d3c695139
- Lean: NOT_RUN · human review: NOT_PERFORMED

[Same-source full JSON](https://ocme.evemisslab.com/data/question-derivations/questions/q-20261013-advance-20261024-r03-finite-markov-chain-0011.json)




