Explore related knowledge and questions →

Question 654: Sufficiency Requires Theta Invariance in Every Positive-Mass Fiber

On this page
  1. Original question and givens
  2. Definition and scope
  3. Step-by-step derivation
  4. Reverse checks
  5. Result
  6. This question review and source binding

Return to catalogue page 4

← Question derivation index · Original question batch

P1000-0654 · q-20261015-advance-20261116-r05-finite-sufficient-statistic-0054

Original question and givens

Use complete theta labels=[a3, b3], samples=[30, 31, 32, 33], aligned exact probability rows=[[[2, 5], [1, 10], [2, 5], [1, 10]], [[1, 10], [2, 5], [1, 10], [2, 5]]] and total statistic=[0, 1, 0, 1]. Each theta law is normalized. Fibers partition the full sample carrier, retaining zero-mass cells. Give (fiber_invariance_rows, sufficient, certificate).

  • G001 — Use complete theta labels=[a3, b3], samples=[30, 31, 32, 33], aligned exact probability rows=[[[2, 5], [1, 10], [2, 5], [1, 10]], [[1, 10], [2, 5], [1, 10], [2, 5]]] and total statistic=[0, 1, 0, 1]. Each theta law is normalized. Fibers partition the full sample carrier, retaining zero-mass cells. Give (fiber_invariance_rows, sufficient, certificate).

Definition and scope

Conditional laws are defined only on positive-mass fibers; sufficiency needs every fiber to be parameter-invariant.

Step-by-step derivation

S001 · implies

Before

Θ=[a3, b3]; Ω=[30, 31, 32, 33]

After

[[2/5, 1/10, 2/5, 1/10], [1/10, 2/5, 1/10, 2/5]]

Conditions: none

Each row is one parameter law and each column an outcome; reorder probabilities together with labels.

Step identifiers and dependencies

Rule: full_parametric_model · Uses: G001

S002 · calculation

Before

P_a3(Ω) := sum(2/5, 1/10, 2/5, 1/10)

After

P_a3(Ω) = 1

Conditions: none

Check this law's complete total mass first.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S001

S003 · calculation

Before

P_b3(Ω) := sum(1/10, 2/5, 1/10, 2/5)

After

P_b3(Ω) = 1

Conditions: none

Check this law's complete total mass first.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S002

S004 · implies

Before

sample=30

After

T(30)=0

Conditions: none

Every sample has exactly one statistic value.

Step identifiers and dependencies

Rule: total_statistic_map · Uses: G001, S003

S005 · implies

Before

sample=31

After

T(31)=1

Conditions: none

Every sample has exactly one statistic value.

Step identifiers and dependencies

Rule: total_statistic_map · Uses: G001, S004

S006 · implies

Before

sample=32

After

T(32)=0

Conditions: none

Every sample has exactly one statistic value.

Step identifiers and dependencies

Rule: total_statistic_map · Uses: G001, S005

S007 · implies

Before

sample=33

After

T(33)=1

Conditions: none

Every sample has exactly one statistic value.

Step identifiers and dependencies

Rule: total_statistic_map · Uses: G001, S006

S008 · implies

Before

[(30, 0), (31, 1), (32, 0), (33, 1)]

After

fibers=[[0, [30, 32]], [1, [31, 33]]]

Conditions: none

Grouping by value produces disjoint fibers whose union is the complete carrier.

Step identifiers and dependencies

Rule: fiber_partition · Uses: G001, S007

S009 · calculation

Before

P_a3(T=0) := sum(2/5, 2/5)

After

P_a3(T=0) = 4/5

Conditions: none

First compute the conditioning event's full mass.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S008

S010 · calculation

Before

P_a3(30|T=0) := div(2/5, 4/5)

After

P_a3(30|T=0) = 1/2

Conditions: none

Divide the same law's atom mass by its positive fiber mass.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S009

S011 · calculation

Before

reconstruct atom 30 under a3 := mul(1/2, 4/5)

After

