Finite consequences and counterexamples [ftip-00JE]
✍️source

    Finite sampling, reward information, and deterministic execution give conditional conclusions about post-training. Their counterexamples show why the task law, feasible set, and available information cannot be omitted.

    This synthesis brings together the finite results used in the evaluation analysis. The conceptual-discovery chapter asks whether such arguments can constrain a complete learning lineage, including changes to representations, curricula and research procedures.

    1. Probability, information, and execution [ftip-00I1]

      Discovery probabilities, support, proxy error, feedback resolution, and replay each constrain a different part of a comparison. Capability remains conditional behavior under a declared intervention and evaluation law, rather than a scalar latent property.

      1.1. Finite probability and execution results [ftip-00I2]

        The conclusions depend on their declared probability laws, finite index sets, positivity conditions, and execution inputs. Changing one of these assumptions can change the result even when the observed score is unchanged.

        Convention 1.1.1. Domains of the finite results [ftip-00I5]

          Each result concerns its declared carriers \(X_1,\ldots ,X_n\), with fixed equality and order conventions. Finiteness, probability laws, and positivity conditions are hypotheses of the result; they cannot be inferred from a finite observation alone.

          Theorem 1.1.2. Independent discovery probability [ftip-00I7]

            For \(B\in \mathbb N\) independent discovery events with the probabilities declared in Convention [ftip-0077], the identity in Theorem [ftip-0078] gives \(\Pr (D_B)=1-\prod _{i=1}^{B}(1-p_i)\).

            Theorem 1.1.3. Discovery budget for a failure threshold [ftip-00I8]

              Under \(0<p<1\), \(0<\delta <1\), and an integer budget \(B\geq 1\), the failure constraint is equivalent to the following bound.

              \[B\geq \left \lceil \frac {\log \delta }{\log (1-p)}\right \rceil .\]

              The result is proved in Corollary [ftip-0079].

              Theorem 1.1.4. Support under finite exponential tilting [ftip-00I9]

                Under the finite-carrier and positive-temperature hypotheses of Theorem [ftip-007C], normalized exponential tilting preserves the base law's positive support.

                Theorem 1.1.5. Uniform proxy error and objective regret [ftip-00IA]

                  For a finite common feasible set and a common regularizer, the uniform proxy error hypothesis in Definition [ftip-007G] yields the two-epsilon objective regret bound proved in Theorem [ftip-007H]; the conclusion concerns the regularized objective named there.

                  Theorem 1.1.6. Utility under a change of evaluation law [ftip-00IB]

                    If the evaluation laws and finite response space satisfy the total-variation hypotheses of Theorem [ftip-00GM], then the expectation difference is bounded by the stated sup-norm times total variation.

                    Theorem 1.1.7. Response classes under feedback refinement [ftip-00IC]

                      For finite response set \(\mathcal Y\) and deterministic rewards, a reward channel that refines the equality partition of another channel separates at least as many response classes, as proved in Lemma [ftip-00AG].

                      Theorem 1.1.8. Equal execution inputs give equal replay traces [ftip-00IJ]

                        If the execution map is deterministic in all coordinates fixed by Definition [ftip-00HF], then equal input, revision, environment, and seed records produce equal finite traces, as proved in Theorem [ftip-00HG].

                        Theorem 1.1.9. Observational equivalence under a common update kernel [ftip-00IK]

                          For the finite transcript and world kernels declared in Definition [ftip-008C]--Definition [ftip-008D], observationally equivalent worlds induce the same output law for any common randomized post-training kernel, as proved in Theorem [ftip-007S].

                          Theorem 1.1.10. Conditions for an admissible commit decision [ftip-00IL]

                            Under the typed audit record of Definition [ftip-00HL], a commit is admissible exactly when all required checks pass, the digest matches, and the recorded decision is \(commit\), as proved in Theorem [ftip-00HM].

                            Theorem 1.1.11. Admission of a finite audit plan [ftip-00IM]

                              A finite audit plan with nonnegative stage costs is admissible exactly when its declared additive cost is within budget; adding a positive stage beyond slack is inadmissible, by Theorem [ftip-00HX].

                              1.2. Counterexamples and restricted assumptions [ftip-00ID]

                                Finite constructions can separate average success from coverage, proxy accuracy from evaluation quality, and observed gradients from the hypotheses needed to bound them. Each separation identifies an assumption that a stronger conclusion would require.

                                Remark 1.2.1. What a finite counterexample establishes [ftip-00IE]

                                  A finite assignment satisfying a claim's hypotheses and violating its conclusion disproves that universal claim. It does not estimate how often the failure occurs under another distribution or establish a general failure rate.

                                  Remark 1.2.2. Changing the model or evaluation changes the claim [ftip-00IF]

                                    A conclusion about fixed carriers, policies, feedback, budgets, and evaluation laws need not survive a change to those objects. Finite zero hits do not imply zero support, empirical benchmark movement does not imply acquisition, and an exact-optimizer result need not hold for an approximate optimizer without an additional error bound.

                                    Example 1.2.3. Equal averages and zero hits do not identify coverage [ftip-00IG]

                                      The two-task examples in Example [ftip-007E] and Example [ftip-00A3] show that equal one-shot averages or zero observed hits can coexist with different coverage or nonzero latent rates. These conclusions use their declared iid model and do not estimate rates outside it.

                                      Example 1.2.4. Small training-law error can reverse evaluation selection [ftip-00IH]

                                        In the two-point construction of Example [ftip-007J], training-law average error is small while evaluation selection reverses. The missing hypothesis is a uniform bound on the evaluated feasible set; an informal promise of similar distributions does not supply it.

                                        Remark 1.2.5. Untied heads, shared gradients, and checkpoint forecasts [ftip-00II]

                                          For DGG, the untied head identity and its finite-batch Jensen bound in Theorem [ftip-007Z] and Theorem [ftip-0081] differ from an intermediate-occurrence bound. A shared intermediate weight requires the sum over all occurrences in Theorem [ftip-007Z]; the source's local hypotheses do not establish its claimed total-gradient bound in [miao2026when, Section 4.2.1, Lemma 1, Theorem 1, and Appendix A.3]. The cancellation example Example [ftip-0084] also separates the active clipping interval from the raw-surrogate extension.

                                          NExt's empirical checkpoint forecasts in [chen2026lowrank, Sections 3.2, 4.1--4.3, and 5.1] do not establish a universal subspace-collapse, capability, or speed theorem. The spectral and evaluation quantities in Definition [ftip-0086] through Remark [ftip-008B] measure different trajectory properties.

                                          1.3. Mathematical notation [ftip-00IN]

                                            Prompt and response spaces, probability laws, policies, rewards, evaluation scores, and execution traces are distinct mathematical objects.

                                            Convention 1.3.1. Prompt spaces, response spaces, and laws [ftip-00IO]

                                              Use \(\mathcal X\) for prompts, \(\mathcal Y\) for finite responses, \(\Omega \) for sample space, \(\mathsf P\) for a declared protocol, and \(\mu \) for a prompt law. A probability law is written \(\Pr \) only after its sample space is named.

                                              Convention 1.3.2. Policies and reference policies [ftip-00IP]

                                                Use \(\pi \) for a policy, \(\pi _{\rm base}\) for a reference policy, and \(\pi _\theta \) for a parameterized policy. A policy is always typed as a kernel from the declared prompt carrier to the declared response carrier.

                                                Convention 1.3.3. Rewards and evaluation utilities [ftip-00IQ]

                                                  Use \(r:\mathcal X\times \mathcal Y\to \mathbb R\) for a deterministic reward and \(u\) for an evaluation utility. Proxy, verifier, and process rewards retain their local subscripts; no bare symbol silently changes meaning.

                                                  Convention 1.3.4. Model artifacts and evaluation scores [ftip-00IR]

                                                    Use \(M\) for a model artifact, \(\mathsf E\) for an evaluation protocol, and \(J_{\mathsf E}(M)\) for its declared score. A comparison must state the invariant evaluation law before subtracting two scores.

                                                    Convention 1.3.5. Traces, states, lineages, and costs [ftip-00IS]

                                                      Use \(z_{0:n}\) for a finite trace, \(s_t\) for a harness state, \(\ell \) for a lineage, and \(c\) for an execution cost. Event logs and summaries are distinct carriers even when one is computed from the other.

                                                      References

                                                        Reference. Low-rank optimization trajectories modeling for LLM RLVR acceleration [chen2026lowrank]

                                                        @article{chen2026lowrank,
  title = {Low-rank Optimization Trajectories Modeling for LLM RLVR Acceleration},
  author = {Chen, Zhipeng and Qian, Tao and Zhao, Wayne Xin and Wen, Ji-Rong},
  year = {2026},
  url = {https://arxiv.org/abs/2604.11446},
  journal = {arXiv preprint arXiv:2604.11446}
}

                                                        Reference. When to stop reusing: Dynamic gradient gating for sample-efficient RLVR [miao2026when]

                                                        @article{miao2026when,
  title = {When to Stop Reusing: Dynamic Gradient Gating for Sample-Efficient RLVR},
  author = {Miao, Yuchun and Zhang, Sen and Zhang, Yuqi and Shi, Yaorui and Gu, Qi and Cai, Xunliang and Zhang, Lefei},
  year = {2026},
  url = {https://arxiv.org/abs/2605.19425},
  journal = {arXiv preprint arXiv:2605.19425}
}

                                                        Context

                                                          Evaluation, evidence, and finite limits [ftip-00JB]

                                                            The training and agent mechanisms described earlier produce an artifact whose capability must be evaluated under a declared task law, inference procedure and resource account. This chapter fixes that comparison, studies what survives a change of evaluation, and examines discovery probabilities, support, proxy error and the information available through feedback.

                                                            Finite results and counterexamples establish consequences under specific probability laws and computational assumptions. They provide tools for the model-lineage question, where their assumptions must cover an evolving research and training process. The architecture analysis uses the same evaluation framework for comparisons that depend on a model implementation or optimizer.

                                                            Independent evaluation and post-training potential [ftip-005C]

                                                              A training score cannot by itself answer how much reliable capability was obtained. This section fixes an evaluation law, an inference procedure, and a resource account before comparing post-training protocols.

                                                              Convention. Fixed evaluation interface for protocol comparison [ftip-005D]

                                                                Fix an evaluation task \(\mathsf T_{\rm ev}\) from Definition [ftip-001O] and a measurable scalar evaluation utility \(u_{\mathsf T_{\rm ev}}:\mathcal X_{\mathsf T_{\rm ev}}\times \mathcal O_{\mathsf T_{\rm ev}}\times \Omega _E\to \mathbb R\), the \(d=1\) case of Definition [ftip-001T]. Fix its task law \(Q_{\rm ev}:=\mu _{\mathsf T_{\rm ev}}\), an inference protocol \(\mathsf I_{\rm ev}\) from Definition [ftip-001R], and an inference budget \(b\in \mathcal B_{\mathrm {eval}}\). Use the inference-seed space \(\Omega _I\) and evaluator-seed space \(\Omega _E\) from Notation [ftip-001N]. A declared probability kernel on these measurable spaces \(\Lambda _{\rm ev}(d\xi ,d\omega \mid x)\) assigns inference and evaluator randomness to each instance. Together with \(Q_{\rm ev}\), it gives the joint evaluation law \(\nu _{\rm ev}(dx,d\xi ,d\omega ) =Q_{\rm ev}(dx)\Lambda _{\rm ev}(d\xi ,d\omega \mid x)\), which is fixed independently of training.

                                                                Declare a measurable space \(\mathcal M\) of executable artifacts. For \(M\in \mathcal M\), define the aliases \[ \mathsf {Eval}_b(M,x;\xi ) :=\operatorname {pr}_1\left (\mathsf I_{\rm ev}(M,x,b;\xi )\right ), \qquad U(x,o;\omega ):=u_{\mathsf T_{\rm ev}}(x,o;\omega ). \] Require \(\mathsf {Eval}_b\) to be measurable in \((M,x,\xi )\) and to return admissible outcomes on admitted runs.

                                                                Each post-training protocol \(P\) has a probability space \((\Omega _P,\Sigma _P,\mathbb P_P)\) for its randomness and a measurable artifact map \(M_P:\Omega _P\to \mathcal M\) produced from the common base artifact \(M_0\). The no-training protocol is \(P_0\). The complete evaluation law for \(P\) is the product \(\mathbb P_P\otimes \nu _{\rm ev}\), expressing independence between protocol randomness and the fixed evaluation draw. For \(\zeta \in \Omega _P\), write \[ Z_P(\zeta ,x,\xi ,\omega ) =U\left (x,\mathsf {Eval}_b(M_P(\zeta ),x;\xi );\omega \right ). \] This composite is measurable. Every protocol compared through expected performance, including the baseline \(P_0\), must satisfy \[ \int |Z_P|\,d(\mathbb P_P\otimes \nu _{\rm ev})<\infty . \] This is the evaluation domain; finite pointwise utility does not replace the absolute-integrability condition. Fix also a scalar success threshold \(u_*\in \mathbb R\).

                                                                Definition. Expected evaluation performance [ftip-005E]

                                                                  For a protocol \(P\) in the integrable evaluation domain of Convention [ftip-005D], its expected evaluation performance is the finite real number

                                                                  \[ \begin {aligned} J_{\rm ev}(P) &=\int Z_P\,d(\mathbb P_P\otimes \nu _{\rm ev}),\\ &=\mathbb E\left [ U\left (X,\mathsf {Eval}_b(M_P,X;\Xi );\Omega \right ) \right ], \\ (X,\Xi ,\Omega )&\sim Q_{\rm ev}(dx)\Lambda _{\rm ev}(d\xi ,d\omega \mid x). \end {aligned} \]

                                                                  The label \(\rm ev\) abbreviates the task, law, inference protocol, budget, utility, and seed law fixed above. Changing any of them changes the estimand. Both positive and negative parts of \(Z_P\) have finite expectation; an undefined expectation or an infinite value is outside this real-valued performance domain.

                                                                  Definition. Post-training gain [ftip-005F]

                                                                    For \(P\) and the no-training protocol \(P_0\) both satisfying the absolute-integrability condition of Convention [ftip-005D], the post-training gain is the real-valued difference

                                                                    \[ \Delta J_{\rm ev}(P) =J_{\rm ev}(P)-J_{\rm ev}(P_0). \]

                                                                    Both terms use the same evaluator, task law, utility, and inference budget. The subtraction does not compare different model families or evaluation procedures. In particular, \(+\infty -(+\infty )\) is not an admitted gain.

                                                                    Remark. Evaluation gain under a fixed task law [ftip-005G]

                                                                      The policy-evaluation expectation of Section 3.5 of Reinforcement learning: An introduction[sutton2018reinforcement] specializes to an independently fixed task law and inference procedure. The gain is a paired contrast with the same base artifact and evaluator.

                                                                      A positive value shows a change under this evaluation. It does not alone show that the trained policy acquired a capability under the criterion of Definition [ftip-0007].

                                                                      Definition. Lifecycle cost vector [ftip-005H]

                                                                        The realized lifecycle cost vector of a protocol is the random vector \(C(P)\in \mathbb R_+^7\), measurable on its declared lifecycle-run probability space, that records separately

                                                                        \[ C(P)= (C_{\rm data},C_{\rm feedback},C_{\rm rollout},C_{\rm env}, C_{\rm update},C_{\rm storage},C_{\rm eval}). \]

                                                                        A componentwise lifecycle budget is a vector \(\mathbf B\in \mathbb R_+^7\). Each cost coordinate has a declared unit, such as tokens, labels, accelerator floating-point operations (FLOPs), sandbox time, bytes, or evaluator calls. A scalar price may be applied later, but the typed vector is retained. Each nonnegative coordinate has a well-defined expectation in \([0,+\infty ]\); finite realized costs need not have finite expectations. A finite componentwise budget excludes protocols with any infinite expected-cost coordinate. When costs include the fixed independent evaluation draw, the run law may include the product law in Convention [ftip-005D]; the accounting record must specify which randomness is averaged.

                                                                        Remark. Lifecycle costs have distinct units [ftip-005I]

                                                                          The scaling study behind Definition [ftip-001C] reports training tokens and compute separately.

                                                                          [hoffmann2022training, sec. 3] studies their allocation. Training tokens and compute are therefore separate cost coordinates.

                                                                          Agentic and replay protocols also incur verifier, environment, storage, and selection work. A training step, a generated rollout, and one second of wall time are therefore different units.

                                                                          The vector permits later cost models without hiding which conversion rates or hardware assumptions they use.

                                                                          Definition. Admissible protocol class [ftip-005J]

                                                                            For a base artifact \(M_0\), an admissible protocol class \(\mathfrak P(M_0)\) is a declared set of type-correct training procedures. Membership fixes which data sources, feedback channels, model changes, environment interfaces, and update rules are permitted. For the expected performance comparison, every member also satisfies the measurable generation and integrable evaluation domain of Convention [ftip-005D], and carries the measurable nonnegative cost vector of Definition [ftip-005H]. The baseline \(P_0\) must satisfy the evaluation domain even if it is not feasible at the chosen cost budget.

                                                                            The class is part of the research question. Enlarging it can only enlarge the set of attainable outcomes, but may make a comparison less informative.

                                                                            Definition. Trust contract [ftip-005K]

                                                                              A trust contract \(\mathsf {Trust}(P)\) is a predicate requiring the protocol to respect declared provenance, information, and accounting boundaries. At minimum it specifies evaluation independence, behavior-policy stamps for reused rollouts, environment and verifier versions, and complete lifecycle-cost reporting.

                                                                              The predicate is evidence to be checked. It is not a statement that a protocol is safe, aligned, or free from distribution shift.

                                                                              Remark. Allowed procedures and admissible evidence [ftip-005L]

                                                                                The protocol class and trust contract impose distinct restrictions. The class states what may be attempted; the contract states what evidence an attempt must retain before it can enter the comparison.

                                                                                Their joint specification is a proposed evaluation framework.

                                                                                A supremum over an unspecified class or an unaudited evaluation boundary has no stable empirical interpretation.

                                                                                Definition. Costed post-training potential [ftip-005M]

                                                                                  For a scalar evaluation utility, the costed post-training potential of \(M_0\) under a finite componentwise budget \(\mathbf B\in \mathbb R_+^7\) is the extended-real supremum

                                                                                  \[ \Phi (M_0,\mathbf B) =\sup _{P\in \mathfrak P(M_0)} \left \{ J_{\rm ev}(P): \mathsf {Trust}(P),\ \mathbb E[C(P)]\leq \mathbf B \right \}. \]

                                                                                  Here \(\mathfrak P(M_0)\) has the evaluation domain of Definition [ftip-005J], so each \(J_{\rm ev}(P)\) is real. The expected-cost inequality is componentwise in \([0,+\infty ]^7\); it cannot hold against a finite budget if any coordinate is infinite. Define \(\sup \varnothing =-\infty \), and use \(+\infty \) when feasible performance values are unbounded above. Thus \(\Phi \) takes values in \(\overline {\mathbb R}=\mathbb R\cup \{-\infty ,+\infty \}\).

                                                                                  The potential is finite real exactly when its feasible performance set is nonempty and bounded above. For example, a common finite upper bound on utility and at least one feasible protocol suffice. This does not guarantee that any protocol attains the supremum. Ordinary differences, ratios, or derivatives of potential values require finite real operands and any further regularity hypotheses needed by that operation. The value is conditional on every object named in the display; it is not an intrinsic constant of the model.

                                                                                  Remark. Potential depends on the intervention and budget [ftip-005N]

                                                                                    The potential \(\Phi \) describes how evaluation performance varies with the base artifact, admissible information, protocol family, and resource budget. The definition supplies no scaling exponent and no guarantee that a maximizing protocol exists.

                                                                                    Empirical studies provide conditional points or bounds only after their protocol, evaluator, and costs are embedded in this interface. An observed benchmark maximum need not equal a universal ceiling.

                                                                                    Definition. feasible objective set [boyd2004convex, Section 4.7.4] [ftip-005O]

                                                                                      For a multi-objective optimization problem with vector objective \(f(x)\), the feasible objective set is the collection of vectors \(f(x)\) attained by feasible choices \(x\).

                                                                                      In a post-training application, the feasible choice is a trusted, budget-feasible protocol and the objective vector contains independently declared evaluation outcomes.

                                                                                      Definition. weighted-sum scalarization [boyd2004convex, Section 4.7.5] [ftip-005P]

                                                                                        For objective vector \(v\in \mathbb R^m\) and nonnegative weights \(w\in \mathbb R_+^m\), the weighted-sum scalarization assigns the score \(w^\top v\). Optimizing this score selects a point according to the declared weights.

                                                                                        Changing \(w\) changes the research question. A single weighted score can hide tradeoffs among evaluation groups or task families.

                                                                                        Definition. Pareto-optimal objective vector [boyd2004convex, Section 4.7.4] [ftip-005Q]

                                                                                          A feasible vector \(v\) is Pareto optimal when there is no feasible \(v'\) with \(v'_j\geq v_j\) in every coordinate and a strict inequality in at least one coordinate. The Pareto frontier is the set of such vectors.

                                                                                          This order preserves visible tradeoffs. It does not choose one point on the frontier.

                                                                                          Definition. worst-group risk [sagawa2020distributionally, Section 2] [ftip-005R]

                                                                                            Given predefined groups with risks \(L_g\), the worst-group risk is \(\max _g L_g\). For utilities, the corresponding robust score is \(\min _g J_g\).

                                                                                            A post-training comparison must declare the groups and their evaluation laws before using this score. It is different from an average and from Pareto dominance.

                                                                                            Example. Three attainable protocols with different scalar, Pareto, and worst-group summaries [ftip-005S]

                                                                                              Three attainable utility vectors separate the answers returned by scalarization, Pareto comparison, and a worst-group summary.

                                                                                              For scalar weights \((0.8,0.2)\), the scores are \(S(A)=0.80\), \(S(B)=0.70\), and \(S(C)=0.56\), so \(A\) wins. The worst-group scores are \(0.4\), \(0.7\), and \(0.5\), so \(B\) wins. No point dominates another coordinatewise, hence the Pareto summary retains all three.

                                                                                              The scalar, Pareto, and worst-group summaries were defined in Definition [ftip-005P]--Definition [ftip-005R]. Their non-equivalence is explicit in these three points, while the choice of a social or evaluation rule remains open.

                                                                                              Evaluation transport and matched protocols [ftip-00F9]

                                                                                                This section compares post-training artifacts only through declared evaluation laws, inference protocols, utilities, seeds, and budgets. It proves finite transport statements locally and treats long-horizon research-state records as empirical evidence, not as theorems.

                                                                                                Evaluation laws and couplings [ftip-00FA]

                                                                                                  Convention. A named evaluation experiment [ftip-00FB]

                                                                                                    A named evaluation experiment records the artifact, task law, inference protocol, evaluator, seed kernel, budget, and sampling unit. Two reported scores are comparable only after these coordinates and their intended target have been stated.

                                                                                                    Definition. Evaluation law [ftip-00FC]

                                                                                                      For a fixed evaluation interface from Convention [ftip-005D], an evaluation law is a probability measure \(\mathsf Q\) on the finite outcome space \(\mathcal Z=\mathcal X_{\mathsf T_{\rm ev}}\times \mathcal O_{\mathsf T_{\rm ev}}\) with random pair \((X,O)\sim \mathsf Q\). Its score for artifact \(M\) is a bounded measurable map \(s_M:\mathcal Z\to [0,1]\). Write \(J_{\mathsf Q}(M)=\mathbb E_{\mathsf Q}[s_M(X,O)]\).

                                                                                                      Definition. Matched evaluation pair [ftip-00FD]

                                                                                                        A matched evaluation pair is \((\mathsf Q,\mathsf I,b,\Lambda )\) and \((\mathsf Q',\mathsf I',b',\Lambda ')\) together with a coupling \((Z,Z')\) whose marginals are the two laws. The pair is matched on the declared coordinates when the task, utility, evaluator version, and sampling unit are shared; any changed coordinate is named.

                                                                                                        Definition. Paired finite score estimator [ftip-00FE]

                                                                                                          For iid coupled draws \((Z_j,Z'_j)_{j=1}^m\), define \(\widehat \Delta _m=m^{-1}\sum _{j=1}^m(s_M(Z_j)-s_{M'}(Z'_j))\). The pairing is part of the estimator specification; it does not silently identify the two evaluation laws.

                                                                                                          Theorem. Unbiasedness of the paired score estimator [ftip-00FF]

                                                                                                            Under the iid coupling in Definition [ftip-00FE], \(\mathbb E[\widehat \Delta _m]=J_{\mathsf Q}(M)-J_{\mathsf Q'}(M')\).

                                                                                                            Proof. 

                                                                                                              Linearity of expectation gives the displayed identity.

                                                                                                              \[ \mathbb E[\widehat \Delta _m] =m^{-1}\sum _j\left (\mathbb E[s_M(Z_j)]- \mathbb E[s_{M'}(Z'_j)]\right ). \]

                                                                                                              The coupling fixes the joint sampling but does not change either marginal, so the two terms are the stated expectations.

                                                                                                              Example. Common seeds can reduce paired variance [ftip-00G0]

                                                                                                                If \(s_M(Z)=s_{M'}(Z')\) almost surely under a common-seed coupling, then \(\widehat \Delta _m=0\) for every sample even when independent sampling would have nonzero variance. This is a variance statement, not evidence that the two artifacts have equal behavior on a different law.

                                                                                                                Remark. A coupling does not merge estimands [ftip-00G1]

                                                                                                                  The result in Theorem [ftip-00FF] follows from its displayed hypotheses. A shared seed can make a paired comparison precise while the changed task law, evaluator, or inference budget still changes the estimand. No causal effect follows without a declared intervention and matched coordinates.

                                                                                                                  Utility transport [ftip-00G2]

                                                                                                                    Definition. Bounded utility perturbation [ftip-00G3]

                                                                                                                      On a common finite outcome law \(\mathsf Q\), let each artifact \(M\) have score maps \(s_M,t_M:\mathcal Z\to [0,1]\). They have perturbation radius \(\varepsilon =\sup _{M,\,z\in \operatorname {supp}(\mathsf Q)} |s_M(z)-t_M(z)|\) when \(0\leq \varepsilon \leq 1\); write \(J_s(M)=\mathbb E_{\mathsf Q}[s_M]\) and \(J_t(M)=\mathbb E_{\mathsf Q}[t_M]\).

                                                                                                                      Theorem. Direct utility transport bound [ftip-00G4]

                                                                                                                        Under Definition [ftip-00G3], every artifact \(M\) satisfies \(|J_s(M)-J_t(M)|\leq \varepsilon \).

                                                                                                                        Proof. 

                                                                                                                          Pointwise bounds give \(-\varepsilon \leq s_M(z)-t_M(z)\leq \varepsilon \). Taking expectations preserves both inequalities.

                                                                                                                          Corollary. Transporting an artifact comparison [ftip-00G5]

                                                                                                                            If two artifacts \(M_1,M_0\) are scored by both \(s\) and \(t\) under the same law and \(\lVert s-t\rVert _{\infty ,\mathsf Q}\leq \varepsilon \), then the gain difference obeys \(|(J_s(M_1)-J_s(M_0))-(J_t(M_1)-J_t(M_0))| \leq 2\varepsilon \). This is a finite utility perturbation bound, not a training or distribution-shift theorem.

                                                                                                                            Example. Equal aggregate score can hide a slice reversal [ftip-00G6]

                                                                                                                              On equally likely outcomes \(a,b\), take score vectors \((s_{M_1}(a),s_{M_1}(b))=(1,0)\) and \((s_{M_0}(a),s_{M_0}(b))=(0,1)\); a second score map swaps coordinates. Both artifacts have aggregate score \(1/2\) under both maps, but their per-outcome ordering reverses. Aggregate transport alone does not identify localized behavior.

                                                                                                                              Remark. Common domains are a transport hypothesis [ftip-00G7]

                                                                                                                                The bound in Theorem [ftip-00G4] requires the same finite outcome support. Changing prompts, parsers, evaluators, or inference budgets is a new law and must be recorded rather than hidden inside a score perturbation.

                                                                                                                                Prompt and research-state transport [ftip-00G8]

                                                                                                                                  Definition. Research-state observable [ftip-00G9]

                                                                                                                                    For a finite record space \(\mathcal R\), an observable is a map \(h:\mathcal R\to \mathcal H\). A summary-only evaluator sees \(h(r)\) and not the underlying record \(r\); the omitted coordinates are unavailable to that evaluator.

                                                                                                                                    Definition. Compaction kernel [ftip-00GA]

                                                                                                                                      A compaction kernel is a randomized map \(K(dh\mid r)\) from records in \(\mathcal R\) to summaries in \(\mathcal H\). A deterministic summary is the special case \(K(dh\mid r)=\delta _{h(r)}\).

                                                                                                                                      Theorem. Summary-only indistinguishability [ftip-00GB]

                                                                                                                                        Let \(r,r'\in \mathcal R\) induce the same summary law under the kernel in Definition [ftip-00GA]. Any randomized decision rule that receives only that summary has the same output law in the two worlds.

                                                                                                                                        Proof. 

                                                                                                                                          The output law is the pushforward of the common summary law through the same decision kernel. Pushforwards of equal finite measures are equal.

                                                                                                                                          Example. An omitted feasibility constraint [ftip-00GC]

                                                                                                                                            Two research records can share every summary score while one contains a withdrawn lemma and the other contains a feasible proof plan. A summary-only selector therefore chooses identically, although the correct next action differs. This is a finite witness to information loss, not a claim about a particular model.

                                                                                                                                            Remark. Long-horizon records are empirical transport evidence [ftip-00GD]

                                                                                                                                              The case study in [li2026longhorizon], Sections 4--7, reports file-based memory, human steering, and research-state failures under one system and task. It motivates explicit observables and omitted constraints; it does not supply the finite theorem in Theorem [ftip-00GB] or a general model capability law.

                                                                                                                                              Evaluation cells and budget accounting [ftip-00GE]

                                                                                                                                                Definition. Evaluation cell [ftip-00GF]

                                                                                                                                                  An evaluation cell is \(C=(M,\mathsf Q,\mathsf I,b,\Lambda ,v)\), where \(M\) is an artifact, \(\mathsf Q\) a task law, \(\mathsf I\) an inference protocol, \(b\) a budget, \(\Lambda \) a seed kernel, and \(v\) an evaluator version. A cell comparison may differ in named coordinates only.

                                                                                                                                                  Lemma. Additive evaluation cost [ftip-00GG]

                                                                                                                                                    For a finite evaluation plan with disjoint stages of costs \(c_1,\ldots ,c_k\in \mathbb R_{\geq 0}\), total cost is \(c=\sum _{i=1}^k c_i\). Appending a stage increases cost by its declared amount and cannot preserve a budget \(B\) unless the remaining slack covers it.

                                                                                                                                                    Proof. 

                                                                                                                                                      The statement is the associativity and monotonicity of finite sums.

                                                                                                                                                      Theorem. Budget-preserving matched comparison [ftip-00GH]

                                                                                                                                                        Let two evaluation plans use the same declared stages except for a substitution whose cost is at most the replaced stage cost. If their common prefix cost is \(c_0\) and both suffix costs fit \(B-c_0\), then both cells in Definition [ftip-00GF] are admissible under budget \(B\).

                                                                                                                                                        Proof. 

                                                                                                                                                          Apply Lemma [ftip-00GG] to the common prefix and each suffix. The assumed inequalities give total cost at most \(B\) in each plan.

                                                                                                                                                          Example. Cost-balanced evaluation cells [ftip-00GI]

                                                                                                                                                            A paired run can spend \(B=100\) units as 40 units of inference, 20 of evaluator calls, and 40 of audit. Replacing 10 inference units by 10 audit units preserves the budget, but changes the cell and must not be described as the same inference protocol.

                                                                                                                                                            Remark. Execution and evaluator confounds [ftip-00GJ]

                                                                                                                                                              A score change can arise from the artifact, prompt law, inference budget, parser, evaluator version, or execution failure. A matched-cell report names these coordinates before interpreting a paired gain.

                                                                                                                                                              Distribution shift and ranking reversals [ftip-00GK]

                                                                                                                                                                Example. Train and evaluation laws can reverse a ranking [ftip-00GL]

                                                                                                                                                                  Let \(\mathsf Q_{\rm tr}\) put masses \(.9,.1\) on \(a,b\), and let \(\mathsf Q_{\rm ev}\) swap them. Artifacts \(M_1,M_0\) with score vectors \((s_{M_1}(a),s_{M_1}(b))=(1,0)\) and \((s_{M_0}(a),s_{M_0}(b))=(0,1)\) rank oppositely under the two laws. A training score is not an evaluation transport certificate.

                                                                                                                                                                  Theorem. Total-variation transport bound [ftip-00GM]

                                                                                                                                                                    For any score \(s:\mathcal Z\to [0,1]\) and finite laws \(\mathsf Q,\mathsf Q'\), \(|\mathbb E_{\mathsf Q}s-\mathbb E_{\mathsf Q'}s|\leq \lVert \mathsf Q-\mathsf Q'\rVert _{\rm TV}\), where \(\lVert \mathsf Q-\mathsf Q'\rVert _{\rm TV}:=\frac 12\sum _{z\in \mathcal Z} |\mathsf Q(z)-\mathsf Q'(z)|\).

                                                                                                                                                                    Proof. 

                                                                                                                                                                      Expand the finite expectation difference and use \(|s(z)|\leq 1\). The positive and negative parts are bounded by the total variation mass, giving the displayed inequality.

                                                                                                                                                                      Example. A sharp two-point transport bound [ftip-00GN]

                                                                                                                                                                        On \(\mathcal Z=\{a,b\}\), let \(s(a)=1,s(b)=0\), and let \(\mathsf Q(a)=1\), \(\mathsf Q'(a)=1-\eta \), and \(\mathsf Q'(b)=\eta \). The score difference and total variation distance are both \(\eta \).

                                                                                                                                                                        Remark. What transport does not identify [ftip-00GO]

                                                                                                                                                                          The bounds above transport a declared score across a declared law. They do not identify why an artifact changed, establish support expansion, prove generalization, or order different evaluators whose outcome spaces differ.

                                                                                                                                                                          Example. A minimal evaluation trace [ftip-00GP]

                                                                                                                                                                            A reproducible record is \((M,\mathsf Q,\mathsf I,b,\Lambda ,v,m, \widehat \Delta _m,c)\), listing the cells, sample count, paired estimate, and cost. Replaying this tuple reproduces the estimator target only when the recorded laws and versions remain available.

                                                                                                                                                                            Remark. Execution controls for a matched evaluation [ftip-00GQ]

                                                                                                                                                                              A matched evaluation requires execution gates, contamination checks, grader calibration, and an audit of the result before it is committed. These controls make the comparison auditable; they do not by themselves establish capability acquisition.

                                                                                                                                                                              Analytical questions and falsifiers [ftip-005T]

                                                                                                                                                                                Successful support, verifier error, and entropy statistics distinguish properties that a benchmark summary can combine. Finite examples and counterexamples distinguish these quantities.

                                                                                                                                                                                Definition. Successful-support probability [ftip-005U]

                                                                                                                                                                                  Fix the evaluation interface and success threshold \(u_*\) from Convention [ftip-005D]. For a protocol \(P\) and instance \(x\in \mathcal X_{\mathsf T_{\rm ev}}\), its successful-support probability is

                                                                                                                                                                                  \[ p_P(x) =\Pr \left [ U\left (x,\mathsf {Eval}_b(M_P,x;\Xi );\Omega \right )\geq u_* \right ]. \]

                                                                                                                                                                                  The probability includes protocol, inference, environment, and evaluator randomness: \(M_P\) is drawn from the protocol, while \((\Xi ,\Omega )\) is drawn from \(\Lambda _{\rm ev}(\cdot \mid x)\) independently of training. The quantity is instance-specific and budget-specific.

                                                                                                                                                                                  Definition. Successful-support coverage [ftip-005V]

                                                                                                                                                                                    For threshold \(0<\alpha \leq 1\), the successful-support coverage of protocol \(P\) under evaluation law \(Q_{\rm ev}\) is

                                                                                                                                                                                    \[ \operatorname {Cov}_\alpha (P) =Q_{\rm ev}\left (\{x:p_P(x)\geq \alpha \}\right ). \]

                                                                                                                                                                                    Coverage records how much task mass has at least the declared success probability. It does not average the probabilities above or below the threshold.

                                                                                                                                                                                    Remark. Task-level success and coverage [ftip-005W]

                                                                                                                                                                                      Increasing probability mass on known solutions need not increase coverage of the task family. Pass-at-\(k\) and related support-sensitive measurements motivate this distinction. Sections 3--5 of Does reinforcement learning really incentivize reasoning capacity in LLMs beyond the base model?[yue2025does] and Sections 2--3 of Understanding r1-zero-like training: A critical perspective[liu2025understanding] compare post-training behavior with base-model support and discuss why response accuracy alone may overstate what RL creates beyond a base model.

                                                                                                                                                                                      The threshold \(\alpha \), inference budget, task law, and success predicate must all be reported. Finite samples estimate this quantity; they do not reveal the unobserved tail without assumptions.

                                                                                                                                                                                      Definition. Uniform task-family acquisition witness [ftip-005X]

                                                                                                                                                                                        Fix a finite, independently selected family \(G\subseteq \mathcal X_{\mathsf T_{\rm ev}}\), thresholds \(0\leq \alpha <\beta \leq 1\), and the common evaluation interface of Convention [ftip-005D]. Protocols \(P_0\) and \(P_1\) have a uniform task-family acquisition witness on \(G\) when

                                                                                                                                                                                        \[ p_{P_0}(x)\leq \alpha \quad \hbox {and}\quad p_{P_1}(x)\geq \beta \qquad \text {for every }x\in G. \]

                                                                                                                                                                                        For each \(x\), the successful event in Definition [ftip-005U] supplies the fixed-budget transfer event in Definition [ftip-0007]. The displayed inequalities specialize that earlier acquisition witness with \(\varepsilon _0=\alpha \) and \(\varepsilon _1=\beta \), then require the specialization uniformly over \(G\).

                                                                                                                                                                                        Remark. Acquisition evidence across a fixed task family [ftip-005Y]

                                                                                                                                                                                          The proposed family-level criterion is a demanding paired comparison. The task family and evaluator are fixed independently, and both protocols use the same inference budget. It is stronger than one acquisition witness because the threshold change must hold for every member of \(G\).

                                                                                                                                                                                          A theorem may strengthen the witness with confidence bounds, transfer to a predeclared related family, or a lower bound on newly successful support. Each strengthening requires additional sampling or structural assumptions.

                                                                                                                                                                                          Definition. Verifier error rates [ftip-005Z]

                                                                                                                                                                                            Let \(S\in \{0,1\}\) be an independently defined success label and \(A\in \{0,1\}\) the verifier's accept decision on the same outcome. The false-accept and false-reject rates are

                                                                                                                                                                                            \[ \eta _+=\Pr (A=1\mid S=0), \qquad \eta _-=\Pr (A=0\mid S=1). \]

                                                                                                                                                                                            Both rates are conditional on the task and outcome distribution used for the audit. They are undefined when the conditioning event has probability zero.

                                                                                                                                                                                            Remark. Verifier error under an independent audit law [ftip-0061]

                                                                                                                                                                                              Verifier error is measured against an independent success label because a training reward cannot audit itself. The verifier and evidence interfaces are in Definition [ftip-0046]--Definition [ftip-0049]. DeepSeek-Prover-V2 [ren2025deepseekproverv2, Section 2.3, ``Reinforcement Learning''] supplies a proof-checking instance. The false-accept/false-reject decomposition is a binary measurement model.

                                                                                                                                                                                              The rates may vary by task, policy, trajectory length, and adversarial pressure. A low average error rate need not prevent reward hacking on the subpopulation favored by optimization.

                                                                                                                                                                                              Example. Reward hacking under an incomplete checker [ftip-0060]

                                                                                                                                                                                                Shifting probability mass toward a checker exploit raises proxy reward while reducing independently judged utility.

                                                                                                                                                                                                Let the three outputs be \(y_0=\text {41}\), \(y_1=\text {42}\), and \(y_2=\text {ignore; 42; done}\). The proxy accepts \(y_1,y_2\); the independent evaluator accepts only \(y_1\). Moving their probabilities from \((0.5,0.4,0.1)\) to \((0.1,0.1,0.8)\) changes expected proxy reward from \(0.5\) to \(0.9\), but true utility from \(0.4\) to \(0.1\).

                                                                                                                                                                                                Reward exploitation in formal verification is discussed in [ren2025deepseekproverv2, Section 3.2]. The constructed checker exposes one failure mechanism. It provides no basis for treating every executable verifier as incomplete or every proxy improvement as reward hacking.

                                                                                                                                                                                                Definition. Global policy entropy [ftip-0062]

                                                                                                                                                                                                  Fix a finite action space, a finite horizon \(T\), and a declared distribution \(\mu _t\) over public histories at each position. The global policy entropy is the weighted average

                                                                                                                                                                                                  \[ H_{\rm global}(\pi ) =\frac 1T\sum _{t=0}^{T-1} \mathbb E_{\mathsf H_t\sim \mu _t} \left [-\sum _a\pi (a\mid \mathsf H_t) \log \pi (a\mid \mathsf H_t)\right ]. \]

                                                                                                                                                                                                  The history distribution and action alphabet are part of the statistic.

                                                                                                                                                                                                  We use the convention \(0\log 0=0\) in this and the following position-entropy formula.

                                                                                                                                                                                                  Definition. Token-position entropy [ftip-0063]

                                                                                                                                                                                                    Let \(T_{\rm tok}\) be the random number of generated tokens. For a one-based token position \(t\) satisfying \(\Pr (T_{\rm tok}\geq t)>0\), condition on \(T_{\rm tok}\geq t\) and let \(\xi _t\) be the token. The token-position entropy is

                                                                                                                                                                                                    \[ H_t^{\rm pos} =-\sum _{v\in \mathcal V} \Pr (\xi _t=v\mid T_{\rm tok}\geq t) \log \Pr (\xi _t=v\mid T_{\rm tok}\geq t). \]

                                                                                                                                                                                                    This is the entropy of a position marginal. It is generally different from the history-conditioned entropy averaged in Definition [ftip-0062].

                                                                                                                                                                                                    Definition. selected-token surprisal [shannon1948mathematical, Part I, Section 6] [ftip-0064]

                                                                                                                                                                                                      For a sampled token \(\xi _t\) under next-token law \(\pi (\,\cdot \mid \mathsf H_t)\), its surprisal is

                                                                                                                                                                                                      \[-\log \pi (\xi _t\mid \mathsf H_t).\]

                                                                                                                                                                                                      It is a random value attached to the selected token. Its conditional expectation over the token equals the finite Shannon entropy of the next-token law.

                                                                                                                                                                                                      Remark. Why the entropy statistics are not interchangeable [ftip-0065]

                                                                                                                                                                                                        Shannon's finite entropy A mathematical theory of communication[shannon1948mathematical] can be aggregated over different random objects. Global and position-level entropy statistics use different laws. Selected-token surprisal is a sample statistic, while the other two are expectations under declared history or position laws.

                                                                                                                                                                                                        A training intervention can raise one quantity while lowering another. Later claims about exploration or collapse must name the statistic, sampling law, horizon, and conditioning event.

                                                                                                                                                                                                        Definition. empirical squared-ratio excess [miao2026when, Theorem 2] [ftip-0066]

                                                                                                                                                                                                          For token-level current-to-behavior ratios \(r_1,\ldots ,r_T\), DGG defines

                                                                                                                                                                                                          \[\widehat \chi ^2=\frac 1T\sum _{i=1}^T(r_i^2-1).\]

                                                                                                                                                                                                          The source relates this statistic to an upper bound on language-model-head gradient energy through a batch-dependent constant. In a finite batch \(\widehat \chi ^2\) can be negative, so it is not automatically a nonnegative empirical Pearson divergence. The result also gives no converse from a small batch gradient to small policy shift.

                                                                                                                                                                                                          Example. Lifecycle compute allocation and a finite rollout observation bound [ftip-0067]

                                                                                                                                                                                                            A componentwise lifecycle allocation separates resource accounting from the finite number of rollouts available for observation.

                                                                                                                                                                                                            In the coordinate order of Definition [ftip-005H], declare a lifecycle budget vector \(\mathbf B\). Its rollout coordinate permits \(N\) attempts. If each attempt has declared success probability \(p\), then \[ \Pr (\text {at least one success})=1-(1-p)^N\leq Np. \] Only the rollout coordinate enters this calculation; no sum or conversion among heterogeneous coordinates is defined.

                                                                                                                                                                                                            The finite bound is the union bound applied to Bernoulli rollouts; finite-horizon success probabilities are standard policy-evaluation objects in [sutton2018reinforcement, Section 3.5]. Independence is needed only for the displayed exact expression. The budget vector is illustrative: neither empirical optimality nor interchangeability of heterogeneous units is inferred from it.

                                                                                                                                                                                                            Remark. Finite questions and necessary assumptions [ftip-0068]

                                                                                                                                                                                                              Finite analysis raises three questions: how conditional success rates bound long-horizon success, how replay-ratio concentration controls update error, and how trajectory extrapolation with periodic recovery affects evaluation regret. A cost comparison also depends on rollout, update, environment, storage, and evaluation work.

                                                                                                                                                                                                              Finite counterexamples show why these questions need additional assumptions. Finite policies can separate the entropy statistics above. Two verifiers can agree on all observed training records yet differ on an unobserved adversarial region. Two parameter paths can share early low-rank summaries and diverge after a new successful rollout. These examples mark where additional assumptions are unavoidable.

                                                                                                                                                                                                              The DGG and NExt papers motivate reuse and trajectory-compression hypotheses but do not establish these general results. Bounds on update error and extrapolation regret require assumptions relating the monitored quantities to the corresponding outcomes.

                                                                                                                                                                                                              Finite consequences and obstructions [ftip-0075]

                                                                                                                                                                                                                This section turns parts of the preceding setup into finite mathematical statements. The results concern declared probability spaces, finite decision sets, recorded feedback, or explicitly stated matrix models. They do not by themselves establish a scaling law for language-model capability.

                                                                                                                                                                                                                We begin with discovery and support, then study proxy rewards and verifiers. The third subsection asks what can be learned from a fixed feedback transcript. The last subsection studies the DGG inequalities before introducing trajectory-compression diagnostics and counterexamples.

                                                                                                                                                                                                                Finite discovery and support [ftip-0076]

                                                                                                                                                                                                                  A successful continuation can have positive probability and still be difficult to observe within a finite rollout budget. This subsection separates the probability of observing a success from support, coverage, and capability acquisition.

                                                                                                                                                                                                                  Convention. Repeated attempts and the discovery event [ftip-0077]

                                                                                                                                                                                                                    Fix a task instance, evaluator, success threshold, and a joint law for \(B\geq 1\) attempts. Let \(E_i\) be the event that attempt \(i\) succeeds. The discovery event by attempt \(B\) is

                                                                                                                                                                                                                    \[ D_B=\bigcup _{i=1}^{B}E_i. \]

                                                                                                                                                                                                                    Write \(p_i=\Pr (E_i)\). Independence is an additional property of the declared joint law; it is not implied by repeated decoding, a shared model, or a common environment. In the independent and identically distributed case, write \(p_i=p\). When the attempt law is the one fixed in Definition [ftip-005U], this \(p\) is the corresponding successful-support probability.

                                                                                                                                                                                                                    Theorem. Discovery under independent attempts [ftip-0078]

                                                                                                                                                                                                                      Assume the events \(E_1,\ldots ,E_B\) of Convention [ftip-0077] are independent. Then

                                                                                                                                                                                                                      \[ \Pr (D_B)=1-\prod _{i=1}^{B}(1-p_i). \]

                                                                                                                                                                                                                      In particular, independent attempts with a common success probability \(p\) satisfy

                                                                                                                                                                                                                      \[ \Pr (D_B)=1-(1-p)^B. \]

                                                                                                                                                                                                                      Proof. 

                                                                                                                                                                                                                        The complement of discovery is \(D_B^{\mathsf c}=\bigcap _{i=1}^{B}E_i^{\mathsf c}\). Independence gives \(\Pr (D_B^{\mathsf c})=\prod _i\Pr (E_i^{\mathsf c}) =\prod _i(1-p_i)\). Taking complements proves the first identity; substituting \(p_i=p\) proves the specialization.

                                                                                                                                                                                                                        This finite statement follows from the displayed hypotheses. The calculation in Example [ftip-0067] is its ten-attempt numerical preview.

                                                                                                                                                                                                                        Corollary. A rollout budget for target discovery probability [ftip-0079]

                                                                                                                                                                                                                          This is a finite corollary of Theorem [ftip-0078], obtained from its displayed hypotheses.

                                                                                                                                                                                                                          Let \(0<\delta <1\). Under the independent and identically distributed setup of Theorem [ftip-0078], suppose first that \(0<p<1\). The least positive integer budget whose discovery failure probability is at most \(\delta \) is

                                                                                                                                                                                                                          \[ B_{\min } =\left \lceil \frac {\log \delta }{\log (1-p)}\right \rceil . \]

                                                                                                                                                                                                                          If \(p=0\), no finite positive budget reaches failure probability below one. If \(p=1\), one attempt suffices.

                                                                                                                                                                                                                          Proof. 

                                                                                                                                                                                                                            For \(0<p<1\), Theorem [ftip-0078] gives failure probability \((1-p)^B\). The inequality \((1-p)^B\leq \delta \) is equivalent to \(B\geq \frac {\log \delta }{\log (1-p)}\) because both logarithms are negative. The least integer solution is the displayed ceiling. The two boundary cases follow directly from \((1-p)^B\).

                                                                                                                                                                                                                            Lemma. Discovery bounds from conditional success rates [ftip-007A]

                                                                                                                                                                                                                              Put \(D_0=\varnothing \). Whenever \(\Pr (D_{i-1}^{\mathsf c})>0\), define the surviving conditional success rate

                                                                                                                                                                                                                              \[ q_i=\Pr (E_i\mid D_{i-1}^{\mathsf c}). \]

                                                                                                                                                                                                                              If these rates are defined through step \(B\), then

                                                                                                                                                                                                                              \[ \Pr (D_B^{\mathsf c})=\prod _{i=1}^{B}(1-q_i). \]

                                                                                                                                                                                                                              Consequently, if \(0\leq \underline q\leq q_i\leq \overline q\leq 1\) for every surviving step, then

                                                                                                                                                                                                                              \[ 1-(1-\underline q)^B \leq \Pr (D_B) \leq 1-(1-\overline q)^B. \]

                                                                                                                                                                                                                              Proof. 

                                                                                                                                                                                                                                The chain rule gives \(\Pr (D_i^{\mathsf c})=\Pr (D_{i-1}^{\mathsf c})(1-q_i)\). Iteration proves the product identity, and the coordinatewise bounds on \(1-q_i\) give the two discovery bounds.

                                                                                                                                                                                                                                No independence assumption is used. The conditional rates may change with the earlier failures, an adaptive decoder, or a changing environment state.

                                                                                                                                                                                                                                This finite statement follows from the displayed hypotheses.

                                                                                                                                                                                                                                Remark. Discovery is neither acquisition nor coverage [ftip-007B]

                                                                                                                                                                                                                                  The discovery event concerns whether a declared sampling procedure observes at least one success. Increasing its probability can be an elicitation effect in the sense of Definition [ftip-0005]: more attempts expose behaviour that already had positive probability. It is not by itself the independent before--after comparison required by Definition [ftip-0007].

                                                                                                                                                                                                                                  Successful-support coverage in Definition [ftip-005V] integrates an instance-level threshold over a task law. A large discovery probability on one instance therefore does not establish broad coverage or the uniform task-family witness of Definition [ftip-005X].

                                                                                                                                                                                                                                  Theorem. Finite exponential tilting preserves support [ftip-007C]

                                                                                                                                                                                                                                    Fix a prompt \(x\), a finite response set \(\mathcal Y\), a reference policy \(\pi _{\mathrm {ref}}\), a finite real reward \(r(x,y)\), and \(\beta >0\). Let \(\pi _r\) be the normalized exponential tilt of Definition [ftip-003O]. Then, for every \(y\in \mathcal Y\),

                                                                                                                                                                                                                                    \[ \pi _r(y\mid x)>0 \quad \Longleftrightarrow \quad \pi _{\mathrm {ref}}(y\mid x)>0. \]

                                                                                                                                                                                                                                    Proof. 

                                                                                                                                                                                                                                      The multiplier \(\exp (r(x,y)/\beta )\) is finite and strictly positive. The finite normalizer \(Z_r(x)\) is also strictly positive. Multiplication by the first quantity and division by the second therefore preserve whether the reference mass is zero or positive.

                                                                                                                                                                                                                                      The source policy form appears as equation (4) in [rafailov2023direct, Section 4]; the displayed result is the finite corollary derived here. Infinite rewards, non-normalizable response spaces, approximate optimization, and changes to the generation mechanism lie outside the statement.

                                                                                                                                                                                                                                      Remark. Formal support and operational discoverability [ftip-007D]

                                                                                                                                                                                                                                        Support preservation is a statement about exact positive probability. A response can remain in mathematical support while its mass becomes too small to observe within the available rollout budget. The identities in Theorem [ftip-0078] and Corollary [ftip-0079] quantify this distinction for declared independent attempts.

                                                                                                                                                                                                                                        Top-\(k\) truncation, nucleus sampling, finite numerical precision, context limits, and parser constraints can also remove an operational route even when the underlying softmax law assigns it positive mass. Claims about elicitation must therefore name both the policy law and the executable inference procedure.

                                                                                                                                                                                                                                        Example. Counterexample: Equal one-shot success, unequal successful coverage [ftip-007E]

                                                                                                                                                                                                                                          Let the evaluation law be uniform on two instances \(x_1,x_2\). Consider protocols \(P\) and \(P'\) with successful-support probabilities

                                                                                                                                                                                                                                          \[ \bigl (p_P(x_1),p_P(x_2)\bigr ) =\left (\frac 12,\frac 12\right ), \qquad \bigl (p_{P'}(x_1),p_{P'}(x_2)\bigr ) =(1,0). \]

                                                                                                                                                                                                                                          Both protocols have mean one-shot success \(1/2\). At threshold \(\alpha =1/2\), however, Definition [ftip-005V] gives

                                                                                                                                                                                                                                          \[ \operatorname {Cov}_{1/2}(P)=1, \qquad \operatorname {Cov}_{1/2}(P')=\frac 12. \]

                                                                                                                                                                                                                                          Thus average success does not determine successful-support coverage. The example is finite and uses the same task law and threshold for both protocols; it does not compare their training costs or establish acquisition.

                                                                                                                                                                                                                                          Proxy reward and verifier fidelity [ftip-007F]

                                                                                                                                                                                                                                            A proxy can guide an update or rank sampled candidates without agreeing with the independently declared utility of the resulting output. This subsection separates pointwise proxy error from average error under a shifted law. It then distinguishes repeated false-accept events from the output of a candidate selector. Pointwise approximation and explicit probability assumptions support different guarantees; an average audit number alone supplies neither.

                                                                                                                                                                                                                                            Definition. Uniform proxy approximation [ftip-007G]

                                                                                                                                                                                                                                              Let \(\mathcal Y_0\) be a nonempty finite set of candidate outcomes. Let \(U:\mathcal Y_0\to \mathbb R\) be an independently declared utility and \(\widehat U:\mathcal Y_0\to \mathbb R\) a proxy score. The proxy is a uniform approximation to \(U\) on \(\mathcal Y_0\) with error \(\varepsilon \) when \(\varepsilon \geq 0\) and

                                                                                                                                                                                                                                              \[ \sup _{y\in \mathcal Y_0}\lvert \widehat U(y)-U(y)\rvert \leq \varepsilon . \]

                                                                                                                                                                                                                                              The candidate set is part of the claim. Approximation on training outcomes, on one policy's support, or in expectation is not uniform approximation on a larger set reached after optimization.

                                                                                                                                                                                                                                              Theorem. Uniform proxy error gives two-epsilon selection regret [ftip-007H]

                                                                                                                                                                                                                                                Under the conditions of Definition [ftip-007G], choose

                                                                                                                                                                                                                                                \[ y^\star \in \operatorname *{arg\,max}_{y\in \mathcal Y_0}U(y), \qquad \widehat y\in \operatorname *{arg\,max}_{y\in \mathcal Y_0}\widehat U(y). \]

                                                                                                                                                                                                                                                Then the utility regret of selecting by the proxy satisfies

                                                                                                                                                                                                                                                \[ 0\leq U(y^\star )-U(\widehat y)\leq 2\varepsilon . \]

                                                                                                                                                                                                                                                Proof. 

                                                                                                                                                                                                                                                  Optimality of \(\widehat y\) for the proxy and the two pointwise error bounds give

                                                                                                                                                                                                                                                  \[ \begin {aligned} U(y^\star ) &\leq \widehat U(y^\star )+\varepsilon \\ &\leq \widehat U(\widehat y)+\varepsilon \\ &\leq U(\widehat y)+2\varepsilon . \end {aligned} \]

                                                                                                                                                                                                                                                  Optimality of \(y^\star \) for \(U\) gives the lower bound.

                                                                                                                                                                                                                                                  This finite statement follows from the displayed hypotheses.

                                                                                                                                                                                                                                                  Remark. The two-epsilon theorem is a decision bound [ftip-007I]

                                                                                                                                                                                                                                                    The bound in Theorem [ftip-007H] follows directly from the uniform approximation condition. It compares two maximizers on one fixed finite candidate set. It does not describe how either score was learned or how a policy changes when that score becomes a training objective.

                                                                                                                                                                                                                                                    The result is useful because its transfer assumption is visible. To apply it after an update or a larger search, the uniform bound must hold on the outcomes that the new procedure can actually select. The verifier evidence of Definition [ftip-0047] can support such an audit, but reproducible evidence alone does not establish the bound.

                                                                                                                                                                                                                                                    Example. Counterexample: Small average proxy error fails after distribution shift [ftip-007J]

                                                                                                                                                                                                                                                      Let the finite decision set be \(\mathcal Y_0=\{y_{\rm safe},y_{\rm exploit}\}\). Define its utility and proxy utility by the following table.

                                                                                                                                                                                                                                                      \[ \begin {array}{c|cc} &y_{\rm safe}&y_{\rm exploit}\\ \hline U&1&0\\ \widehat U&1&2. \end {array} \]

                                                                                                                                                                                                                                                      For \(0<\delta <1\), let a reference law \(P_\delta \) assign probability \(\delta \) to \(y_{\rm exploit}\). Its mean absolute proxy error is

                                                                                                                                                                                                                                                      \[ \mathbb E_{P_\delta }\lvert \widehat U-U\rvert =2\delta , \]

                                                                                                                                                                                                                                                      which tends to zero with \(\delta \). Nevertheless, proxy maximization selects \(y_{\rm exploit}\) and incurs utility regret \(1\). Under the shifted law concentrated on that selected outcome, the mean error is \(2\). Thus no vanishing selection-regret bound can depend only on average error under the reference law.

                                                                                                                                                                                                                                                      This two-outcome construction isolates the distribution-shift warning in Remark [ftip-0061]. It does not claim that a particular learned verifier has this error profile; Example [ftip-0060] gives a source-linked checker instance with the same proxy-versus-utility separation.

                                                                                                                                                                                                                                                      Definition. Repeated verifier audit [ftip-007K]

                                                                                                                                                                                                                                                        A repeated verifier audit of size \(N\geq 1\) records pairs \((S_i,A_i)\in \{0,1\}^2\) for candidates \(1\leq i\leq N\). Here \(S_i\) is an independently defined success label and \(A_i\) is the verifier decision, as in Definition [ftip-005Z]. Define

                                                                                                                                                                                                                                                        \[ C_i^{\rm fa}=\{S_i=0,\ A_i=1\}, \qquad \mathcal E_N^{\rm fa}=\bigcup _{i=1}^N C_i^{\rm fa}. \]

                                                                                                                                                                                                                                                        The event \(\mathcal E_N^{\rm fa}\) says that at least one invalid candidate was accepted. It does not say which candidate a downstream selector returns. Write \(\phi _i=\Pr (C_i^{\rm fa})\). When \(\iota _i=\Pr (S_i=0)>0\), the conditional false-accept rate \(\eta _{+,i}=\Pr (A_i=1\mid S_i=0)\) is defined and \(\phi _i=\iota _i\eta _{+,i}\).

                                                                                                                                                                                                                                                        Theorem. Independent false accepts amplify with candidate count [ftip-007L]

                                                                                                                                                                                                                                                          In the repeated audit of Definition [ftip-007K], suppose the pairs \((S_i,A_i)\) are independent and identically distributed. Assume

                                                                                                                                                                                                                                                          \[ \iota =\Pr (S_i=0)>0, \qquad \eta _+=\Pr (A_i=1\mid S_i=0). \]

                                                                                                                                                                                                                                                          Then the probability that at least one accepted invalid candidate exists among the \(N\) audited candidates is

                                                                                                                                                                                                                                                          \[ \Pr (\mathcal E_N^{\rm fa})=1-(1-\iota \eta _+)^N. \]

                                                                                                                                                                                                                                                          It is strictly increasing in \(N\) when \(0<\iota \eta _+<1\), and it converges to \(1\) when \(\iota \eta _+>0\).

                                                                                                                                                                                                                                                          Proof. 

                                                                                                                                                                                                                                                            Each \(C_i^{\rm fa}\) has probability \(\iota \eta _+\). Independence of the audited pairs makes the events \(C_i^{\rm fa}\) independent. Therefore

                                                                                                                                                                                                                                                            \[ \Pr \left ((\mathcal E_N^{\rm fa})^c\right ) =\Pr \left (\bigcap _{i=1}^N (C_i^{\rm fa})^c\right ) =\prod _{i=1}^N(1-\iota \eta _+) =(1-\iota \eta _+)^N. \]

                                                                                                                                                                                                                                                            Taking complements gives the equality. The monotonicity and limit follow from the elementary powers of \(1-\iota \eta _+\).

                                                                                                                                                                                                                                                            This finite statement follows from the displayed hypotheses.

                                                                                                                                                                                                                                                            Theorem. A false-accept union bound without independence [ftip-007M]

                                                                                                                                                                                                                                                              For any joint law of a repeated verifier audit,

                                                                                                                                                                                                                                                              \[ \Pr (\mathcal E_N^{\rm fa})\leq \sum _{i=1}^N \phi _i. \]

                                                                                                                                                                                                                                                              If \(\iota _i=\Pr (S_i=0)>0\) for every \(i\), this becomes

                                                                                                                                                                                                                                                              \[ \Pr (\mathcal E_N^{\rm fa})\leq \sum _{i=1}^N \iota _i\eta _{+,i}. \]

                                                                                                                                                                                                                                                              Proof. 

                                                                                                                                                                                                                                                                Apply the union bound to \(\mathcal E_N^{\rm fa}=\bigcup _i C_i^{\rm fa}\). The factorization \(\phi _i=\iota _i\eta _{+,i}\) follows from conditional probability whenever \(\iota _i>0\). If \(\iota _i=0\), then \(\phi _i=0\) while the corresponding conditional rate is undefined, so the first display remains the unconditional statement.

                                                                                                                                                                                                                                                                Without a dependence assumption, matching marginal error rates do not give the equality in Theorem [ftip-007L]; the events \(C_i^{\rm fa}\) could coincide.

                                                                                                                                                                                                                                                                This finite statement follows from the displayed hypotheses.

                                                                                                                                                                                                                                                                Example. Weight updates and candidate selection are different proxy operators [ftip-007N]

                                                                                                                                                                                                                                                                  A proxy score can enter a training operator or a selection operator. In the first route it changes the policy; in the second it ranks a finite sample from a policy whose weights remain fixed.

                                                                                                                                                                                                                                                                  The lifecycle accounting of Definition [ftip-005H] places the first route's rollout and update work in separate coordinates. The second route incurs rollout and evaluation work but no parameter update. Consequently, the event \(\mathcal E_N^{\rm fa}\) in Definition [ftip-007K] concerns the candidate set presented to selection; it is not a claim about the selected output or a training-time policy change.

                                                                                                                                                                                                                                                                  Remark. What verifier error rates do not identify [ftip-007O]

                                                                                                                                                                                                                                                                    The rates in Definition [ftip-005Z] are properties of a declared audit law. They do not identify where errors occur within the task family, how error events depend across repeated candidates, or which accepted candidate a selector returns. Theorem [ftip-007L] adds identical marginals and independence; Theorem [ftip-007M] retains only the union bound.

                                                                                                                                                                                                                                                                    Nor do these rates determine the effect of optimizing against the verifier. That effect depends on how the induced policy or selection law moves mass toward particular outcomes. The incomplete-checker example Example [ftip-0060] demonstrates one such movement, while Example [ftip-007J] shows why an average reference-law error cannot rule it out. These are local finite statements. Any claim about a named verifier still requires its own audit distribution, evidence, and transfer argument.

                                                                                                                                                                                                                                                                    The deterministic regret lemma Theorem [ftip-007H], the independent-audit identity Theorem [ftip-007L], and the union bound Theorem [ftip-007M] follow from uniform approximation, independent trials, and subadditivity, respectively. Their hypotheses need not hold for a verifier chosen only for its empirical performance.

                                                                                                                                                                                                                                                                    Feedback identifiability and fixed records [ftip-007P]

                                                                                                                                                                                                                                                                      A training protocol can respond only to distinctions present in its observations. The following finite setup makes that restriction precise before considering stronger, model-specific limits on preference data.

                                                                                                                                                                                                                                                                      Definition. Finite declared feedback protocol [ftip-007Q]

                                                                                                                                                                                                                                                                        Fix a horizon \(N\geq 0\), finite action sets \(\mathcal A_n\), finite feedback sets \(\mathcal F_n\), and a finite internal-seed set \(\mathcal U\) with a declared law \(\lambda \). A finite declared protocol \(\mathsf P\) consists of selection maps

                                                                                                                                                                                                                                                                        \[ a_n:\mathcal U\times \prod _{j<n}(\mathcal A_j\times \mathcal F_j) \longrightarrow \mathcal A_n \qquad (0\leq n<N). \]

                                                                                                                                                                                                                                                                        An action may specify the task, rollout record, feedback request, or sampling choice made at that round. The protocol can depend on earlier exposed feedback and its declared seed, but it cannot depend on a latent world field that has not entered those arguments.

                                                                                                                                                                                                                                                                        Definition. Finite feedback world [ftip-008C]

                                                                                                                                                                                                                                                                          For the action and feedback sets of Definition [ftip-007Q], a finite feedback world \(w\) supplies, for each round \(0\leq n<N\), a probability kernel \(K_{n,w}\) from a generic action--feedback history \((a_0,f_0,\ldots ,a_n)\) ending in \(a_n\in \mathcal A_n\) to \(\mathcal F_n\). Thus, whenever \(a_j\in \mathcal A_j\) and \(f_j\in \mathcal F_j\),

                                                                                                                                                                                                                                                                          \[ K_{n,w}(\,\cdot \mid a_0,f_0,\ldots ,a_n) \in \Delta (\mathcal F_n). \]

                                                                                                                                                                                                                                                                          Two worlds may agree on every feedback kernel queried by a protocol while differing in latent utility, unrequested labels, or unobserved environment facts. Those latent fields are not feedback until a declared query exposes them.

                                                                                                                                                                                                                                                                          Definition. Observed feedback transcript [ftip-008D]

                                                                                                                                                                                                                                                                            Fix a finite declared protocol \(\mathsf P\) from Definition [ftip-007Q] and a finite feedback world \(w\) from Definition [ftip-008C]. Draw \(U\sim \lambda \) and, for \(0\leq n<N\), set

                                                                                                                                                                                                                                                                            \[ \begin {aligned} A_n&=a_n(U,A_0,F_0,\ldots ,A_{n-1},F_{n-1}),\\ F_n&\sim K_{n,w}(\,\cdot \mid A_0,F_0,\ldots ,A_n). \end {aligned} \]

                                                                                                                                                                                                                                                                            The resulting observed feedback transcript is

                                                                                                                                                                                                                                                                            \[ T_w^{\mathsf P}=(U,A_0,F_0,\ldots ,A_{N-1},F_{N-1}). \]

                                                                                                                                                                                                                                                                            All protocol randomness is included in \(U\). Immutable rollout records and typed feedback events may be components of the finite action and feedback sets, as in Definition [ftip-0051] and Definition [ftip-0053].

                                                                                                                                                                                                                                                                            Definition. Observational equivalence for a declared protocol [ftip-007R]

                                                                                                                                                                                                                                                                              Let \(\mathcal T_{\mathsf P}\) be the finite set of possible transcripts for a declared protocol \(\mathsf P\). Two feedback worlds \(w_0,w_1\) are observationally equivalent for \(\mathsf P\), written \(w_0\equiv _{\mathsf P}w_1\), when

                                                                                                                                                                                                                                                                              \[ \Pr (T_{w_0}^{\mathsf P}=t)=\Pr (T_{w_1}^{\mathsf P}=t) \qquad \text {for every }t\in \mathcal T_{\mathsf P}. \]

                                                                                                                                                                                                                                                                              The relation is protocol-relative. Another protocol may issue a different feedback request and thereby separate the same worlds. Equality only on the realized transcript is weaker than this definition, which compares the whole finite transcript law.

                                                                                                                                                                                                                                                                              Theorem. Post-training cannot distinguish observationally equivalent worlds [ftip-007S]

                                                                                                                                                                                                                                                                                For a finite random variable \(X\), write \(\operatorname {Law}(X)\) for its probability law. If \(h\) maps the value space of \(X\) to a finite set \(\mathcal Y\), its pushforward law \(h_{\#}\operatorname {Law}(X)\) is characterized by \[ \bigl (h_{\#}\operatorname {Law}(X)\bigr )(\{y\}) =\Pr (h(X)=y),\qquad y\in \mathcal Y. \]

                                                                                                                                                                                                                                                                                Let \(w_0\equiv _{\mathsf P}w_1\). For any finite output set \(\mathcal Y\) and any readout \(h:\mathcal T_{\mathsf P}\to \mathcal Y\),

                                                                                                                                                                                                                                                                                \[ h_{\#}\operatorname {Law}(T_{w_0}^{\mathsf P}) =h_{\#}\operatorname {Law}(T_{w_1}^{\mathsf P}). \]

                                                                                                                                                                                                                                                                                Thus a final artifact stamp, update decision, or test chosen solely from the declared protocol's transcript has the same distribution in both worlds.

                                                                                                                                                                                                                                                                                Proof. 

                                                                                                                                                                                                                                                                                  For every \(y\in \mathcal Y\), finiteness gives

                                                                                                                                                                                                                                                                                  \[ \begin {aligned} \Pr \left (h(T_{w_0}^{\mathsf P})=y\right ) &=\sum _{\substack {t\in \mathcal T_{\mathsf P}\\h(t)=y}} \Pr (T_{w_0}^{\mathsf P}=t)\\ &=\sum _{\substack {t\in \mathcal T_{\mathsf P}\\h(t)=y}} \Pr (T_{w_1}^{\mathsf P}=t) =\Pr \left (h(T_{w_1}^{\mathsf P})=y\right ). \end {aligned} \]

                                                                                                                                                                                                                                                                                  The middle equality is observational equivalence from Definition [ftip-007R]. These point probabilities determine the two pushforward laws.

                                                                                                                                                                                                                                                                                  This finite statement follows from the displayed hypotheses.

                                                                                                                                                                                                                                                                                  Remark. A no-free-feedback result, not a no-learning result [ftip-007T]

                                                                                                                                                                                                                                                                                    Theorem [ftip-007S] says that the declared observations supply no information that distinguishes \(w_0\) from \(w_1\). It does not say that the output must equal the initial model, that the parameters cannot change, or that performance cannot improve in both worlds. Pretraining, inductive bias, computation on the observed records, and generalization may still produce an improvement shared by the two worlds.

                                                                                                                                                                                                                                                                                    Calling the theorem a no-learning result would therefore erase the central condition: only world-dependent conclusions unavailable from the common transcript are ruled out.

                                                                                                                                                                                                                                                                                    Corollary. Replaying a fixed pool supplies no new feedback information [ftip-007U]

                                                                                                                                                                                                                                                                                      Fix a realized finite replay pool \(d\) as in Definition [ftip-0056]. Let \(\mathcal V\) be a finite seed set, and let \(V\in \mathcal V\) be a replay-and-update seed with the same declared law in two feedback worlds and whose law does not depend on the world. If a replay-only procedure makes no new environment or feedback query, then its output has the form \(Y=h(d,V)\). The law of \(Y\) is the same in the two worlds.

                                                                                                                                                                                                                                                                                      Proof. 

                                                                                                                                                                                                                                                                                        For every output \(y\),

                                                                                                                                                                                                                                                                                        \[ \Pr (h(d,V)=y)= \sum _{\substack {v\in \mathcal V\\h(d,v)=y}}\Pr (V=v). \]

                                                                                                                                                                                                                                                                                        The fixed pool, seed law, and readout are identical in the two worlds, so the displayed sum is identical. Equivalently, this is the pushforward argument of Theorem [ftip-007S] applied after conditioning on the realized pool.

                                                                                                                                                                                                                                                                                        This finite statement follows from the displayed hypotheses.

                                                                                                                                                                                                                                                                                        Remark. Reuse can change optimization without enlarging evidence [ftip-007V]

                                                                                                                                                                                                                                                                                          A replay schedule can reweight records, reduce optimization error on the fixed pool, or produce a different update proposal in the sense of Definition [ftip-006C]. Those are genuine computational effects. They do not add a label, preference, verifier result, or environment transition to the fixed evidence. Fresh optimizer randomness is likewise not feedback about the latent world.

                                                                                                                                                                                                                                                                                          This distinction prevents sample reuse from being counted as feedback acquisition. It does not imply that replay is useless; it isolates the source of any benefit as further computation on already acquired records.

                                                                                                                                                                                                                                                                                          Example. Counterexample: An off-query utility reversal [ftip-007W]

                                                                                                                                                                                                                                                                                            Let the response set be \(\{a,b\}\). A one-round protocol queries only \(x_0\); both worlds return the preference \(a\succ b\). The protocol therefore has the same transcript law in both worlds. Fix a deterministic transcript-to-policy readout that chooses \(a\) also at an unqueried \(x_1\). The worlds agree on every observed field but reverse utility at \(x_1\):

                                                                                                                                                                                                                                                                                            The transcript laws are identical, so Theorem [ftip-007S] applies, while the deterministic readout returns the same output in both worlds. That output is optimal in \(w_+\) and suboptimal in \(w_-\) on \(x_1\). The example does not show that generalization always fails. It shows that a claim about unqueried utility requires an assumption connecting observed feedback to that utility.

                                                                                                                                                                                                                                                                                            Remark. From finite indistinguishability to preference-data limits [ftip-007X]

                                                                                                                                                                                                                                                                                              [zhao2025limits, Theorems 3.3--3.5] study a more structured post-training model. They give ordinal-preference distortion lower bounds, including a lower bound under Bradley--Terry noise with linear scores, and a positive result using a limited number of cardinal queries. These results depend on the routing model, utility class, and query budget developed in § [ftip-008X].

                                                                                                                                                                                                                                                                                              Theorem [ftip-007S] gives a finite pushforward theorem, while Example [ftip-007W] gives a counterexample to identification from an incomplete transcript. They are neither proofs nor special cases of the paper's distortion results.

                                                                                                                                                                                                                                                                                              Replay monitors and trajectory compression [ftip-007Y]

                                                                                                                                                                                                                                                                                                Reusing a rollout and jumping along a predicted checkpoint path save different kinds of work. The first changes how often recorded feedback enters an update. The second replaces some realized training steps by a parameter forecast. This subsection records what their proposed monitors establish and, separately, what remains unmeasured.

                                                                                                                                                                                                                                                                                                Theorem. DGG head gradient and shared-weight occurrence sum [ftip-007Z]

                                                                                                                                                                                                                                                                                                  Fix a sampled history and an active token \(i\) in the interior of the unclipped branch of the GRPO objective. Consider a finite directed acyclic computation graph that is differentiable at the parameter point in question. Let \(a_i\) be the sampled token, \(\widehat A_i\) its fixed normalized advantage, and \(p_i=\operatorname {softmax}(z_i)\) the current distribution on a finite vocabulary \(\mathcal V\). With fixed behavior probability \(b_i>0\), set \[ r_i=\frac {p_i(a_i)}{b_i}, \qquad \mathcal L_i=r_i\widehat A_i, \qquad E_i=r_i\widehat A_i(e_{a_i}-p_i). \] Here \(e_{a_i}\in \mathbb R^{|\mathcal V|}\) is the sampled-token basis vector. The history and sampling decisions are held fixed during differentiation.

                                                                                                                                                                                                                                                                                                  Suppose the output head \(W_{\rm lm}\in \mathbb R^{|\mathcal V|\times d_{\rm model}}\) is untied: its only path to \(\mathcal L_i\) is through \(z_i=W_{\rm lm}h_{L,i}\), and \(h_{L,i}\in \mathbb R^{d_{\rm model}}\) is independent of \(W_{\rm lm}\). Then \[ G_i^{\rm lm}=\nabla _{W_{\rm lm}}\mathcal L_i =E_i h_{L,i}^{\mathsf T}. \]

                                                                                                                                                                                                                                                                                                  Let \(W_{\rm int}\in \mathbb R^{m\times d}\) be a shared intermediate weight. Index by a finite set \(\mathcal O_i\) every occurrence of this weight that can affect \(z_i\), assuming that all such uses have the form \(y_o=W_{\rm int}x_o\), with \(x_o\in \mathbb R^d\). First replace these uses by independent copies \(W_o\) and evaluate them all at \(W_o=W_{\rm int}\). Let \(J_{io}\in \mathbb R^{|\mathcal V|\times m}\) be the downstream Jacobian from node \(y_o\) to \(z_i\) in this graph, with the other weight copies fixed. Define the contribution of occurrence \(o\) by \[ H_{io}=\nabla _{W_o}\mathcal L_i =(J_{io}^{\mathsf T}E_i)x_o^{\mathsf T}. \] On tying the copies, the total derivative is \[ G_i^{\rm int}=\nabla _{W_{\rm int}}\mathcal L_i =\sum _{o\in \mathcal O_i}H_{io}. \] The head gradient and each occurrence contribution have rank at most one; the total shared-weight gradient need not.

                                                                                                                                                                                                                                                                                                  For a layer used once per position in a causal network, the sum includes every earlier position whose output affects token \(i\). Reuse across depth adds further occurrences. Tying the head to embeddings or other blocks also requires their contributions; the displayed head identity assumes that such tying is absent.

                                                                                                                                                                                                                                                                                                  Proof. 

                                                                                                                                                                                                                                                                                                    Softmax differentiation gives \(\nabla _{z_i}\mathcal L_i=E_i\). The outer-product rule gives the untied head identity. In the graph with independent copies, \(x_o\) does not depend on its own \(W_o\); all downstream paths from \(y_o\) are included in \(J_{io}\). The chain rule therefore gives \(\nabla _{W_o}\mathcal L_i=(J_{io}^{\mathsf T}E_i)x_o^{\mathsf T}\). Finally, the derivative of the diagonal map \(W_{\rm int}\mapsto (W_o=W_{\rm int})_{o\in \mathcal O_i}\) adds these partial derivatives.

                                                                                                                                                                                                                                                                                                    Clipped or inactive terms require their own derivative or mask. [miao2026when, Section 4.2.1, Proposition 1, and Appendix A.1] derives the intermediate outer product through one local application. For a shared weight, that calculation gives \(H_{io}\); identifying it with the total \(G_i^{\rm int}\) omits the other occurrences. The sum above supplies the chain rule needed for shared parameters.

                                                                                                                                                                                                                                                                                                    Theorem. DGG occurrence-to-head gradient-energy bound [ftip-0080]

                                                                                                                                                                                                                                                                                                      Use the per-token quantities and untied head of Theorem [ftip-007Z], and fix one occurrence \(o\in \mathcal O_i\). Assume \(d_{\rm model}\geq 1\) and positive constants \(\alpha _{\min }\), \(\beta _{\max }\), and \(C\) satisfy \[ \|h_{L,i}\|_2^2\geq \alpha _{\min }d_{\rm model}, \qquad \|x_o\|_2^2\leq \beta _{\max }d_{\rm model}, \] and the two logit-sensitivity bounds \[ \mathbb E_{a\sim p_i} \|(J_{io})_{a,:}\|_2^2\leq C, \qquad \|(J_{io})_{a_i,:}\|_2^2\leq C. \] If \(\widehat A_i\neq 0\) and \(p_i(a_i)<1\), then \[ \frac {\|H_{io}\|_F^2}{\|G_i^{\rm lm}\|_F^2} \leq \frac {\mathcal C_{\rm occ}} {(1-p_i(a_i))^2}, \qquad \mathcal C_{\rm occ} =\frac {4\beta _{\max }C}{\alpha _{\min }}. \]

                                                                                                                                                                                                                                                                                                      Proof. 

                                                                                                                                                                                                                                                                                                        The sampled-token coordinate of \(E_i\) and the lower activation bound give \[ \|G_i^{\rm lm}\|_F^2 =\|E_i\|_2^2\|h_{L,i}\|_2^2 \geq r_i^2\widehat A_i^2 (1-p_i(a_i))^2 \alpha _{\min }d_{\rm model}. \] Write \(J_{io}^{\mathsf T}E_i\) as \(r_i\widehat A_i\) times the difference between the sampled row and the \(p_i\)-weighted mean row. The squared-norm inequality \(\|u-v\|_2^2\leq 2\|u\|_2^2+2\|v\|_2^2\), Jensen's inequality for that mean, and the two row-energy bounds give \(\|J_{io}^{\mathsf T}E_i\|_2^2\leq 4r_i^2\widehat A_i^2C\). Hence \[ \|H_{io}\|_F^2 \leq 4r_i^2\widehat A_i^2C\, \beta _{\max }d_{\rm model}. \] The source's softmax probabilities make \(r_i>0\); the nonzero-advantage and nonunit-probability hypotheses make the head lower bound positive. Division and cancellation give the displayed ratio.

                                                                                                                                                                                                                                                                                                        This bounds one occurrence contribution, not the total derivative of a shared intermediate weight. For the latter, the sum in Theorem [ftip-007Z] gives only \[ \|G_i^{\rm int}\|_F \leq \sum _{o\in \mathcal O_i} \|J_{io}^{\mathsf T}E_i\|_2\|x_o\|_2. \] If the same displayed hypotheses hold for every occurrence, the triangle inequality yields the ratio bound \(|\mathcal O_i|^2\mathcal C_{\rm occ}/(1-p_i(a_i))^2\) for \(\|G_i^{\rm int}\|_F^2/\|G_i^{\rm lm}\|_F^2\). Controlling only the application at position \(i\) does not establish this all-occurrence hypothesis or the source's claimed bound for the total gradient. The contributing positions, reuse pattern, and Jacobians depend on the architecture. Neither bound establishes a small gradient or an evaluation-score comparison.

                                                                                                                                                                                                                                                                                                        The activation and row-energy hypotheses and the local inequality follow the calculation in [miao2026when, Section 4.2.1, Lemma 1, Assumption 1, Theorem 1, and Appendix A.3], with the differentiated object restricted to an occurrence contribution. They do not prove the source's total shared-weight claim under its local hypotheses.

                                                                                                                                                                                                                                                                                                        Theorem. DGG finite-batch head-gradient inequality [ftip-0081]

                                                                                                                                                                                                                                                                                                          For \(T\geq 1\) active, unclipped tokens with fixed sampled histories and the untied output head of Theorem [ftip-007Z], let \[ G^{\rm lm}=\frac 1T\sum _{i=1}^T G_i^{\rm lm}, \qquad \overline {r^2}=\frac 1T\sum _{i=1}^T r_i^2, \] and set \[ c_{\max }= \max _{1\leq i\leq T} \widehat A_i^2 \|e_{a_i}-\pi _\theta (\mathord \cdot \mid h_{L,i})\|_2^2 \|h_{L,i}\|_2^2. \] Then \[ \|G^{\rm lm}\|_F^2\leq c_{\max }\overline {r^2} =c_{\max }(1+\widehat \chi ^2), \] where \(\widehat \chi ^2\) is the statistic of Definition [ftip-0066]. If \(c_{\max }>0\), rearrangement gives the source's equivalent direction \[ \widehat \chi ^2\geq \frac {\|G^{\rm lm}\|_F^2}{c_{\max }}-1. \]

                                                                                                                                                                                                                                                                                                          Proof. 

                                                                                                                                                                                                                                                                                                            Convexity of the squared Frobenius norm and the factorization in Theorem [ftip-007Z] give \[ \left \|\frac 1T\sum _iG_i^{\rm lm}\right \|_F^2 \leq \frac 1T\sum _i\|G_i^{\rm lm}\|_F^2 \leq \frac {c_{\max }}T\sum _i r_i^2. \] The identity \(\overline {r^2}=1+\widehat \chi ^2\) follows directly from Definition [ftip-0066]; division by positive \(c_{\max }\) gives the final form.

                                                                                                                                                                                                                                                                                                            The inequality points from observed head-gradient energy to a lower bound on this finite-batch squared-ratio statistic. It is not a converse: cancellation can hide nonunit ratios. The active cancellation example in Example [ftip-0084] states its clipping interval explicitly. The proof uses no intermediate-weight bound.

                                                                                                                                                                                                                                                                                                            The finite-batch inequality follows the calculation in [miao2026when, Section 4.2.2, Lemma 2, Theorem 2, and Appendix B], under the untied-head and fixed-history assumptions stated above.

                                                                                                                                                                                                                                                                                                            Remark. DGG monitors update geometry, not evaluation safety [ftip-0082]

                                                                                                                                                                                                                                                                                                              The identities in Theorem [ftip-007Z]--Theorem [ftip-0081] concern gradients, importance ratios, activations, and occurrence-specific logit Jacobians. The intermediate bound controls a local contribution; a shared-weight bound needs control over all contributing occurrences. None of their hypotheses mentions the fixed independent-evaluation functional \(J_{\rm ev}\) of Definition [ftip-005E]. They therefore cannot imply that accepting an update preserves \(J_{\rm ev}\), or that rejecting one would have prevented a decrease.

                                                                                                                                                                                                                                                                                                              DGG adds an empirical policy on top of those identities: it monitors the increment in head-gradient energy, standardizes that increment against a trailing window, and rejects some reused updates before the optimizer step [miao2026when, Section 5 and Algorithm 1]. Its reported experiments relate that policy to observed training stability. They do not turn the Z-score into a calibrated test of independent-evaluation safety.

                                                                                                                                                                                                                                                                                                              Example. Counterexample: empirical squared-ratio excess can be negative [ftip-0083]

                                                                                                                                                                                                                                                                                                                Take one observed action \(a\) with \(\pi _{\rm old}(a)=1/2\) and \(\pi _\theta (a)=1/4\). The batch contains only that action, so \(T=1\) and \(r_1=1/2\). Hence \[ \widehat \chi ^2=r_1^2-1=-\frac 34. \] Both policies can be completed on a two-action space by assigning their remaining mass to the other action.

                                                                                                                                                                                                                                                                                                                Thus the finite-batch statistic in Definition [ftip-0066] need not share the nonnegativity of the population Pearson divergence. Theorem Theorem [ftip-0081] remains valid: its right side contains \(1+\widehat \chi ^2=1/4=\overline {r^2}\).

                                                                                                                                                                                                                                                                                                                Example. Counterexample: active batch cancellation can hide nonunit ratios [ftip-0084]

                                                                                                                                                                                                                                                                                                                  Fix \(\epsilon _{\rm clip}\in (0,1)\) and \(1<R<1+\epsilon _{\rm clip}\). On a two-token vocabulary, let both observed tokens have \(a_i=1\), current probability \(\pi _\theta (1)=1/2\), and behavior probability \(\pi _{\rm old}(1)=1/(2R)\). Take scalar hidden states \(h_{L,1}=h_{L,2}=1\) and fixed normalized advantages \(\widehat A_1=1\), \(\widehat A_2=-1\). These may be selected token terms from different rollout members. An untied head with both logits zero realizes the current probabilities. Both terms lie strictly inside the clipping interval of Definition [ftip-003F], so the clipped surrogate locally agrees with \(\mathcal L_i=r_i\widehat A_i\). Thus \(r_1=r_2=R\), and Theorem [ftip-007Z] gives \[ G_1^{\rm lm}=R(1/2,-1/2)^{\mathsf T}, \qquad G_2^{\rm lm}=-G_1^{\rm lm}. \] Consequently \(G^{\rm lm}=0\), while \(\widehat \chi ^2=R^2-1>0\). For this fixed clipping rule, the statistic in this construction is bounded above by \((1+\epsilon _{\rm clip})^2-1\).

                                                                                                                                                                                                                                                                                                                  For the raw surrogate \(\mathcal L_i=r_i\widehat A_i\) considered as a separate objective, the same algebra works at every \(R>1\) and yields arbitrarily large squared-ratio excess. This does not extend the active construction to arbitrary \(R\) under clipping: when \(R>1+\epsilon _{\rm clip}\), the positive-advantage term is locally constant, while the negative term remains active. Their clipped gradients are then \(0\) and \(-R(1/2,-1/2)^{\mathsf T}\), with nonzero mean \((-R/4,R/4)^{\mathsf T}\).

                                                                                                                                                                                                                                                                                                                  The example does not contradict Theorem [ftip-0081]: that theorem upper-bounds batch-gradient energy by a ratio moment. It supplies no lower bound on the gradient and no converse from zero batch-gradient energy to ratios equal to one. The arbitrary-ratio version concerns only the separate raw surrogate.

                                                                                                                                                                                                                                                                                                                  Example. Counterexample: a Z-score gate is not an evaluation-safety certificate [ftip-0085]

                                                                                                                                                                                                                                                                                                                    Let two consecutive proposed reused updates have the same monitored energy, \(g_{t-1}=g_t=1\). With trailing-window increment mean \(\mu _t=0\), any positive scale \(\sigma _t+\varepsilon \), and any positive threshold, DGG's score is \[ z_t=\frac {(g_t-g_{t-1})-\mu _t}{\sigma _t+\varepsilon }=0, \] so the gate accepts the proposal. Now choose a fixed evaluation interface for which the artifact before the accepted update has performance \(J_{\rm ev}=1\) and the artifact after it has performance \(J_{\rm ev}=0\).

                                                                                                                                                                                                                                                                                                                    This is consistent because the gate rule of Definition [ftip-005A] imposes no mathematical relation between its scalar monitor and \(J_{\rm ev}\). A safety claim would need an additional assumption connecting proposed updates to the independent evaluation law; the Z-score calculation alone cannot provide it.

                                                                                                                                                                                                                                                                                                                    Definition. Leading squared singular-energy share [ftip-0086]

                                                                                                                                                                                                                                                                                                                      Let \(\Delta W\in \mathbb R^{m\times n}\) be nonzero, set \(q=\min (m,n)\), and order its singular values as \(\sigma _1\geq \cdots \geq \sigma _q\geq 0\). Its leading squared singular-energy share is \[ \rho _1(\Delta W) =\frac {\sigma _1(\Delta W)^2}{\sum _{j=1}^q\sigma _j(\Delta W)^2} =\frac {\sigma _1(\Delta W)^2}{\|\Delta W\|_F^2}. \] The nonzero hypothesis prevents an undefined \(0/0\); the value lies in \([1/q,1]\).

                                                                                                                                                                                                                                                                                                                      NExt instead reports \(E_1=\sigma _1/\sum _j\sigma _j\) in Section 3.2 Low-rank optimization trajectories modeling for LLM RLVR acceleration[chen2026lowrank]. That nuclear-share statistic and \(\rho _1\) answer different questions. The squared share measures contribution to squared Frobenius norm.

                                                                                                                                                                                                                                                                                                                      Definition. Leading spectral gap [ftip-0087]

                                                                                                                                                                                                                                                                                                                        For \(\Delta W\in \mathbb R^{m\times n}\) with \(q=\min (m,n)\geq 2\), its leading spectral gap is \[ \operatorname {gap}_1(\Delta W) =\sigma _1(\Delta W)-\sigma _2(\Delta W). \] A positive gap makes the leading left and right one-dimensional singular subspaces unique, although each chosen singular vector still has an arbitrary sign. When the gap is zero, a single leading vector is not intrinsic.

                                                                                                                                                                                                                                                                                                                        The quantity is undefined when \(q=1\), since there is no second singular value. Projector comparisons require a positive gap at every compared checkpoint.

                                                                                                                                                                                                                                                                                                                        Definition. Leading-subspace projector drift [ftip-0088]

                                                                                                                                                                                                                                                                                                                          Let \(\Delta W_t\) and \(\Delta W_s\) be nonzero matrices of the same shape, each with positive leading spectral gap. If \(u_1(t)\) and \(u_1(s)\) are unit leading left singular vectors, define their leading-subspace projector drift by \[ d_{\rm proj}(t,s) =\|\Pi _t^{\rm svd}-\Pi _s^{\rm svd}\|_F, \qquad \Pi _t^{\rm svd}=u_1(t)u_1(t)^{\mathsf T}, \quad \Pi _s^{\rm svd}=u_1(s)u_1(s)^{\mathsf T}. \] The definition is independent of both singular-vector signs and takes values in \([0,\sqrt {2}]\).

                                                                                                                                                                                                                                                                                                                          This is an additional proposed trajectory diagnostic; NExt does not define it.

                                                                                                                                                                                                                                                                                                                          A large value of \(\rho _1\) from Definition [ftip-0086] says that one singular mode dominates a particular difference matrix. It does not say that the dominant subspace remains fixed across checkpoints; \(d_{\rm proj}\) measures that separate question.

                                                                                                                                                                                                                                                                                                                          Definition. Path-emulation regret [ftip-0089]

                                                                                                                                                                                                                                                                                                                            Fix the evaluation interface of Convention [ftip-005D]. Let \(P_{t+s}^{\rm act}\) be the protocol that returns the artifact reached after \(s\geq 1\) additional realized training steps from checkpoint \(t\). Let \(\mathcal K_{\leq t}\) be the saved checkpoint history available through \(t\), and let \(\widehat P_{t+s}(\mathcal K_{\leq t})\) instead return the artifact forecast from that history. Their signed path-emulation regret and absolute path-emulation regret are \[ \begin {aligned} \operatorname {Reg}^{\rm path}_{\rm ev}(t,s) &=J_{\rm ev}(P_{t+s}^{\rm act}) -J_{\rm ev}(\widehat P_{t+s}(\mathcal K_{\leq t})),\\ \operatorname {AReg}^{\rm path}_{\rm ev}(t,s) &=\left |\operatorname {Reg}^{\rm path}_{\rm ev}(t,s)\right |. \end {aligned} \]

                                                                                                                                                                                                                                                                                                                            The sign distinguishes an optimistic forecast from a pessimistic one; the absolute value measures discrepancy without cancellation across checkpoints. Both use the same task law, inference budget, and evaluator. Parameter error alone is not substituted for evaluation error. The NExt extrapolation and recovery schedule described in Sections 4.1--4.3 and 5.1 motivates this comparison Low-rank optimization trajectories modeling for LLM RLVR acceleration[chen2026lowrank], but the paper does not state this regret definition.

                                                                                                                                                                                                                                                                                                                            Example. Counterexample: early low-rank agreement does not determine continuation [ftip-008A]

                                                                                                                                                                                                                                                                                                                              Let \(e_1=(1,0)^{\mathsf T}\) and \(e_2=(0,1)^{\mathsf T}\) be the standard basis vectors of \(\mathbb R^2\). In a two-dimensional matrix chart, set \(P=e_1e_1^{\mathsf T}\) and \(Q=e_2e_2^{\mathsf T}\). Two paths share the entire observed history \[ W_0=0,\qquad W_1=P,\qquad W_2=2P. \] Every observed local difference is the same rank-one matrix \(P\). The paths then fork: path A takes \(W_3^A=3P\), whereas path B takes \(W_3^B=2P+Q\). Each next local difference is again rank one.

                                                                                                                                                                                                                                                                                                                              A deterministic history-only forecaster must return the same matrix \(\widehat W_3\) in both worlds. Since \(\|W_3^A-W_3^B\|_F=\|P-Q\|_F=\sqrt {2}\), the triangle inequality forces its Frobenius error to be at least \(1/\sqrt {2}\) on one continuation. Low-rank early motion therefore does not identify the next subspace or the next checkpoint.

                                                                                                                                                                                                                                                                                                                              Remark. Compression of a charted path is not capability acquisition [ftip-008B]

                                                                                                                                                                                                                                                                                                                                NExt extracts global, local, and target differences from LoRA checkpoint matrices, keeps leading singular factors, learns a nonlinear predictor, jumps in that parameter chart, and resumes RLVR [chen2026lowrank, Sections 3.2, 4.1--4.3, and 5.1]. Its reported results are empirical; the paper states no theorem that a leading subspace remains stable or that a forecast preserves a policy.

                                                                                                                                                                                                                                                                                                                                The quantities in Definition [ftip-0086]--Definition [ftip-0089] separate four tests. Squared singular-energy share concerns one matrix, spectral gap controls whether its leading subspace is identifiable, projector drift compares those subspaces over time, and path-emulation regret returns to fixed independent evaluation. None, by itself, is evidence that new feedback was acquired or that a new capability was learned. Such a claim must use a declared post-training gain such as Definition [ftip-005F] and must charge forecast training, the parameter jump, and recovery updates.

                                                                                                                                                                                                                                                                                                                                Alignment gain and preference information [ftip-008E]

                                                                                                                                                                                                                                                                                                                                  Two finite models ask different questions about post-training. The first assumes an exact KL-regularized optimizer and characterizes the reward gain that its exponential tilt can produce. The second asks what ordinal comparisons reveal when post-training may reroute a fixed set of response circuits.

                                                                                                                                                                                                                                                                                                                                  Neither source model is a general account of neural post-training. The first assumes exact optimization of a declared scalar reward. The second is a stylized routing model with a fixed circuit set. Extending the KL identity to an approximate optimizer requires further analysis. Extending the ordinal routing conclusion to a changing circuit set requires additional assumptions on that change.

                                                                                                                                                                                                                                                                                                                                  Finite KL-regularized alignment [ftip-008F]

                                                                                                                                                                                                                                                                                                                                    This subsection studies an exact, finite optimization model. A reference law is exponentially tilted by a declared scalar reward. In this setting, reward gain admits two exact descriptions: a Jeffreys-divergence identity and a covariance under the reference law.

                                                                                                                                                                                                                                                                                                                                    The statements do not model approximate optimization, neural training cost, reward validity, or independent capability evaluation.

                                                                                                                                                                                                                                                                                                                                    Remark. Exact optimization on a finite response set [ftip-008G]

                                                                                                                                                                                                                                                                                                                                      Theorems 1 and 2 of the v1 preprint [paes2026theoretical] concern an exactly optimal KL-regularized policy and a fixed query. On a finite response set, their expectations and normalizers are ordinary finite sums.

                                                                                                                                                                                                                                                                                                                                      These exact identities do not establish a comparison among best-of-\(N\), PPO, and GRPO, or a general guarantee for proxy rewards and reward ensembles. Those questions require assumptions beyond exact optimization of one reward.

                                                                                                                                                                                                                                                                                                                                      Notation. Translating the alignment source notation [ftip-008H]

                                                                                                                                                                                                                                                                                                                                        The source writes \(\lambda >0\) for the KL penalty. Here we write \(\beta >0\), matching the DPO notation in Notation [ftip-003M]--Definition [ftip-003O]. This avoids collision with the generalized-advantage parameter in Definition [ftip-003E] and the protocol law in Definition [ftip-007Q].

                                                                                                                                                                                                                                                                                                                                        The source's gain \(\Delta (r,r')\) is written \(G_p(r;s)\): \(r\) is the reward used to tilt the reference law \(p\), while \(s\) is the reward used to evaluate the tilted law. This avoids collision with both the simplex notation \(\Delta (X)\) of Notation [ftip-000A] and the paired DPO margin of Notation [ftip-003M]. For a finite set \(\mathcal Y\), a law \(p\in \Delta (\mathcal Y)\), and functions \(f,g:\mathcal Y\to \mathbb R\), set

                                                                                                                                                                                                                                                                                                                                        \[ \operatorname {Cov}_p(f,g) =\mathbb E_{y\sim p}[f(y)g(y)] -\mathbb E_{y\sim p}[f(y)]\, \mathbb E_{y\sim p}[g(y)]. \]

                                                                                                                                                                                                                                                                                                                                        Definition. Finite KL-alignment instance [ftip-008I]

                                                                                                                                                                                                                                                                                                                                          A finite KL-alignment instance consists of a nonempty finite response set \(\mathcal Y\), a reference law \(p\in \Delta (\mathcal Y)\), a penalty \(\beta >0\), and finite real functions \(r,s:\mathcal Y\to \mathbb R\). The reference support is

                                                                                                                                                                                                                                                                                                                                          \[ S_p=\{y\in \mathcal Y:p(y)>0\}. \]

                                                                                                                                                                                                                                                                                                                                          A prompt is fixed and suppressed. The function \(r\) determines the alignment update; \(s\) measures its result. They may coincide, but they need not. Finiteness makes every exponential weight and expectation below finite.

                                                                                                                                                                                                                                                                                                                                          These objects specialize the fixed-query setting in [paes2026theoretical, Section 2, equations (2.1)--(2.2)]; they are not a definition of alignment in general.

                                                                                                                                                                                                                                                                                                                                          Definition. Exponential weight and partition function [ftip-008J]

                                                                                                                                                                                                                                                                                                                                            For a finite KL-alignment instance, define the exponential weight and partition function by

                                                                                                                                                                                                                                                                                                                                            \[ a_r(y)=\exp \left (\frac {r(y)}{\beta }\right ), \qquad Z_r=\mathbb E_{y\sim p}[a_r(y)]. \]

                                                                                                                                                                                                                                                                                                                                            Every \(a_r(y)\) is finite and strictly positive. Since \(p\) is a probability law on a nonempty finite set, \(0<Z_r<\infty \).

                                                                                                                                                                                                                                                                                                                                            This weight and normalizer are the fixed-query form of [paes2026theoretical, Equation (2.2)].

                                                                                                                                                                                                                                                                                                                                            Definition. Aligned law in finite-source notation [ftip-008K]

                                                                                                                                                                                                                                                                                                                                              The aligned law induced by \(r\) is \(q_r\in \Delta (\mathcal Y)\) given by

                                                                                                                                                                                                                                                                                                                                              \[ q_r(y)=\frac {p(y)a_r(y)}{Z_r}. \]

                                                                                                                                                                                                                                                                                                                                              Normalization follows from the definition of \(Z_r\). Moreover, \(q_r(y)>0\) exactly when \(p(y)>0\). This is the finite notation for the same exponential-tilt optimizer stated in Definition [ftip-003O]; support preservation was proved in Theorem [ftip-007C].

                                                                                                                                                                                                                                                                                                                                              This formula is [paes2026theoretical, Equation (2.2)]. It assumes the exact optimizer, not an iterate returned by a particular training algorithm.

                                                                                                                                                                                                                                                                                                                                              Definition. Cross-reward gain under an alignment reward [ftip-008L]

                                                                                                                                                                                                                                                                                                                                                The cross-reward gain from aligning with \(r\) and evaluating with \(s\) is

                                                                                                                                                                                                                                                                                                                                                \[ G_p(r;s) =\mathbb E_{y\sim q_r}[s(y)] -\mathbb E_{y\sim p}[s(y)]. \]

                                                                                                                                                                                                                                                                                                                                                The semicolon records two roles. Its left argument changes the response law; its right argument scores both laws. Thus \(G_p(r;s)\) is not an independent evaluation unless \(s\) has separately been declared to serve that role.

                                                                                                                                                                                                                                                                                                                                                This is the finite notation for \(\Delta (r,r')\) in Theorem 2, equation (3.4), of Theoretical limits of language model alignment[paes2026theoretical].

                                                                                                                                                                                                                                                                                                                                                Definition. Jeffreys divergence [ftip-008M]

                                                                                                                                                                                                                                                                                                                                                  For probability laws \(p\) and \(q\) for which both terms are finite, their Jeffreys divergence is

                                                                                                                                                                                                                                                                                                                                                  \[ J(p,q) =D_{\mathrm {KL}}(p\Vert q) +D_{\mathrm {KL}}(q\Vert p). \]

                                                                                                                                                                                                                                                                                                                                                  The KL divergence and its argument order are defined in Definition [ftip-006X]. Unlike either directed term, \(J(p,q)=J(q,p)\). In the finite tilt of Definition [ftip-008K], \(p\) and \(q_r\) have the same support, so both terms are finite.

                                                                                                                                                                                                                                                                                                                                                  See [paes2026theoretical, Theorem 1, equation (3.2)].

                                                                                                                                                                                                                                                                                                                                                  Lemma. Log-density ratio of the exact tilt [ftip-008N]

                                                                                                                                                                                                                                                                                                                                                    For every \(y\in S_p\), the aligned law satisfies

                                                                                                                                                                                                                                                                                                                                                    \[ \log \frac {q_r(y)}{p(y)} =\frac {r(y)}{\beta }-\log Z_r. \]

                                                                                                                                                                                                                                                                                                                                                    Proof. 

                                                                                                                                                                                                                                                                                                                                                      On \(S_p\), both \(p(y)\) and \(q_r(y)\) are positive. Dividing the formula of Definition [ftip-008K] by \(p(y)\) and taking logarithms gives the identity.

                                                                                                                                                                                                                                                                                                                                                      This is equation (B.1) followed by the logarithmic step in [paes2026theoretical, Appendix B.1, equations (B.1)--(B.2)].

                                                                                                                                                                                                                                                                                                                                                      Theorem. Exact reward gain equals scaled Jeffreys divergence [ftip-008O]

                                                                                                                                                                                                                                                                                                                                                        For a finite KL-alignment instance,

                                                                                                                                                                                                                                                                                                                                                        \[ G_p(r;r)=\beta J(p,q_r). \]

                                                                                                                                                                                                                                                                                                                                                        Proof. 

                                                                                                                                                                                                                                                                                                                                                          Rearranging Lemma [ftip-008N] gives \(r(y)=\beta \log (q_r(y)/p(y))+\beta \log Z_r\) on the common support. Taking expectation first under \(q_r\) and then under \(p\) yields

                                                                                                                                                                                                                                                                                                                                                          \[ \begin {aligned} \mathbb E_{q_r}[r] &=\beta D_{\mathrm {KL}}(q_r\Vert p)+\beta \log Z_r,\\ \mathbb E_p[r] &=-\beta D_{\mathrm {KL}}(p\Vert q_r)+\beta \log Z_r. \end {aligned} \]

                                                                                                                                                                                                                                                                                                                                                          Subtracting cancels the common normalizer and gives the result.

                                                                                                                                                                                                                                                                                                                                                          This is the finite form of [paes2026theoretical, Theorem 1, equation (3.2), with proof in Appendix B.1].

                                                                                                                                                                                                                                                                                                                                                          Remark. What the Jeffreys identity does and does not identify [ftip-008P]

                                                                                                                                                                                                                                                                                                                                                            The identity Theorem [ftip-008O] is an equality inside one declared model. It says that exact gain in the optimizing reward equals a symmetric divergence from the reference law. It does not say that a larger divergence improves a different utility, nor that a training algorithm reaches the exact tilt.

                                                                                                                                                                                                                                                                                                                                                            The identity accounts for neither rollout and update work nor the cost of obtaining \(r\). Consequently it is not, by itself, a bound on the costed post-training potential of Definition [ftip-005M].

                                                                                                                                                                                                                                                                                                                                                            Theorem. Cross-reward gain is a base-law covariance [ftip-008Q]

                                                                                                                                                                                                                                                                                                                                                              For a finite KL-alignment instance,

                                                                                                                                                                                                                                                                                                                                                              \[ G_p(r;s) =\operatorname {Cov}_p\left (s,\frac {a_r}{Z_r}\right ). \]

                                                                                                                                                                                                                                                                                                                                                              Proof. 

                                                                                                                                                                                                                                                                                                                                                                The aligned expectation can be written under the reference law as \(\mathbb E_{q_r}[s]=\mathbb E_p[s a_r/Z_r]\). Also \(\mathbb E_p[a_r/Z_r]=1\). Substituting these two identities into Definition [ftip-008L] gives the covariance defined in Notation [ftip-008H].

                                                                                                                                                                                                                                                                                                                                                                This is the finite form of Theorem 2, equation (3.4), in Theoretical limits of language model alignment[paes2026theoretical]. Its proof is in Appendix B.1, equations (B.5)--(B.7).

                                                                                                                                                                                                                                                                                                                                                                Remark. The covariance is predictive only for a declared reward [ftip-008R]

                                                                                                                                                                                                                                                                                                                                                                  The identity Theorem [ftip-008Q] expresses exact tilted-law gain using expectations under \(p\). This makes the population quantity accessible from the reference law in principle. A finite-sample estimator still needs its own sampling law, moment assumptions, and error analysis.

                                                                                                                                                                                                                                                                                                                                                                  The formula also remains indexed by both \(r\) and \(s\). It cannot turn a proxy reward into an independent utility. If \(s=r\), it measures improvement in the same quantity that defined the exact optimizer; if \(s\ne r\), its sign is determined by the displayed covariance.

                                                                                                                                                                                                                                                                                                                                                                  Example. A two-response alignment identity [ftip-008S]

                                                                                                                                                                                                                                                                                                                                                                    Take \(\mathcal Y=\{a,b\}\), \(p=(1/2,1/2)\), \(\beta =1\), and \(r(a)=0\), \(r(b)=\log 3\). Exponential weighting changes the reference law as follows.

                                                                                                                                                                                                                                                                                                                                                                    The reward gain is

                                                                                                                                                                                                                                                                                                                                                                    \[ G_p(r;r) =\left (\frac 34-\frac 12\right )\log 3 =\frac 14\log 3. \]

                                                                                                                                                                                                                                                                                                                                                                    Direct calculation gives

                                                                                                                                                                                                                                                                                                                                                                    \[ \begin {aligned} D_{\mathrm {KL}}(q_r\Vert p) &=\frac 14\log \frac 12+\frac 34\log \frac 32,\\ D_{\mathrm {KL}}(p\Vert q_r) &=\frac 12\log 2+\frac 12\log \frac 23, \end {aligned} \]

                                                                                                                                                                                                                                                                                                                                                                    whose sum is \(\frac 14\log 3\). Thus the example checks Theorem [ftip-008O] exactly; it is not an empirical alignment result.

                                                                                                                                                                                                                                                                                                                                                                    Corollary. Averaging the fixed-query identity over prompts [ftip-008T]

                                                                                                                                                                                                                                                                                                                                                                      Let \(\mathcal X\) be finite with prompt law \(\mu \). For each \(x\in \mathcal X\), let \(p_x\), \(r_x\), and \(q_{r_x}\) be a finite KL-alignment instance with the same penalty \(\beta >0\). Then

                                                                                                                                                                                                                                                                                                                                                                      \[ \sum _{x\in \mathcal X}\mu (x)G_{p_x}(r_x;r_x) =\beta \sum _{x\in \mathcal X}\mu (x)J(p_x,q_{r_x}). \]

                                                                                                                                                                                                                                                                                                                                                                      Proof. 

                                                                                                                                                                                                                                                                                                                                                                        Apply Theorem [ftip-008O] at each prompt and take the finite \(\mu \)-weighted sum.

                                                                                                                                                                                                                                                                                                                                                                        The source theorem is stated for each fixed query. This corollary performs only finite averaging; it does not introduce a shared neural parameterization across prompts.

                                                                                                                                                                                                                                                                                                                                                                        Lemma. Additive reward shifts leave the aligned law unchanged [ftip-008U]

                                                                                                                                                                                                                                                                                                                                                                          For constants \(c,d\in \mathbb R\),

                                                                                                                                                                                                                                                                                                                                                                          \[ q_{r+c}=q_r, \qquad G_p(r+c;s+d)=G_p(r;s). \]

                                                                                                                                                                                                                                                                                                                                                                          Proof. 

                                                                                                                                                                                                                                                                                                                                                                            The shifted weight is \(a_{r+c}=e^{c/\beta }a_r\), while its partition function is \(Z_{r+c}=e^{c/\beta }Z_r\); the common factor cancels in the aligned law. Adding \(d\) to the evaluation reward adds \(d\) to both expectations in the gain, so it also cancels.

                                                                                                                                                                                                                                                                                                                                                                            This finite lemma records the same prompt-dependent additive non-identifiability that appears in the DPO reparameterization of Definition [ftip-003P].

                                                                                                                                                                                                                                                                                                                                                                            Remark. A penalty coefficient is not a hard KL budget [ftip-008V]

                                                                                                                                                                                                                                                                                                                                                                              For fixed \(\beta \), the exponential tilt solves the penalized problem

                                                                                                                                                                                                                                                                                                                                                                              \[ \max _{q\in \Delta (\mathcal Y)} \left \{\mathbb E_q[r] -\beta D_{\mathrm {KL}}(q\Vert p)\right \} \]

                                                                                                                                                                                                                                                                                                                                                                              under the conventions of Definition [ftip-008I]. This is not the same specification as choosing a number \(\kappa \) and solving

                                                                                                                                                                                                                                                                                                                                                                              \[ \max _q\mathbb E_q[r] \quad \text {subject to}\quad D_{\mathrm {KL}}(q\Vert p)\leq \kappa . \]

                                                                                                                                                                                                                                                                                                                                                                              A Lagrange multiplier can relate the two problems when the relevant duality and activity conditions hold. The coefficient \(\beta \) alone does not declare a hard budget, and the identities Theorem [ftip-008O]--Theorem [ftip-008Q] do not supply those conditions.

                                                                                                                                                                                                                                                                                                                                                                              Remark. Fixed-query identities and their assumptions [ftip-008W]

                                                                                                                                                                                                                                                                                                                                                                                The source setup writes rewards as \(r(\mathbf x,\mathbf y)\), while the display of Theorem 1 reverses the two arguments in places. This subsection uses the setup order and then suppresses the fixed prompt. The source also moves between a dataset-level penalized objective and fixed-query identities. The finite-averaging result Corollary [ftip-008T] makes that step explicit.

                                                                                                                                                                                                                                                                                                                                                                                The identities specialize Theoretical limits of language model alignment[paes2026theoretical] to a finite response set. They require no extension to the full sequence space.

                                                                                                                                                                                                                                                                                                                                                                                Finally, exact exponential tilting is a distributional optimizer. It does not account for rollout, gradient, optimizer, or systems cost, and it does not show that PPO, GRPO, DPO, or any frontier training run attains the displayed law. Applying the identities to a training run therefore requires a separate argument that its output law is the exact optimizer.

                                                                                                                                                                                                                                                                                                                                                                                Preference-feedback distortion [ftip-008X]

                                                                                                                                                                                                                                                                                                                                                                                  A finite routing model supports preference-distortion lower bounds in Sections 2--3 and Appendix A of The limits of preference data for post-training[zhao2025limits]. Cardinal queries permit a different guarantee under the hypotheses of Peeking behind the ordinal curtain: Improving distortion via cardinal queries[amanatidis2021peeking].

                                                                                                                                                                                                                                                                                                                                                                                  Both comparisons depend on the queries, circuits, routing maps, utility, feedback profile, algorithm, and comparator class. The noiseless and Bradley--Terry bounds retain those model restrictions.

                                                                                                                                                                                                                                                                                                                                                                                  Remark. The routing-model assumption behind preference limits [ftip-008Y]

                                                                                                                                                                                                                                                                                                                                                                                    The routing model and preference limits below are based on the v1 preprint The limits of preference data for post-training[zhao2025limits]. It models a pretrained system as a finite collection of response circuits plus learned maps that route queries to those circuits. Post-training changes the routing maps while retaining the circuit collection.

                                                                                                                                                                                                                                                                                                                                                                                    The noiseless lower bound is proved here under explicit pointwise response separation and a deterministic preference-only learner, whose returned router may be stochastic. Its finite partition estimate and cardinal-utility construction give a restricted reconstruction of the source rate; the proof does not establish a randomized-learner extension.

                                                                                                                                                                                                                                                                                                                                                                                    The routing model is a source assumption, not an architectural theorem about language models. In particular, its lower bounds do not prove that real post-training creates no circuits, that a neural network decomposes into the displayed objects, or that every preference-learning algorithm obeys the same bound outside this model.

                                                                                                                                                                                                                                                                                                                                                                                    Notation. Notation for the finite preference model [ftip-008Z]

                                                                                                                                                                                                                                                                                                                                                                                      The finite preference model uses the following symbols, corresponding to the notation of The limits of preference data for post-training[zhao2025limits]:

                                                                                                                                                                                                                                                                                                                                                                                      \[ \mathcal Q\mapsto Q,\qquad \mathcal R\mapsto Y,\qquad \mathcal S_0\mapsto C_0,\qquad \mathcal Z\mapsto H, \] \[ \Phi \mapsto \mathfrak E,\qquad \mathcal D\mapsto \mu _Q,\qquad M\mapsto \mathfrak m. \]

                                                                                                                                                                                                                                                                                                                                                                                      Thus \(H\) denotes the source's finite internal-representation set, not a public interaction history. The family \(\mathfrak E\) contains admissible query encoders and is unrelated to the costed potential \(\Phi \) of Definition [ftip-005M].

                                                                                                                                                                                                                                                                                                                                                                                      Definition. Queries, responses, and retained circuits [ftip-0090]

                                                                                                                                                                                                                                                                                                                                                                                        Following the formal model in Section 2 of The limits of preference data for post-training[zhao2025limits], let \(Q\) be a finite nonempty query set and \(Y\) a response set. A response circuit is a function \(c:Q\to Y\). The finite nonempty set \(C_0\) contains the circuits retained from the pretrained model.

                                                                                                                                                                                                                                                                                                                                                                                        The word ``circuit'' is source terminology for this abstract function. No claim is made here that an element of \(C_0\) is localized in a neural network or corresponds to one human-named capability.

                                                                                                                                                                                                                                                                                                                                                                                        Definition. Query representation and circuit routing [ftip-0091]

                                                                                                                                                                                                                                                                                                                                                                                          Let \(H\) be a finite nonempty representation set and \(\mathfrak E\subseteq H^Q\) a finite nonempty family of admissible encoders. A query encoder is \(e\in \mathfrak E\). A circuit router is a map

                                                                                                                                                                                                                                                                                                                                                                                          \[ h:H\longrightarrow \Delta (C_0). \]

                                                                                                                                                                                                                                                                                                                                                                                          For a query \(\xi \in Q\), the composition \(h(e(\xi ))\) is a law on the retained circuits. Sampling \(c\sim h(e(\xi ))\) and returning \(c(\xi )\) gives the response law. These are the two routing components in the source model [zhao2025limits, Section 2, ``Formal model''].

                                                                                                                                                                                                                                                                                                                                                                                          Definition. Pretrained and post-trained routing models [ftip-0092]

                                                                                                                                                                                                                                                                                                                                                                                            A routing model is a triple \(\mathfrak m=(e,h,C_0)\) with the types fixed in Definition [ftip-0090]--Definition [ftip-0091]. The pretrained model is \(\mathfrak m_0=(e_0,h_0,C_0)\). In the source intervention, a post-trained model may replace \(e_0\) and \(h_0\), but it retains exactly \(C_0\).

                                                                                                                                                                                                                                                                                                                                                                                            Write \(\mathfrak m(\xi )\) for the random response obtained by sampling \(c\sim h(e(\xi ))\) and returning \(c(\xi )\). The source sometimes writes this as though the router selected a circuit rather than a distribution; the stochastic reading follows its declared codomain \(\Delta (C_0)\).

                                                                                                                                                                                                                                                                                                                                                                                            Definition. Utility and the uniform query law [ftip-0093]

                                                                                                                                                                                                                                                                                                                                                                                              The source fixes the uniform probability law \(\mu _Q\) on \(Q\) and a utility function

                                                                                                                                                                                                                                                                                                                                                                                              \[ u:Q\times Y\longrightarrow \mathbb R. \]

                                                                                                                                                                                                                                                                                                                                                                                              For a routing model \(\mathfrak m\), its expected utility is

                                                                                                                                                                                                                                                                                                                                                                                              \[ U_u(\mathfrak m) =\mathbb E_{\xi \sim \mu _Q} \mathbb E\left [u\left (\xi ,\mathfrak m(\xi )\right )\mid \xi \right ]. \]

                                                                                                                                                                                                                                                                                                                                                                                              This is the outcome objective in [zhao2025limits, Section 2, ``Outcome-based optimization with preference data'']. It is an assumed cardinal utility, not something ordinal comparisons directly reveal.

                                                                                                                                                                                                                                                                                                                                                                                              Definition. Complete noiseless ordinal preference profile [ftip-0094]

                                                                                                                                                                                                                                                                                                                                                                                                Assume that distinct retained circuits never tie at a query. For each \(\xi \in Q\), utility then induces a strict comparison by

                                                                                                                                                                                                                                                                                                                                                                                                \[ c_i\succ _{\xi ,u}c_j \quad \Longleftrightarrow \quad u\left (\xi ,c_i(\xi )\right ) >u\left (\xi ,c_j(\xi )\right ). \]

                                                                                                                                                                                                                                                                                                                                                                                                The complete noiseless ordinal profile is \(\succ _u=(\succ _{\xi ,u})_{\xi \in Q}\). The source gives the learner unlimited, unbiased access to every such comparison [zhao2025limits, Section 2, final paragraph]. Utilities with ties require a separately declared deterministic tie-break; the lower bounds below use the source's tie-free constructions.

                                                                                                                                                                                                                                                                                                                                                                                                Remark. Full preference data and an online oracle expose the same source information [ftip-0095]

                                                                                                                                                                                                                                                                                                                                                                                                  Within this finite model, a table containing every comparison in \(\succ _u\) and a noiseless online oracle that answers every possible query expose the same ordinal information. The source deliberately grants this ideal access so that its obstruction is not caused by finite sampling or an offline split [zhao2025limits, Section 2].

                                                                                                                                                                                                                                                                                                                                                                                                  This equivalence does not price the number of queries, labeler time, or adaptivity. It therefore cannot be transferred to a finite-feedback protocol without a separate query-complexity statement.

                                                                                                                                                                                                                                                                                                                                                                                                  Definition. Preference-only post-training algorithm and attainable route class [ftip-0096]

                                                                                                                                                                                                                                                                                                                                                                                                    A preference-only post-training algorithm \(\mathcal A\) maps the pretrained routing model and the complete profile to

                                                                                                                                                                                                                                                                                                                                                                                                    \[ \mathfrak m_{\mathcal A}(u) =\mathcal A(\mathfrak m_0,\succ _u). \]

                                                                                                                                                                                                                                                                                                                                                                                                    The deterministic comparator class displayed in the source theorems is

                                                                                                                                                                                                                                                                                                                                                                                                    \[ \mathcal M_{\rm det}(C_0) =\left \{(e,h,C_0):e\in \mathfrak E, h:H\to C_0\right \}. \]

                                                                                                                                                                                                                                                                                                                                                                                                    The source's formal model initially permits stochastic routers \(h:H\to \Delta (C_0)\), but its theorem comparator uses deterministic \(h:H\to C_0\). The comparator class is therefore the displayed deterministic class.

                                                                                                                                                                                                                                                                                                                                                                                                    Definition. Multiplicative post-training distortion [ftip-0097]

                                                                                                                                                                                                                                                                                                                                                                                                      Let \(\mathcal B\) be any post-training algorithm with output \(\mathfrak m_{\mathcal B}(u)\) under the feedback law induced by \(u\). When the denominator is positive, define its multiplicative post-training distortion by

                                                                                                                                                                                                                                                                                                                                                                                                      \[ \operatorname {Dist}_u(\mathcal B;\mathfrak m_0) =\frac { \max _{\mathfrak m^*\in \mathcal M_{\rm det}(C_0)}U_u(\mathfrak m^*) }{ U_u(\mathfrak m_{\mathcal B}(u)) }. \]

                                                                                                                                                                                                                                                                                                                                                                                                      If the numerator is positive and the denominator is zero, set the ratio to \(+\infty \). The source lower bounds construct bounded nonnegative utilities for which the comparison is well defined [zhao2025limits, Equation (2) and Appendix A]. Distortion measures loss relative to the declared comparator class; it is not an absolute capability score.

                                                                                                                                                                                                                                                                                                                                                                                                      Definition. Borda count [ftip-0098]

                                                                                                                                                                                                                                                                                                                                                                                                        Let \(m=|C_0|\), and suppose each \(\succ _{\xi ,u}\) is a strict total order on \(C_0\). If \(\operatorname {rank}_{\succ _{\xi ,u}}(c)\) places the most preferred circuit at rank one, its Borda score is

                                                                                                                                                                                                                                                                                                                                                                                                        \[ B_{\xi }(c)=m-\operatorname {rank}_{\succ _{\xi ,u}}(c). \]

                                                                                                                                                                                                                                                                                                                                                                                                        The Borda-count choice is any circuit in

                                                                                                                                                                                                                                                                                                                                                                                                        \[ \operatorname *{arg\,max}_{c\in C_0} \sum _{\xi \in Q}B_{\xi }(c). \]

                                                                                                                                                                                                                                                                                                                                                                                                        This is [zhao2025limits, Definition 3.1]. The source cites a prior equivalence between a standard RLHF model and Borda count; the definition here does not assert that every RLHF implementation is a Borda rule.

                                                                                                                                                                                                                                                                                                                                                                                                        Example. A compromise circuit can maximize utility without winning Borda count [ftip-0099]

                                                                                                                                                                                                                                                                                                                                                                                                          Example 3.2 of The limits of preference data for post-training[zhao2025limits] prints only \(a\geq 0\) and \(2a<b\), but those conditions do not force its stated rankings or Borda totals. Sufficient conditions are \(0<a<1/2\) and \(2a<b<1\). Take three queries, three circuits, and a singleton representation set, so every query must use one common circuit. Set

                                                                                                                                                                                                                                                                                                                                                                                                          \[ \begin {array}{c|ccc} &c_A&c_B&c_C\\ \hline \xi _1&1&0&1-a\\ \xi _2&1&0&1-a\\ \xi _3&0&1&b \end {array} \]

                                                                                                                                                                                                                                                                                                                                                                                                          These inequalities give the rankings \(c_A\succ c_C\succ c_B\) for \(\xi _1,\xi _2\) and \(c_B\succ c_C\succ c_A\) for \(\xi _3\). Hence the Borda totals are \((4,2,3)\), so the ordinal rule selects \(c_A\). The utility totals are \((2,1,2-2a+b)\). Since \(2a<b\), circuit \(c_C\) has strictly greater total utility than \(c_A\).

                                                                                                                                                                                                                                                                                                                                                                                                          This finite example isolates information lost by ranking. The compromise circuit is never first for an individual query, yet its aggregate utility is largest. It does not show that Borda is always suboptimal or that a neural model must collapse all queries to one representation.

                                                                                                                                                                                                                                                                                                                                                                                                          Theorem. Noiseless preference distortion for deterministic learners [ftip-009A]

                                                                                                                                                                                                                                                                                                                                                                                                            Let \(Q,H\) be nonempty finite sets, let \(\varnothing \neq \mathfrak E\subseteq H^Q\) be finite, and let \(C_0=\{c_1,\ldots ,c_m\}\) be a nonempty finite set of deterministic maps \(Q\to Y\). Write \(N=|Q|\), \(r=|H|\), \(p=|\mathfrak E|\) and \(m=|C_0|\). The query law is uniform on \(Q\). Call \(C_0\) pointwise response-separating when

                                                                                                                                                                                                                                                                                                                                                                                                            \[ c_i\neq c_j\quad \Longrightarrow \quad c_i(q)\neq c_j(q) \qquad (q\in Q). \]

                                                                                                                                                                                                                                                                                                                                                                                                            Assume this separation. Let \(\mathcal A\) be a deterministic preference-only learner: from a pretrained model \(\mathfrak m_0\) and the complete strict ordinal profile, it returns \((e,h,C_0)\) with \(e\in \mathfrak E\) and a possibly stochastic router \(h:H\to \Delta (C_0)\). The comparator class is exactly \(\mathcal M_{\rm det}(C_0)\) of Definition [ftip-0096], including every map \(H\to C_0\) for each \(e\in \mathfrak E\).

                                                                                                                                                                                                                                                                                                                                                                                                            For every such pretrained model and learner there exists \(u:Q\times Y\to [0,1]\), inducing a strict profile, such that

                                                                                                                                                                                                                                                                                                                                                                                                            \[ \sum _{j=1}^m u(q,c_j(q))=1\quad (q\in Q), \]\[ R_{Q,\mathfrak E,H}=\frac {N}{\sqrt {N(r+\log p)}+r}, \]\[ \operatorname {Dist}_u(\mathcal A;\mathfrak m_0) \geq \frac 1{80}\min \{\sqrt m,R_{Q,\mathfrak E,H}\}. \]

                                                                                                                                                                                                                                                                                                                                                                                                            Logarithms are natural. Utility averages over the uniform query and the learner's router draw as in Definition [ftip-0093]. The comparator maximum exists because its class is finite and nonempty. It is positive for the normalized utilities above: some constant-circuit route has mean at least \(1/m\). A zero learner utility therefore gives distortion \(+\infty \), with no \(0/0\) case.

                                                                                                                                                                                                                                                                                                                                                                                                            Proof. 

                                                                                                                                                                                                                                                                                                                                                                                                              First, for every normalized nonnegative utility, the comparator value is at least the learner value. Keep the learner's representation map and, on each fiber, choose a circuit maximizing its total utility there. That deterministic choice dominates the stochastic mixture and belongs to the comparator class. Thus distortion is at least one.

                                                                                                                                                                                                                                                                                                                                                                                                              Put

                                                                                                                                                                                                                                                                                                                                                                                                              \[ \begin {aligned} D&=\sqrt {Nr}+\sqrt {\frac N2\log (4p)},& B&=\sqrt {N(r+\log p)},\\ T&=\min \{\sqrt m,R_{Q,\mathfrak E,H}\},& x&=\min \{\sqrt m,N/(2D)\}. \end {aligned} \]

                                                                                                                                                                                                                                                                                                                                                                                                              Since \((\log 4)/2<1\leq r\) and \(\log p\geq 0\), we have \(D\leq 2B\). Consequently \(N/(2D)\geq N/(4B)\geq R_{Q,\mathfrak E,H}/4\) and \(x\geq T/4\). Every denominator is positive.

                                                                                                                                                                                                                                                                                                                                                                                                              If \(m=1\), assign utility one to the sole circuit response at every query. Distortion is one and \(T\leq 1\). If \(m\geq 2\) but \(x<2\), assign the same strict normalized values \(2(m-j)/(m(m-1))\) to the circuits in index order at every query. Distortion is at least one and \(T<8\), which proves the claimed bound. Extend both assignments by zero to all other responses.

                                                                                                                                                                                                                                                                                                                                                                                                              In the remaining case set \(k=\lfloor x\rfloor \). Then

                                                                                                                                                                                                                                                                                                                                                                                                              \[ 2\leq k\leq \sqrt m,\qquad kD\leq N/2, \qquad k\geq x/2\geq T/8. \]

                                                                                                                                                                                                                                                                                                                                                                                                              Write \([k]=\{1,\ldots ,k\}\) and fix a map \(f:Q\to [k]\) supplied by Lemma [ftip-009C]. At a query with label \(i=f(q)\), fix the strict order putting \(c_i\) first and the remaining circuits in increasing index order. Let \(\operatorname {rank}_i(j)\in \{1,\ldots ,m\}\) be the position of \(c_j\), with the first circuit at rank one, and define

                                                                                                                                                                                                                                                                                                                                                                                                              \[v_i(j)=\frac {2(m-\operatorname {rank}_i(j))}{m(m-1)}.\]

                                                                                                                                                                                                                                                                                                                                                                                                              These values decrease strictly in the fixed order, sum to one and lie in \([0,2/m]\). The ordinal profile is now fixed independently of the learner's output. Run the deterministic learner on this profile and \(\mathfrak m_0\), obtaining \((e,h,C_0)\). Write \(h_z(j)=h(z)(c_j)\) for the probability of circuit \(c_j\) at representation \(z\). For each \(z\in H\), choose \(i_z\in [k]\) minimizing \(h_z(j)\) over \(j\in [k]\), breaking ties by index. Since \(\sum _{j=1}^k h_z(j)\leq 1\), we have \(h_z(i_z)\leq1/k\).

                                                                                                                                                                                                                                                                                                                                                                                                              Let \(A=\{q:f(q)=i_{e(q)}\}\) and \(S=|A|\). The lower partition bound gives

                                                                                                                                                                                                                                                                                                                                                                                                              \[ S=\sum _zX_{z,i_z}\geq \sum _z\min _{j\in [k]}X_{z,j} \geq N/k-D\geq N/(2k). \]

                                                                                                                                                                                                                                                                                                                                                                                                              Fix \(\epsilon =1/4\). For \(i=f(q)\), assign

                                                                                                                                                                                                                                                                                                                                                                                                              \[ u(q,c_j(q))= \begin {cases} (1-\epsilon )\mathbf 1_{j=i}+\epsilon v_i(j),&q\in A,\\ (1-\epsilon )/m+\epsilon v_i(j),&q\notin A. \end {cases} \]

                                                                                                                                                                                                                                                                                                                                                                                                              Each row is nonnegative and sums to one. On selected queries the added peak favors the already highest-ranked circuit; on the other queries the same constant is added to every circuit. Hence every row induces exactly the fixed strict order. Pointwise response separation makes these assignments well-defined on \(Q\times Y\); assign zero to responses outside the attained circuit responses. Because the final utility has the unchanged ordinal profile, the deterministic learner returns the same \((e,h,C_0)\).

                                                                                                                                                                                                                                                                                                                                                                                                              Write \(W=NU\) for total utility. A selected query gives the learner at most \((1-\epsilon )/k+2\epsilon/m\); any other query gives at most \((1-\epsilon )/m+2\epsilon/m\). Averaging over the stochastic router yields

                                                                                                                                                                                                                                                                                                                                                                                                              \[ W_{\mathcal A} \leq (1-\epsilon )S/k+(1-\epsilon )(N-S)/m+2\epsilon N/m \leq S/k+2N/m. \]

                                                                                                                                                                                                                                                                                                                                                                                                              Choose the deterministic comparator \(e^*=e\) and \(h^*(z)=c_{i_z}\). It belongs to the declared class, attains utility at least \(1-\epsilon \geq1/2\) on each selected query and nonnegative utility elsewhere. Thus its total utility is at least \(S/2\). If learner utility is zero the bound follows. Otherwise, using \(S\geq N/(2k)\) and \(k^2\leq m\),

                                                                                                                                                                                                                                                                                                                                                                                                              \[ \begin {aligned} \operatorname {Dist}_u &\geq \frac {S/2}{S/k+2N/m} =\frac {k}{2(1+2kN/(mS))}\\ &\geq \frac {k}{2(1+4k^2/m)} \geq \frac {k}{10}\geq \frac {T}{80}. \end {aligned} \]

                                                                                                                                                                                                                                                                                                                                                                                                              Appendix Theorem A.1 of The limits of preference data for post-training[zhao2025limits] states the corresponding rate for its routing model. Its displayed balancing parameter retains \(\log N\) factors that are absent from its final rate; the second-moment partition bound in Lemma [ftip-009C] supplies a separate argument for the stated restricted model. Its index-based perturbation on queries outside the selected group need not preserve their prescribed favorite; the query-dependent rank weights used here preserve it. When circuits collide at a query, a circuitwise prescription need not define a response utility; pointwise separation excludes that issue.

                                                                                                                                                                                                                                                                                                                                                                                                              The utility is a worst-case existential choice for each fixed learner. The proof permits stochastic inference, but it does not cover internal learner randomness: a utility chosen after a realized random output need not be one utility valid before the learner's random draw. No claim about response-colliding circuits or the separate noisy-preference bound follows.

                                                                                                                                                                                                                                                                                                                                                                                                              Corollary. A square-root corollary under explicit query growth [ftip-009B]

                                                                                                                                                                                                                                                                                                                                                                                                                Under all hypotheses of Theorem [ftip-009A], including a deterministic preference-only learner and pointwise response separation, assume

                                                                                                                                                                                                                                                                                                                                                                                                                \[R_{Q,\mathfrak E,H}\geq \sqrt {|C_0|}.\]

                                                                                                                                                                                                                                                                                                                                                                                                                For every pretrained model and every such learner, the utility supplied by that theorem satisfies

                                                                                                                                                                                                                                                                                                                                                                                                                \[ \operatorname {Dist}_u(\mathcal A;\mathfrak m_0) \geq \frac 1{80}\sqrt {|C_0|}. \]

                                                                                                                                                                                                                                                                                                                                                                                                                Proof. 

                                                                                                                                                                                                                                                                                                                                                                                                                  The displayed growth condition makes the minimum in Theorem [ftip-009A] equal to \(\sqrt {|C_0|}\).

                                                                                                                                                                                                                                                                                                                                                                                                                  Theorem 3.3 of The limits of preference data for post-training[zhao2025limits] gives a square-root rate in its large-query regime. The explicit condition above gives a finite regime for the reconstructed theorem with its stated learner and response assumptions.

                                                                                                                                                                                                                                                                                                                                                                                                                  Lemma. A simultaneous finite partition bound [ftip-009C]

                                                                                                                                                                                                                                                                                                                                                                                                                    Let \(Q,H\) be nonempty finite sets with \(N=|Q|\) and \(r=|H|\), and let \(\mathfrak E\subseteq H^Q\) be nonempty and finite with \(p=|\mathfrak E|\). For every integer \(k\geq 1\), there is a map \(f:Q\to [k]\) such that, simultaneously for every \(e\in \mathfrak E\),

                                                                                                                                                                                                                                                                                                                                                                                                                    \[ \begin {aligned} \sum _{z\in H}\max _{j\in [k]}X_{z,j}&\leq \frac Nk+D,\\ \sum _{z\in H}\min _{j\in [k]}X_{z,j}&\geq \frac Nk-D, \end {aligned} \]

                                                                                                                                                                                                                                                                                                                                                                                                                    where \([k]=\{1,\ldots ,k\}\), logarithms are natural, and

                                                                                                                                                                                                                                                                                                                                                                                                                    \[ X_{z,j}=|\{q\in Q:e(q)=z,\ f(q)=j\}|, \qquad D=\sqrt {Nr}+\sqrt {\frac N2\log (4p)}. \]

                                                                                                                                                                                                                                                                                                                                                                                                                    Proof. 

                                                                                                                                                                                                                                                                                                                                                                                                                      Choose the labels \(f(q)\) independently and uniformly from \([k]\). Fix \(e,z\), write \(n_z=|e^{-1}(z)|\), and put \(a_j=X_{z,j}-n_z/k\). Each occupancy has variance \(n_z(1/k)(1-1/k)\), so

                                                                                                                                                                                                                                                                                                                                                                                                                      \[\mathbb E\sum _{j=1}^k a_j^2=n_z(1-1/k).\]

                                                                                                                                                                                                                                                                                                                                                                                                                      The pointwise maximum and minimum satisfy

                                                                                                                                                                                                                                                                                                                                                                                                                      \[ \begin {aligned} \max _jX_{z,j}&\leq n_z/k+\|a\|_2,\\ \min _jX_{z,j}&\geq n_z/k-\|a\|_2. \end {aligned} \]

                                                                                                                                                                                                                                                                                                                                                                                                                      Jensen's inequality gives \(\mathbb E\|a\|_2\leq \sqrt {n_z(1-1/k)}\). Summing over \(z\) and applying Cauchy--Schwarz yields

                                                                                                                                                                                                                                                                                                                                                                                                                      \[ \begin {aligned} \mathbb E\sum _z\max _jX_{z,j}&\leq N/k+\sqrt {Nr(1-1/k)},\\ \mathbb E\sum _z\min _jX_{z,j}&\geq N/k-\sqrt {Nr(1-1/k)}. \end {aligned} \]

                                                                                                                                                                                                                                                                                                                                                                                                                      Changing one label changes only one representation group: one occupancy decreases by one and another increases by one. Its maximum and its minimum each change by at most one. Thus both sums have bounded differences with all \(N\) constants equal to one. McDiarmid's inequality, also used in Appendix A.1 of The limits of preference data for post-training[zhao2025limits], bounds each relevant one-sided deviation of size \(t\) by \(\exp (-2t^2/N)\).

                                                                                                                                                                                                                                                                                                                                                                                                                      Choose \(t=\sqrt {(N/2)\log (4p)}\). A union bound over both tails and all \(p\) representations gives total failure probability at most

                                                                                                                                                                                                                                                                                                                                                                                                                      \[2p\exp (-2t^2/N)=\frac 12<1.\]

                                                                                                                                                                                                                                                                                                                                                                                                                      At least one deterministic labeling satisfies both claimed bounds, since \(\sqrt {Nr(1-1/k)}\leq \sqrt {Nr}\). Empty representation fibers have all occupancies zero and require no exception.

                                                                                                                                                                                                                                                                                                                                                                                                                      The bound uses a second-moment estimate in place of the occupancy estimate in source Lemma A.2. The chosen labeling depends only on \(Q,H,\mathfrak E,k\); its existence uses proof randomness and does not assume randomness in the learning algorithm.

                                                                                                                                                                                                                                                                                                                                                                                                                      Definition. Bradley--Terry preference from a score map [ftip-009D]

                                                                                                                                                                                                                                                                                                                                                                                                                        Fix a query \(\xi \) and nonnegative circuit scores \(a_{\xi ,c}\geq 0\) such that \(a_{\xi ,c_i}+a_{\xi ,c_j}>0\) for every compared pair. The Bradley--Terry comparison law is

                                                                                                                                                                                                                                                                                                                                                                                                                        \[ \Pr (c_i\succ _{\xi }c_j) =\frac {a_{\xi ,c_i}} {a_{\xi ,c_i}+a_{\xi ,c_j}}. \]

                                                                                                                                                                                                                                                                                                                                                                                                                        Only score ratios are identified: multiplying every score for a fixed query by the same positive constant leaves all comparison probabilities unchanged. The linear and exponential score links discussed in [zhao2025limits, Section 3.2] therefore impose different assumptions on the relation between rewards and comparisons.

                                                                                                                                                                                                                                                                                                                                                                                                                        Definition. Exponential-score Bradley--Terry feedback [ftip-009E]

                                                                                                                                                                                                                                                                                                                                                                                                                          The exponential-score link sets

                                                                                                                                                                                                                                                                                                                                                                                                                          \[ a_{\xi ,c}=\exp \left (u(\xi ,c(\xi ))\right ). \]

                                                                                                                                                                                                                                                                                                                                                                                                                          For this link, exact comparison probabilities reveal pairwise utility differences through

                                                                                                                                                                                                                                                                                                                                                                                                                          \[ \log \frac {\Pr (c_i\succ _{\xi }c_j)} {\Pr (c_j\succ _{\xi }c_i)} =u(\xi ,c_i(\xi ))-u(\xi ,c_j(\xi )). \]

                                                                                                                                                                                                                                                                                                                                                                                                                          This algebra explains why a known link and infinite noiseless frequency information can expose more than an ordinal order. It does not apply when the link is unknown or misspecified.

                                                                                                                                                                                                                                                                                                                                                                                                                          Definition. Linear-score Bradley--Terry feedback [ftip-009F]

                                                                                                                                                                                                                                                                                                                                                                                                                            The linear-score link sets

                                                                                                                                                                                                                                                                                                                                                                                                                            \[ a_{\xi ,c}=u(\xi ,c(\xi )), \qquad \Pr (c_i\succ _{\xi }c_j) =\frac {u(\xi ,c_i(\xi ))} {u(\xi ,c_i(\xi ))+u(\xi ,c_j(\xi ))}. \]

                                                                                                                                                                                                                                                                                                                                                                                                                            Write \(p^u_{\xi ,ij}\) for the displayed probability and define the complete pairwise-probability profile

                                                                                                                                                                                                                                                                                                                                                                                                                            \[ P_u^{\rm lin} =\left (p^u_{\xi ,ij}\right )_{\xi \in Q,\,c_i\neq c_j\in C_0}. \]

                                                                                                                                                                                                                                                                                                                                                                                                                            This requires nonnegative utilities and a positive denominator for each queried pair. A linear-score algorithm \(\mathcal A_{\rm lin}\) takes \((\mathfrak m_0,P_u^{\rm lin})\) as input and returns \(\mathfrak m_{\mathcal A_{\rm lin}}(u)\). The following lower bound concerns this specific link; it is not a lower bound for every stochastic preference model.

                                                                                                                                                                                                                                                                                                                                                                                                                            Theorem. General linear-score noisy preference lower bound [ftip-009G]

                                                                                                                                                                                                                                                                                                                                                                                                                              Assume pointwise response separation as defined in Theorem [ftip-009A]. For every pretrained routing model and linear-score algorithm \(\mathcal A_{\rm lin}\), there exists a utility

                                                                                                                                                                                                                                                                                                                                                                                                                              \[ u:Q\times Y\longrightarrow [0,1]. \]

                                                                                                                                                                                                                                                                                                                                                                                                                              Post-training from even the complete comparison-probability profile of the linear-score link then satisfies

                                                                                                                                                                                                                                                                                                                                                                                                                              \[ \operatorname {Dist}_u(\mathcal A_{\rm lin};\mathfrak m_0) \geq \widetilde \Omega \left ( \min \left \{|C_0|,R_{Q,\mathfrak E,H}\right \} \right ), \]

                                                                                                                                                                                                                                                                                                                                                                                                                              where \(R_{Q,\mathfrak E,H}\) is defined in Theorem [ftip-009A]. The theorem is again existential in \(u\) and uses the source's deterministic comparator. The same circuitwise-utility issue recorded in Theorem [ftip-009A] prevents us from asserting the source's unrestricted pretrained-model quantifier here. Its noise is informative because probabilities depend on cardinal scores; the obstruction survives under the particular linear link.

                                                                                                                                                                                                                                                                                                                                                                                                                              This lower bound is the form of Appendix Theorem A.5 in The limits of preference data for post-training[zhao2025limits] with the additional pointwise response-separation assumption stated above.

                                                                                                                                                                                                                                                                                                                                                                                                                              Remark. The noisy main theorem and appendix have different asymptotic notation [ftip-009H]

                                                                                                                                                                                                                                                                                                                                                                                                                                The main-text Theorem 3.4 of The limits of preference data for post-training[zhao2025limits] displays \(\Omega (|C_0|)\) in its stated large-query regime. Appendix Theorem A.5 displays the general bound with \(\widetilde \Omega \) and the minimum in Theorem [ftip-009G]. The tilde can hide logarithmic factors, so these statements are not textually identical.

                                                                                                                                                                                                                                                                                                                                                                                                                                The general bound in Theorem [ftip-009G] has the appendix's rate with a possible logarithmic loss. Eliminating that loss to obtain the main-text rate requires an additional argument.

                                                                                                                                                                                                                                                                                                                                                                                                                                Definition. Cardinal value query [ftip-009I]

                                                                                                                                                                                                                                                                                                                                                                                                                                  In the social-choice source, agents rank alternatives and also have nonnegative cardinal values. A value query takes an agent \(i\) and an alternative \(j\) and returns \(v_{ij}\) [amanatidis2021peeking, Definition 1].

                                                                                                                                                                                                                                                                                                                                                                                                                                  Under the routing analogy, a query \(\xi \in Q\) plays the role of an agent and a circuit \(c\in C_0\) plays the role of an alternative. A cardinal query therefore reveals one value \(u(\xi ,c(\xi ))\). Query counts inherited from the social-choice theorem are per query/agent, not totals across \(Q\).

                                                                                                                                                                                                                                                                                                                                                                                                                                  Theorem. Acceptable Range Voting information--distortion tradeoff [ftip-009J]

                                                                                                                                                                                                                                                                                                                                                                                                                                    Let \(m\) be the number of alternatives and let \(k\in \{1,\ldots ,m\}\). Theorem 4 of Peeking behind the ordinal curtain: Improving distortion via cardinal queries[amanatidis2021peeking] states that \(k\)-Acceptable Range Voting uses

                                                                                                                                                                                                                                                                                                                                                                                                                                    \[ O(k\log m) \]

                                                                                                                                                                                                                                                                                                                                                                                                                                    value queries per agent and has distortion

                                                                                                                                                                                                                                                                                                                                                                                                                                    \[ O\left (m^{1/(k+1)}\right ). \]

                                                                                                                                                                                                                                                                                                                                                                                                                                    This is a social-choice mechanism theorem. It transfers directly to the singleton-representation specialization \(|H|=1\), where every query must use one common circuit. Under that restriction, queries are agents and circuits are alternatives as in Definition [ftip-009I]. The theorem does not by itself cover a routing comparator that may choose different circuits for different representations, and it is not an implementation of neural post-training.

                                                                                                                                                                                                                                                                                                                                                                                                                                    This statement is Theorem 4 of Peeking behind the ordinal curtain: Improving distortion via cardinal queries[amanatidis2021peeking].

                                                                                                                                                                                                                                                                                                                                                                                                                                    Corollary. Constant distortion with logarithmically many value queries per query [ftip-009K]

                                                                                                                                                                                                                                                                                                                                                                                                                                      Taking \(k\) proportional to \(\log m\) in Theorem [ftip-009J] yields constant distortion with

                                                                                                                                                                                                                                                                                                                                                                                                                                      \[ O(\log ^2 m) \]

                                                                                                                                                                                                                                                                                                                                                                                                                                      value queries per agent. This is Corollary 2 of Peeking behind the ordinal curtain: Improving distortion via cardinal queries[amanatidis2021peeking], inherited as Theorem 3.5 by The limits of preference data for post-training[zhao2025limits]. Under the routing analogy, the count is per query, so a full table over \(|Q|\) queries can require \(O(|Q|\log ^2m)\) values. The statement is an upper bound for the named mechanism in the common-circuit specialization of Theorem [ftip-009J]. It is not a result for the full routing comparator, nor a lower bound saying that this many values are necessary.

                                                                                                                                                                                                                                                                                                                                                                                                                                      Remark. Information and optimization assumptions in the two finite models [ftip-009L]

                                                                                                                                                                                                                                                                                                                                                                                                                                        The two source families assume different information models; the diagram compares them without imposing an information order.

                                                                                                                                                                                                                                                                                                                                                                                                                                        The KL identities characterize the exact optimizer for a declared scalar reward. The preference lower bounds are worst-case statements inside a fixed- circuit routing model. Bradley--Terry conclusions depend on the chosen score link. In the common-circuit specialization, cardinal queries change the information modality and admit a positive mechanism result. Outside that specialization, the preference and cardinal-query results are not directly comparable without further assumptions.

                                                                                                                                                                                                                                                                                                                                                                                                                                        None of these statements derives the finite transcript theorem Theorem [ftip-007S], and none proves that benchmark gain is capability acquisition. Applying either result to a training system requires that system to satisfy the corresponding information, optimizer, and comparator assumptions.

                                                                                                                                                                                                                                                                                                                                                                                                                                        Controlled coverage, feedback resolution, and prompt breadth [ftip-009M]

                                                                                                                                                                                                                                                                                                                                                                                                                                          This section studies finite measurements and controlled comparisons that separate starting-policy coverage from the information supplied by a reward. It also records how a training prompt law limits the scope of an observed post-training effect.

                                                                                                                                                                                                                                                                                                                                                                                                                                          The empirical route is a controlled language-model post-training study. Its reported outcomes remain experiment-specific observations. Theorems in this section follow from the stated finite-probability assumptions; the empirical results alone do not imply those conclusions.

                                                                                                                                                                                                                                                                                                                                                                                                                                          Starting-policy interventions [ftip-009N]

                                                                                                                                                                                                                                                                                                                                                                                                                                            A comparison among starting policies is meaningful only after the task, training grid, feedback rule, and evaluation procedure have been declared. Observed differences are conditional on those experimental coordinates.

                                                                                                                                                                                                                                                                                                                                                                                                                                            Remark. The source experiment as an intervention matrix [ftip-009O]

                                                                                                                                                                                                                                                                                                                                                                                                                                              [clay2026demystifying, Sections 4.1--4.3 and Figure 1] organize the reported experiments along three declared axes: a starting model distribution, a training-prompt distribution, and a reward function. Each reported measurement therefore belongs to a cell of a matrix rather than to an unqualified ``RL post-training'' condition. The source holds its broad training recipe fixed while varying selected axes; it does not study variation among RL algorithms.

                                                                                                                                                                                                                                                                                                                                                                                                                                              Each experimental comparison is conditional on its model, task, prompt law, executable reward rule, training budget, and evaluation procedure. The reward rule is especially consequential here because the main text and Appendix C do not state identical sparse-reward semantics. Section 4.2 describes target containment with a length penalty. Appendix C's prose says an exact target receives unit reward, but its displayed equation requires the response to be strictly longer than the target for any positive reward. These two descriptions do not identify a single sparse-reward implementation.

                                                                                                                                                                                                                                                                                                                                                                                                                                              Definition. Target-response event [ftip-009P]

                                                                                                                                                                                                                                                                                                                                                                                                                                                Fix an evaluation instance \(x\), a response space \(\mathcal Y_x\), and a declared target predicate \(h_x^\star :\mathcal Y_x\to \{0,1\}\). For a sampled response \(Y\), the target-response event is

                                                                                                                                                                                                                                                                                                                                                                                                                                                \[ E_x^\star =\{h_x^\star (Y)=1\}. \]

                                                                                                                                                                                                                                                                                                                                                                                                                                                The predicate is part of the evaluation specification. It may test exact string equality after a declared normalization, containment of a target substring, equality of a parsed answer, or another explicitly typed condition. These predicates are not interchangeable. The movie-quote and AIME experiments in [clay2026demystifying, Sections 4.1--4.2] use different response objects and therefore require different target predicates.

                                                                                                                                                                                                                                                                                                                                                                                                                                                Remark. Exact-string success and task utility are different predicates [ftip-009Q]

                                                                                                                                                                                                                                                                                                                                                                                                                                                  Let \(y_x^\star \) be a designated string and let \(N_x\) be a declared normalizer. Exact-string success is the specialization \(h_x^\star (y)=\mathbf 1\{N_x(y)=N_x(y_x^\star )\}\) of Definition [ftip-009P]. A task utility may instead accept semantically equivalent answers, assign partial credit, invoke a verifier, or depend on evaluator randomness as in Convention [ftip-005D].

                                                                                                                                                                                                                                                                                                                                                                                                                                                  Consequently, a change in target-string match rate is not automatically a change in task utility. [clay2026demystifying, Sections 4.1--4.2] deliberately use narrow target behaviours to study controlled coverage. Transferring their measurements to broader capability requires a separately justified evaluator.

                                                                                                                                                                                                                                                                                                                                                                                                                                                  Definition. Base, SFT-positive, and SFT-negative starting-policy triple [ftip-009R]

                                                                                                                                                                                                                                                                                                                                                                                                                                                    For one declared model family and target predicate, a starting-policy triple is

                                                                                                                                                                                                                                                                                                                                                                                                                                                    \[ \left (\pi ^{\mathrm {base}},\pi ^+,\pi ^-\right ). \]

                                                                                                                                                                                                                                                                                                                                                                                                                                                    Here \(\pi ^{\mathrm {base}}\) is the unmodified starting policy, \(\pi ^+\) is obtained by a declared supervised update intended to increase target-response frequency, and \(\pi ^-\) is obtained by a declared update intended to decrease it. The superscripts name producing interventions, not mathematical order relations between the resulting policies.

                                                                                                                                                                                                                                                                                                                                                                                                                                                    [clay2026demystifying, Section 4.1] instantiates the triple with the source's Base, SFT-positive, and SFT-negative checkpoints. For the movie quote, its SFT mixture places twenty percent weight on the target quote and eighty percent on other quotes from the Cornell Movie-Dialogs corpus; the negative intervention maximizes cross-entropy loss on the target.

                                                                                                                                                                                                                                                                                                                                                                                                                                                    Remark. SFT-positive and SFT-negative are composite weight interventions [ftip-009S]

                                                                                                                                                                                                                                                                                                                                                                                                                                                      The policies \(\pi ^+\) and \(\pi ^-\) of Definition [ftip-009R] are produced by optimization. Their weights, output probabilities, representations, and off-target behaviours can all change together. Calling one intervention ``positive'' and the other ``negative'' describes its intended effect on the declared target response; it does not assert that only one probability mass was edited.

                                                                                                                                                                                                                                                                                                                                                                                                                                                      The comparisons in [clay2026demystifying, Sections 4.1 and 5.1] therefore test dependence on three constructed starting checkpoints. They do not identify a causal effect of initial target probability alone without an additional intervention model.

                                                                                                                                                                                                                                                                                                                                                                                                                                                      Definition. Controlled post-training experiment cell [ftip-009T]

                                                                                                                                                                                                                                                                                                                                                                                                                                                        A controlled post-training experiment cell is a record

                                                                                                                                                                                                                                                                                                                                                                                                                                                        \[ \mathfrak c= (M,\pi ^{\mathrm {init}},\mathsf T,\mathcal D_{\mathrm {tr}}, r^{\mathrm {id}},\mathcal A,b_{\mathrm {tr}},\mathsf E), \]

                                                                                                                                                                                                                                                                                                                                                                                                                                                        where \(M\) identifies the model architecture and checkpoint lineage, \(\pi ^{\mathrm {init}}\) is its starting policy, \(\mathsf T\) is the task, \(\mathcal D_{\mathrm {tr}}\) is the training-prompt law, \(r^{\mathrm {id}}\) identifies an executable reward rule and version, \(\mathcal A\) is the update procedure, \(b_{\mathrm {tr}}\) is the training budget, and \(\mathsf E\) is the evaluation interface. Random seeds and hyperparameters belong to the relevant record fields even when suppressed from the notation.

                                                                                                                                                                                                                                                                                                                                                                                                                                                        [clay2026demystifying, Figure 1 and Sections 4.1--4.3] motivates the coordinates. The source varies starting distribution, prompt distribution, and reward while using a common broad RL setup. Because its main-text and Appendix-C sparse rewards differ, the reward field is an identifier for an executable rule, not merely the word ``sparse.''

                                                                                                                                                                                                                                                                                                                                                                                                                                                        Definition. Matched cells and held-fixed coordinates [ftip-009U]

                                                                                                                                                                                                                                                                                                                                                                                                                                                          Let \(J\) index the coordinates of an experiment cell \(\mathfrak c\) from Definition [ftip-009T]. For \(S\subseteq J\), two cells \(\mathfrak c\) and \(\mathfrak c'\) are matched outside \(S\) when

                                                                                                                                                                                                                                                                                                                                                                                                                                                          \[ \mathfrak c_j=\mathfrak c'_j\qquad \text {for every }j\in J\setminus S. \]

                                                                                                                                                                                                                                                                                                                                                                                                                                                          The coordinates in \(J\setminus S\) are the held-fixed coordinates; those in \(S\) are the declared intervention coordinates. Equality means equality at the resolution recorded by the experiment, including evaluation sample size when that size affects the reported statistic.

                                                                                                                                                                                                                                                                                                                                                                                                                                                          A matched comparison licenses a contrast between the recorded cells. It does not show that a named coordinate is internally atomic. In particular, matching outside the starting-policy coordinate leaves the composite-checkpoint qualification of Remark [ftip-009S] in force.

                                                                                                                                                                                                                                                                                                                                                                                                                                                          Example. Three starting laws under one declared training grid [ftip-009V]

                                                                                                                                                                                                                                                                                                                                                                                                                                                            A source comparison may place the three starting policies of Definition [ftip-009R] into cells matched outside the starting-policy coordinate. The shared boxes below mean equality of the declared grid fields, not that the three checkpoints differ in only one scalar probability.

                                                                                                                                                                                                                                                                                                                                                                                                                                                            This is the comparison pattern used in [clay2026demystifying, Sections 4.1 and 5.1]. An actual cell still needs its model, task, reward implementation, and numerical record; the diagram is not a claim that all experiments in the paper instantiate one identical grid.

                                                                                                                                                                                                                                                                                                                                                                                                                                                            Remark. What the starting-policy comparison can and cannot identify [ftip-009W]

                                                                                                                                                                                                                                                                                                                                                                                                                                                              Within a declared model, task, training grid, and evaluation procedure, the three-cell comparison can establish that the measured post-training outcome differs across the source's constructed starting checkpoints. The movie-quote and AIME entries in [clay2026demystifying, Section 5.1, Tables 1--2] are empirical records of that form.

                                                                                                                                                                                                                                                                                                                                                                                                                                                              The comparison does not isolate initial target probability from every other SFT-induced weight change, prove that an observed zero has zero support, or establish acquisition of a broader capability. The reported model sets differ across the paper: [clay2026demystifying, Section 4.1] names OLMo 3, Qwen2-7B, Qwen3-1.7B, and Qwen2.5-7B-Instruct, while Table 1 and Appendix G also report Qwen3-8B and Qwen2-1.5B. Each measurement is specific to the model and configuration in its table row.

                                                                                                                                                                                                                                                                                                                                                                                                                                                              Finite initial-coverage measurement [ftip-009X]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                A finite evaluation records hits, not mathematical support. This subsection introduces the hit count and its sampling law, derives the exact zero-hit bound under independent sampling, and then returns to the limits of the source measurement.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                Definition. Initial evaluation hit count [ftip-009Y]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                  Fix a starting policy, an evaluation sampling law, and the target predicate of Definition [ftip-009P]. Before post-training, draw evaluation records \((X_j,Y_j)_{j=1}^m\). Define the hit indicators and the initial evaluation hit count by

                                                                                                                                                                                                                                                                                                                                                                                                                                                                  \[ I_j^\star =h_{X_j}^\star (Y_j), \qquad K_m=\sum _{j=1}^{m}I_j^\star . \]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                  The sampling law determines whether the instances \(X_j\) are fixed, resampled, or stratified. The adjective ``initial'' locates the measurement before the post-training intervention; it does not assert that the samples are independent or that the starting policy is a foundation checkpoint.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                  Definition. Empirical initial success rate [ftip-009Z]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                    For a nonempty initial evaluation sample of size \(m\), the empirical initial success rate is

                                                                                                                                                                                                                                                                                                                                                                                                                                                                    \[ \widehat p_m=\frac {K_m}{m} =\widehat {\mathbb E}_{j\in \{1,\ldots ,m\}}[I_j^\star ], \]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                    using the empirical-average convention of Convention [ftip-006Z]. This is a statistic of the declared sample. It is not, without a sampling model and an uncertainty statement, the exact successful-support probability \(p_P(x)\) of Definition [ftip-005U].

                                                                                                                                                                                                                                                                                                                                                                                                                                                                    Remark. Zero observed hits are not zero probability [ftip-00A0]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                      The equality \(K_m=0\) says that no target response occurred in one finite sample. Every success probability \(0\leq p<1\) assigns positive probability \((1-p)^m\) to this observation under independent Bernoulli sampling. Thus \(\widehat p_m=0\) does not imply \(p=0\), absence from mathematical support, or impossibility of discovery under a larger budget.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                      The entries printed as 0.00 percent in [clay2026demystifying, Section 5.1, Tables 1--2] are empirical rates at the stated evaluation sizes. They must not be rewritten as exact support claims.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                      Theorem. Zero-hit likelihood under iid evaluation [ftip-00A1]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                        Let \(m\in \mathbb N_{\geq 1}\). Assume the hit indicators from Definition [ftip-009Y] are independent Bernoulli variables with a common success probability \(p\). Then \(K_m\) has the binomial law and

                                                                                                                                                                                                                                                                                                                                                                                                                                                                        \[ \Pr _p(K_m=0)=(1-p)^m. \]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                        Proof. 

                                                                                                                                                                                                                                                                                                                                                                                                                                                                          The event \(K_m=0\) is \(\bigcap _{j=1}^m\{I_j^\star =0\}\). Independence and \(\Pr _p(I_j^\star =0)=1-p\) give the displayed product.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                          This finite statement follows from the displayed hypotheses. Applying it to a source table requires the additional iid and stationary-success assumptions stated above.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                          Corollary. Exact one-sided bound after zero hits [ftip-00A2]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                            Assume Theorem [ftip-00A1] with \(m\in \mathbb N_{\geq 1}\) and fix \(0<\delta <1\). If \(K_m=0\), inversion of the exact zero-count likelihood gives the one-sided upper endpoint

                                                                                                                                                                                                                                                                                                                                                                                                                                                                            \[ u_{m,\delta }=1-\delta ^{1/m}. \]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                            Indeed, \(\Pr _{u_{m,\delta }}(K_m=0)=\delta \), and for every \(p>u_{m,\delta }\) one has \(\Pr _p(K_m=0)<\delta \). Thus the observed zero count excludes probabilities above \(u_{m,\delta }\) at exact level \(\delta \) under the declared iid model.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                            Proof. 

                                                                                                                                                                                                                                                                                                                                                                                                                                                                              By Theorem [ftip-00A1], the zero-count likelihood is \((1-p)^m\), which is strictly decreasing in \(p\). Solving \((1-p)^m=\delta \) gives the endpoint and the stated strict inequality.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                              This is a likelihood inversion derived from the displayed finite setup, not a source theorem and not a support certificate.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                              Example. The 128-sample zero-hit bound [ftip-00A3]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                Take \(m=128\) and \(\delta =0.05\) in Corollary [ftip-00A2]. After zero hits, the exact one-sided upper endpoint is

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                \[ u_{128,0.05} =1-0.05^{1/128} \approx 0.02313. \]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                Under the iid Bernoulli model, probabilities above approximately 2.313 percent make a zero count less than five percent likely. The calculation does not turn a recorded \(0/128\) into proof that the true probability is zero, and it does not apply if the 128 evaluations have a different joint sampling law.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                Definition. First positive sparse-reward time [ftip-00A4]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                  Fix an executable sparse-reward rule and let \(r_j^{\mathrm {sp}}\) be the reward returned on rollout \(j\). The first positive sparse-reward time is the extended-valued index

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                  \[ J_+=\inf \{j\geq 1:r_j^{\mathrm {sp}}>0\}, \qquad \inf \varnothing :=\infty . \]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                  This definition concerns the reward implementation named by an experiment cell. The event \(r_j^{\mathrm {sp}}>0\) coincides with a target-response event only when that equality is part of the declared reward semantics. In particular, a length penalty or partial-credit rule can separate positive reward from exact target match.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                  Corollary. Sparse-reward discovery within a rollout budget [ftip-00A5]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                    Suppose the events \(\{r_j^{\mathrm {sp}}>0\}\) are independent and have a common probability \(q\). For every positive rollout budget \(B\),

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                    \[ \Pr (J_+\leq B)=1-(1-q)^B. \]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                    Proof. 

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                      Apply the independent-attempt theorem Theorem [ftip-0078] with \(E_j=\{r_j^{\mathrm {sp}}>0\}\). Its discovery event is exactly \(\{J_+\leq B\}\).

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                      This is a specialization proved from the displayed hypotheses. It does not supply independence, stationarity, or the value of \(q\) for a training run, and it does not equate positive proxy reward with task utility.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                      Example. The AIME 128-sample measurement record [ftip-00A6]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                        [clay2026demystifying, Section 5.1, Table 2] reports the following empirical target-answer rates for AIME Problem 4 with Qwen2.5-7B-Instruct and evaluation size \(m=128\). The task asks for the number of integer pairs \((x,y)\in [-100,100]^2\) satisfying \(12x^2-xy-6y^2=0\); the target answer is \(117\).

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                        \[ \begin {array}{c|ccc} &\mathrm {SFT{+}}&\mathrm {Base}&\mathrm {SFT{-}}\\ \hline \text {No Reward}&26.6&3.92&0.00\\ \text {Sparse Reward}&85.9&10.2&0.00\\ \text {Dense Reward}&86.7&92.2&0.00 \end {array} \]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                        Every entry in the displayed array is a percentage.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                        These are source-reported empirical percentages, not exact policy probabilities. ``No Reward'' is retained as the source's row label; the table alone does not define it as a post-training protocol. The three zero entries for SFT-negative are finite observations and remain subject to Remark [ftip-00A0]. Appendix Figure 5's caption prints a different set of Qwen2.5-7B-Instruct values that duplicates the neighbouring movie-quote caption and is incompatible with Table 2. The displayed percentages are those of Table 2; the caption does not provide a consistent alternative measurement.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                        Remark. An observed plateau is not a universal probability threshold [ftip-00A7]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                          [clay2026demystifying, Section 5.2 and Figure 2] report that the Qwen3-1.7B Base movie-quote cell, whose initial empirical match rate is about 0.5 percent, does not optimize under the source's sparse-reward run, whereas its dense-reward run rises toward fifty percent. [clay2026demystifying, Appendix Figure 8] gives final match rates 10.0 percent for sparse reward and 48.8 percent for dense reward. Thus ``failed'' here means failure of the reported sparse run to optimize as intended, not zero final matches.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                          A plateau is indexed by the model, target, reward implementation, optimizer, sampling process, and budget in its experiment cell. One observed transition therefore does not identify a universal initial-probability threshold for RL learning, support, or capability acquisition.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                          Sparse, dense, and process feedback [ftip-00A8]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                            Sparse, dense, and process rewards expose different observations about a response. This subsection treats that difference as a change in the feedback channel, rather than as a free change in the smoothness of one fixed objective.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                            Definition. Sparse exact reward [ftip-00A9]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                              Let \(\mathcal Y\) be a finite response set and fix a target response \(\tau \in \mathcal Y\). The sparse exact reward is the map \(r_{\rm exact}:\mathcal Y\to \{0,1\}\) defined by

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                              \[ r_{\rm exact}(y)=\mathbf 1\{y=\tau \}. \]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                              This idealized reward exposes one bit: whether the whole response equals the target. It does not expose a prefix, edit location, or partial milestone. The movie-quote source uses related but textually inconsistent substring and length-penalized rewards; the distinct formulas are compared in Remark [ftip-00AA].

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                              Remark. Main-text and Appendix-C sparse-reward discrepancy [ftip-00AA]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                Section 4.2 of Demystifying Reinforcement Learning Post-Training of Language Models[clay2026demystifying] displays a substring indicator \(\mathbf 1\{\tau \subseteq y\}\) and says that a length penalty is applied. In Appendix C, \(n\) is the maximum generation length and \(s\) is the number of tokens beyond the target. The appendix first defines the excess-length penalty

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                \[ p(s)= \begin {cases} 0,&s=0,\\ s/n,&s>0, \end {cases} \]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                and then gives Equation (3):

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                \[ r_{\rm C}(y,\tau )= \begin {cases} \max \{0.5,1-p(s)\},&\tau \text { occurs in }y \text { and }|y|>|\tau |,\\ 0,&\text {otherwise}. \end {cases} \]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                As printed, Equation (3) assigns zero when \(y=\tau \), because its first branch requires strict excess length. This conflicts with the immediately preceding Appendix-C prose, which assigns base reward one when the target is generated, and it is not the exact-match reward of Definition [ftip-00A9]. The two printed descriptions therefore specify different reward rules.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                Definition. Edit-distance reward [ftip-00AB]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                  Let \(y=y_1\cdots y_m\) and a nonempty target \(\tau =\tau _1\cdots \tau _n\) be finite strings. Their Levenshtein distance is determined by \(D(0,j)=j\), \(D(i,0)=i\), and, for \(i,j>0\),

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                  \[ D(i,j)=\min \left \{ \begin {aligned} &D(i-1,j)+1,\\ &D(i,j-1)+1,\\ &D(i-1,j-1)+\mathbf 1\{y_i\neq \tau _j\} \end {aligned} \right \}. \]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                  Set \(L(y,\tau )=\max \{|y|,|\tau |\}\). The edit-distance reward is

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                  \[ r_{\rm edit}(y,\tau ) =\max \left \{0,1-\frac {D(|y|,|\tau |)}{L(y,\tau )}\right \}. \]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                  The recurrence is Equation (1) in the main text and Equation (4) in Appendix C of Demystifying Reinforcement Learning Post-Training of Language Models[clay2026demystifying]; the normalized reward is its Equation (5). The nonempty-target assumption makes the displayed denominator positive. This reward does not establish that edit similarity is the correct utility for a different task.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                  Remark. Dense reward imports target structure [ftip-00AC]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                    The edit reward of Definition [ftip-00AB] is not obtained from the binary value in Definition [ftip-00A9] by a numerical smoothing operation. It also receives the target string, a character-level edit model, and the ordering of symbols. Two non-target responses that both receive sparse reward zero can therefore receive different edit rewards.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                    That extra resolution can improve credit assignment, but it changes the feedback channel and its assumptions. The source calls edit distance a dense proxy and reports controlled movie-quote experiments [clay2026demystifying, Sections 4.2 and 5.2]. Neither the formula nor those observations establish that edit proximity is an independent measure of general response quality.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                    Definition. Milestone process reward [ftip-00AD]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                      For the source's fixed AIME problem, let

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                      \[ M(y)=(m_1(y),\ldots ,m_5(y))\in \{0,1\}^5 \]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                      record whether a completed response contains five declared milestones: a valid algebraic setup, correct root relations, correct integer bounds, a correct count for at least one branch, and correct subtraction of the overlap at the origin. With

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                      \[ (w_1,\ldots ,w_5)=(0.05,0.05,0.10,0.15,0.25), \]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                      the milestone process reward is

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                      \[ r_{\rm proc}(y)=\sum _{i=1}^{5}w_i m_i(y). \]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                      Appendix D.1 of Demystifying Reinforcement Learning Post-Training of Language Models[clay2026demystifying] gives Equation (6) and the milestone list above. In the experiment, a 32-billion-parameter instruction-tuned model classifies the completed trajectory. The displayed map is therefore richer than a deterministic final-answer verifier, even though it returns one scalar after the rollout.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                      Remark. Process feedback assumptions and milestone-weight discrepancy [ftip-00AE]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                        Appendix D.2 of Demystifying Reinforcement Learning Post-Training of Language Models[clay2026demystifying] supplements \(r_{\rm proc}\) with an extracted-answer override and two penalties. Translating its notation, let \(\tau =117\), \(\tau _{\rm near}=118\), and define

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                        \[ r_{\rm base}(y)= \begin {cases} 1.0,&\operatorname {extract}(y)=\tau ,\\ 0.6,&\operatorname {extract}(y)=\tau _{\rm near},\\ r_{\rm proc}(y),&\text {otherwise}. \end {cases} \]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                        Let \(p_{\rm loop}(y)=-0.3\) when the judge flags a loop without the exact answer, and zero otherwise. Let \(p_{\rm format}(y)=-0.5\) when the response lacks the required boxed delimiter, and zero otherwise. Equations (7)--(8) then give

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                        \[ r_{\rm PRM}(y) =\max \{0,r_{\rm base}(y)+p_{\rm loop}(y)+p_{\rm format}(y)\}. \]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                        These clauses assume a reliable milestone judge, parser, near-miss choice, loop flag, and formatting rule. They are part of the feedback definition, not consequences of reinforcement learning. The main text describes ``exponentially increasing'' dense rewards, and Appendix D calls the weights ``exponential scaling.'' The printed vector \((0.05,0.05,0.10,0.15,0.25)\) is neither strictly increasing at every milestone nor a geometric progression. We preserve the exact weights and do not infer an exponential law from that wording.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                        Definition. Reward-induced observational equivalence [ftip-00AF]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                          Let \(\mathcal Y\) be a finite response set and \(r:\mathcal Y\to \mathcal R\) any reward map. Two responses are observationally equivalent under \(r\), written \(y\sim _r y'\), when

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                          \[ y\sim _r y'\quad \Longleftrightarrow \quad r(y)=r(y'). \]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                          Equality makes \(\sim _r\) an equivalence relation. Its quotient \(\mathcal Y/{\sim _r}\) is the finite set of response classes distinguished by the reward alone. This proposed equivalence relation ignores any information in the response that is not returned by \(r\); equal rewards need not imply equal latent utility.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                          Lemma. Refining feedback separates at least as many responses [ftip-00AG]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                            Let \(\mathcal Y\) be finite and let \(r_1:\mathcal Y\to \mathcal R_1\) and \(r_2:\mathcal Y\to \mathcal R_2\). Say that \(r_2\) refines \(r_1\) when

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                            \[ r_2(y)=r_2(y')\quad \Longrightarrow \quad r_1(y)=r_1(y') \qquad (y,y'\in \mathcal Y). \]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                            If \(r_2\) refines \(r_1\), then

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                            \[ \left |\mathcal Y/{\sim _{r_2}}\right | \geq \left |\mathcal Y/{\sim _{r_1}}\right |. \]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                            Proof. 

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                              Send the \(r_2\)-class of \(y\) to the \(r_1\)-class of \(y\). The refinement condition makes this map well defined. It is surjective because every \(r_1\)-class contains some \(y\), whose \(r_2\)-class maps to it. A surjection between finite sets has a domain at least as large as its codomain.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                              This finite lemma compares observational partitions only. It does not say that the refined reward is cheaper, more accurate, or better aligned with utility.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                              Example. Counterexample: equal sparse reward, unequal dense reward [ftip-00AH]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                Take the target string \(\tau =\texttt {abc}\) and two responses \(y=\texttt {abx}\) and \(y'=\texttt {xyz}\). Both fail exact matching, while their edit distances and normalized edit rewards are

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                \[ \begin {array}{c|c|c|c} \text {response}&r_{\rm exact}&D(\,cdot\,,\tau )&r_{\rm edit}\\ \hline \texttt {abx}&0&1&2/3\\ \texttt {xyz}&0&3&0 \end {array} \]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                Thus \(y\sim _{r_{\rm exact}}y'\) but \(y\not \sim _{r_{\rm edit}}y'\). The example witnesses a strict separation inside one sparse-reward class. It does not claim that every dense proxy refines every sparse verifier.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                Example. Three feedback resolutions on one response set [ftip-00AI]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                  One finite response set can be observed through three different maps. The arrows below share a domain; they do not assert that the three codomains form a refinement chain.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                  The exact reward forgets every difference among failures. Edit reward can retain character-level proximity, while the source process reward retains a declared milestone vector only after judge, override, and penalty choices. The partition lemma Lemma [ftip-00AG] applies to a pair only after its refinement hypothesis has been checked.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                  Remark. Reward density is not cost-free smoothing [ftip-00AJ]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                    A denser reward can distinguish more responses and supply more frequent update signal. It can also require information absent from a sparse verifier. In the controlled source, edit feedback assumes the full target and computes a string metric; process feedback uses a 32-billion-parameter judge, five problem-specific milestones, answer extraction, an enumerated near miss, and loop and format penalties [clay2026demystifying, Appendices C--D].

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                    The richer feedback channel incurs specification, computation, and validation costs. Replacing sparse feedback by dense feedback can alter both the information available to training and the objective being optimized. The resulting comparison is an intervention on feedback resolution, not evidence that one fixed reward was smoothed at zero cost.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                    Prompt breadth and effect locality [ftip-00AK]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                      Training on one prompt law can change behavior unevenly across evaluation slices. Localized and distributed degradation are distinguished relative to that training law and the specified evaluation slices.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                      Definition. Training prompt law and evaluated prompt slice [ftip-00AL]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                        Let \(\mathcal X\) be a task-instance set. Write \(\mu _{\rm tr}=\mathcal D_{\rm tr}\) for the training-prompt coordinate of an experiment cell in Definition [ftip-009T]. A training prompt law is this probability law on \(\mathcal X\), used to draw instances during a post-training protocol. Let \(\mu _{\rm ev}\) be an independently declared evaluation law on the same set.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                        An evaluated prompt slice is a measurable set \(C\subseteq \mathcal X\) with \(\mu _{\rm ev}(C)>0\). Its conditional evaluation law is

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                        \[ \mu _{\rm ev}(A\mid C) =\frac {\mu _{\rm ev}(A\cap C)}{\mu _{\rm ev}(C)}. \]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                        The training and evaluation laws need not agree. A slice records where an effect is measured; it does not assert that prompts inside the slice are equally difficult or represented equally in pretraining. We specialize the task-law convention of Definition [ftip-001Q].

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                        Definition. Source-specific narrow and broad configurations [ftip-00AM]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                          A prompt configuration is the record

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                          \[ \mathsf c=(M_0,\mu _{\rm tr},m_{\rm tr},r,\mathsf A,b), \]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                          containing the starting artifact, training prompt law, finite prompt-pool size, reward, update algorithm, and training budget. We call two particular records \(\mathsf c_{\rm nar}\) and \(\mathsf c_{\rm brd}\) only when a cited experiment names them narrow and broad.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                          Section 4.3 and Appendix F of Demystifying Reinforcement Learning Post-Training of Language Models[clay2026demystifying] instantiate these labels in two model-family experiments. The Qwen comparison uses 100 DeepScaleR prompts versus 10,000 WildChat prompts. The OLMo comparison uses 100 math-only prompts versus 10,000 prompts split evenly among mathematics, instruction following, and code. These labels identify the two reported configurations; they do not define a general measure or ordering of prompt breadth.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                          Remark. Prompt breadth is not a total order [ftip-00AN]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                            The records in Definition [ftip-00AM] change several coordinates together. The prompt-pool size, domain mixture, and repetition frequency differ. Across the paper's Qwen and OLMo studies, the starting artifact and evaluated tasks also differ.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                            We therefore use ``narrow'' and ``broad'' as names for the source cells. They do not define a total order on prompt laws, and their comparison does not identify a causal effect of breadth alone. A breadth theorem would need a declared statistic and matched configurations that differ only in that statistic.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                            Definition. Slice-conditioned success change [ftip-00AO]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                              Fix an evaluated slice \(C\) from Definition [ftip-00AL], and let \(P_0\) and \(P_1\) denote the pre- and post-training protocols whose successful-support probabilities are defined in Definition [ftip-005U]. The slice-conditioned success change is

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                              \[ \Delta _{\rm suc}(C;P_1,P_0) =\mathbb E_{X\sim \mu _{\rm ev}(\cdot \mid C)} \left [p_{P_1}(X)-p_{P_0}(X)\right ]. \]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                              The evaluation interface, inference budget, and success predicate are held fixed across the two terms. The quantity is an average change on one declared slice. It neither locates the change inside the model nor identifies which training coordinate caused it.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                              Definition. Localized and distributed degradation [ftip-00AP]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                Fix pairwise disjoint evaluated slices \(C_1,\ldots ,C_J\) and a declared degradation threshold \(\kappa >0\). Define the set of materially degraded slices

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                \[ \mathcal H_\kappa (P_1,P_0) =\left \{j:\Delta _{\rm suc}(C_j;P_1,P_0)\leq -\kappa \right \}. \]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                Degradation is localized relative to this slice family and threshold when \(|\mathcal H_\kappa |=1\). It is distributed when \(|\mathcal H_\kappa |\geq 2\).

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                These terms depend on the chosen partition, threshold, and evaluation budget. They do not turn a finite benchmark vector into a statement about all capabilities.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                Example. Narrow and broad random-reward paths [ftip-00AQ]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                  Section 5.3 and Appendix F of Demystifying Reinforcement Learning Post-Training of Language Models[clay2026demystifying] supply two OLMo paths; Figure 4 reports their outcomes. Both replace the usual verifiable reward with a random scalar drawn from \(\operatorname {Unif}[0,1]\), but their prompt configurations differ.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                  In the narrow SFT-start path, GSM8K accuracy falls from 86 to about 32 by step 400, while the reported MMLU and IFEval changes are much smaller. In the broad path, the source reports an entropy spike near step 400 together with collapse on GSM8K, MMLU, and IFEval. The diagram records that interpretation; it does not isolate prompt breadth from pool size, mixture, or repetition.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                  Remark. What the source observes about spurious reward [ftip-00AR]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                    Section 5.3 and Figures 3--4 of Demystifying Reinforcement Learning Post-Training of Language Models[clay2026demystifying] report that the Qwen narrow configuration retains higher MATH and AMC Acc@1 than its broad configuration under random reward. The OLMo experiment reports the different evaluation patterns summarized in Example [ftip-00AQ].

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                    These are finite empirical observations. The random scalar reward removes task alignment from one feedback channel, but it does not hold all other training coordinates fixed. The reported entropy is a named token statistic, not a direct measure of capability or acquisition.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                    Example. Counterexample: equal marginal reward, unequal prompt-local damage [ftip-00AS]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                      Let two evaluation slices \(C_1,C_2\) have equal mass. A feedback channel returns an independent Bernoulli reward with mean \(1/2\) under either of two post-training protocols. Suppose their fixed-interface success changes are

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                      \[ \left (\Delta _{\rm suc}(C_1),\Delta _{\rm suc}(C_2)\right ) =(-1,0) \quad \hbox {or}\quad \left (-\tfrac 12,-\tfrac 12\right ). \]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                      The reward law and its mean are identical, but the slice-level evaluation vectors differ. Hence marginal training reward does not determine whether damage is localized or distributed. This is a finite counterexample, not a claim about the mechanism in the source experiment.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                      Remark. Coverage, feedback resolution, and prompt-conditioned effects [ftip-00AT]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                        The source cells motivate tests of starting-policy coverage, feedback resolution, and prompt-conditioned damage. They do not establish that dense reward creates mathematical support, that zero sampled hits imply zero probability, or that random reward has one model-independent effect.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                        Separating the effects of coverage, feedback resolution, and prompt breadth requires stronger controls. One comparison fixes prompt laws and varies only the feedback sigma-algebra. Another fixes feedback and evaluation while varying one starting-policy coordinate. Confidence regions for the complete vector of slice-conditioned changes would quantify effects that an aggregate score can hide.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                        The reported observations remain conditional on their experimental configurations. They do not establish general results about capability acquisition, elicitation, or the optimal allocation of post-training compute.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                        Finite consequences and counterexamples [ftip-00JE]
                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                        ✍️source

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                          Finite sampling, reward information, and deterministic execution give conditional conclusions about post-training. Their counterexamples show why the task law, feasible set, and available information cannot be omitted.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                          This synthesis brings together the finite results used in the evaluation analysis. The conceptual-discovery chapter asks whether such arguments can constrain a complete learning lineage, including changes to representations, curricula and research procedures.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                          Probability, information, and execution [ftip-00I1]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                            Discovery probabilities, support, proxy error, feedback resolution, and replay each constrain a different part of a comparison. Capability remains conditional behavior under a declared intervention and evaluation law, rather than a scalar latent property.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                            Finite probability and execution results [ftip-00I2]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                              The conclusions depend on their declared probability laws, finite index sets, positivity conditions, and execution inputs. Changing one of these assumptions can change the result even when the observed score is unchanged.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                              Convention. Domains of the finite results [ftip-00I5]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                Each result concerns its declared carriers \(X_1,\ldots ,X_n\), with fixed equality and order conventions. Finiteness, probability laws, and positivity conditions are hypotheses of the result; they cannot be inferred from a finite observation alone.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                Theorem. Independent discovery probability [ftip-00I7]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                  For \(B\in \mathbb N\) independent discovery events with the probabilities declared in Convention [ftip-0077], the identity in Theorem [ftip-0078] gives \(\Pr (D_B)=1-\prod _{i=1}^{B}(1-p_i)\).

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                  Theorem. Discovery budget for a failure threshold [ftip-00I8]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                    Under \(0<p<1\), \(0<\delta <1\), and an integer budget \(B\geq 1\), the failure constraint is equivalent to the following bound.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                    \[B\geq \left \lceil \frac {\log \delta }{\log (1-p)}\right \rceil .\]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                    The result is proved in Corollary [ftip-0079].

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                    Theorem. Support under finite exponential tilting [ftip-00I9]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                      Under the finite-carrier and positive-temperature hypotheses of Theorem [ftip-007C], normalized exponential tilting preserves the base law's positive support.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                      Theorem. Uniform proxy error and objective regret [ftip-00IA]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                        For a finite common feasible set and a common regularizer, the uniform proxy error hypothesis in Definition [ftip-007G] yields the two-epsilon objective regret bound proved in Theorem [ftip-007H]; the conclusion concerns the regularized objective named there.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                        Theorem. Utility under a change of evaluation law [ftip-00IB]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                          If the evaluation laws and finite response space satisfy the total-variation hypotheses of Theorem [ftip-00GM], then the expectation difference is bounded by the stated sup-norm times total variation.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                          Theorem. Response classes under feedback refinement [ftip-00IC]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                            For finite response set \(\mathcal Y\) and deterministic rewards, a reward channel that refines the equality partition of another channel separates at least as many response classes, as proved in Lemma [ftip-00AG].

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                            Theorem. Equal execution inputs give equal replay traces [ftip-00IJ]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                              If the execution map is deterministic in all coordinates fixed by Definition [ftip-00HF], then equal input, revision, environment, and seed records produce equal finite traces, as proved in Theorem [ftip-00HG].

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                              Theorem. Observational equivalence under a common update kernel [ftip-00IK]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                For the finite transcript and world kernels declared in Definition [ftip-008C]--Definition [ftip-008D], observationally equivalent worlds induce the same output law for any common randomized post-training kernel, as proved in Theorem [ftip-007S].

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                Theorem. Conditions for an admissible commit decision [ftip-00IL]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                  Under the typed audit record of Definition [ftip-00HL], a commit is admissible exactly when all required checks pass, the digest matches, and the recorded decision is \(commit\), as proved in Theorem [ftip-00HM].

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                  Theorem. Admission of a finite audit plan [ftip-00IM]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                    A finite audit plan with nonnegative stage costs is admissible exactly when its declared additive cost is within budget; adding a positive stage beyond slack is inadmissible, by Theorem [ftip-00HX].

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                    Counterexamples and restricted assumptions [ftip-00ID]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                      Finite constructions can separate average success from coverage, proxy accuracy from evaluation quality, and observed gradients from the hypotheses needed to bound them. Each separation identifies an assumption that a stronger conclusion would require.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                      Remark. What a finite counterexample establishes [ftip-00IE]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                        A finite assignment satisfying a claim's hypotheses and violating its conclusion disproves that universal claim. It does not estimate how often the failure occurs under another distribution or establish a general failure rate.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                        Remark. Changing the model or evaluation changes the claim [ftip-00IF]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                          A conclusion about fixed carriers, policies, feedback, budgets, and evaluation laws need not survive a change to those objects. Finite zero hits do not imply zero support, empirical benchmark movement does not imply acquisition, and an exact-optimizer result need not hold for an approximate optimizer without an additional error bound.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                          Example. Equal averages and zero hits do not identify coverage [ftip-00IG]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                            The two-task examples in Example [ftip-007E] and Example [ftip-00A3] show that equal one-shot averages or zero observed hits can coexist with different coverage or nonzero latent rates. These conclusions use their declared iid model and do not estimate rates outside it.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                            Example. Small training-law error can reverse evaluation selection [ftip-00IH]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                              In the two-point construction of Example [ftip-007J], training-law average error is small while evaluation selection reverses. The missing hypothesis is a uniform bound on the evaluated feasible set; an informal promise of similar distributions does not supply it.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                              Remark. Untied heads, shared gradients, and checkpoint forecasts [ftip-00II]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                For DGG, the untied head identity and its finite-batch Jensen bound in Theorem [ftip-007Z] and Theorem [ftip-0081] differ from an intermediate-occurrence bound. A shared intermediate weight requires the sum over all occurrences in Theorem [ftip-007Z]; the source's local hypotheses do not establish its claimed total-gradient bound in [miao2026when, Section 4.2.1, Lemma 1, Theorem 1, and Appendix A.3]. The cancellation example Example [ftip-0084] also separates the active clipping interval from the raw-surrogate extension.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                NExt's empirical checkpoint forecasts in [chen2026lowrank, Sections 3.2, 4.1--4.3, and 5.1] do not establish a universal subspace-collapse, capability, or speed theorem. The spectral and evaluation quantities in Definition [ftip-0086] through Remark [ftip-008B] measure different trajectory properties.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                Mathematical notation [ftip-00IN]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                  Prompt and response spaces, probability laws, policies, rewards, evaluation scores, and execution traces are distinct mathematical objects.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                  Convention. Prompt spaces, response spaces, and laws [ftip-00IO]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                    Use \(\mathcal X\) for prompts, \(\mathcal Y\) for finite responses, \(\Omega \) for sample space, \(\mathsf P\) for a declared protocol, and \(\mu \) for a prompt law. A probability law is written \(\Pr \) only after its sample space is named.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                    Convention. Policies and reference policies [ftip-00IP]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                      Use \(\pi \) for a policy, \(\pi _{\rm base}\) for a reference policy, and \(\pi _\theta \) for a parameterized policy. A policy is always typed as a kernel from the declared prompt carrier to the declared response carrier.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                      Convention. Rewards and evaluation utilities [ftip-00IQ]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                        Use \(r:\mathcal X\times \mathcal Y\to \mathbb R\) for a deterministic reward and \(u\) for an evaluation utility. Proxy, verifier, and process rewards retain their local subscripts; no bare symbol silently changes meaning.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                        Convention. Model artifacts and evaluation scores [ftip-00IR]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                          Use \(M\) for a model artifact, \(\mathsf E\) for an evaluation protocol, and \(J_{\mathsf E}(M)\) for its declared score. A comparison must state the invariant evaluation law before subtracting two scores.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                          Convention. Traces, states, lineages, and costs [ftip-00IS]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                            Use \(z_{0:n}\) for a finite trace, \(s_t\) for a harness state, \(\ell \) for a lineage, and \(c\) for an execution cost. Event logs and summaries are distinct carriers even when one is computed from the other.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                            Related

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                              Conceptual discovery across model generations [ftip-00MH]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                The preceding chapters specify the model and learning mechanisms, retained agent state, evaluation and costs, with architecture-dependent refinements when needed. This chapter combines them in a question about capability growth across successive learned artifacts.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                A mathematical breakthrough may require a new representation, a useful invariant, or a connection to another domain. The question is whether a specified model lineage can discover and acquire that structure within its resources, including by improving its own search and training procedures. An external contribution might make the same capability affordable.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                This is a proposed separation between complete processes. A plateau in one training recipe does not establish it. Nor does the size of unexplored mathematics imply that current architectures can only recombine a fixed stock of ideas. Useful structure may be generated implicitly by updates, through analogy, or by programs constructed during the campaign.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                The acquisition question in Definition [ftip-0007] therefore extends across successive learned artifacts. The finite discovery estimates of § [ftip-0076] apply only when their probability premises cover that evolving process. The finite controller certificate in § [ftip-00M8] illustrates an upper-bound method for a fully specified action class.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                The complete lineage and its resources [ftip-00MI]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                  The comparison starts from disclosed artifacts and executable operations. A lineage includes the models it trains, the controllers it writes, and the evidence it retains. Its limits cannot be inferred from the support of one initial decoder while allowing the rest of the system to change.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                  Definition. A resource-bounded model lineage [ftip-00MJ]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                    Fix a specification

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                    \[ \Xi =(I_0,\mathcal C_0,\Gamma ,\mathcal E_0,V, \mathcal D,\mathcal F,\mathbf B,\mathbf b_{\mathrm {eval}}). \]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                    Here \(I_0\) contains the initial models, corpora, libraries, prompts, optimizers, evaluators, software and cached results. The nonempty class \(\mathcal C_0\) specifies controller programs and constants available from \(I_0\); it does not grant an arbitrary program chosen after a discovery. An initial generator of additional controllers is allowed, with its generation and selection work charged as explained in § [ftip-00N6]. The semantics \(\Gamma \) specifies executable operations and costs; \(\mathcal E_0\) specifies baseline observations and tool-response laws. The checker \(V\), task law and reveal schedule \(\mathcal D\), allowed final artifacts \(\mathcal F\), campaign cap \(\mathbf B\) and deployment cap \(\mathbf b_{\mathrm {eval}}\) are fixed before evaluation. Include the no-update procedure as a baseline.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                    A campaign is a causal execution starting from this endowment. Its state contains available checkpoints, contexts, generated code, retained traces, libraries, optimizer state and resource usage. A controller may use only its charged accessible state: discarded history must be reconstructed at cost. Environment state may remain hidden. All random seeds follow their declared laws; a fortunate completed trajectory is not an available program.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                    Whenever admitted by \(\Gamma \), operations include model inference, proof and program search, tool calls, parallel workers, memory management, candidate comparison, reward and credit assignment, synthetic tasks, parameter training, architecture changes, and controller replacement. Generated controllers execute under the same semantics and caps. Selection, evaluation and the controller's own computation are charged. These operations may recur in any order; learning need not first produce a complete successful trace or an explicitly verbalized idea.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                    The lineage is closed relative to \((I_0,\mathcal E_0)\) when its only campaign inputs are scheduled tasks, its randomness and admitted environment responses. This allows computation to reveal useful structure. A simulator using independent randomness is different from a tool observing new hidden world state; the latter access belongs in \(\mathcal E_0\).

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                    Controller selection is independent of unrevealed instance seeds, conditional on declared public family information. This alone does not exclude family-wide answer tables: all such constants and preprocessing belong in \(I_0\). An asymptotic claim specifies uniform generation across instance sizes or explicitly accounts for nonuniform advice and preparation.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                    Definition. Hard resource accounting across generations [ftip-00MK]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                      For a realized campaign \(\zeta \), let \(\mathbf R(\zeta )\) record inference work, training work, tool and checker work, total accelerator time, peak live memory and storage, peak allocated hardware, wall time and money under the declared operational model. Admission requires

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                      \[\mathbf R(\zeta )\preceq \mathbf B\quad \text {almost surely}.\]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                      Stop before an unaffordable operation; a missing result scores zero. Charge every failed path, discarded trace, evaluator call, consultation, checkpoint comparison and update. Bound the number of transitions by charged elementary work or an explicit finite horizon: infinitely many free operations are not admitted.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                      For additive work coordinates, a portfolio costs shared development plus the sum of task-specific work. Shared training is charged once even when it benefits many tasks. Peak resources and elapsed time come from the actual joint schedule, including communication and sequential dependencies. Parallel work is summed across workers. An expected-cost bound does not replace this hard cap.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                      A scalar budget \(B\) is used only after choosing one resource or a declared conversion with the remaining constraints fixed. Human time, accelerator work and elapsed time have no implicit exchange rate. Model pretraining and contributor expertise may be disclosed sunk endowments in a marginal comparison. A lifetime-cost claim must also account for producing both; unknown historical costs remain unknown.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                      Discovery and acquired capability [ftip-00ML]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                        A contribution can help solve a current problem without becoming a reusable ability. Discovery and acquisition are therefore separate outcomes, both evaluated against a fixed mathematical truth contract.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                        Definition. Signed discovery and fresh-task acquisition [ftip-00MM]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                          Fix the statement translation, allowed axioms, formal library and certificate checker \(V\). An answer is a sign \(\sigma \in \{+,-\}\) and a certificate \(p\). Put \(s_V(x,(\sigma ,p))=1\) when \(V\) accepts \(p\) as a proof of \(x\) for sign \(+\), or of \(\neg x\) for sign \(-\); otherwise put \(s_V=0\). The failure output \(\bot \) scores zero. A proof of excluded middle without either signed certificate does not solve the task. A task family may assume one signed certificate exists; independence from the allowed axioms is otherwise a separate source of failure.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                          For a current portfolio \(x_1,\ldots ,x_n\) with fixed nonnegative weights \(w_i\) summing to one, a campaign \(P\) has discovery score

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                          \[Q_{\mathrm {disc}}(P)=\mathbb E\sum _{i=1}^n w_i s_V(x_i,P_i).\]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                          For one fixed conjecture use a singleton portfolio; its truth need not be randomized. The expectation includes the declared task and execution randomness, with no assumption of independent attempts.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                          After development, freeze an artifact \(A\in \mathcal F\cup \{\bot \}\) before revealing fresh problems \(x'_1,\ldots ,x'_m\), where \(m\geq 1\). Their identities and solutions are unavailable during development; they are conditionally independent of development draws given the declared task-family variable. With a fixed deployment procedure \(\mathrm {Deploy}\), define

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                          \[ Q_{\mathrm {acq}}(P)=\mathbb E\frac 1m\sum _{j=1}^m s_V(x'_j,\mathrm {Deploy}(A,x'_j;\mathbf b_{\mathrm {eval}})). \]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                          Remove contributor access and feedback into training or checkpoint selection. Any permitted adaptation within one test problem is charged and discarded before the next. Evaluation work counts in the campaign; the per-problem cap is common to both arms. Deployment of \(\bot \) fails.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                          For model acquisition, \(\mathcal F\) contains learned parameters or adapters with a common fixed harness. For system acquisition it may instead include a bounded acquired library or controller. State which is measured. The pair \((Q_{\mathrm {disc}},Q_{\mathrm {acq}})\) does not allow success on one coordinate to conceal failure on the other. Imported mathematical results and new proof notation require sound translation under \(V\), including the cost of expanding and checking certificates.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                          Affordable complementary contributions [ftip-00MT]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                            The recipient is the learning system that receives and processes a contribution. Its interaction protocol specifies the permitted tools, retained state and update procedures. The contributor is the source of that contribution.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                            A contributor can make a representation, analogy, criticism, discriminating question or research direction affordably available to a recipient. The relevant properties are the interaction it can produce and what the recipient can make of it. Architecture, culture, expertise and developmental history can explain these properties without becoming mandatory coordinates of the abstract definition.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                            Availability, structural quality and realized benefit require different arguments. A familiar connection can be novel to a learner's affordable repertoire, while a surprising sentence may be useless. The existence of infinitely many possible patterns supplies neither a probability of useful help nor an unaided computational lower bound.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                            Definition. A causal contribution process [ftip-00MU]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                              Fix the recipient specification, task family, reveal schedule, interaction permissions and resource accounting. Abstract a contributor \(v\) by a causal interaction law, written as budget-indexed kernels

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                              \[K_v^b(\mathrm dh\mid H).\]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                              Here \(H\) is the history available to the contributor, \(b\) is its remaining contribution budget, and \(h\) includes the next message or failure/stop output with its joint resource record. The kernels arise from one consistent causal process under stopping: different budgets cannot be assigned unrelated ideal answers. No access to unrevealed test instances or their answers is permitted.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                              Two internal realizations are equivalent for this abstraction when they induce the same joint laws of transcripts, costs and stopping for every admitted recipient protocol and budget. Mathematically equivalent message contents need not be equivalent interactions: the recipient may find one encoding much easier to interpret or verify. A useful contribution may develop through several exchanges. Producing, interpreting, rejecting, correcting and learning from suggestions all consume resources.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                              Conditional theorems may assume properties of this interface without simulating a brain or reconstructing a civilization. An unconditional existence result additionally requires a realizable member of the assumed class, for example an executable source with disclosed initial state and costs. A controlled human protocol instead supplies empirical estimates. An arbitrary answer kernel or assumed success probability proves neither.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                              The target statements, truth contract, checker and reveal schedule stay fixed. Contributors may have different broad backgrounds or search biases; these endowment differences are disclosed. Relevant prior results must be justified under the target checker. A hidden target parameter or precomputed answer table is a different mechanism from conceptual insight. Equalizing all background material is an optional stronger comparison. Giving the recipient textual access to the relevant material can test whether acquiring and using the connection remains costly. Historical preparation follows the symmetric accounting convention in Definition [ftip-00MK].

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                              Definition. Structural quality and good contributor classes [ftip-00MV]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                Fix a development law and recipient interaction protocol \(\Pi \) before final evaluation. For development input \(D\) and resulting contribution transcript \(H_v\), choose an independently specified structural predicate \(S(D,H_v)\). Define

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                \[q_v=\Pr _{\Pi ,v}\bigl (S(D,H_v)\bigr ).\]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                A possible property is a sound reduction to a declared tractable class with bounded translation and certificate-expansion costs. A reusable invariant with a proved consequence or a curriculum satisfying a separate learning condition are other possibilities. A fallible analogy may require charged recipient completion before the property holds. The predicate is not simply that the final score improved; soundness, scope and checking costs require their own arguments. Quality is relative to this task, protocol and budget, not a universal ranking of minds.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                For \(0<q_0\leq 1\), the restricted class

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                \[\mathcal G(q_0)=\{v\in \mathfrak V:q_v\geq q_0\}\]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                is legitimate. An existence theorem about a member of this class need not help every contributor outside it. Nonemptiness remains a separate obligation; choosing sources on final test outcomes does not establish pre-evaluation availability. Recruitment and screening costs are necessary when claiming an affordable procedure to find a good contributor, but mere existence does not require a population recruitment theorem.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                To discuss a median, additionally declare a population law \(\mu \) on admissible contributors with measurable quality \(v\mapsto q_v\). Let \(q_{50}\) satisfy \(\mu (q_v\leq q_{50})\geq \frac 12\) and \(\mu (q_v\geq q_{50})\geq \frac 12\). Then define

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                \[\mathcal G_\mu (q_0)=\{v:q_v\geq \max (q_0,q_{50})\}.\]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                If \(q_0\leq q_{50}\), this class has at least half the population mass. If \(q_0>q_{50}\), even nonemptiness needs evidence. The median can be zero, so belonging to the upper half alone does not guarantee useful assistance. There is no default uniform law over all possible contributors, and an unattained quality supremum need not have a best contributor.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                proposition. From structural quality to acquired capability [ftip-00MW]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                  Fix one contributor and one recipient protocol with almost-sure total resource caps, including failed consultations. Let \(Z\in [0,1]\) be the realized fresh-task score of its frozen artifact with contributor access removed. Suppose, for the same joint process and remaining resources,

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                  \[\Pr (S)\geq q_0>0,\qquad \mathbb E[Z\mid S]\geq \beta \geq 0.\]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                  Then \(Q_{\mathrm {acq}}=\mathbb E Z\geq q_0\beta \).

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                  Proof. 

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                    Nonnegativity and conditional expectation give

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                    \[\mathbb E Z\geq \mathbb E[Z\mathbf 1_S] =\Pr (S)\mathbb E[Z\mid S]\geq q_0\beta .\]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                    No independence assumption is used. A uniform recipient guarantee for qualified transcripts and compatible development histories can establish the transfer premise, including interpretation, verification and acquisition costs. A guarantee for a different, easier message distribution cannot.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                    Together with a universal closed bound \(Q_{\mathrm {acq}}(P)\leq \tau ^-\) and an admissible member of \(\mathcal G(q_0)\), the strict inequality \(q_0\beta \geq \tau ^+>\tau ^-\) yields the assisted crossing in § [ftip-00MN]. The substantive obligations are affordable source quality, recipient transfer and the bound over every admitted unaided alternative. The elementary expectation inequality alone establishes none of these.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                    proposition. Simulation can erase an apparent contribution advantage [ftip-00MX]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                      Fix a scalar accounting model with the other constraints declared. Suppose an admitted assisted campaign \((R,v)\) at total budget \(B\) has an admitted closed simulator at budget \(g(B)\). Require that the simulator can reproduce the contributor's endowment, observations and causal interaction, together with the recipient's allowed final artifact and evaluation law. All simulation work and initialization count. Then, for \(j\in \{\mathrm {disc},\mathrm {acq}\}\),

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                      \[\sup _{P\in \mathcal L(g(B))}Q_j(P)\geq Q_j(R,v).\]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                      Proof. 

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                        Couple the initial states and each successive conditional interaction using the stipulated simulator. Induction gives the same joint law of observable transcripts, final artifact and evaluated outcomes. The closed simulator therefore has the same score, and its admission places that score below the displayed supremum.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                        If the simulation is uniform across instance sizes with \(g(B)\leq cB\) for a fixed constant \(c\), an actual assisted procedure reaching \(\tau \) at work \(U(n)\) implies \(B_{\mathrm {closed}}(n,\tau )\leq cU(n)\). This excludes a lower bound \(L(n)\) with \(U(n)/L(n)\to 0\). Unavailable background state, observations, hardware or large simulation overhead can invalidate the premise; different origin alone does not. The argument does not assume that a language model already has an affordable simulation of a human contributor.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                        Admission includes discovery of any required reconstruction program from the declared initial state. A simulator written with advance knowledge of the useful representation does not satisfy this premise merely because its later execution is cheap. If the program is generated during the campaign, its generation law, failed attempts and selection costs belong in the simulation. This conditional proposition supplies no lower bound on that discovery cost; § [ftip-00N6] distinguishes program existence from its availability to the lineage.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                        Example. A human–agent exchange about conceptual discovery [ftip-00MY]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                          In this exchange, the human is the contributor and the agent is the recipient: the system receiving and processing the contribution. The agent's proposals arose within an already human-directed conversation; they were not outputs of a separate unaided experiment.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                          1. The agent proposed a resource-bounded formulation and a finite missing-evidence construction. The human rejected missing facts as the intended mechanism and described conceptual leaps across model generations: new perspectives, paradigms and connections between domains. The agent revised the target to conceptual discovery and separated prohibitive finite work from permanent unreachability using the enumeration countercheck.
                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                          2. The agent specified an executable source with bounded observations. The human challenged an oracle-like abstraction, pointed to diverse cultural backgrounds and developed representations, and asked for an abstract account of what the source contributes. The agent formulated the causal contribution interface, with background differences disclosed rather than a mandatory model of a brain or lifetime.
                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                          3. The human emphasized that existence of good contributors need not imply usefulness of all contributors, and suggested an upper-median restriction. The agent separated independent structural quality, class nonemptiness and recipient transfer, while showing why a median requires a population and need not have positive quality.
                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                          4. The human suggested studying recursive self-improvement papers for the gap between the problems they diagnose and the portions their methods repair. The agent examined contemporary work and checked a revised primary source that narrowed stronger self-imitation claims. The resulting thesis distinguishes affordable quality, recipient acquisition and a universal unaided bound, with proof, refutation and precise obstacles all possible.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                          In Definition [ftip-00MU], \(H\) corresponds to the exchange so far and \(h\) to the human's next criticism, analogy or research direction. The agent's retained conversation and revised artifacts form its evolving state; reasoning, literature search and checking are its processing actions. The human did not supply a completed theorem: the assistance changed the problem representation and choice of inquiry. The observed outcome was a revised conjecture, before any fixed-target acquisition experiment. No structural-quality probability, cost advantage, held-out acquisition score or universal unaided bound was measured, so it does not establish the separation conjecture.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                          The conceptual-discovery conjecture [ftip-00MN]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                            Fix the lineage specification and a separately specified admissible class \(\mathfrak V\) of contributors as in Definition [ftip-00MU]. A contributor interacts causally from its disclosed background within charged resources, without hidden target answers or unrevealed test inputs. Background knowledge may differ between arms; target statements, axioms, checker and test law remain fixed. The conjectured mechanism is making conceptual structure affordable to discover, recognize or acquire under those endowments.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                            Let \(\mathcal L(B)\) contain every closed campaign admitted by Definition [ftip-00MJ] under the chosen scalar cap and other fixed constraints. Let \(\mathcal A_v(B)\) contain admitted contributor–recipient campaigns, including contribution production, failed help, communication, interpretation, validation, training and evaluation in the cap. For some specified research family and initial lineage, conjecture thresholds \(0\leq \tau ^-<\tau ^+\leq 1\) and a realistic cap \(B\) such that

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                            \[ \begin {gathered} \forall P\in \mathcal L(B),\qquad Q_{\mathrm {acq}}(P)\leq \tau ^-,\\ \exists v\in \mathfrak V,\ \exists R\in \mathcal A_v(B),\qquad Q_{\mathrm {acq}}(R)\geq \tau ^+. \end {gathered} \]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                            This is not asserted for every task, model or budget. It allows unaided improvements below the threshold. A discovery version uses \(Q_{\mathrm {disc}}\); a joint claim requires the same assisted campaign to cross both thresholds. An abstract contributor class requires a realizable member for an unconditional existence result.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                            For a difficulty-indexed family and fixed \(0<\tau \leq 1\), define the closed work threshold by

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                            \[ B_{\mathrm {closed}}(n,\tau )= \inf \{B:\sup _{P\in \mathcal L_n(B)}Q_{\mathrm {acq}}(P)\geq \tau \}, \qquad \inf \varnothing =+\infty . \]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                            Define \(B_{\mathrm {assisted}}\) with the supremum over admissible contributors and recipients. A stronger asymptotic conjecture asks for positive functions \(L,U\) satisfying

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                            \[ B_{\mathrm {closed}}(n,\tau )\geq L(n),\qquad B_{\mathrm {assisted}}(n,\tau )\leq U(n),\qquad \frac {U(n)}{L(n)}\longrightarrow 0. \]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                            An operational crossing additionally requires an actual assisted procedure achieving \(\tau \) at work at most \(U(n)\) and a realistic cap \(U(n)\leq B_{\mathrm {real}}(n)<L(n)\). Suprema and infima alone need not be attained. Both inequalities remain conjectural for the intended mechanism. The proof-directed formulation in § [ftip-00N5] asks how developmental experience could yield the assisted construction and the closed lower bound.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                            Discovery without advance knowledge of the useful pattern [ftip-00N5]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                              Knowing how to construct a representation after someone identifies it is different from finding it during research. The relevant cost includes reaching a useful idea, recognizing enough of its value to act on it, and acquiring a capability that survives fresh evaluation. Each step may occur implicitly through learning; an explicit name for the idea is unnecessary.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                              Which discovery procedures are initially available? [ftip-00N6]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                The initial controller class in Definition [ftip-00MJ] is part of the endowment. It is not enlarged after an assisted discovery by inserting a program tailored to that discovery. A concrete specification can supply a finite collection of initial controllers, or an executable procedure that generates further controllers. In the latter case, generation, execution, comparison and selection occur within the campaign and consume its budget. The generator's fixed code and constants are themselves initial resources.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                For example, let a campaign generate a program \(A_Z\) using a random variable \(Z\), and let its later interaction depend on the observed results. Its score averages over that declared generation and subsequent execution. Showing that one realization \(A_z\) constructs a useful representation cheaply does not show that the campaign finds that realization cheaply. Replacing the campaign by this selected program changes the initial endowment unless a legal route to its availability has been supplied.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                This distinction does not forbid an ingenious algorithm. A procedure already admitted from the public task-family description is a legitimate closed alternative even if nobody has tested it. A lower bound must cover it. Conversely, a proof quantifying over all programs with arbitrary family-specific constants grants more advice than a fixed model lineage possesses. Uniformity across input sizes does not alone remove that advice: a single finite program can already contain the decisive family-wide idea. The theorem must state which controller access it grants.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                An existential mathematical upper bound may describe a particular admitted program without proving that a person will discover its proof. The operational claim that a fixed lineage can acquire that program is stronger. It requires an available initial program or a charged causal construction from its accessible state. Keeping these claims distinct prevents both free advance knowledge and the exclusion of legitimate internal discoveries.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                Every equally useful acquired solution [ftip-00N7]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                  Fix a difficulty \(n\) and task-family parameter, the truth contract, fresh evaluation law and deployment cap of Definition [ftip-00MM]. For an allowed frozen artifact \(f\), including the failure artifact \(\bot \), let \(q_n(f)\) be its expected fresh-task score under that evaluation. The expectation includes fresh tasks and deployment randomness; set \(q_n(\bot )=0\). Evaluation begins with exactly the retained state permitted by the specification. Define

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                  \[\mathcal U_{n,\tau }=\{f\in \mathcal F_n\cup \{\bot \}:q_n(f)\geq \tau \}.\]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                  If the comparison randomizes a shared family parameter, apply this definition conditionally on that parameter and then average the resulting scores. This class is defined for mathematical analysis; membership need not be decidable or cheaply recognizable during research. It includes any artifact with the required performance: explicit lemmas, learned libraries, new architectures, implicit weights, and methods that avoid the contributor's representation entirely, whenever those artifacts are allowed.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                  For a random final artifact \(F_P\), the acquisition score is \(Q_{\mathrm {acq}}(P)=\mathbb E[q_n(F_P)]\). The desired lower bound must control this expectation for every admitted closed campaign. It cannot merely show that one named representation is unlikely to appear. Nor is a bound on reaching \(\mathcal U_{n,\tau }\) automatically a bound below \(\tau \): many outcomes just below the threshold can still have high mean score. A proposed proof must connect its event or structural quantity to the complete score distribution, as the explicit hypotheses of proposition [ftip-00MP] illustrate.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                  The contributor need not transmit an entire solution. A question, analogy or example may change which experiments the recipient attempts. The resulting interpretation, validation and learning remain charged. Acquisition is established only by the frozen recipient's performance on fresh instances; an insightful exchange by itself establishes neither that performance nor a lower bound on unaided discovery.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                  From absent experience to a discovery lower bound [ftip-00N8]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                    The proof direction is to begin with a concrete developmental asymmetry: some task-relevant experience available to a contributor is absent from the lineage's initial data and observed traces. From a specified family and computational model, derive that acquiring any equally useful capability exceeds the closed budget. The absence of that experience is a premise. The absence of every affordable substitute is the desired conclusion, and must not be included as another premise.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                    Three arguments are needed. A bounded developmental process must produce reusable structure with a stated probability before fresh target instances are revealed. A charged interaction and learning procedure must turn that structure into recipient capability. A lower-bound argument must cover all closed histories admitted by the initial endowment and execution semantics, including adaptive tools, simulations, generated programs, training, changed architectures and alternative representations. The first two arguments describe a constructive assisted procedure; the third establishes why the closed lineage cannot match it at the chosen resources.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                    A necessary-event estimate becomes useful only after the family and operations justify both its necessity and its probability bound. Assuming that every successful route requires a rare conceptual event simply moves the central difficulty into an assumption. Likewise, absence from a corpus does not imply computational inaccessibility: affordable experiments or derivations may supply a substitute. A proof must explain what the particular environment makes accessible and why the admitted closed operations cannot obtain an equally useful substitute within budget.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                    Both inequalities in § [ftip-00MN] remain open for the intended conceptual-discovery mechanism. The conditional transfer estimate in proposition [ftip-00MW] and simulation proposition in proposition [ftip-00MX] do not prove them. The research objective is a positive separation proof, beginning with a sufficiently concrete account of development, access and cost. Any restriction used to make the mathematics tractable must be visible in the claim; a result for a narrow action class does not establish a ceiling for all model lineages.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                    Developmental experience and affordable discovery [ftip-00N9]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                      A contributor arrives with a history of learning. That history may have made a useful invariant, decomposition or research direction easy to recognize long before the present problem arose. The proposed mechanism is that development changes which conceptual structures become accessible at reasonable cost. Different experience alone does not prove this effect.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                      The first comparison can isolate environment while holding the learning architecture fixed. This is a mathematical control, not a claim that human brains and current models have identical capabilities. A useful result under that control would not require architectural superiority.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                      A contributor produced by bounded development [ftip-00NA]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                        Specify a developmental process by an architecture, initial state, learning and action rules, an environment response law, and hard resource caps. The process generates an interaction history and a retained state \(Z\); from that state it induces a contributor \(v_Z\) of Definition [ftip-00MU]. States include learned parameters, habits, libraries and memories. Their existence must follow from the declared development, rather than from choosing an arbitrary helpful state after seeing the evaluation.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                        An initial library or teacher may already embody earlier learning. Treat that preparation as a disclosed inherited endowment, or include a bounded process producing it. The controlled comparison must not credit the current environment with structure already present before development begins.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                        Development may include other learners, teachers, language, tools and related tasks. Their response laws and relevant preparation are part of the specification. The source's developmental randomness, failed learning and failed contributions remain in the joint score distribution. An existence claim can supply one explicit developmental process with a proved quality guarantee. Selecting a lucky realized graduate is different: an affordable selection procedure must account for screening and failures, as in Definition [ftip-00MV].

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                        A task-family parameter may be shared between development and fresh evaluation, allowing experience to be relevant. The development law and source-selection rule are fixed before final instance seeds are sampled. Conditional on the declared family parameter, those seeds are independent of development. The contributor receives neither the unrevealed instances nor their answers. Broadly useful structure acquired on earlier tasks is allowed; a secret determining the final answers is a different mechanism from the conceptual discovery sought here.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                        To isolate the environmental contribution, one controlled comparison starts copies with the same architecture, initial state, learning rules and development caps, then varies only their environmental access. This can establish an environmental effect for those processes. The lower-bound claim is stronger: it must still cover every closed campaign admitted by Definition [ftip-00MJ], rather than only the one control learner used in that comparison. Architecture, initial artifacts and permitted learning changes must remain explicit when moving from this control to a human–model study.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                        Experience coverage and computational accessibility [ftip-00NB]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                          The starting asymmetry concerns available experience: the lineage's initial corpora, memories and recorded traces do not contain some relevant part of the contributor's development. Literal absence is only a weak condition. Another description, a simulation, a derivation or a different experience may make an equally useful capability affordable. The claim in § [ftip-00N8] is to derive a bound covering these substitutes.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                          Three kinds of access should be distinguished. A stored trace gives particular observations and actions. Interactive access lets a learner choose actions based on its current state and receive the corresponding responses. Access to an executable environment model permits simulations, subject to the cost and fidelity of that model. None is automatically identical to either other kind: a finite trace need not determine responses to untried actions, while an accurate model can sometimes replace direct experience. Declare what the baseline actually has.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                          If environmental responses reveal a hidden bit that fixes the target answer, an information bound may be possible, but it proves a different mechanism. For conceptual discovery, retain a common mathematical truth contract and ask how development reveals reusable ways to search, represent or reason. The baseline may already contain enough information to compute the answer in principle. The proposed gap concerns the resources required to find and acquire an effective method.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                          A compact description of the acquired structure need not imply a cheap route to it. Description length, execution cost after identification, and discovery cost are different quantities. Conversely, declaring the structure absent from all affordable computations would assume the desired conclusion. Its inaccessibility must follow from the concrete task family, the supplied endowment and the admitted operations. Tools and simulations are charged operations within that argument, not an additional process outside the comparison.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                          Human and model growth as interacting learning processes [ftip-00NC]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                            A realistic comparison needs more than the contrast between a person who grows and a model that reads text. Human experience is selective and changes with the learner's actions and abilities. Models also inherit large bodies of human-produced data and can learn from video, interaction, feedback, generated tasks and earlier model generations. The relevant asymmetry is the particular developmental access and retained structure available in the specified comparison.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                            Smith and colleagues' 2018 review, The developing infant creates a curriculum for statistical learning, describes head-camera and eye-tracking evidence that infants' visual inputs change with posture, mobility and object manipulation. It proposes that these changing inputs can support a developmental curriculum. The authors leave the causal benefit of particular ordering and its relation to learning mechanisms as research questions. This motivates modelling learner-dependent experience; it does not establish an adult mathematical advantage or a lower bound for artificial learners.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                            Artificial learning already combines different forms of experience. In V-JEPA 2, Assran and colleagues pretrain visual representations on large-scale video, then train an action-conditioned predictor with robot interaction trajectories. The result supports planning for evaluated manipulation tasks. The relevant lesson is that recorded observations, action information and learned simulation can play different roles within one model's development. These results do not by themselves concern mathematical concept discovery.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                            The SIMA 2 report of November 2025 describes learning in new game environments using self-generated experience, with Gemini supplying tasks and estimated rewards, after initial learning from demonstrations. This is an example of a model lineage gaining skills through further interaction. Its teacher, environment access and retained experience belong in the baseline when available. The reported remaining difficulties with long tasks and memory are properties of that system, not universal limits of model growth.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                            These observations suggest comparing concrete interventions: preserve or shuffle a developmental sequence; provide selected traces or interactive access; add a bounded teacher; allow the lineage to design its own curriculum. Fix total resources and evaluate fresh-task acquisition after removing help. Such comparisons can identify which experience matters and guide a mathematical family. Even a large measured gap applies only to the tested procedures; proving the closed inequality still requires the broader argument in § [ftip-00N8].

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                            Marginal assistance and the cost of development [ftip-00ND]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                              A marginal comparison begins with a specified pretrained lineage and an already-developed contributor. It charges the closed campaign's new search and learning, and the assisted campaign's contribution production, failed help, communication, interpretation, checking and learning. Both face the same final evaluation and resource accounting. Their prior histories are disclosed endowments. A gap here means that assistance makes new acquisition affordable from those starting states; it does not mean that producing the contributor was cheaper than producing the model.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                              For an additive scalar work measure, let \(D_M\) be the model lineage's prior development, \(D_C\) the contributor's prior development not already included in \(D_M\), and \(W_0(m)\), \(W_1(m)\) the closed and assisted marginal work for a specified portfolio of \(m\) tasks. With any shared preparation charged once, the corresponding lifetime totals are

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                              \[ \begin {aligned} T_0(m)&=D_M+W_0(m),\\ T_1(m)&=D_M+D_C+W_1(m). \end {aligned} \]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                              Thus \(W_1(m)<W_0(m)\) need not imply \(T_1(m)<T_0(m)\). Shared expertise may be amortized across a declared portfolio; one cannot divide its cost by an arbitrary number of hypothetical future beneficiaries. Human-created training data, cultural resources, teachers and infrastructure follow the same inclusion convention on both sides. Unmeasured historical costs remain unmeasured.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                              The full resource comparison is a vector as in Definition [ftip-00MK]. Human time and accelerator work need an explicit conversion before a scalar inequality compares them. Wall time, peak hardware and memory follow the actual schedule, including causal dependencies. A model may copy states and run many experiments in parallel; an environment may impose an interaction rate. Whether simulation or accumulated experience can remove that delay is part of the setting, not an assumed advantage for either side.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                              A first proof target is marginal assistance, with bounded prior development specified separately. A lifetime comparison is a stronger additional question. Even with identical architectures, environmental access and prior duration can differ; equalizing architecture alone does not equalize all costs. State whether a claimed prohibitive expense is work, money, memory or elapsed time, and give the corresponding operational cap.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                              Settings for a developmental separation proof [ftip-00NE]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                A promising mathematical setting couples related developmental tasks to a fresh target family through reusable structure. The contributor must acquire that structure by a bounded process. The recipient must then learn to use it under the common checker. The central choice is a family whose structure can both explain the developmental benefit and support a lower bound over the admitted closed alternatives. The following possibilities are research directions, not established separations.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                One direction is a family of transformation puzzles with public local move rules. Development offers related tasks on which a learner can experiment, notice conserved quantities or discover a compositional decomposition. Fresh tasks ask for a checked move sequence or a certificate of impossibility. The acquired method must apply to new instances, and its certificates must fit the shared checker and deployment cap. This makes the intended assistance concrete without giving the contributor unrevealed answers. The missing argument is why the closed lineage cannot affordably discover any comparably useful invariant, decomposition or direct search method from the same public rules and its admitted tools.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                A second direction studies the order and interaction of developmental experience. A learner's partial understanding can determine which question or intervention makes the next relation visible. Compare that process with the available passive traces and with any interactive or simulated substitutes admitted to the closed lineage. A proof must derive the cost of obtaining enough useful experience or processing the available data; simply withholding the interaction and declaring its outputs necessary would not explain conceptual discovery. Giving the lineage the same interaction channel is a stronger comparison when the intended mechanism is the cost of choosing how to use it.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                A third direction studies a contributor drawing on cumulative cultural search. Several bounded learners develop, test and teach reusable concepts across earlier tasks. A current contributor's short suggestion may transmit structure produced by that longer process. This naturally motivates a marginal advantage and an amortization calculation. A lifetime advantage additionally requires accounting for that earlier population's work and for analogous shared data, teachers and parallel search available to model lineages. Culture must be generated by the declared process; a collection of perfect hints would assume its success.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                For each direction, the proof needs a quantity that can be bounded through every admitted operation and connected to fresh-task performance. Information arguments apply when there is residual uncertainty; query arguments apply to explicitly limited response interfaces; computational arguments must address the available program class and its costs. If a separation is conditional on an independent computational hardness assumption, state that assumption and exhibit the reduction. Merely renaming the desired discovery difficulty as a hardness assumption adds no explanation. Restricted models can yield useful first results, provided their restrictions are not silently transferred to contemporary agents.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                The most immediate constructive target is a development process that learns a reusable invariant on one task distribution and transfers it to fresh certified tasks. Alongside that construction, seek a family-specific lower bound covering every equally useful acquired method as in § [ftip-00N7]. Keep the model's own discovery, simulations and learning inside this argument. Neither the construction alone nor a failed search for substitutes proves the prohibitive closed cost.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                § [ftip-00NF] develops the first direction as a representation learner whose developmental experience also teaches it to construct a useful curriculum for another recipient. The concrete objects are the grounded representation, the learned teaching policy and their fresh-task effects.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                Representation discovery through developmental curricula [ftip-00NF]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                  A useful contribution can change how a learner represents a problem and how it learns to reason in that representation. The contributor may recognize a conserved quantity, a compositional structure or a distinction missing from the learner's present vocabulary. Its curriculum then makes that structure usable by another system. This combines two acquisition problems: discovering a grounded representation and discovering experiences that teach it.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                  The proposed construction uses related tasks with public transformation rules. A bounded developmental learner acquires representations and teaching procedures on earlier tasks; an initially separate recipient learns from its contribution and faces fresh certified tasks. The intended gain is less total acquisition work at a fixed success threshold. The construction below specifies the mechanisms to establish that gain. A successful learning process and a lower bound over every affordable closed alternative remain mathematical obligations, not consequences of specifying the setting.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                  A complementary acquisition problem is deciding which representations will matter before future demands are apparent. § [ftip-00NK] studies that prospective choice through a changing public task process.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                  Public transformations and learned representations [ftip-00NG]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                    Consider finite expressions built from a public grammar. A family parameter \(\theta \) specifies local rewrite rules and a distribution of problem sizes and compositions. The description of \(\theta \), the grammar and the rules are available to both campaigns. A target instance asks whether one expression can be transformed into another. An accepted answer contains either a legal rewrite sequence or a proof of impossibility in a fixed sound proof system. The generator produces instances with certificates of bounded size, retains those certificates for evaluation, and reveals only the instance to the learner. The checker, allowed proof rules and certificate-size cap are identical for assisted and closed campaigns.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                    Public rules make the intended difficulty computational. Earlier experience may teach consequences of the rules that are expensive to find from their description. It supplies no secret governing future answers. The family parameter, development law, evaluation distribution and resource caps are fixed before final seeds are sampled. Developmental and final seeds are independent conditional on \(\theta \). Intermediate learning tasks may be simpler than final tasks, but their relation to the final distribution must be specified by the generator rather than chosen after observing a favorable test result.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                    One possible learned representation consists of a map \(\phi \) from concrete expressions to abstract states, abstract operations, and procedures connecting abstract reasoning to checked concrete certificates. For example, a learner may discover that several rewrites preserve a quantity, or that large expressions decompose into components with a small interface. A soundness proof for the invariant or decomposition is part of the acquired method when it is used to certify an answer. Recognizing a pattern in a few examples is insufficient. Grounding here means computing the abstract description from the supplied expression and justifying the concrete consequences used by the solver.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                    The map may discard distinctions. If two expressions have the same abstract description but require different choices, a successful learner can refine the representation, retain a concrete side condition, or use another level of description. The cost of discovering the counterexample and implementing the revision counts. The task family should admit several sufficient methods: another invariant, a different decomposition, a compiled solver or direct search may succeed without reconstructing \(\phi \). Success is measured by checked answers, so equally useful implicit representations in model parameters also qualify.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                    This is a parameterized family design, not a claimed hard rewrite system. An explicit instance of the construction must give the grammar, rules, certified generator and learning procedures, then prove their performance. Families reducible to a cheap canonical form or direct search may demonstrate learning and transfer while offering no discovery-cost separation. That possibility is a substantive test of the proposed mechanism.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                    Learning to discover and teach a representation [ftip-00NH]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                      The contributor begins with the disclosed state and bounded development of § [ftip-00NA]. On related rewrite tasks it can propose predicates, execute public rules, test conjectures, build examples and revise its representation. Neither a completed invariant nor a successful curriculum is placed in its initial state unless that preparation is explicitly counted as an inherited endowment. A constructive success argument must describe how the development process produces useful structure with a stated probability, including failed attempts.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                      Teaching is a further learned action. Let \(Z_t\) be the contributor's retained state, \(h_t\) the observed interaction history and \(q_t\) an intermediate task or demonstration. A teaching policy chooses \(q_t\) from \(Z_t\) and \(h_t\); the recipient's response and checked learning progress supply feedback for later choices. The policy may first teach a distinction on small expressions, then ask for a general invariant, and finally require composition on larger expressions. These stages describe a possible mechanism. Their usefulness must be established for the specified learner, rather than assumed from the apparent pedagogical order.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                      During development, the contributor can practice with bounded copies of a declared recipient population. It learns which examples correct particular failures and when a new abstraction is worth introducing. The student updates used to evaluate a teaching proposal are real work: cloning, training, progress evaluation, rejected curricula and teacher updates all count. A progress set drawn from the development distribution can provide a verified reward. Final evaluation instances remain unavailable for curriculum selection. Any guarantee must connect development progress to fresh-task success, since a curriculum may overfit either the practiced recipient or its progress measure.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                      At assistance time, a fresh recipient starts from the declared model endowment. The contributor supplies an explanation, programs, examples or an adaptive sequence of tasks, within communication and interaction caps. The recipient must interpret the contribution, check the relevant claims and learn to use the representation. Evaluation occurs after the contributor is removed. A retained contributed program is allowed when it fits the common deployment interface and cap; merely consulting an uncharged external solver during evaluation is a different experiment.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                      Useful teaching need not require the teacher to solve the final tasks itself. Conversely, a source that can solve them may still fail to teach the recipient. Measuring the contributor's discovery, its teaching skill and the recipient's later capability separately makes these possibilities visible. A short explanation or a short successful curriculum measures transmission after discovery; its length does not establish that finding it was cheap or expensive.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                      Contemporary representation and curriculum learners [ftip-00NI]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                        Current agents already implement substantial parts of this construction. TheoryCoder-2 synthesizes PDDL abstractions alongside a learned Python dynamics model and hierarchical planning. Its discussion nevertheless identifies supplied object-oriented states and brittle predicate grounding as limitations. In its tested environments, an initial observation sufficed for adequate abstractions; learning to revise a representation through unfamiliar interventions remains a further problem. This motivates learning the concrete-to-abstract map, without implying that generated predicates are beyond model capabilities.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                        ProPlay learns a procedural graph with transition reliability to guide later action. Its failure analysis shows why reusable structure alone is insufficient: a coarse procedure can lose necessary quantitative detail, and a generally reliable transition can be unhelpful for the present task. Its plan is produced once per episode. The representation learner above must therefore be compared with agents allowed to revise plans and abstraction levels, not just with the particular implementation evaluated in that paper.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                        SOAR, especially its method, ablations and limitations, provides an automated teaching mechanism: teacher tasks receive reward through a student's improvement on a separate hard training set, without the teacher seeing those hard questions. Its substantial bilevel training cost and dependence on a ground-truth progress signal belong in the comparison. Failure on an initial finite sample does not prove that direct discovery is impossible.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                        Vocabulary Dropout for Curriculum Diversity shows that modifying proposal generation can sustain curriculum diversity, while its asymmetric proposer/solver experiment and verification analysis show that diversity and stronger teachers need not yield better learning. ANCORA combines supervised initialization, proposer/solver training and a filtered curriculum graph for verifier-based learning. Its limitations include diversity collapse within valid outputs and longer-run plateaus. Its Proposition 4.1 assumes continued positive probability of admitting new specifications; that premise does not establish the cost of discovering useful new concepts.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                        These results motivate a combined comparison with representation synthesis, curriculum generation, active experiments, persistent memory, search and model updates. Their reported benchmarks do not instantiate the rewrite construction or establish its separation. A contributor defined only as a supplier of abstractions, diverse exercises or a curriculum graph would duplicate mechanisms already available to the closed campaign. The remaining question concerns how much work any adequate combination needs to acquire useful structure from the specified starting state.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                        Fresh transfer and the discovery-cost argument [ftip-00NJ]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                          Fix a final success threshold and a resource vector before comparing methods. The assisted upper-bound problem is constructive: specify bounded development, a prospective source-selection procedure, contribution production and recipient learning, and establish their joint probability of reaching the threshold. Charge failed development and teaching runs where selection uses them. The marginal comparison discloses earlier contributor development separately; a lifetime claim includes that work under § [ftip-00ND]. Communication length, token count, accelerator work and elapsed time are distinct quantities unless an explicit conversion relates them.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                          Several controlled comparisons can locate the benefit. Giving the recipient a completed grounded representation measures acquisition after discovery. Replaying a successful curriculum measures learning after its selection. Replacing adaptive teaching with fixed examples tests the value of recipient feedback; varying the final expression size and composition tests reuse. A closed campaign that builds its own curricula, revises representations and updates its models tests affordable reconstruction. The supplied-representation and replay experiments are positive controls, not estimates of unaided discovery cost.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                          The mechanism predicts that a useful developmental curriculum reduces recipient work on unseen compositions, and that failures caused by lost abstract distinctions decrease after grounded refinement. If gains vanish when the source is removed, depend on near-duplicate evaluation instances, or disappear under a cheap alternative solver, the proposed explanation must change. Measuring these outcomes can reject a candidate construction. An observed advantage over the implemented comparison agents still leaves the all-campaign claim open.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                          For that claim, start with an arbitrary successful closed campaign in Definition [ftip-00MJ]. Its code search, implicit representations, retrieval, synthetic tasks, self-play, active interventions, training updates, heterogeneous models and resource-allocation choices are all admissible when allowed by the declared endowment and caps. The lower-bound argument must connect its checked fresh-task success to work that every such route incurs. It cannot require the campaign to discover the contributor's particular invariant or follow its curriculum. Direct solving is an alternative to conceptual reconstruction.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                          A family-specific reduction could show that any successful closed campaign solves an independently hard computational problem, while the bounded developmental process and assistance yield an affordable upper bound under the disclosed prior endowments. A restricted representation language or response interface may admit a first, narrower theorem. Neither case permits assuming that every useful curriculum or representation is negligibly likely under arbitrary adaptive search: that would assume the desired discovery barrier. The absence of the contributor's experience in § [ftip-00N8] supplies the starting condition; the prohibitive cost of every equivalent capability is still to be derived.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                          Prospective abstraction in evolving task families [ftip-00NK]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                            Some concepts become valuable because they prepare a learner for tasks that have not yet arrived. A contributor may learn how research demands evolve and invest in structure whose utility is poorly reflected by compression of past solutions. The acquired capability is a way to forecast, choose and revise abstractions under limited resources.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                            This differs from constructing a teaching curriculum in § [ftip-00NF]. There the source chooses experiences that help a recipient learn useful structure. Here the source learns about the process producing future demands, and uses that understanding to decide which structure is worth acquiring. Teaching can transmit the resulting capability, but does not define its prospective value. Informative experiments, cumulative culture and research judgment can support either process.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                            A public process for changing task demands [ftip-00NL]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                              Extend the public rewrite setting of § [ftip-00NG] by a sequence of demand states \(X_t\), with a declared initial distribution. A fixed transition law \(K_\theta \) governs how the demand state changes. Conditional on \(X_t\), a fixed generator \(G_\theta \) samples a certified task. The parameter \(\theta \), both laws and the rewrite rules are available to both campaigns. A demand state may favor particular compositions, expression sizes or interfaces, so an abstraction useful in one period need not remain useful in the next. The future random seeds are unrevealed, and the laws are fixed independently of either learner's decisions. The laws are given as computable programs; their execution and any derived approximation are charged.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                              For example, demand may move between tasks dominated by local cancellation, tasks requiring repeated composition, and tasks coupling several components through a shared boundary. This describes possible structure in the generator, not established difficulty of those tasks. The change law could make a local regularity predictive of later coupling, so acquiring a compositional representation has value before that coupling becomes common. An actual construction must specify the expressions, rules and transition probabilities, and show that its proposed investment really reduces later work.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                              A state \(X_t\) can be observed directly or inferred from the common history of revealed tasks and responses. Fix which case applies. If the state is latent, both campaigns receive the same observations; the source has no private reading of the current state or future seed. In the computational version, their problem is to process the available history and public laws cheaply enough. Uncertainty remaining even for an unlimited observer is common to both. Giving only the contributor an informative sensor or an undisclosed generator defines a separate information-access comparison.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                              Development uses earlier independently seeded episodes from the declared process family. It may teach a learner to recognize which histories predict useful future structure, but cannot supply the final episode's hidden state. Selection of the source and its retained state precedes final seeds. During evaluation, tasks arrive in order; any feedback and adaptation available after an answer follow the same specified schedule on both sides. The final correctness predicate, proof rules and certificate cap stay fixed throughout the changing demand distribution.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                              Joint acquisition of a forecast and a library [ftip-00NM]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                A developmental learner retains a predictive state \(b_t\) and a library \(L_t\) of representations, subroutines or reusable reasoning procedures. From the observed history it updates its forecast of future tasks and decides whether to extend, refine or discard library elements. The forecast need not be an explicit Bayesian posterior, and the library may be encoded in parameters. The defining feature is that the learner uses anticipated downstream utility in deciding what to acquire.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                The two learning problems interact. A new representation can make a previously obscure regularity in the task process easier to recognize; a revised forecast can change which representation is worth learning. Consequently, a predictor operating over a fixed, human-supplied list of perfect abstractions removes part of the proposed acquisition problem. A bounded construction should describe how candidate structure is generated, how its consequences are grounded, and how experience updates both prediction and selection. Initial program libraries, pretrained predictors and demonstration histories remain disclosed endowments.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                One possible developmental procedure generates candidate decompositions from earlier solved tasks, predicts their usefulness over a finite future horizon, and spends a capped amount of work testing the most promising candidates on independently sampled continuations. Failed predictions supply feedback. This is an explicit algorithmic pattern, not a free forecast oracle: generating continuations, constructing a simulator, evaluating candidates and revising the predictor all cost work. With public computable laws, the closed campaign may implement this procedure too. The intended advantage must come from the cost of acquiring a sufficiently useful procedure from the specified endowments.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                A developed contributor can teach the recipient its selection method, transmit a grounded library with its conditions of use, or help initialize a predictor. The recipient must acquire and apply the contribution within the assistance cap. Later library selection and task solving are performed without further uncharged source access. A one-time selection for a revealed history is a weaker form of help than learning a reusable prospective policy; transfer to fresh episodes distinguishes them. Neither form requires matching the source's internal concepts.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                Prospective selection and contemporary agent alternatives [ftip-00NN]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                  Prospective Compression in Human Abstraction Learning studies reusable-helper choices while a latent curriculum changes. Its two controlled Pattern Builder experiments involve 60 participants in total and six computational comparison models. The results support sensitivity to future reusable structure beyond the tested retrospective and LLM-based accounts. They motivate studying prospective acquisition rather than only compression of earlier solutions.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                  The paper's limitations are decisive for the comparison here. It does not implement a full learner that infers the latent task-generating process, and individual tasks can be solved without reproducing human helper choices. Its restricted helper-optimization hardness result does not bound arbitrary learning agents. The proposed construction therefore evaluates checked future performance and total work, rather than similarity to human-selected helpers, and admits agents that jointly learn a process model and a library.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                  Such agents may forecast by Bayesian inference, learned world models, sequence prediction or simulation; select structure by search, expected utility or learned value estimates; and retain experience in memory or model updates. ProPlay supplies one contemporary procedural-memory mechanism, while BREW constructs reusable recipes from trajectories and optimizes their correctness and retrieval usefulness. These particular systems do not establish prospective learning for the public rewrite process, but their mechanisms are available components of an alternative campaign.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                  Theoretical active-inference guarantees also require attention to what is already supplied. Curiosity is Knowledge proves results under stated identifiability and regularity conditions; its discussion identifies idealizations including a discrete hypothesis setting and exact mutual-information computation. Providing an adequate hypothesis class or an exact acquisition calculation can remove work that the developmental construction is meant to explain. Conversely, these restrictions do not establish that a more general agent cannot find an affordable approximation or a different sufficient method.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                  Experiments, cultural preparation and research judgment [ftip-00NO]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                    Informative experiments can improve either representation discovery or forecasts of future demand. A contributor may learn which intervention distinguishes plausible decompositions or exposes a misleading progress measure. In the public-rule setting, both campaigns can execute the same permitted experiments; the question is the cost of choosing and interpreting them. Criticality-guided learning learns to target failure-prone conditions from execution outcomes, showing why rarity under random sampling is too weak an argument. Its predefined state representations remain a relevant limitation of that implementation. A physical experiment with unequal access may support a different, explicitly informational or interaction-rate result.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                    Cultural preparation can supply earlier exploration, tested concepts and teaching practices. Model it as a bounded population that generates, selects and transmits methods, or disclose its products as inherited endowments. Failed discoveries, selection and transmission count; so do analogous shared data, model populations and libraries on the closed side. The study of AI-discovered strategies in human culture separates difficulty of discovery, ease of transmission and recognizable advantage. Its AI-to-human direction supports an origin-neutral contribution. Neither that experiment nor its population simulations establish a general discovery lower bound. Prior cultural work can explain a marginal benefit, while lifetime and amortized claims require the accounting in § [ftip-00ND].

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                    Research judgment can help choose a fruitful subproblem, recognize when an abstraction loses an essential distinction, or improve an intermediate progress measure. Such choices affect how computation is spent; they do not change the final mathematical task or checker. The study of divergence and negation in scientific ideas reports differences between expert ratings and several automated evaluations, while also showing benefits from learning a reward model on human ratings. This motivates acquired judgment without treating it as a human monopoly. Expert ratings of ideas do not directly certify mathematical discovery. For this construction, any learned progress measure must justify its value through fresh checked outcomes, with its own training and validation charged.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                    These three contributions have distinct roles: experiments produce useful evidence, culture explains how prior useful structure was generated and transmitted, and judgment guides selection and evaluation. They can support both major constructions, but their benefits do not automatically add. A curriculum learned from cultural demonstrations and selected by an experimental progress measure may share preparation across all three. Ablations should vary one mechanism at a time, and total accounting should charge shared work once.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                    Future utility, investment cost and proof scope [ftip-00NP]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                      Fix a horizon \(H\), a success threshold and a common adaptation schedule. In an additive work measure, let \(A_t\) charge forecasting, experiments and library construction before task \(t\), and let \(S_t\) charge solving, checking and permitted learning from that task. Let \(I\) charge assistance production, communication and recipient acquisition. The assisted marginal work is

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                      \[W_1=I+\sum _{t=1}^{H}(A_t+S_t).\]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                      The closed total charges its corresponding acquisition and task work under the same convention. Forecasts may optimize expected future work, but a hard budget claim must also bound realized resource use and include runs that exhaust the cap in the success probability. Memory, peak hardware and elapsed time retain their separate operational constraints. Earlier development and any portfolio amortization follow § [ftip-00ND].

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                      A useful prospective policy should reduce later acquisition and solving work enough to repay its earlier investment at the fixed success threshold. Compare it with retrospective compression, a learned generative-model policy, direct solving without a reusable library, and a campaign that constructs its own predictor and representations. Equalize current observations and disclose earlier preparation. An oracle given the future sequence can diagnose the maximum possible value of anticipation, but its performance does not establish that either real learner can obtain it.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                      The mechanism predicts a larger benefit when demand changes have learnable structure and the right abstractions require substantial advance investment. It predicts a smaller benefit when demand is uninformative, useful libraries are cheap to build on arrival, or direct solving already fits the cap. A predictor can be accurate yet unhelpful if its forecast does not change an affordable decision. Measure fresh-task success, realized work and the effect of forecast-guided investment together. These are testable predictions for the specified process, not reported experiments.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                      The constructive proof problem is to produce a bounded developmental learner and establish its later performance without hindsight selection or privileged final-episode information. The closed lower-bound problem must cover every equally useful selection or solving method in § [ftip-00N7], including implicit forecasts, alternate abstractions, heterogeneous learners and internally generated curricula. A lower bound only against retrospective compression would explain that restricted comparison, not the conjecture about contemporary closed campaigns.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                      For a computational separation with public laws, a reduction must connect fresh checked success to an independently hard inference or computation problem under the declared endowment and resource cap. It must also explain why direct solving and alternative investment policies cannot avoid that work. Withholding the future law from one side, choosing future tasks after seeing its library, or assuming every useful forecast is rare would establish a different claim or assume the desired conclusion. The prospective construction supplies a distinct acquisition problem; the all-campaign cost inequality remains open.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                      Mathematical research beyond initial ability [ftip-00NQ]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                        A mathematical agent can develop a method for a problem whose solution is already known to its evaluators. What matters for acquisition is the agent's starting ability, the research it performs, and the new problems it can solve afterward. Novel mathematics strengthens the discovery outcome, but withholding a known solution can make the development of a method observable under a precise standard of correctness.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                        This setting makes the developmental construction of § [ftip-00NF] concrete through mathematical research. A candidate concept is tested against objects and counterexamples, useful lemmas are retained, and a recipient acquires an artifact before fresh problems are revealed. The prospective question in § [ftip-00NK] concerns which such concepts are worth developing for future demands. Both questions admit successful autonomous discovery.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                        Initial difficulty, discovery and retained capability [ftip-00NR]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                          Fix an initial agent, its available mathematical material and tools, a correctness standard, and a budget for an initial attempt. A problem is initially unresolved by this agent when the declared attempt procedure returns no accepted solution. A family-level measurement reports the initial success rate and its sampling uncertainty. Failure under this procedure neither proves that the solution is absent from pretrained weights nor establishes failure under every affordable procedure.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                          This operational condition permits three settings. In controlled rediscovery, evaluators know a useful mathematical concept and withhold its explicit construction. In withheld research problems, evaluators possess proofs that the agent cannot retrieve through its permitted interfaces. In open mathematical research, a result may also be new to the community. The initial agent can have relevant background knowledge in all three. Novelty, correctness and improvement over initial ability are different measurements.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                          The First Proof second batch provides a concrete withheld-research protocol: human-proved research lemmas were evaluated before their proofs were published, with organizer-run agents, a time limit and expert assessment. Its released statements and logs are now public, so a new experiment must use fresh withheld material or state which reconstruction of earlier access is being tested. An agent's accepted alternative proof can be a substantive discovery even if the theorem has an existing human proof.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                          The research campaign has three observable products. A discovery is an accepted mathematical result or method obtained during development. An acquired artifact is the state retained for subsequent work: parameters, a checked library, an executable representation, a search procedure, or an explicitly specified combination. Transfer is the performance of that frozen artifact on new problems under a common deployment budget. A successful answer to the current problem alone does not establish transfer. Continuing to consult the contributor during evaluation changes the system being measured and must be a separate condition.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                          DreamProver (sections 3--5) illustrates how research produces a reusable library. Failed training goals are decomposed into helper results; a later phase clusters, generalizes, verifies and prunes candidate lemmas. Libraries are then evaluated on separate theorems. The learned lemmas may be well-known mathematics, and the retained artifact is available in context rather than necessarily encoded by a parameter update. This is evidence for a particular acquisition mechanism, with discovery and library-construction costs still relevant to a complete comparison.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                          ProofEvolve (section 5.6) separates two useful reuse experiments. Synthetic compositional families compare a growing library against resetting it. A separate held-out theorem study supplies relevant self-generated, verified proofs as examples and compares them with no examples and random retrieval. That second experiment disables proof-graph search, decomposition and repair, so its measured gain isolates contextual reuse rather than the entire evolving prover. This suggests testing the contribution of an acquired library independently of changes to the surrounding search algorithm.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                          The multi-agent concept-discovery study provides a complementary mechanism. A conjecturing process guides symbolic regression, a skeptical process challenges regularities by reweighting examples, and provability feedback helps select candidates. Experiments reconstruct expressions related to Euler characteristic and Betti numbers. The provided incidence matrices, dimensions, ranks and nullities already encode mathematical insight. Discovering an expression from those features and inventing the underlying representation are distinct acquisition tasks. A concrete experiment must state which one it measures.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                          SOAR makes useful teaching an executable development process: a teacher proposes intermediate exercises and is rewarded by measured student progress on difficult training questions. Its initial filtering by repeated failed attempts is an operational criterion, not an impossibility claim. Teacher development and recipient training are separately charged, including unsuccessful curricula. A contributor can therefore be a learned mathematical teacher rather than an unexplained source of ideal hints.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                          The autonomous comparator must also admit learning during search. TTT-Discover (section 3) updates a model while seeking an excellent solution to the current problem; later generalization is outside that stated objective. ThetaEvolve (section 4.3.1) includes an experiment freezing a checkpoint trained on one mathematical search task and applying it to unseen tasks. These mechanisms distinguish current search progress from retained parameter acquisition. Checkpoint selection and learning costs accompany the latter comparison.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                          The proposed FTIP experiment combines concept testing, verified lemma accumulation and recipient transfer. This combination is a research proposal, not a result reported jointly by the cited papers. Both campaigns retain the fixed mathematical rules and checker of § [ftip-00ML]; an external contribution may provide a representation, connection or curriculum developed from permitted related experience. Its producer does not receive the withheld evaluation answers. The recipient may reject it, improve it or find an alternative. All of that work belongs to the process being compared.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                          The finite comparison can show that one developed artifact is useful or affordable relative to tested alternatives. It cannot establish the all-lineage lower bound in § [ftip-00MN]. If an admitted classical solver, a self-generated library or a learned autonomous procedure reaches the same capability more cheaply, that finding is evidence against the proposed advantage for this setting. The correctness criterion does not privilege reconstruction of the evaluator's preferred concept.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                          A finite setting for invariant rediscovery [ftip-00NS]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                            A first concrete family can use linear chain complexes over the two-element field \(\mathbb F_2\). This adapts the incidence-matrix concept-discovery setting of Aggarwal et al. into an exact finite experiment. The chosen field, transformations and certificate tasks below are part of this proposal, not a reproduction of that paper.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                            An object consists of vector spaces of dimensions \(n_0,n_1,n_2\) and matrices \(D_1:\mathbb F_2^{n_1}\to \mathbb F_2^{n_0}\) and \(D_2:\mathbb F_2^{n_2}\to \mathbb F_2^{n_1}\) satisfying \(D_1D_2=0\). All entries, dimensions and allowed operations are public. Arithmetic is exact. Zero-dimensional spaces and zero maps are included. The experiment can provide only matrices and arithmetic, or additionally ranks and nullities; these are different initial endowments and receive separate results. Neither regime establishes discovery of the entire mathematical representation from unstructured observations.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                            The middle cycles and boundaries are \(Z_1=\ker D_1\) and \(B_1=\operatorname {im}D_2\). The chain identity gives \(B_1\subseteq Z_1\), so the quotient \(H_1=Z_1/B_1\) is defined. Rank-nullity yields

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                            \[ \beta _1=\dim H_1 =n_1-\operatorname {rank}D_1-\operatorname {rank}D_2. \notag\]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                            Indeed, \(\dim Z_1=n_1-\operatorname {rank}D_1\) and \(\dim B_1=\operatorname {rank}D_2\); taking the quotient subtracts these dimensions. At the ends, \(\beta _0=n_0-\operatorname {rank}D_1\) and \(\beta _2=n_2-\operatorname {rank}D_2\). These elementary identities explain the evaluator's target and remain withheld as explicit answers where rediscovery is being measured. They are not new mathematical results.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                            Allowed changes include invertible changes of basis \(P_i\) in each space. They replace the matrices by

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                            \[ \begin {aligned} D'_1&=P_0D_1P_1^{-1},\\ D'_2&=P_1D_2P_2^{-1}. \end {aligned} \notag\]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                            The product remains zero and the ranks remain unchanged. Another allowed change adjoins or removes a direct summand consisting of an identity map between two adjacent one-dimensional spaces, with zero maps elsewhere. That summand has zero homology in every degree. Direct sums add dimensions of homology, so these moves preserve all three \(\beta _i\). A candidate invariant can be challenged with new valid objects, basis changes and such elementary additions.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                            A target asks whether two presented objects are related by a sequence of these allowed moves. A positive certificate lists legal moves and their exact matrices, including inverses for basis changes and the displayed summand for a removal. A negative certificate supplies unequal homology dimensions with checked rank witnesses. A rank witness can give invertible row and column transformations, their inverses and a diagonal normal form with an identity block and zeros elsewhere; the checker verifies these matrix identities and counts the block size. Agreement of a proposed invariant on a few examples is insufficient, and equality of the dimensions alone is not accepted as a positive certificate. The agent must construct the required transformation or another certificate justified by the fixed mathematical checker.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                            A concrete sampler first draws uniformly from the finite set of nonnegative integer tuples \((h_0,h_1,h_2,r_1,r_2)\) satisfying the declared dimension cap, where

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                            \[ \begin {aligned} n_0&=h_0+r_1,\\ n_1&=h_1+r_1+r_2,\\ n_2&=h_2+r_2. \end {aligned} \notag\]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                            It builds a direct sum of zero-differential spaces of dimensions \(h_i\) in degree \(i\), \(r_1\) identity pairs in degrees one and zero, and \(r_2\) identity pairs in degrees two and one. Independently sampled invertible binary basis matrices scramble this presentation; uniform sampling by rejection from all binary square matrices is one exact choice. The resulting \(\beta _i=h_i\) are evaluator facts, not additional observations supplied to either agent. The distribution and sampling algorithm themselves are public, so reconstructing this decomposition is an admitted strategy.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                            Positive instances apply a sampled legal move sequence to an object, retaining that sequence privately. At each step the sampler chooses uniformly among the declared finite encodings of dimension-bounded legal moves; the identity move permits padding to the specified length. Negative instances draw two canonical tuples with different homology vectors and randomize their presentations independently. Their dimensions are matched where the chosen profile permits, and results are also stratified by dimension differences to detect easy size cues. Retained rank witnesses certify the labels. The mixture, move count, dimension profile and certificate limits are fixed before final seeds are sampled.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                            A single middle invariant is not complete even for this family. Objects concentrated in degree zero can have identical \(\beta _1=0\) and different \(\beta _0\), and hence cannot be related by the allowed moves. This provides a concrete counterexample to premature abstraction. A learner may retain the whole homology vector, refine its proposal or use direct algebraic reasoning; successful certification, rather than one preferred formula, determines the outcome.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                            This initial family has an efficient classical alternative. Gaussian elimination computes bases for cycles and boundaries and decomposes a finite complex over a field into homology summands and adjacent identity summands. It therefore supplies both the invariants and constructive transformations when appropriate. Its arithmetic and certificate costs must be measured as an admitted baseline. The setting can reveal how an agent develops and transfers a method, but cannot support a claim that all autonomous methods face a prohibitive search barrier merely because one language model initially fails it.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                            Developing a method and teaching a recipient [ftip-00NT]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                              The finite family in § [ftip-00NS] permits a complete account of what a contributor learns and what a recipient acquires. Development takes place on earlier instances with independently sampled seeds. The final instance distribution, allowed observations and resource caps are specified before development; target instances and their certificates remain unrevealed. Broad mathematical preparation is disclosed separately from work performed during this experiment.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                              An autonomous research process alternates candidate generation, experiments and proof attempts. It can propose expressions involving the available matrix features, search for transformations, generate helper lemmas or invent code. A skeptical process selects valid chains that challenge a proposal. Exact counterexamples return a failed instance; a finite test pass only advances a conjecture to a proof attempt. A general lemma enters the verified library only after justification in the fixed proof system. Special-case facts carry their assumptions and are not silently promoted to universal laws.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                              The library-development loop follows the mechanism of DreamProver: use failed goals to identify helper results, group related discoveries, propose generalizations, verify them and discard redundant material. Suitable discoveries here include behavior under direct sums, invariance under changes of basis, and the need to account for all relevant degrees. Generalization may fail; its attempts, counterexamples and proof costs are part of development. No rule confines the process to discovering the evaluator's homology formula if another certified method is useful.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                              One executable contributor begins with related finite linear-algebra episodes: solving systems, studying kernels and images, and comparing quotients of nested subspaces. A bounded learner selects useful exercises and retains procedures and justified claims. It subsequently encounters the chain-complex development family and can propose a connection, a proof-producing solver, or exercises that teach the connection to the recipient. Its prior lessons, their solutions and its development work are recorded. It does not receive final target answers, an ideal hint for each instance, or an uncharged completed representation.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                              A second contribution type is a learned teaching curriculum. Following the progress-based idea in SOAR, a teacher chooses intermediate tasks and is evaluated by improvement of a provisional student on a separate development set. Teacher selection never uses final evaluation outcomes. Useful exercises need not solve the ultimate task directly. Producing and testing them, training provisional students and selecting a curriculum all consume resources. The recipient may receive incorrect suggestions, provided their verification and rejection are included rather than scored as free work.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                              Separate recipient conditions identify what was acquired. A library condition retains checked statements, proofs and an executable retriever. A procedural condition retains a certified transformation algorithm. A parameter condition updates a declared trainable model using the permitted development material. A combined condition retains an explicitly listed combination. These are different systems, not interchangeable evidence that the same capability has entered model weights. Imported proof macros must expand or be justified under the unchanged checker.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                              After acquisition, freeze the retained artifact, remove access to the contributor and reveal fresh instances. Measure accepted certificates under a common deployment budget. Test new random presentations within the development size range first, then a separately specified larger-size or composition regime. Success on one does not imply success on the other. A further assessment asks for general laws about direct sums and allowed transformations, with formal proof or independently assessed mathematical arguments as declared in advance. Benchmark prompts and theorem families are held out by mathematical content, not merely renamed variables.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                              The contributor may itself be an agent, a human or another bounded learning process. What matters is its endowment, development, transmitted artifact and the recipient's resulting capability. Supplying a previously published human proof is a legitimate retrieval condition, but its effect does not by itself demonstrate that a newly developed contributor discovered or taught the method. This distinction permits successful autonomous research to revise the proposed complementarity claim.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                              A prospective comparison of research campaigns [ftip-00NU]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                The purpose of the first experiment is to determine whether a developed mathematical contribution improves affordable retained capability in § [ftip-00NS]. The family, algorithm interfaces, model versions, seed schedule, success threshold and resource profiles are fixed before the contribution conditions are compared. A task initially easy for the agent cannot demonstrate overcoming its initial difficulty; a task solved cheaply by an admitted classical method cannot demonstrate a general discovery barrier. Both are informative outcomes.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                Information revealed by the generator, certificate interface, exposed checker code or accessible literature belongs to the initial endowment. If it supplies the homology formula, evaluate construction and reuse of a certifying method rather than rediscovery of that formula.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                A proposed pilot uses four disjoint sources of instances: admission probes, development episodes, development validation and final evaluation. Admission tests the initial agent without adaptation on 32 probes at a fixed per-probe budget. An operational admission threshold is at most eight accepted certificates. This threshold is a declared experimental choice, not a theorem about the model. Report every admission result. If the chosen family fails this condition, retain the result as an easy-family finding; any revised family starts a new prospectively specified experiment. Do not search for a family on which the assisted condition has already won.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                One concrete size profile gives development objects at most eight dimensions in each degree, with up to eight generating moves; final in-distribution instances use the same profile and new seeds. A separate extrapolation set permits dimensions and move counts up to sixteen. For dimension cap \(d\), allow at most \(8d+16\) transformation steps and \(64(d+1)^3\) binary matrix entries in a certificate; check dimensions, indices and invertibility explicitly. All conditions share these limits, and generation rejects instances whose retained certificates exceed them. The pilot evaluates 128 final instances per regime, balanced between positive and negative generation, across ten independent development seeds. These are proposed settings, to be costed before execution; they are not reported measurements.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                Development validation may select a checkpoint, library or curriculum; its repeated use and all discarded candidates are charged. Final instances are revealed only after the retained artifact is frozen. A failed final result cannot be used to revise that artifact within the same evaluation. If another research generation uses those results, it receives a new final set and a separate generation label. Exact repeated instances are excluded. Fresh presentations with the same homology are intentional transfer tests, not independent discoveries. For general-lemma assessments, screen equivalent statements and trivial variable renamings across training and final sets.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                The comparison includes the following complete procedures.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                1. An exact classical solver constructs certificates by elimination and decomposition, including all certificate production and checking.
                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                2. A fixed initial agent uses direct attempts and verification feedback, establishing the reference capability under the common deployment cap.
                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                3. An autonomous researcher develops lemmas, curricula, representations and executable solvers from permitted initial material. Its search can use experiments, counterexamples, retrieval, persistent archives and, where the selected model permits it, parameter updates.
                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                4. The same recipient acquires a contribution from the specified developmental producer, with producer preparation, validation and teaching included in the campaign resources.
                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                5. Retrieval of existing mathematical methods is measured separately, with the same declared library or literature access and charged search and integration.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                Within these conditions, compare relevant and irrelevant material at similar context size, an acquired library with its removal, and a learned curriculum with a predetermined curriculum. A parameter-acquisition claim also compares against giving the same material in context without training. These controls answer different questions and need not all share one headline score. The stronger autonomous method may reconstruct the contributor's development process, and that reconstruction is admitted whenever its initial material and operations are available.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                AlphaEvolve motivates allowing invented algorithms and code; TTT-Discover motivates updates during search; ThetaEvolve motivates frozen transfer. Nexus and OEIS Open motivate comparing richer research machinery against a strong simple loop. These choices prevent the unaided condition from being defined as one deliberately weak sampling recipe. They still form a finite tested collection, not every admitted lineage in the theoretical conjecture.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                The initial finite problem permits a later research extension. New withheld lemmas can assess proof development in the manner of First Proof; longer campaigns can use archives and communication as in Station. Problem selection can also be assessed prospectively, following the question posed by FAR. Such an extension receives its own mathematical standard and evaluation schedule. Success on the finite linear-algebra family does not establish success on research mathematics.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                Costs, measurements and outcomes that would change the claim [ftip-00NV]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                  A campaign's resource record includes model inference, training, mathematical experiments, classical computation, retrieval, contribution production, communication, certificate generation and verification. It also includes failed attempts, discarded checkpoints and validation used to select a method. Model calls alone do not equalize systems using different models, context lengths or training procedures. Record accelerator time, CPU work, human time, money, memory and wall time separately before applying any declared scalar conversion.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                  Let \(D_A\) denote development work for an autonomous process and \(D_C\) the contributor's charged development. Let \(T\) include transmission, recipient adaptation and validation. For a common deployment budget, write \(E_A(N)\) and \(E_C(N)\) for work on \(N\) fresh instances, including certification. A specified accounting convention then compares

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                  \[ \begin {aligned} W_A(N)&=D_A+E_A(N),\\ W_C(N)&=D_C+T+E_C(N). \end {aligned} \notag\]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                  The expression includes any autonomous reconstruction of contributor preparation in \(D_A\). Report inherited preparation and resources treated as sunk separately for both sides. A marginal-session saving does not establish a lifetime saving. If resources remain a vector, compare each component or state a Pareto relation; do not add human hours to accelerator operations without a conversion rule.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                  At equal task distributions and accepted-success requirements, reuse can amortize a contribution. Under the additional approximation of constant per-instance costs \(e_A\) and \(e_C\), with \(e_A>e_C\), the contributed method has lower total work precisely when

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                  \[ N(e_A-e_C)>D_C+T-D_A. \notag\]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                  This is an accounting consequence, not a prediction that the inequality holds. If the contributed method has lower success, comparisons must account for the additional work required to reach the same criterion. If its per-instance work is no better, amortization alone cannot erase a larger initial cost. Report failures at a cap as censored attempts; do not turn them into an infinite measured cost or a solved-instance ratio.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                  The primary acquisition measurement is the fraction of new instances with accepted certificates under the fixed deployment cap. Record it separately for the original distribution and extrapolation regime, along with certificate lengths, work and failures. Repeat complete development campaigns, rather than only decoding from one favorable learned library. Use common evaluation instances for paired comparisons and report variation across development seeds. Cost-to-threshold conclusions require uncertainty for both success and work and must name the procedures and budgets tested.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                  Additional measurements explain a result without replacing it: which verified lemmas are used in accepted proofs; whether a transformation method handles new presentations; whether the recipient still succeeds without contributor access; and whether a new recipient benefits from the same artifact. A proof differing textually from examples is not by itself evidence of conceptual novelty. Conversely, reuse of a short verified lemma can be a useful acquisition even when that lemma is familiar to mathematicians.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                  The literature motivates several testable predictions.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                  1. Relevant verified lemmas should improve recipient performance more than similarly sized irrelevant examples, as suggested by the reuse studies in DreamProver and ProofEvolve. A missing difference would weaken the claimed library mechanism for this family.
                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                  2. Challenging conjectures with counterexamples should expose the failure of incomplete invariants, including the middle-degree example in § [ftip-00NS]. If a simple algebraic solver already gives equivalent performance at lower cost, this mechanism supplies no cost advantage.
                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                  3. A useful curriculum should improve frozen-recipient performance beyond direct exposure to its material at the same accounted resources. If it merely helps while the teacher remains present, the result concerns assisted deployment rather than retained capability.
                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                  4. Amortized savings, when present, should depend on reuse count and the deployment regime. Failure on larger compositions would restrict transfer even if the original-size evaluation improves.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                  A positive pilot would establish a bounded acquisition result for the specified procedures. An autonomous reconstruction at comparable cost would weaken a proposed developmental advantage; a cheap classical solver would defeat an all-method barrier for this family. Neither result decides whether a different mathematical research family admits the separation in § [ftip-00MN]. Moving to that stronger claim requires a new family and an argument covering all equally useful methods, including implicit representations and future model generations.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                  Conditional obstructions to conceptual discovery [ftip-00MO]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                    One possible lower-bound mechanism is a necessary structural event: every successful route must construct or acquire some adequate representation. The event must cover alternative proofs and structures learned implicitly in parameters. The elementary probability bound below becomes informative only when its necessity and uniform probability premises can be established from the admitted system.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                    proposition. A necessary-event bound for an evolving lineage [ftip-00MP]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                      Fix \(B\in \mathbb N\) charged elementary transitions and a \([0,1]\)-valued realized acquisition score \(Z\), including its evaluation randomness. Let \(G_t\) mean a specified necessary structural event has occurred by transition \(t\). Assume \(G_0\) is false, \(G_t\subseteq G_{t+1}\), and \(Z\leq \mathbf 1_{G_B}\) almost surely. For deterministic \(\epsilon _t\in [0,1]\), suppose that every admitted campaign and every permitted positive-probability history before \(G\) satisfy

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                      \[ \Pr (G_t\mid \text {that history at }t-1)\leq \epsilon _t, \qquad t=1,\ldots ,B. \]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                      For general history spaces use the corresponding conditional-kernel bound almost everywhere for each admitted campaign. Include histories after training and controller replacement. Stopped runs are padded by absorbing transitions. Then every admitted \(P\) satisfies

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                      \[ Q_{\mathrm {acq}}(P)=\mathbb E Z \leq 1-\prod _{t=1}^B(1-\epsilon _t) \leq \min \{1,\sum _{t=1}^B\epsilon _t\}. \]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                      Proof. 

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                        Conditional on not having reached \(G\) by \(t-1\), survival at the next transition has probability at least \(1-\epsilon _t\). Conditional expectation gives

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                        \[ \Pr (G_t^c)\geq (1-\epsilon _t)\Pr (G_{t-1}^c). \]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                        Induction from \(\Pr (G_0^c)=1\) gives the product bound. The union bound on first-entry events gives the sum bound, while probabilities are at most one. Taking expectations of \(Z\leq \mathbf 1_{G_B}\) proves the score bound. For \(B=0\), the empty product is one and the bound is zero.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                        If the premise holds with \(\epsilon _t=\epsilon (n)>0\) at every work budget, then \(B_{\mathrm {closed}}(n,\tau )\geq \frac {\tau }{\epsilon (n)}\) for integer work budgets. A bound measured for one fixed checkpoint does not supply this premise. If other routes can achieve positive score without \(G\), the domination assumption fails. Calling \(G\) simply “success” does not explain a discovery mechanism without an independent probability bound. Recognition and learning obstructions may require other arguments.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                        Finite work, permanent barriers, and enumeration [ftip-00MQ]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                          Work exceeding a realistic cap, divergence with instance size, and permanent unreachability of a fixed target differ. A permanent barrier needs closure under all admitted learning, program and architecture changes. Excluding the target from a set does not derive that closure. An assisted crossing must leave the invariant set while preserving the checker. Fair enumeration gives a countercheck.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                          proposition. A permanent barrier requires transition closure [ftip-00MR]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                            Let \(\mathcal R\) be a measurable set of complete states. Suppose the initial state lies in \(\mathcal R\) almost surely, and every admitted transition from a permitted history ending in \(\mathcal R\) remains in \(\mathcal R\) with probability one. Suppose no successful terminal state lies in \(\mathcal R\). Then for every admitted campaign,

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                            \[\Pr (T_{\mathrm {success}}<\infty )=0.\]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                            Proof. 

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                              Induction and conditional expectation imply that the state lies in \(\mathcal R\) at each finite time with probability one. The countable union of the null events of leaving \(\mathcal R\) has probability zero. Success at finite time would require such a departure.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                              proposition. Finite certificates defeat an unrestricted never-reachable claim [ftip-00MS]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                Fix a target with a finite accepted signed certificate under a decidable checker. If the baseline admits enumeration of all finite signed candidate strings over a finite alphabet in increasing length, checking each in finite time, then some admitted procedure discovers a certificate in finite total work.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                Proof. 

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                  A finite alphabet has finitely many strings no longer than the accepted certificate. Each preceding check terminates, so the sum of their finite execution costs and the successful check is finite.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                  This assumes enumeration and checking have the required memory and other resources as work grows; it does not override fixed hardware caps. It gives no useful realistic work bound and no fresh-task acquisition guarantee. Short compressed proofs may still be expensive to expand.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                  Independent restarted attempts of uniformly bounded cost with fixed success probability \(p>0\) have expected attempt count \(1/p\). Full token support alone does not establish restart access, termination or such a fixed probability for an adaptive lineage. Other processes can succeed almost surely with infinite expected time. Neither one slow process nor one failed search bounds all admitted alternatives.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                  Where contemporary self-improvement meets conceptual discovery [ftip-00MZ]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                    Recent work supplies mechanisms for finding and using new structure, as well as examples of improvements generated inside a model's own workflow. A paper's motivating problem often extends beyond the part its method repairs. That difference identifies something to investigate; it does not establish an obstruction to every possible repair. The following studies connect these mechanisms to the conceptual-discovery conjecture, using the indicated primary versions.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                    Background structure and realized complementarity [ftip-00N0]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                      Hemmer and colleagues distinguish available complementarity from benefit actually realized by a human–AI team. They also distinguish differences in information from differences in capability, and choosing an individual's answer from producing an answer neither individual supplied alone. This motivates the separation between Definition [ftip-00MV] and proposition [ftip-00MW]: a source can expose useful structure while the joint procedure fails to exploit it. Their decision-making experiments do not establish learning into successor models.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                      In Semantic knowledge guides innovation and drives cultural evolution, Yaman, Tian and Lindström combine an agent-based model with a 1,243-participant experiment. Meaningful item depictions let participants use semantic knowledge; abstract symbols obscure it while preserving combination rules. Semantic knowledge and social learning support cumulative innovation. The model gives a concrete mechanism: learned representations direct exploration, and socially transmitted examples improve those representations across generations. The evidence comes from a closed-world recipe task. The authors also warn that strong priors may hide counterintuitive combinations. Cultural background is therefore a possible source of directed search, with relevance and flexibility still to be established.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                      Unlocking LLM Creativity in Science through Analogical Reasoning makes cross-domain object and relation mappings explicit, then searches for candidate solutions. It reports diversity and judged-novelty gains and four biomedical implementation case studies. Its cross-domain baseline also uses two model calls; its unconstrained baseline uses one. These counts help interpret the comparison without establishing matched total cost. Feasibility and later acquisition remain separate questions. Because the model itself constructs analogies, this method also belongs among the closed lineage's possible substitutes for an external contributor.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                      A testable hypothesis is that assistance helps when it supplies a relevant relation the recipient can verify more cheaply than it can discover. Compare a supplied relation with internally generated analogies at matched total cost. Give both arms the relevant background texts in a further comparison, charging retrieval and interpretation. If the advantage persists, access to texts alone has not explained it; if it disappears, this instance supports a background-access explanation. Neither outcome by itself bounds all admitted internal search procedures.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                      Choosing what is worth learning next [ftip-00N1]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                        A contributor may offer a promising question or a direction of inquiry without knowing its final answer. The difficulty is prospective: the learner must choose where to spend effort before observing how much that effort will teach it. Surprise can prioritize noise, while measured learning progress arrives after the investment.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                        Herrmann and Schmidhuber model interestingness through complexity–runtime profiles and future compression progress under specified Length, Algorithmic and Speed priors. Their analysis and finite enumeration experiments study when present structure predicts further compressibility. Section 4.4 limits the formal correspondence through Busy Beaver time scales; a long plateau does not exclude a later breakthrough. The analysis supplies neither an affordable selector for frontier models nor a lower bound over their possible research strategies.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                        For the contribution model, a direction's quality needs an independent property: for example, a reduction exposing a learnable subproblem with bounded translation cost. Calling a direction “interesting” cannot supply that property for free. An informative experiment would compare equal-cost choices by the recipient, a contributor and a shuffled-direction control, then measure verified progress and fresh-task performance after a fixed learning budget. A plausible prediction is that a useful structural selector outperforms mere surprise when high-surprise distractors are present. A successful internal selector weakens the proposed external advantage for that specification.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                        Improving workflows and learning from comparisons [ftip-00N2]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                          Recursive Harness Self-Improvement addresses the cost of maintaining effective agent workflows and the need for useful execution traces in model–workflow co-evolution. It revises prompt-level workflows from pairwise evaluation history while holding the foundation model fixed. Experiments on 30 synthetic machine-learning research tasks show gains over the tested configurations. The proposed information-theoretic explanation is a hypothesis. Its conclusion leaves internalizing the resulting traces into future foundation models for future work. The improved workflow is evidence of better system behavior; successor-model acquisition needs a further result.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                          Mendel Gödel Machine diagnoses a different missed opportunity: editing from a single failed trajectory underuses comparisons across tasks and lineages. Its operators extract evidence from both kinds of comparison to edit agent scaffold code. The diagnostic theory assumes informative comparisons and an editor able to use them. Its simulations vary the comparative fixing advantage, including a null setting with no advantage, and its coding-agent experiments test bounded benchmark subsets. This is a concrete internal remedy, not evidence that every archive automatically yields useful structure.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                          These methods suggest an acquisition experiment with declared artifact types. First measure the improved workflow with its persistent instructions and memory. Then train a successor on the resulting traces and evaluate that frozen successor under the same declared deployment wrapper, with contributor access removed. An unchanged-weights comparison and a successor trained from baseline traces distinguish workflow effects from learning effects. All trace generation, evaluation, selection and training consume the lineage budget. A gain that survives the second comparison supports acquisition under that contract; a workflow-only gain still counts when workflows are among the allowed final artifacts in Definition [ftip-00MM].

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                          A second prediction concerns archive quality: comparisons should help most when failures share an identifiable cause and the archive contains a relevant contrast. Vary those conditions while matching archive-building and editing costs. Successful internally generated comparisons must enter the closed baseline before attributing an affordable advantage to an external source.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                          Retained experience and the limits of self-imitation [ftip-00N3]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                            Beyond Final Scores studies seven models on 36 long-horizon AI research and development tasks. Its process diagnostics separate framing, execution and feedback; its experience comparisons include continuations with retained versus erased experience and lessons transferred to held-out tasks. Reuse can help or mislead. Under its particular novelty review, three of 252 best-seed solutions qualify as novel approaches. This finite observation identifies a problem in the tested setting, without proving a ceiling over alternative learning lineages.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                            The mechanism worth testing is whether a learner can extract a reusable principle while discarding task-specific tactics. Compare raw experience, verified abstractions, deliberately mismatched lessons and no retained experience, with extraction and verification charged. Predict that matched abstractions help across the declared structural family and that harmful reuse increases when applicability conditions are violated. Improved internal experience revision is a possible remedy and belongs in the baseline.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                            Version differences matter for the stronger claim that a closed loop must deteriorate. The September revision of the RSI survey by Chen, Wang and Qu describes an unvanishing external-signal requirement. Zenil's August revision explicitly narrows that formulation: a per-generation correction fraction may vanish while cumulative correction remains sufficient. It distinguishes exact self-imitation, replacement, retention and correction, and does not assert universal collapse.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                            Zenil also distinguishes total information from the consequences an affordable procedure can make accessible. This is compatible with the role of computation in Definition [ftip-00MJ]: a new representation can expose a consequence without adding a hidden fact. Neither the information distinction nor the narrow resampling calculations show that an autonomous lineage lacks every useful representation change. A conceptual-discovery lower bound must constrain those alternatives explicitly.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                            Three obligations for a separation proof [ftip-00N4]

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                              The conditional transfer result separates three substantive obligations. First establish an affordably available contribution with independently meaningful structural quality. Then establish recipient interpretation, verification and acquisition within the remaining resources. Finally bound every admitted closed alternative, including internal analogy search, comparative archives, revised experience, task selection and changes across model generations. Existing studies motivate the first two and offer useful counterchecks to the third. They do not jointly prove the conjecture.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                              The central objective is to prove the separation. The developmental formulation in § [ftip-00N8] begins with absent experience and asks what family-specific argument makes every equally useful closed route expensive. An affordable qualified contributor and a recipient learning guarantee provide the constructive side; a necessary-event premise is insufficient unless its necessity and bound are derived for the admitted process.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                              Evidence can revise the setting while this proof is sought. A proved admitted procedure whose expected score exceeds the proposed ceiling invalidates that ceiling. One unusually successful run does not establish such an expectation, and failure of a tested menu does not establish a universal lower bound. Internal improvements belong in the closed process; a contribution the recipient cannot acquire leaves the constructive claim unproved. Fix the target, checker, endowments, resource limits and evaluation law before the decisive comparison.

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                              The economic extension studies how civilization and economic reproduction constrain the resources available to these learning lineages. It separates feasible schedules from task-specific discovery difficulty.