01 / Two capacities, one starting question
Let's look at two more forests.
Imagine two forests that both maintain the organization we've agreed to call a forest. Their present organization meets the specification, but the viable responses represented for each are different.
Forest A has a capacity containing only a stable response. Forest B has that same stable response, together with an exposed response. I use the two symbols S and E to keep the example small enough that we can see every distinction.
These drawings are illustrations. Their capacity sets are declared mathematical response categories from the finite forest framework, not measurements of the pictured trees, and no probabilities are implied.
The capacities are plainly different. Forest B retains one additional response category.
Distinguishable representations
Different capacity sets.
The symbol ≠ means “is not equal to.” These are different represented capacities even though both contain a stable response.
Whether the difference changes their Health judgment depends on what we have asked the capacity to establish.
02 / The declared questions
Let's give each forest the same two requirements.
Paper I uses a very simple requirement language for this finite case. The first requirement asks whether the capacity contains any viable response category at all. The second asks whether a stable response is available.
That gives us an unusually clear comparison:
| Adequacy requirement | Forest A · {S} | Forest B · {S, E} |
|---|---|---|
| Any viable response available? | Yes | Yes |
| Stable response available? | Yes | Yes |
Both forests pass every requirement we've declared. Their capacity representations differ, but the resulting adequacy answers agree. Because our thought experiment also assumes that both forests presently realize their defining organization, their full Health judgments agree under those same indices and requirements.
I don't want to attach a value judgment to Forest B's additional exposed response. In this finite example, capacity is a set of attained viable response categories. The presence of E tells us that the category is available; it does not say how frequently a response occurs or how likely failure would be.
03 / What the declared requirements can see
Here is the mathematical heart of the idea.
I call two capacities equivalent with respect to a collection of requirements when every requirement in that collection returns the same adequacy answer on both. The notation looks abstract, but the rule is the one we just used for the forests.
Requirement-visible equivalence
Equal answers for every declared requirement.
Paper I's equivalence definition. The statement compares adequacy answers, not the complete content of the underlying capacity sets.
- c1 ∼Q c2
- Two capacities give the same answers for every requirement in the declared collection Q.
- Q
- The collection of requirements we're considering.
- ∀
- “For every.” We compare all the requirements in Q, not only one convenient example.
- Adequater(c)
- Does capacity c meet requirement r?
- ↔
- “If and only if” between the two adequacy answers: either both hold or both do not.
The equivalence is relative to the declared requirements. If our questions cannot distinguish the two capacities, then for those questions they belong to the same group. The full capacities remain different; we are retaining only what the chosen requirement language can observe.
04 / Turning equivalence into a new object
What do I mean by a quotient?
The word quotient often suggests division. Here, it means something much more tangible: we group objects together whenever the stated equivalence rule gives them the same status.
Our two response atoms, S and E, have four possible subsets: the empty set, {E}, {S}, and {S, E}. Under the two declared requirements, they collapse into just three groups of adequacy answers.