Original question and givens
Use complete theta labels=[a7, b7], samples=[70, 71, 72, 73], aligned exact probability rows=[[[2, 5], [1, 10], [2, 5], [1, 10]], [[1, 10], [2, 5], [1, 10], [2, 5]]] and total statistic=[0, 0, 0, 0]. Each theta law is normalized. Fibers partition the full sample carrier, retaining zero-mass cells. Mode=constant. 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=[a7, b7], samples=[70, 71, 72, 73], aligned exact probability rows=[[[2, 5], [1, 10], [2, 5], [1, 10]], [[1, 10], [2, 5], [1, 10], [2, 5]]] and total statistic=[0, 0, 0, 0]. Each theta law is normalized. Fibers partition the full sample carrier, retaining zero-mass cells. Mode=constant. 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
Θ=[a7, b7]; Ω=[70, 71, 72, 73]
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_a7(Ω) := sum(2/5, 1/10, 2/5, 1/10)
After
P_a7(Ω) = 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_b7(Ω) := sum(1/10, 2/5, 1/10, 2/5)
After
P_b7(Ω) = 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=70
After
T(70)=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=71
After
T(71)=0
Conditions: none
Every sample has exactly one statistic value.
Step identifiers and dependencies
Rule: total_statistic_map · Uses: G001, S004
S006 · implies
Before
sample=72
After
T(72)=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=73
After
T(73)=0
Conditions: none
Every sample has exactly one statistic value.
Step identifiers and dependencies
Rule: total_statistic_map · Uses: G001, S006
S008 · implies
Before
[(70, 0), (71, 0), (72, 0), (73, 0)]
After
fibers=[[0, [70, 71, 72, 73]]]
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_a7(T=0) := sum(2/5, 1/10, 2/5, 1/10)
After
P_a7(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_a7(70|T=0) := div(2/5, 1)
After
P_a7(70|T=0) = 2/5
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 70 under a7 := mul(2/5, 1)
After
reconstruct atom 70 under a7 = 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_a7(71|T=0) := div(1/10, 1)
After
P_a7(71|T=0) = 1/10
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 71 under a7 := mul(1/10, 1)
After
reconstruct atom 71 under a7 = 1/10
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
P_a7(72|T=0) := div(2/5, 1)
After
P_a7(72|T=0) = 2/5
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 72 under a7 := mul(2/5, 1)
After
reconstruct atom 72 under a7 = 2/5
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
P_a7(73|T=0) := div(1/10, 1)
After
P_a7(73|T=0) = 1/10
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 73 under a7 := mul(1/10, 1)
After
reconstruct atom 73 under a7 = 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
conditional total (a7,0) := sum(2/5, 1/10, 2/5, 1/10)
After
conditional total (a7,0) = 1
Conditions: none
The complete conditional law must have total mass1.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S017
S019 · calculation
Before
P_b7(T=0) := sum(1/10, 2/5, 1/10, 2/5)
After
P_b7(T=0) = 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_b7(70|T=0) := div(1/10, 1)
After
P_b7(70|T=0) = 1/10
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 70 under b7 := mul(1/10, 1)
After
reconstruct atom 70 under b7 = 1/10
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_b7(71|T=0) := div(2/5, 1)
After
P_b7(71|T=0) = 2/5
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 71 under b7 := mul(2/5, 1)
After
reconstruct atom 71 under b7 = 2/5
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_b7(72|T=0) := div(1/10, 1)
After
P_b7(72|T=0) = 1/10
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 72 under b7 := mul(1/10, 1)
After
reconstruct atom 72 under b7 = 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
P_b7(73|T=0) := div(2/5, 1)
After
P_b7(73|T=0) = 2/5
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 73 under b7 := mul(2/5, 1)
After
reconstruct atom 73 under b7 = 2/5
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 (b7,0) := sum(1/10, 2/5, 1/10, 2/5)
After
conditional total (b7,0) = 1
Conditions: none
The complete conditional law must have total mass1.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S027
S029 · implies
Before
valid positive-mass laws for T=0: [[a7, [[70, 2/5], [71, 1/10], [72, 2/5], [73, 1/10]]], [b7, [[70, 1/10], [71, 2/5], [72, 1/10], [73, 2/5]]]]
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, S028
S030 · implies
Before
[[0, [[a7, [[70, 2/5], [71, 1/10], [72, 2/5], [73, 1/10]]], [b7, [[70, 1/10], [71, 2/5], [72, 1/10], [73, 2/5]]]], No]]
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, S029
S031 · implies
Before
the only fiber is Ω with probability1
After
conditional sample law=P_theta; sufficient iff all rows agree
Conditions: none
It is the conditional sample-outcome law that may vary, not the law of the constant statistic itself.
Step identifiers and dependencies
Rule: constant_statistic_boundary · Uses: G001, S030
Result
(constant, [[0, [[a7, [[70, 2/5], [71, 1/10], [72, 2/5], [73, 1/10]]], [b7, [[70, 1/10], [71, 2/5], [72, 1/10], [73, 2/5]]]], No]], No, [], null, No, Yes, 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.