@lapxo/obligations 0.4.1 → 0.4.3

package/dist/measures/tolerant-subsets.d.ts

@@ -0,0 +1,79 @@
+import { type DeclaredFailure } from './confidence.ts';
+export declare function tolerantSubsetConfidence(failures: readonly DeclaredFailure[], k: number, probabilitySpace: string): {
+    model: "declared-failure-subset-bound@1";
+    status: "conditional-bound";
+    unit: "probability";
+    probabilitySpace: string;
+    declarations: {
+        id: string;
+        p: Readonly<{
+            numerator: string;
+            denominator: string;
+        }>;
+        justification: string;
+    }[];
+    allowedFailures: number;
+    totalDeclarations: number;
+    conditions: readonly ["common-probability-space", "declared-marginal-upper-bounds"];
+    referencesVerified: false;
+    terms: {
+        id: string;
+        subsets: string;
+        contribution: Readonly<{
+            numerator: string;
+            denominator: string;
+        }>;
+    }[];
+    uncappedFailureBound: Readonly<{
+        numerator: string;
+        denominator: string;
+    }>;
+    failureUpperBound: Readonly<{
+        numerator: string;
+        denominator: string;
+    }>;
+    value: Readonly<{
+        numerator: string;
+        denominator: string;
+    }>;
+    trivial: boolean;
+};
+export type JointIndependenceDeclaration = Readonly<{
+    probabilitySpace: string;
+    jointIndependence: true;
+    justification: string;
+}>;
+export declare function independentCountConfidence(failures: readonly DeclaredFailure[], k: number, declaration: JointIndependenceDeclaration): {
+    model: "declared-joint-independent-count-bound@1";
+    status: "conditional-bound";
+    unit: "probability";
+    probabilitySpace: string;
+    declarations: {
+        id: string;
+        p: Readonly<{
+            numerator: string;
+            denominator: string;
+        }>;
+        justification: string;
+    }[];
+    allowedFailures: number;
+    totalDeclarations: number;
+    jointIndependence: {
+        declared: true;
+        justification: string;
+    };
+    referencesVerified: false;
+    bernoulliEnvelope: Readonly<{
+        numerator: string;
+        denominator: string;
+    }>[];
+    failureUpperBound: Readonly<{
+        numerator: string;
+        denominator: string;
+    }>;
+    value: Readonly<{
+        numerator: string;
+        denominator: string;
+    }>;
+    trivial: boolean;
+};

package/dist/measures/tolerant-subsets.js