reconstruct atom 30 under a3 = 2/5

Conditions: none

Multiply by fiber mass to check the original atom probability.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S010

S012 · calculation

Before

P_a3(32|T=0) := div(2/5, 4/5)

After

P_a3(32|T=0) = 1/2

Conditions: none

Divide the same law's atom mass by its positive fiber mass.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S011

S013 · calculation

Before

reconstruct atom 32 under a3 := mul(1/2, 4/5)

After

reconstruct atom 32 under a3 = 2/5

Conditions: none

Multiply by fiber mass to check the original atom probability.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S012

S014 · calculation

Before

conditional total (a3,0) := sum(1/2, 1/2)

After

conditional total (a3,0) = 1

Conditions: none

The complete conditional law must have total mass1.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S013

S015 · calculation

Before

P_a3(T=1) := sum(1/10, 1/10)

After

P_a3(T=1) = 1/5

Conditions: none

First compute the conditioning event's full mass.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S014

S016 · calculation

Before

P_a3(31|T=1) := div(1/10, 1/5)

After

P_a3(31|T=1) = 1/2

Conditions: none

Divide the same law's atom mass by its positive fiber mass.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S015

S017 · calculation

Before

reconstruct atom 31 under a3 := mul(1/2, 1/5)

After

reconstruct atom 31 under a3 = 1/10

Conditions: none

Multiply by fiber mass to check the original atom probability.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S016

S018 · calculation

Before

P_a3(33|T=1) := div(1/10, 1/5)

After

P_a3(33|T=1) = 1/2

Conditions: none

Divide the same law's atom mass by its positive fiber mass.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S017

S019 · calculation

Before

reconstruct atom 33 under a3 := mul(1/2, 1/5)

After

reconstruct atom 33 under a3 = 1/10

Conditions: none

Multiply by fiber mass to check the original atom probability.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S018

S020 · calculation

Before

conditional total (a3,1) := sum(1/2, 1/2)

After

conditional total (a3,1) = 1

Conditions: none

The complete conditional law must have total mass1.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S019

S021 · calculation

Before

P_b3(T=0) := sum(1/10, 1/10)

After

P_b3(T=0) = 1/5

Conditions: none

First compute the conditioning event's full mass.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S020

S022 · calculation

Before

P_b3(30|T=0) := div(1/10, 1/5)

After

P_b3(30|T=0) = 1/2

Conditions: none

Divide the same law's atom mass by its positive fiber mass.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S021

S023 · calculation

Before

reconstruct atom 30 under b3 := mul(1/2, 1/5)

After

reconstruct atom 30 under b3 = 1/10

Conditions: none

Multiply by fiber mass to check the original atom probability.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S022

S024 · calculation

Before

P_b3(32|T=0) := div(1/10, 1/5)

After

P_b3(32|T=0) = 1/2

Conditions: none

Divide the same law's atom mass by its positive fiber mass.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S023

S025 · calculation

Before

reconstruct atom 32 under b3 := mul(1/2, 1/5)

After

reconstruct atom 32 under b3 = 1/10

Conditions: none

Multiply by fiber mass to check the original atom probability.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S024

S026 · calculation

Before

conditional total (b3,0) := sum(1/2, 1/2)

After

conditional total (b3,0) = 1

Conditions: none

The complete conditional law must have total mass1.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S025

S027 · calculation

Before

P_b3(T=1) := sum(2/5, 2/5)

After

P_b3(T=1) = 4/5

Conditions: none

First compute the conditioning event's full mass.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S026

S028 · calculation

Before

P_b3(31|T=1) := div(2/5, 4/5)

After

P_b3(31|T=1) = 1/2

Conditions: none

Divide the same law's atom mass by its positive fiber mass.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S027

S029 · calculation

Before

reconstruct atom 31 under b3 := mul(1/2, 4/5)

After

reconstruct atom 31 under b3 = 2/5

Conditions: none

Multiply by fiber mass to check the original atom probability.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S028

S030 · calculation

