Lemma 5.4 — Markov-chain recovery
ProvedSecondBestTrade.HalfEfficiency.markov_recoveryFix a useful dual. For each buyer and seller , let be its constructed generator and let be its true and virtual coordinate matrices. Then , is invertible, and
The matrices form a continuous stochastic semigroup and are the transition matrices of a finite-state continuous-time Markov chain from each initial support type. Every row is a probability distribution. Stopping independently at a rate-one exponential time gives row as the terminal law. For every incident coordinate ,
The resolvent entries and exponential-weighted virtual-coordinate expectations are integrable. The conclusion applies to every buyer and every seller, with the same generator acting on all coordinates of an agent.
This recovers entire multidimensional types and includes the chain and terminal-law interpretation as well as the algebraic identity.
Differences from the source:
- encoding: finite agent, trade and support sets with product-prior expectations → Fin labels, an injective nonnegative-vector support embedding, and finite product-weighted sums; reason: bijections cover every finite source market, and summing an overwritten own coordinate multiplies by its total probability one
- encoding: matrix integral, independently exponentially stopped chain, and vector recovery using (5.8) → entrywise integrable density integrals, finite-dimensional chain laws on a probability space, stochastic continuous semigroup, and coordinatewise recovery with zero extension outside incident trades; reason: rate-one stopping has density exp(-theta); finite coordinates give the same integral, law and vector identities; (5.8) is written explicitly and no recovery is assumed
import Mathlib import Definitions.Def_SecondBestTrade_HalfEfficiency_Recovery open scoped BigOperators NNReal open MeasureTheory set_option autoImplicit false noncomputable section
namespace SecondBestTrade.HalfEfficiency
/-- Lemma 5.4, printed p. 10 (PDF p. 11), with both sides and every coordinate. -/
theorem markov_recovery (N : Market) (z : Dual N) (hz : useful N z) :
∀ a : Agent N,
(∀ t e, virtual N z a t e = ∑ s,
(1 - generator N z a) t s * coord N a s e) ∧
recoveryProperties (generator N z a) (coord N a) (virtual N z a) := by sorry
end SecondBestTrade.HalfEfficiency
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.