Original question and givens
Use complete theta labels=[a13, b13], samples=[130, 131, 132, 133], aligned exact probability rows=[[[1, 2], 0, [1, 2], 0], [0, [1, 2], 0, [1, 2]]] and total statistic=[0, 1, 0, 1]. Each theta law is normalized. Fibers partition the full sample carrier, retaining zero-mass cells. Mode=zero_mass. 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=[a13, b13], samples=[130, 131, 132, 133], aligned exact probability rows=[[[1, 2], 0, [1, 2], 0], [0, [1, 2], 0, [1, 2]]] and total statistic=[0, 1, 0, 1]. Each theta law is normalized. Fibers partition the full sample carrier, retaining zero-mass cells. Mode=zero_mass. 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
Θ=[a13, b13]; Ω=[130, 131, 132, 133]
After
[[1/2, 0, 1/2, 0], [0, 1/2, 0, 1/2]]
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_a13(Ω) := sum(1/2, 0, 1/2, 0)
After
P_a13(Ω) = 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_b13(Ω) := sum(0, 1/2, 0, 1/2)
After
P_b13(Ω) = 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=130
After
T(130)=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=131
After
T(131)=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=132
After
T(132)=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=133
After
T(133)=1
Conditions: none
Every sample has exactly one statistic value.
Step identifiers and dependencies
Rule: total_statistic_map · Uses: G001, S006
S008 · implies
Before
[(130, 0), (131, 1), (132, 0), (133, 1)]
After
fibers=[[0, [130, 132]], [1, [131, 133]]]
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_a13(T=0) := sum(1/2, 1/2)
After
P_a13(T=0) = 1
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_a13(130|T=0) := div(1/2, 1)
After
P_a13(130|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 130 under a13 := mul(1/2, 1)
After
reconstruct atom 130 under a13 = 1/2
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_a13(132|T=0) := div(1/2, 1)
After
P_a13(132|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 132 under a13 := mul(1/2, 1)
After
reconstruct atom 132 under a13 = 1/2
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 (a13,0) := sum(1/2, 1/2)
After
conditional total (a13,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_a13(T=1) := sum(0, 0)
After
P_a13(T=1) = 0
Conditions: none
First compute the conditioning event's full mass.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S014
S016 · implies
Before
P_a13(T=1)=0
After
conditional=null (undefined)
Conditions: none
This contract leaves zero-mass conditional cells undefined, rather than fabricating a zero distribution.
Step identifiers and dependencies
Rule: null_fiber_guard · Uses: G001, S015
S017 · calculation
Before
P_b13(T=0) := sum(0, 0)
After
P_b13(T=0) = 0
Conditions: none
First compute the conditioning event's full mass.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S016
S018 · implies
Before
P_b13(T=0)=0
After
conditional=null (undefined)
Conditions: none
This contract leaves zero-mass conditional cells undefined, rather than fabricating a zero distribution.
Step identifiers and dependencies
Rule: null_fiber_guard · Uses: G001, S017
S019 · calculation
Before
P_b13(T=1) := sum(1/2, 1/2)
After
P_b13(T=1) = 1
Conditions: none
First compute the conditioning event's full mass.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S018
S020 · calculation
Before
P_b13(131|T=1) := div(1/2, 1)
After
P_b13(131|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, S019
S021 · calculation
Before
reconstruct atom 131 under b13 := mul(1/2, 1)
After
reconstruct atom 131 under b13 = 1/2
Conditions: none
Multiply by fiber mass to check the original atom probability.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S020
S022 · calculation
Before
P_b13(133|T=1) := div(1/2, 1)
After
P_b13(133|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, S021
S023 · calculation
Before
reconstruct atom 133 under b13 := mul(1/2, 1)
After
reconstruct atom 133 under b13 = 1/2
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
conditional total (b13,1) := sum(1/2, 1/2)
After
conditional total (b13,1) = 1
Conditions: none
The complete conditional law must have total mass1.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S023
S025 · implies
Before
valid positive-mass laws for T=0: [[a13, [[130, 1/2], [132, 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, S024
S026 · implies
Before
valid positive-mass laws for T=1: [[b13, [[131, 1/2], [133, 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, S025
S027 · implies
Before
[[0, [[a13, [[130, 1/2], [132, 1/2]]]], Yes], [1, [[b13, [[131, 1/2], [133, 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, S026
S028 · implies
Before
[[a13, 1, 0, null], [b13, 0, 0, null]]
After
zero-mass cells do not supply a fabricated conditional law
Conditions: none
Retain null and compare only positive-mass cells; null is not a zero vector to compare against distributions.
Step identifiers and dependencies
Rule: zero_mass_boundary · Uses: G001, S027
Result
(zero_mass, [[0, [[a13, [[130, 1/2], [132, 1/2]]]], Yes], [1, [[b13, [[131, 1/2], [133, 1/2]]]], Yes]], Yes, [[a13, 1, 0, null], [b13, 0, 0, null]], null, 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.