@@ -0,0 +1,60 @@
+import { unionBoundConfidence } from "./confidence.js";
+import { add, sub, mul, q, rational, zero, one, pack } from "./rational.js";
+const refuse = (cause) => { throw new Error('REFUSE·L7 ' + cause); };
+function inputs(failures, k, probabilitySpace) {
+    if (typeof probabilitySpace !== 'string' || probabilitySpace.trim() === '')
+        refuse('common-probability-space-required');
+    const base = unionBoundConfidence(failures), m = base.declarations.length;
+    if (!Number.isSafeInteger(k) || k < 0 || k > m)
+        refuse('allowed-failure-count-outside-0..m');
+    return { base, m };
+}
+function choose(n, k) {
+    if (k > n)
+        return 0n;
+    let c = 1n;
+    for (let j = 1; j <= Math.min(k, n - k); j++)
+        c = c * BigInt(n - j + 1) / BigInt(j);
+    return c;
+}
+export function tolerantSubsetConfidence(failures, k, probabilitySpace) {
+    const { base, m } = inputs(failures, k, probabilitySpace);
+    const ordered = base.declarations.map(entry => ({ entry, p: rational(entry.p) })).sort((a, b) => {
+        const d = a.p[0] * b.p[1] - b.p[0] * a.p[1];
+        return d < 0n ? -1 : d > 0n ? 1 : 0;
+    });
+    let sum = zero;
+    const terms = k === m ? [] : ordered.slice(0, m - k).map(({ entry, p }, j) => {
+        const coefficient = choose(m - j - 1, k), contribution = mul(p, q(coefficient));
+        sum = add(sum, contribution);
+        return { id: entry.id, subsets: String(coefficient), contribution: pack(contribution) };
+    });
+    const trivial = sum[0] >= sum[1], upper = trivial ? one : sum;
+    return { model: 'declared-failure-subset-bound@1', status: 'conditional-bound',
+        unit: 'probability', probabilitySpace, declarations: base.declarations,
+        allowedFailures: k, totalDeclarations: m, conditions: ['common-probability-space', 'declared-marginal-upper-bounds'],
+        referencesVerified: false, terms, uncappedFailureBound: pack(sum), failureUpperBound: pack(upper),
+        value: pack(sub(one, upper)), trivial };
+}
+export function independentCountConfidence(failures, k, declaration) {
+    if (!declaration || declaration.jointIndependence !== true)
+        refuse('joint-independence-required');
+    if (typeof declaration.justification !== 'string' || declaration.justification.trim() === '')
+        refuse('joint-independence-justification-required');
+    const { base, m } = inputs(failures, k, declaration.probabilitySpace);
+    let distribution = [one];
+    for (const entry of base.declarations) {
+        const p = rational(entry.p), next = Array.from({ length: distribution.length + 1 }, () => zero);
+        for (let j = 0; j < distribution.length; j++) {
+            next[j] = add(next[j], mul(distribution[j], sub(one, p)));
+            next[j + 1] = add(next[j + 1], mul(distribution[j], p));
+        }
+        distribution = next;
+    }
+    const upper = distribution.slice(k + 1).reduce(add, zero);
+    return { model: 'declared-joint-independent-count-bound@1', status: 'conditional-bound',
+        unit: 'probability', probabilitySpace: declaration.probabilitySpace, declarations: base.declarations,
+        allowedFailures: k, totalDeclarations: m, jointIndependence: { declared: true, justification: declaration.justification },
+        referencesVerified: false, bernoulliEnvelope: distribution.map(pack), failureUpperBound: pack(upper),
+        value: pack(sub(one, upper)), trivial: upper[0] === upper[1] };
+}

package/docs/measures.md

@@ -194,4 +194,28 @@ Helly is a property of a declared geometric family, not a probabilistic independ
 
 ## 17. Publication and stability
 
