Original question and givens
Use complete theta labels=[a14, b14], samples=[140, 141, 142, 143], 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, 2, 3]. Each theta law is normalized. Fibers partition the full sample carrier, retaining zero-mass cells. Mode=identity. 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=[a14, b14], samples=[140, 141, 142, 143], 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, 2, 3]. Each theta law is normalized. Fibers partition the full sample carrier, retaining zero-mass cells. Mode=identity. 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
Θ=[a14, b14]; Ω=[140, 141, 142, 143]
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_a14(Ω) := sum(2/5, 1/10, 2/5, 1/10)
After
P_a14(Ω) = 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_b14(Ω) := sum(1/10, 2/5, 1/10, 2/5)
After
P_b14(Ω) = 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=140
After
T(140)=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=141
After
T(141)=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=142
After
T(142)=2
Conditions: none
Every sample has exactly one statistic value.
Step identifiers and dependencies
Rule: total_statistic_map · Uses: G001, S005
S007 · implies
Before
sample=143
After
T(143)=3
Conditions: none
Every sample has exactly one statistic value.
Step identifiers and dependencies
Rule: total_statistic_map · Uses: G001, S006
S008 · implies
Before
[(140, 0), (141, 1), (142, 2), (143, 3)]
After
fibers=[[0, [140]], [1, [141]], [2, [142]], [3, [143]]]
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_a14(T=0) := sum(2/5)
After
P_a14(T=0) = 2/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_a14(140|T=0) := div(2/5, 2/5)
After
P_a14(140|T=0) = 1
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 140 under a14 := mul(1, 2/5)
After
reconstruct atom 140 under a14 = 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
conditional total (a14,0) := sum(1)
After
conditional total (a14,0) = 1
Conditions: none
The complete conditional law must have total mass1.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S011
S013 · calculation
Before
P_a14(T=1) := sum(1/10)
After
P_a14(T=1) = 1/10
Conditions: none
First compute the conditioning event's full mass.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S012
S014 · calculation
Before
P_a14(141|T=1) := div(1/10, 1/10)
After
P_a14(141|T=1) = 1
Conditions: none
Divide the same law's atom mass by its positive fiber mass.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S013
S015 · calculation
Before
reconstruct atom 141 under a14 := mul(1, 1/10)
After
reconstruct atom 141 under a14 = 1/10
Conditions: none
Multiply by fiber mass to check the original atom probability.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S014
S016 · calculation
Before
conditional total (a14,1) := sum(1)
After
conditional total (a14,1) = 1
Conditions: none
The complete conditional law must have total mass1.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S015
S017 · calculation
Before
P_a14(T=2) := sum(2/5)
After
P_a14(T=2) = 2/5
Conditions: none
First compute the conditioning event's full mass.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S016
S018 · calculation
Before
P_a14(142|T=2) := div(2/5, 2/5)
After
P_a14(142|T=2) = 1
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 142 under a14 := mul(1, 2/5)
After
reconstruct atom 142 under a14 = 2/5
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 (a14,2) := sum(1)
After
conditional total (a14,2) = 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_a14(T=3) := sum(1/10)
After
P_a14(T=3) = 1/10
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_a14(143|T=3) := div(1/10, 1/10)
After
P_a14(143|T=3) = 1
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 143 under a14 := mul(1, 1/10)
After
reconstruct atom 143 under a14 = 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
conditional total (a14,3) := sum(1)
After
conditional total (a14,3) = 1
Conditions: none
The complete conditional law must have total mass1.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S023
S025 · calculation
Before
P_b14(T=0) := sum(1/10)
After
P_b14(T=0) = 1/10
Conditions: none
First compute the conditioning event's full mass.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S024
S026 · calculation
Before
P_b14(140|T=0) := div(1/10, 1/10)
After
P_b14(140|T=0) = 1
Conditions: none
Divide the same law's atom mass by its positive fiber mass.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S025
S027 · calculation
Before
reconstruct atom 140 under b14 := mul(1, 1/10)
After
reconstruct atom 140 under b14 = 1/10
Conditions: none
Multiply by fiber mass to check the original atom probability.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S026
S028 · calculation
Before
conditional total (b14,0) := sum(1)
After
conditional total (b14,0) = 1
Conditions: none
The complete conditional law must have total mass1.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S027
S029 · calculation
Before
P_b14(T=1) := sum(2/5)
After
P_b14(T=1) = 2/5
Conditions: none
First compute the conditioning event's full mass.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S028
S030 · calculation
Before
P_b14(141|T=1) := div(2/5, 2/5)
After
P_b14(141|T=1) = 1
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 141 under b14 := mul(1, 2/5)
After
reconstruct atom 141 under b14 = 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 (b14,1) := sum(1)
After
conditional total (b14,1) = 1
Conditions: none
The complete conditional law must have total mass1.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S031
S033 · calculation
Before
P_b14(T=2) := sum(1/10)
After
P_b14(T=2) = 1/10
Conditions: none
First compute the conditioning event's full mass.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S032
S034 · calculation
Before
P_b14(142|T=2) := div(1/10, 1/10)
After
P_b14(142|T=2) = 1
Conditions: none
Divide the same law's atom mass by its positive fiber mass.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S033
S035 · calculation
Before
reconstruct atom 142 under b14 := mul(1, 1/10)
After
reconstruct atom 142 under b14 = 1/10
Conditions: none
Multiply by fiber mass to check the original atom probability.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S034
S036 · calculation
Before
conditional total (b14,2) := sum(1)
After
conditional total (b14,2) = 1
Conditions: none
The complete conditional law must have total mass1.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S035
S037 · calculation
Before
P_b14(T=3) := sum(2/5)
After
P_b14(T=3) = 2/5
Conditions: none
First compute the conditioning event's full mass.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S036
S038 · calculation
Before
P_b14(143|T=3) := div(2/5, 2/5)
After
P_b14(143|T=3) = 1
Conditions: none
Divide the same law's atom mass by its positive fiber mass.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S037
S039 · calculation
Before
reconstruct atom 143 under b14 := mul(1, 2/5)
After
reconstruct atom 143 under b14 = 2/5
Conditions: none
Multiply by fiber mass to check the original atom probability.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S038
S040 · calculation
Before
conditional total (b14,3) := sum(1)
After
conditional total (b14,3) = 1
Conditions: none
The complete conditional law must have total mass1.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S039
S041 · implies
Before
valid positive-mass laws for T=0: [[a14, [[140, 1]]], [b14, [[140, 1]]]]
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, S040
S042 · implies
Before
valid positive-mass laws for T=1: [[a14, [[141, 1]]], [b14, [[141, 1]]]]
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, S041
S043 · implies
Before
valid positive-mass laws for T=2: [[a14, [[142, 1]]], [b14, [[142, 1]]]]
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, S042
S044 · implies
Before
valid positive-mass laws for T=3: [[a14, [[143, 1]]], [b14, [[143, 1]]]]
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, S043
S045 · implies
Before
[[0, [[a14, [[140, 1]]], [b14, [[140, 1]]]], Yes], [1, [[a14, [[141, 1]]], [b14, [[141, 1]]]], Yes], [2, [[a14, [[142, 1]]], [b14, [[142, 1]]]], Yes], [3, [[a14, [[143, 1]]], [b14, [[143, 1]]]], 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, S044
S046 · implies
Before
each fiber is one sample point
After
every valid conditional is the same point mass
Conditions: none
Conditioning on a positive-mass singleton gives probability1 at that point, independent of the parameter.
Step identifiers and dependencies
Rule: identity_statistic_boundary · Uses: G001, S045
Result
(identity, [[0, [[a14, [[140, 1]]], [b14, [[140, 1]]]], Yes], [1, [[a14, [[141, 1]]], [b14, [[141, 1]]]], Yes], [2, [[a14, [[142, 1]]], [b14, [[142, 1]]]], Yes], [3, [[a14, [[143, 1]]], [b14, [[143, 1]]]], Yes]], Yes, [], null, Yes, 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.