Original question and givens
Use complete theta labels=[a0, b0], samples=[0, 1, 2, 3], aligned exact probability rows=[[[3, 5], [1, 10], [1, 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. Mode=nonsufficient. Give (mode, fiber_invariance_rows, sufficient, zero_mass_cells, nonsufficiency_witness_or_null, injective_statistic, constant_statistic, theta_laws_equal, constant_equivalence_if_applicable, factorization_or_quality_claim, boundary).
G001 — Use complete theta labels=[a0, b0], samples=[0, 1, 2, 3], aligned exact probability rows=[[[3, 5], [1, 10], [1, 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. Mode=nonsufficient. Give (mode, fiber_invariance_rows, sufficient, zero_mass_cells, nonsufficiency_witness_or_null, injective_statistic, constant_statistic, theta_laws_equal, constant_equivalence_if_applicable, factorization_or_quality_claim, boundary).
Step-by-step derivation
S001 · implies
Before
Θ=[a0, b0]; Ω=[0, 1, 2, 3]
After
[[3/5, 1/10, 1/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_a0(Ω) := sum(3/5, 1/10, 1/5, 1/10)
After
P_a0(Ω) = 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_b0(Ω) := sum(1/10, 2/5, 1/10, 2/5)
After
P_b0(Ω) = 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=0
After
T(0)=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=1
After
T(1)=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=2
After
T(2)=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=3
After
T(3)=1
Conditions: none
Every sample has exactly one statistic value.
Step identifiers and dependencies
Rule: total_statistic_map · Uses: G001, S006
S008 · implies
Before
[(0, 0), (1, 1), (2, 0), (3, 1)]
After
fibers=[[0, [0, 2]], [1, [1, 3]]]
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_a0(T=0) := sum(3/5, 1/5)
After
P_a0(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_a0(0|T=0) := div(3/5, 4/5)
After
P_a0(0|T=0) = 3/4
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 0 under a0 := mul(3/4, 4/5)
After
reconstruct atom 0 under a0 = 3/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_a0(2|T=0) := div(1/5, 4/5)
After
P_a0(2|T=0) = 1/4
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 2 under a0 := mul(1/4, 4/5)
After
reconstruct atom 2 under a0 = 1/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 (a0,0) := sum(3/4, 1/4)
After
conditional total (a0,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_a0(T=1) := sum(1/10, 1/10)
After
P_a0(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_a0(1|T=1) := div(1/10, 1/5)
After
P_a0(1|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 1 under a0 := mul(1/2, 1/5)
After
reconstruct atom 1 under a0 = 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_a0(3|T=1) := div(1/10, 1/5)
After
P_a0(3|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 3 under a0 := mul(1/2, 1/5)
After
reconstruct atom 3 under a0 = 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 (a0,1) := sum(1/2, 1/2)
After
conditional total (a0,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_b0(T=0) := sum(1/10, 1/10)
After
P_b0(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_b0(0|T=0) := div(1/10, 1/5)
After
P_b0(0|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 0 under b0 := mul(1/2, 1/5)
After
reconstruct atom 0 under b0 = 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_b0(2|T=0) := div(1/10, 1/5)
After
P_b0(2|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 2 under b0 := mul(1/2, 1/5)
After
reconstruct atom 2 under b0 = 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 (b0,0) := sum(1/2, 1/2)
After
conditional total (b0,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_b0(T=1) := sum(2/5, 2/5)
After
P_b0(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_b0(1|T=1) := div(2/5, 4/5)
After
P_b0(1|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 1 under b0 := mul(1/2, 4/5)
After
reconstruct atom 1 under b0 = 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_b0(3|T=1) := div(2/5, 4/5)
After
P_b0(3|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 3 under b0 := mul(1/2, 4/5)
After
reconstruct atom 3 under b0 = 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 (b0,1) := sum(1/2, 1/2)
After
conditional total (b0,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: [[a0, [[0, 3/4], [2, 1/4]]], [b0, [[0, 1/2], [2, 1/2]]]]
After
parameter-invariant: No
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: [[a0, [[1, 1/2], [3, 1/2]]], [b0, [[1, 1/2], [3, 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, [[a0, [[0, 3/4], [2, 1/4]]], [b0, [[0, 1/2], [2, 1/2]]]], No], [1, [[a0, [[1, 1/2], [3, 1/2]]], [b0, [[1, 1/2], [3, 1/2]]]], Yes]]
After
all fibers invariant: No
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
S036 · implies
Before
[0, [[a0, [[0, 3/4], [2, 1/4]]], [b0, [[0, 1/2], [2, 1/2]]]], No]
After
one positive-mass conditional-law disagreement refutes sufficiency
Conditions: none
Exhibit the conditional probability disagreement on one common fiber, rather than infer nonsufficiency from a name.
Step identifiers and dependencies
Rule: nonsufficiency_witness · Uses: G001, S035
Result
(nonsufficient, [[0, [[a0, [[0, 3/4], [2, 1/4]]], [b0, [[0, 1/2], [2, 1/2]]]], No], [1, [[a0, [[1, 1/2], [3, 1/2]]], [b0, [[1, 1/2], [3, 1/2]]]], Yes]], No, [], [0, [[a0, [[0, 3/4], [2, 1/4]]], [b0, [[0, 1/2], [2, 1/2]]]], No], No, No, No, Yes, No, identity_is_sufficient_constant_is_sufficient_exactly_when_theta_laws_match_no_factorization_or_estimator_quality_claim)
The full substitutions and premise audits recover the original answer, retaining its field order and verdict meanings.