Theorem 11.4.2 — evaluation equation identifies the gain
DisprovedPutermanMDP.SemiMarkov.evaluation_identifies_gainLet be nonempty and countable, and fix a stationary randomized rule . Assume that its embedded chain is unichain, its Cesaro limit is a probability matrix, and Assumption 11.1.1 holds. The finite-epoch reward and time expectations are finite. If a real constant and a real function satisfy
with each transition expectation of absolutely convergent, then
This is the printed gain-identification assertion. The statement deliberately retains an arbitrary, possibly unbounded ; finding F1 and its draft verification F4 show that this literal formulation is false.
Formalization Note The finite-moment predicates specify the real-expectation domain. They do not impose invariant integrability or boundedness of . The extended gain is asserted equal to the real scalar .
import Definitions.Def_PutermanMDP_SemiMarkov_Stationary
namespace PutermanMDP.SemiMarkov
theorem evaluation_identifies_gain {S : Type*} [Countable S] [Nonempty S]
(M : Model S) (d : Rule M) (hNE : Nonexplosive M)
(hU : Unichain M d) (hP : CesaroProbability M d)
(hE : FiniteEpochMoments M d)
(g : ℝ) (h : S → ℝ) (hEq : EvaluationEquation M d (fun _ => g) h) :
∀ s, gain M d s = (g : EReal) := by sorry
end PutermanMDP.SemiMarkov
Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
Setting. is a state space: any type that is countable (finite or countably infinite) and nonempty. Its countability and nonemptiness are the only structural assumptions. is an object of type Model over , and is an object of type Rule for . The names suggest a semi-Markov decision model and a decision rule, but this code does not show what either type contains: both are defined in the imported file Definitions.Def_PutermanMDP_SemiMarkov_Stationary, which is not reproduced here.
Hypotheses. Five named conditions are assumed. Each one is a predicate defined in the same imported file, and this read-back does not unfold any of them.
- is a condition on the model alone.
- is a condition on the model together with the rule .
- is a condition on the model together with the rule .
- is a condition on the model together with the rule .
- Fix a real number and a real-valued function . The pair satisfies , where is the constant function for every state . In other words, the "gain" argument of the evaluation equation is a constant vector with value . Nothing further is assumed about : it may be unbounded, and it has no normalisation.
Conclusion. For every state ,
where is the quantity gain M d s defined in the imported file. That quantity takes values in the extended reals , and is viewed there as a finite extended real. So the statement says three things together:
- the gain is finite at every state;
- the gain is the same at every state;
- the gain equals the constant that appears in the evaluation equation.
Degenerate cases. cannot be empty, but it may have exactly one element. In that case the conclusion is the single equation at the only state . Because gain is -valued, the conclusion rules out the values whenever the hypotheses hold. If the five hypotheses can never hold together for any and , or if no pair satisfies the evaluation equation, then the theorem is vacuously true. Whether either happens depends on the imported definitions, which this code does not show.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.