Is being able to survive the same as being likely to survive?

01 / Two different questions about continuing

A possible successful future tells us nothing by itself about its probability.

Imagine two forests. Both have at least one future response that maintains their defining organization. By a simple possibility test, both have a successful continuation available.

But now suppose we've equipped our mathematical model with a probability distribution over possible responses. In Paper III, Section 12.3, I use two finite distributions with very different success probabilities: 999 out of 1,000 and 1 out of 1,000.

Both distributions are stipulated mathematical examples with the same positive outcome support. The percentages are not measured ecological success rates or calibrated biological forecasts.

Both pass the possibility question because each assigns positive probability to some successful outcome. Now declare a stricter question: must at least half the probability be assigned to success? System A passes. System B does not.

Possibility and probability ask different things. The original set of attained viable response categories does not automatically carry a probability law, so this extension requires its own declared semantics.

02 / Adding the successful response masses

Here's how I calculate success probability.

For a finite response collection, I give each response r a probability mass μ(r) and declare which responses satisfy the success condition P. The total success probability sums the masses of responses that satisfy that condition.

μ

The separately specified finite probability distribution.

r and P(r)

A response r, and the declaration that it satisfies success criterion P.

1_P(r)

The indicator: 1 for success, 0 for failure.

∑

Add the contributions over the response carrier.

p_succ

The total mass assigned to successful responses.

To make the arithmetic tangible, imagine a different, purely pedagogical forest response law. Stable continuation has probability 40%, regeneration 35%, adaptation 15%, and collapse 10%. I declare the first three responses successful and collapse unsuccessful.

The total success probability in that imagined model is 0.40 + 0.35 + 0.15 = 0.90. Collapse is an admitted outcome in the example, but it does not contribute to the successful mass.

03 / One number that answers many questions

When does total success probability contain all the information we need?

Suppose every declared question has this form: does the success probability reach some threshold θ? Our response may be complex, with different probabilities spread among several ways of continuing, but the threshold question needs only their combined successful mass.

Now comes the precise result. Paper III's Theorem 10.1 considers all bounded rational thresholds between zero and one and a fixed success predicate P. Two finite rational response-mass distributions answer all those threshold questions identically if and only if they have the same total success probability.

Here's why the proof is approachable. Suppose the success probabilities are 0.70 and 0.90. Choose a threshold of 0.80. The first fails and the second passes, so their complete threshold-answer profiles cannot agree. More generally, the two probabilities themselves lie within the permitted threshold range, allowing the theorem to distinguish any unequal pair.

If the probabilities are identical, every threshold comparison obviously agrees. We have proved both directions.

Consequently, the single success-probability number is a minimal task-visible realization of the complete bounded rational threshold language, in the precise refinement sense we learned in Lessons 8 and 9. The distribution contains richer information; all those threshold questions are answered by this one scalar.

04 / The resources needed for continuation

A viable future may be possible yet expensive.

Now let's turn to a different kind of question. Imagine two systems that both have a viable recovery pathway. If I ask only whether recovery exists, they may answer identically. If I ask whether recovery can occur within a declared budget, the paths may no longer look equivalent.

Paper III assigns a cost to a particular viable history, rather than assuming every route to the same outcome costs the same amount. This matters: two different paths leading to one endpoint may consume different amounts of a declared resource.

Given a budget b, we collect the response atoms reached through histories whose costs do not exceed that budget.

b

A declared resource budget.

c(v.γ)

The cost attached to a particular viable history γ.

V_d,t(x)

The complete viable-continuation family for the stated source, scenario and horizon.

o(v) = a

That viable continuation is observed as response atom a.

B_b(x)

The response atoms for which at least one viable history is affordable under budget b.

That lets us distinguish what a system can achieve from what it can achieve within the resources the requirement permits. The costs, budgets, and meanings of those resources all belong to the declared model.

05 / One code for every budget question

The minimum attainable cost can also summarize an entire question family.

To study all possible budget questions for a fixed observed response atom a, Paper III introduces a cost code. If the response is unavailable through every viable continuation, its code is none. If a viable minimum cost is attained, the code is some(m), recording that minimum m.

The paper's finite Boolean example has CostCode(true) = some(1) and CostCode(false) = some(3). Here some(1) is a typed mathematical value meaning that a minimum exists and equals 1; it is not an empirical resource price.

On the paper's declared unavailable-or-attained-minimum domain, all budget-adequacy answers agree for two states exactly when their cost codes agree.

The domain qualification is important. I have not assumed that any arbitrary set of history costs must possess a minimum. The theorem uses cases where the minimum really exists, or the response is absent.

With that condition, the cost code is a concrete minimal task-visible realization for the all-budget questions. The full collection of costed histories may contain many additional details, including multiple routes to the same observed response.

06 / Two examples of the same representation principle

What information do our questions actually use?

The probability theorem and the cost theorem now have the same conceptual shape. Both begin with richer response information. Each then specifies a family of questions that consumes only certain distinctions in that information.

We can now distinguish several kinds of information a measurement might be asked to supply. If the requirement asks only whether continuation is possible, possibility information may be sufficient. If it asks how probable a successful outcome is, probability information is required. If it asks whether a viable response is affordable, we need cost information as well.

If our requirements involve which paths are distinct, whether a policy can actually produce a successful continuation, or whether failure remains possible under challenges, the representation may need those richer response structures. We'll develop them in Lesson 11.