fix(ftip): bound the finite-frontier identifiability example [AGENT] - #176
Merged
Conversation
Replace the universal better-frontier assertion with two explicit finite attainable frontiers that agree at every measured cost. Give a deterministic bounded-utility realization, distinguish the attained global bound and singleton-class exceptions, and retain the conditional certificate and its independent upper-bound premise.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
The finite-frontier example previously claimed that every finite set of observations admits a strictly better agreeing frontier. That fails when observations attain a known global bound or the possible class is a singleton.
Replace the universal claim with two explicit bounded monotone frontiers permitted by a declared class. The same two-intervention cost specification realizes both possibilities, with attained finite maxima at every nonnegative budget. State the known-bound and singleton exceptions, and preserve the neighboring conditional certificate's need for upper-bound evidence. Only
ftip-00LN.treechanges.Validation: all-real budget partition and boundary cases; finite analytic controls; 22 prose tests; source/lint, full site build, rendered checks, and inspected HTML/PDF. The focused PDF has 232 pages. A fresh independent adversarial review approved exact head
493e09ff7cf3a401090af9f650cecf3744e191d9with no unresolved findings.