Before

P_b3(33|T=1) := div(2/5, 4/5)

After

P_b3(33|T=1) = 1/2

Conditions: none

Divide the same law's atom mass by its positive fiber mass.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S029

S031 · calculation

Before

reconstruct atom 33 under b3 := mul(1/2, 4/5)

After

reconstruct atom 33 under b3 = 2/5

Conditions: none

Multiply by fiber mass to check the original atom probability.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S030

S032 · calculation

Before

conditional total (b3,1) := sum(1/2, 1/2)

After

conditional total (b3,1) = 1

Conditions: none

The complete conditional law must have total mass1.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S031

S033 · implies

Before

valid positive-mass laws for T=0: [[a3, [[30, 1/2], [32, 1/2]]], [b3, [[30, 1/2], [32, 1/2]]]]

After

parameter-invariant: Yes

Conditions: none

Compare full defined conditional laws; parameter invariance requires every sample probability to agree.

Step identifiers and dependencies

Rule: conditional_law_comparison · Uses: G001, S032

S034 · implies

Before

valid positive-mass laws for T=1: [[a3, [[31, 1/2], [33, 1/2]]], [b3, [[31, 1/2], [33, 1/2]]]]

After

parameter-invariant: Yes

Conditions: none

Compare full defined conditional laws; parameter invariance requires every sample probability to agree.

Step identifiers and dependencies

Rule: conditional_law_comparison · Uses: G001, S033

S035 · implies

Before

[[0, [[a3, [[30, 1/2], [32, 1/2]]], [b3, [[30, 1/2], [32, 1/2]]]], Yes], [1, [[a3, [[31, 1/2], [33, 1/2]]], [b3, [[31, 1/2], [33, 1/2]]]], Yes]]

After

all fibers invariant: Yes

Conditions: none

Sufficiency under this finite contract requires every fiber to pass, not just one.

Step identifiers and dependencies

Rule: finite_sufficiency_definition · Uses: G001, S034