-Every new operation is linked to its contract, yes/no data and native Bound 0.1.7 captures in two places. Validation readers are maintained TypeScript worlds with ordinary modular compilation; no .mjs bundle or private executor ships in this library. Their implementation inventory is retained once by digest. The installed archive must expose the same public exports, preserve the four states, match all published bytes and close native receipts without a private store. Declaring these requirements does not pay them.
+The historical nine publication groups are linked to their contracts, yes/no data and declared Bound 0.1.7 captures in two places. The 0.4.2 operations below require new captures under their selected reader; historical implementation-bound receipts do not cover changed bytes. Validation readers are maintained TypeScript worlds with ordinary modular compilation; no .mjs bundle or private executor ships in this library. Their implementation inventory is retained once by digest. The installed archive must expose the same public exports, preserve the four states, match all published bytes and close native receipts without a private store. Declaring these requirements does not pay them.
+
+## 18. Declared failure bounds
+
+`unionBoundConfidence(failures)` requires distinct nonempty IDs, explicit rational probabilities in [0,1], and nonempty justification references. The caller must establish every failure bound in one probability space. References are retained, not verified. The returned lower bound for all events succeeding is max(0,1−Σp_i), with exact rational arithmetic. The empty family gives 1; Σp_i≥1 gives the trivial bound 0. No independence, truth probability, or algebraic state is inferred.
+
+`tolerantCountConfidence(failures,k)` requires a safe integer 0≤k≤m. For k<m it bounds failure by min(1,min_{0≤j≤k}(Σ of the m−j smallest p_i)/(k+1−j)); its exact success lower bound is the complement. For k=m success is certain. For m=3,k=1 and all p_i=1/10 the result is 17/20, not an inferred success rate. The distinct subset-intersection guarantee gives the weaker bound 7/10. Three disjoint paired failures among six events, each pair having probability 1/10, refute the former 4/5 claim: success is 7/10.
+
+These operations compute conditional probability bounds. They select neither a geometric tolerance nor a consumer policy. Count-tolerant intersection T_k and widened-interval intersection T_eps remain named forms; tolerant-choice remains open.
+
+## 19. Declared covering cause
+
+`commonCauseCapacityBound(n,c,q,{logarithm:'binary64-log2'})` requires integer n≥2 and explicit rational c,q in [0,1]. Truth is uniform; the covering-cause indicator is independent of truth; when active, every report copies one symmetric channel with accuracy q. The inactive private channel is unrestricted. Revealing the indicator gives the upper bound log2(n)−c[h(q)+(1−q)log2(n−1)] in approximate bits. Copy count is no input. This is neither finite-sample mutual information nor an achievability claim.
+
+At n=4,c=1,q=1/4 the bound is exactly zero; q=0 gives log2(4/3), and q=1 gives two bits. Missing q refuses. The operational declaration or detection of activation remains open in identification.model. Unconditioned coincidence does not identify q.
+
+M/3 and M/4 retain their existing definitions. Partial-factor governance proposals do not supply a conditional joint observation and selection law. The information carried by dissent, including a bottom symbol, is open for those unspecified proposals.
+
+## Obligations 0.4.3 — proposed conditional measures
+
+L7: conditional bound on one declared common probability space: P(N>k)<=min(1,sum over |S|=k+1 of min p_i), with rational declared marginal failure upper bounds and 0<=k<=m. Trivial iff computed upper bound is one. Counterexamples refute the former top-k+1 success guarantee. Joint-independent Bernoulli convolution is a separate declared hypothesis; rho=0 and pairwise independence do not supply it. Existing stronger 0.4.2 count bound is unchanged and needs no joint independence.
+
+L8: law by enumeration only for 3<=n<=64, positive integer divisors p|n and integer 0<=s<p. D=log2(n/p)-h(s/p), explicit binary64-log2 approximation. Odd-period minimum uses h(floor(p/2)/p), even-period minimum uses one. Complete maximum at zero; nonzero domain has endpoints 1,p-1, empty when p=1. No information or worst-case interpretation follows from nonnegativity. T87 retains its separate wrapped-phase amplitude identity.
+
+L9: law by counterexample of existence of noninjective weighted mix, and measure with a declared prior on a finite explicitly supplied set of named-factor configurations. Equal-weight ab and ba give the same bottom tie and different named forks. Loss is H(configuration | mix)=H(configuration)-H(mix); a uniform prior must be explicitly selected, absent prior is unmeasured. The four-state uniform example has mean loss 0.5 bits and one bit conditioned on tie; the injective named fork has zero loss. Defines no new algebraic act, governance selection, M/3 or M/4 law, or destroyed field.

package/package.json

