physics.soc-phJun 10, 2026

A Mathematical Theory of Value: a synthesis on goal-directed agency under resource constraints

Authors: Cheng Qian

Abstract

We propose that value -- the quantity goal-directed agents create, destroy, and exchange -- is a lawful structural quantity in the same category as information. Following Shannon's method, we make one ruthless abstraction: value is the rate at which an agent converts a resource into goal-progress, relative to a frame fixed by its goal. A scale-invariance axiom forces a logarithmic measure, V=ikilneiV=\sum_i k_i\ln e_i; compounding of a reinvested resource forces the same form via the ergodicity argument of Peters (2019) -- kin routes, a consistency check, not an over-determination. We derive a coding theorem of value, ΔGI(X;Y)ΔG \le I(X;Y); realized value decomposes as G=D(qr)D(qp)G=D(q\|r)-D(q\|p). For populations, value is frame-relative while price is frame-independent; a fleet that pools its resource and fuses its perception inherits the ceiling GfleetI(X;Y1:m)H(X)G_{\rm fleet}\le I(X;Y_{1:m})\le H(X) (a corollary; an earlier sum-form claim was wrong and is corrected in v5). A dynamical layer yields an is/ought asymmetry from which alignment emerges as a control-stability condition. We test the single-frame laws on live language models, pre-registered: perception mutual information tracks realized capability (Spearman ρ=0.977ρ=0.977 over 30 model×\timesdomain points); out-of-sample ΔGΔG tracks I(X;Y)I(X;Y), shape-invariant across four task shapes (n=42n=42, slope 0.9530.953); over-confidence is measurable dissipation. The stated continuation gate has since been run (pre-registered, frontier-model population): the coupled capacity-region prediction -- growth-gap law, coalition submodularity with an XOR synergy control, joint ceiling, Kelly selection -- is confirmed within its frozen bands on real agents; the mean-field residual law Vg/γ\|Vg\|/γ found no domain (populations hold no goal dispersion) and is retired to its mathematical scope. The contribution is the unification and the governance mapping that follows.

Explore similar work

Jul 7, 2026cs.AI

Information Limits and Attractor Dynamics in Economies of Frontier LLM Agents: A Pre-Registered Test

We report a pre-registered, two-part experiment on small economies of frontier language-model agents (Claude Opus 4.8), testing two quantitative predictions about coupled multi-agent systems: an information-theoretic capacity region for wealth growth under market coupling, and a mean-field residual-scaling law for population misalignment under incentive and control levers. All predictions, acceptance bands, and decision rules were frozen in a public git chain before any run; every reported number re-derives mechanically from cached model outputs; the entire experiment cost $138.76 in metered API spend and is re-runnable at zero cost from the cache. Result 1 (confirmation): in parimutuel-coupled economies, relative growth equals relative claimed information -- the gap law G_a - G_b = I_a - I_b holds to a worst-case 46 millinats (pre-registered band: 50) across four perception structures; coalition value is submodular exactly where channels are conditionally independent, and a designed XOR synergy control flips it supermodular by 0.62 >= ln2/2 nats, with agents reasoning out the joint bit; the joint growth ceiling G_S <= H(X) binds exactly; and the best-informed agent absorbs essentially the whole wealth pool in 4/5 market seeds. Result 2 (structural negative): the residual-scaling test returned "domain not found." In all 72 population runs, goal dispersion collapsed (V -> 0; maximum 4.85 against a frozen floor of 5.31), the population's response to the two levers was a step function across the dominance boundary rather than a smooth response, and cells near the boundary were bistable with seed-selected outcomes. No tested LLM population at any capability level realizes the noise-maintained-dispersion regime the smooth mean-field model assumes. We release the full protocol, pre-registration chain, call cache, and analysis code.
Cheng Qian
Sep 10, 2026cs.IT

A Mathematical Theory of Pragmatic Information

We propose a mathematical theory of pragmatic information that connects communication, control, and decision-making. Its central notion is the isoteleia mapping, which formalizes equifinality: distinct semantic paths that lead to the same optimal action are treated as pragmatically equivalent. This mapping yields a three-tier hierarchy of syntactic, semantic, and pragmatic information, in which each successive abstraction removes distinctions that are irrelevant to the task. We then define pragmatic entropy, up/down pragmatic mutual information, channel capacity, and rate-distortion, and prove lossless source coding, channel coding, and rate-distortion theorems that extend Shannon's results. These measures quantify decision uncertainty, reliable transmission, and task-oriented compression at the level of terminal actions. We further introduce pragmatic value of information (VoI) and pragmatic cost of information (CoI) as decision-theoretic duals to rate-distortion and capacity, and develop a Lagrangian dual framework for cross-layer optimization. The resulting pragmatic efficiency bound Ep(λ)=supR[Φp(R)λCoIp(R)]\mathcal{E}_p(λ)=\sup_R[Φ_p(R)-λ\mathrm{CoI}_p(R)] characterizes the maximum net utility attainable by a resource-constrained intelligent system under a given resource price, yielding a behavioral capacity that extends Shannon's symbol-level capacity to goal-directed action. Extensions to continuous messages provide closed-form expressions for Gaussian channels and sources, while dynamic settings are addressed through a Bellman equation for sequential decision-making. The framework supports task-oriented communication, networked control, autonomous systems, and embodied AI by shifting emphasis from symbol fidelity to the effectiveness of information in guiding actions. In this way, it offers a common language for systems that extract value from information under resource constraints.
Kai Niu, Ping Zhang
Aug 13, 2026cond-mat.stat-mech

Thermodynamics of Learning: A Typed Four-Component Accounting of Memory, Fit, and Value

What a finite learning device has recorded and what will hold value for it on future tasks are not the same quantity. We develop a typed accounting for finite-state learning devices that separates four components: a training-side fit functional ΦfitΦ_{\mathrm{fit}}, the record-correlation stock JD=I(M;D)J_{D}=I(M;D), an update-side search ledger σMσ_{M}, and an operational capital value V(M;T,b)V(M;T,b). This value is the work gap between an informed protocol class and a blind class obtained by deleting the memory-read port and re-optimizing from scratch. (I) Separation: for every nn, there is a device family on which record correlation and world correlation grow by nln2n\ln 2 while the capital gain is exactly zero. In the flat\mathrm{flat}^{*} regime, data-free updates never increase VV. (II) Capitalization ledger: an exact flat\mathrm{flat}^{*} extraction identity and a universal ledger identity give, for (F5')-stable MM-local updates under a no-discarded-record-correlation condition (f), the bound ηcap1η_{\mathrm{cap}}\le 1 for the capitalization efficiency ηcap=ΔV/(kTσM)η_{\mathrm{cap}}=ΔV/(k T\,σ_{M}), together with necessary and sufficient conditions for equality. (III) Value retention: for the retention gap LgenL_{\mathrm{gen}} and retention ratio ρgenρ_{\mathrm{gen}} (the former carries no sign constraint; the latter is defined for positive training-side value and is not confined to [0,1][0,1]) we give a two-layer alignment domain: an exact exchange rate between value and the side-information-adjusted record fit I(M;DY)I(M';D\mid Y) without any record-side-information independence assumption, and a raw record-stock exchange rate under a joint side-information neutrality condition (M,D)Y(M,D)\perp Y, whose boundary is marked by an explicit one-time-pad witness. These are statements about finite-device value retention under task-distribution shift, not a theory of statistical generalization.
Akihito Sudo