Reverse checks

  • S035 · premise_and_result_audit — Retain every parameter and sample label; distinguish null, empty tables, zero distributions and tied optima.
  • S034 · premise_and_result_audit — Retain every parameter and sample label; distinguish null, empty tables, zero distributions and tied optima.
  • S033 · premise_and_result_audit — Retain every parameter and sample label; distinguish null, empty tables, zero distributions and tied optima.
  • S032 · premise_and_result_audit — Recompute conditional total (b3,1) with exact rational arithmetic, not rounded decimals.
  • S031 · premise_and_result_audit — Recompute reconstruct atom 33 under b3 with exact rational arithmetic, not rounded decimals.
  • S030 · premise_and_result_audit — Recompute P_b3(33|T=1) with exact rational arithmetic, not rounded decimals.
  • S029 · premise_and_result_audit — Recompute reconstruct atom 31 under b3 with exact rational arithmetic, not rounded decimals.
  • S028 · premise_and_result_audit — Recompute P_b3(31|T=1) with exact rational arithmetic, not rounded decimals.
  • S027 · premise_and_result_audit — Recompute P_b3(T=1) with exact rational arithmetic, not rounded decimals.
  • S026 · premise_and_result_audit — Recompute conditional total (b3,0) with exact rational arithmetic, not rounded decimals.
  • S025 · premise_and_result_audit — Recompute reconstruct atom 32 under b3 with exact rational arithmetic, not rounded decimals.
  • S024 · premise_and_result_audit — Recompute P_b3(32|T=0) with exact rational arithmetic, not rounded decimals.
  • S023 · premise_and_result_audit — Recompute reconstruct atom 30 under b3 with exact rational arithmetic, not rounded decimals.
  • S022 · premise_and_result_audit — Recompute P_b3(30|T=0) with exact rational arithmetic, not rounded decimals.
  • S021 · premise_and_result_audit — Recompute P_b3(T=0) with exact rational arithmetic, not rounded decimals.
  • S020 · premise_and_result_audit — Recompute conditional total (a3,1) with exact rational arithmetic, not rounded decimals.
  • S019 · premise_and_result_audit — Recompute reconstruct atom 33 under a3 with exact rational arithmetic, not rounded decimals.
  • S018 · premise_and_result_audit — Recompute P_a3(33|T=1) with exact rational arithmetic, not rounded decimals.
  • S017 · premise_and_result_audit — Recompute reconstruct atom 31 under a3 with exact rational arithmetic, not rounded decimals.
  • S016 · premise_and_result_audit — Recompute P_a3(31|T=1) with exact rational arithmetic, not rounded decimals.
  • S015 · premise_and_result_audit — Recompute P_a3(T=1) with exact rational arithmetic, not rounded decimals.
  • S014 · premise_and_result_audit — Recompute conditional total (a3,0) with exact rational arithmetic, not rounded decimals.
  • S013 · premise_and_result_audit — Recompute reconstruct atom 32 under a3 with exact rational arithmetic, not rounded decimals.
  • S012 · premise_and_result_audit — Recompute P_a3(32|T=0) with exact rational arithmetic, not rounded decimals.
  • S011 · premise_and_result_audit — Recompute reconstruct atom 30 under a3 with exact rational arithmetic, not rounded decimals.
  • S010 · premise_and_result_audit — Recompute P_a3(30|T=0) with exact rational arithmetic, not rounded decimals.
  • S009 · premise_and_result_audit — Recompute P_a3(T=0) with exact rational arithmetic, not rounded decimals.
  • S008 · premise_and_result_audit — Retain every parameter and sample label; distinguish null, empty tables, zero distributions and tied optima.
  • S007 · premise_and_result_audit — Retain every parameter and sample label; distinguish null, empty tables, zero distributions and tied optima.
  • S006 · premise_and_result_audit — Retain every parameter and sample label; distinguish null, empty tables, zero distributions and tied optima.
  • S005 · premise_and_result_audit — Retain every parameter and sample label; distinguish null, empty tables, zero distributions and tied optima.
  • S004 · premise_and_result_audit — Retain every parameter and sample label; distinguish null, empty tables, zero distributions and tied optima.
  • S003 · premise_and_result_audit — Recompute P_b3(Ω) with exact rational arithmetic, not rounded decimals.
  • S002 · premise_and_result_audit — Recompute P_a3(Ω) with exact rational arithmetic, not rounded decimals.
  • S001 · premise_and_result_audit — Retain every parameter and sample label; distinguish null, empty tables, zero distributions and tied optima.

Result

([[0, [[a3, [[30, 1/2], [32, 1/2]]], [b3, [[30, 1/2], [32, 1/2]]]], Yes], [1, [[a3, [[31, 1/2], [33, 1/2]]], [b3, [[31, 1/2], [33, 1/2]]]], Yes]], Yes, conditional_law_must_be_theta_independent_on_every_positive_mass_cell)

The full substitutions and premise audits recover the original answer, retaining its field order and verdict meanings.

This question review and source binding

Review date: 2026-10-26

Original questions, answers, step expressions, numeric ASTs and historical records are retained. Source candidate labels remain historical and are not overwritten as formal proof.

Source hashes and review receipts
  • input commit: 0f7be61e2c22317a4075561dc822c87d881a50db
  • original question SHA-256: 8286b8eee50892949f23ec99e166164c17dc46ff493cd2fe5b6fc38f833b9b41
  • candidate record SHA-256: 00c87844e204435b1b67fd3f768b5ae6d9f4b0d429b3e25ff020989a4b9a02f9
  • semantic review receipt SHA-256: 6c2c6d46aded7582a11ac41a8c0b3bdde2669a53bdb6e796eea2039994a02772
  • question-first witness SHA-256: 77e43898df9efdbf8094ad81fe4ab91cf4b4bd82f481eb9b4699b73cb4da612b
  • Lean: NOT_RUN · human review: NOT_PERFORMED
Same-source full JSON