@@ -1 +1 @@
-{"name":"@lapxo/obligations","version":"0.4.1","description":"The algebra of a cell: two poles, origins with phase, eight acts.","type":"module","license":"MIT","author":"Lapxo","repository":{"type":"git","url":"git+https://github.com/Lapxo/obligations.git"},"keywords":["obligations","lattice","provenance"],"sideEffects":false,"engines":{"node":">=22.12"},"exports":{".":{"types":"./dist/lattice/index.d.ts","default":"./dist/lattice/index.js"},"./debit":{"types":"./dist/debit/debit.d.ts","default":"./dist/debit/debit.js"},"./encounter":{"types":"./dist/field/encounter.d.ts","default":"./dist/field/encounter.js"},"./field":{"types":"./dist/field/field.d.ts","default":"./dist/field/field.js"},"./forms":{"types":"./dist/lattice/forms.d.ts","default":"./dist/lattice/forms.js"},"./lattice":{"types":"./dist/lattice/lattice.d.ts","default":"./dist/lattice/lattice.js"},"./measures":{"types":"./dist/measures/index.d.ts","default":"./dist/measures/index.js"},"./packed":{"types":"./dist/debit/packed.d.ts","default":"./dist/debit/packed.js"},"./present":{"types":"./dist/field/present.d.ts","default":"./dist/field/present.js"},"./price":{"types":"./dist/lattice/price/index.d.ts","default":"./dist/lattice/price/index.js"},"./replay":{"types":"./dist/replay.d.ts","default":"./dist/replay.js"},"./shuffle":{"types":"./dist/debit/shuffle.d.ts","default":"./dist/debit/shuffle.js"},"./signatures":{"types":"./dist/field/signatures.d.ts","default":"./dist/field/signatures.js"},"./views/field":{"types":"./dist/views/field.d.ts","default":"./dist/views/field.js"},"./views/product":{"types":"./dist/views/product.d.ts","default":"./dist/views/product.js"},"./package.json":"./package.json"},"files":["dist","README.md","LICENSE","TARGET.bound","receipts.bound","docs/measures.md","samples/measures","vectors/measures","samples/yes/algebra-is-closed.json","samples/yes/field-uses-price-and-debit.json","samples/yes/three-theories-one-algebra.json","src/lattice/index.ts","src/field/motion.ts","samples/yes/installed-artifact.json","samples/no/installed-artifact.json","vectors/measures/installed-artifact.cli.json","docs/img","docs/paper.md","docs/reference.md","docs/learn/in-phase.md","docs/learn/price.md","docs/learn/signature.md","docs/learn/thermometer.md","docs/learn/withdrawal.md"],"scripts":{"build":"tsc --build","test":"node --import ./test/setup.ts --test --test-concurrency=2 test/*.test.ts test/measures/*.test.ts"},"devDependencies":{"@types/node":"^22","typescript":"^5.9.3"}}
+{"name":"@lapxo/obligations","version":"0.4.3","description":"The algebra of a cell: two poles, origins with phase, eight acts.","type":"module","license":"MIT","author":"Lapxo","repository":{"type":"git","url":"git+https://github.com/Lapxo/obligations.git"},"keywords":["obligations","lattice","provenance"],"sideEffects":false,"engines":{"node":">=22.12"},"exports":{".":{"types":"./dist/lattice/index.d.ts","default":"./dist/lattice/index.js"},"./debit":{"types":"./dist/debit/debit.d.ts","default":"./dist/debit/debit.js"},"./encounter":{"types":"./dist/field/encounter.d.ts","default":"./dist/field/encounter.js"},"./field":{"types":"./dist/field/field.d.ts","default":"./dist/field/field.js"},"./forms":{"types":"./dist/lattice/forms.d.ts","default":"./dist/lattice/forms.js"},"./lattice":{"types":"./dist/lattice/lattice.d.ts","default":"./dist/lattice/lattice.js"},"./measures":{"types":"./dist/measures/index.d.ts","default":"./dist/measures/index.js"},"./packed":{"types":"./dist/debit/packed.d.ts","default":"./dist/debit/packed.js"},"./present":{"types":"./dist/field/present.d.ts","default":"./dist/field/present.js"},"./price":{"types":"./dist/lattice/price/index.d.ts","default":"./dist/lattice/price/index.js"},"./replay":{"types":"./dist/replay.d.ts","default":"./dist/replay.js"},"./shuffle":{"types":"./dist/debit/shuffle.d.ts","default":"./dist/debit/shuffle.js"},"./signatures":{"types":"./dist/field/signatures.d.ts","default":"./dist/field/signatures.js"},"./views/field":{"types":"./dist/views/field.d.ts","default":"./dist/views/field.js"},"./views/product":{"types":"./dist/views/product.d.ts","default":"./dist/views/product.js"},"./package.json":"./package.json"},"files":["dist","README.md","LICENSE","TARGET.bound","receipts.bound","docs/measures.md","samples/measures","vectors/measures","samples/yes/algebra-is-closed.json","samples/yes/field-uses-price-and-debit.json","samples/yes/three-theories-one-algebra.json","src/lattice/index.ts","src/field/motion.ts","samples/yes/installed-artifact.json","samples/no/installed-artifact.json","vectors/measures/installed-artifact.cli.json","docs/img","docs/paper.md","docs/reference.md","docs/learn/in-phase.md","docs/learn/price.md","docs/learn/signature.md","docs/learn/thermometer.md","docs/learn/withdrawal.md","vectors/laws/policy.json","vectors/laws/l7-tolerant-k.json","vectors/laws/l8-phase-defect.json","vectors/laws/l9-mix-loss.json","vectors/laws/implementation-043.json"],"scripts":{"build":"tsc --build","test":"node --import ./test/setup.ts --test --test-concurrency=2 test/*.test.ts test/measures/*.test.ts"},"devDependencies":{"@types/node":"^22","typescript":"^5.9.3"}}