Original question and givens
Use one complete finite probability model with aligned exact masses=[30/49, 12/49, 5/49, 2/49] on Fin(4)={0,…,3}. Masses must be nonnegative and sum exactly to 1; do not assume uniformity. Events A=[2, 3], B=[1, 3] are carrier-label sets, normalized by removing duplicates and sorting numerically. The primary definition is P(A∩B)=P(A)P(B); conditional formulas require positive conditioning probability. Only two-event independence is checked, not mutual independence of a larger family. Use exact reduced rational outputs with positive denominators; omit /1 for integers. Require P(B)>0. Give (P_A,P_B,P_intersection,P_A_given_B,conditional_equal?,independent?).
G001 — Use one complete finite probability model with aligned exact masses=[30/49, 12/49, 5/49, 2/49] on Fin(4)={0,…,3}. Masses must be nonnegative and sum exactly to 1; do not assume uniformity. Events A=[2, 3], B=[1, 3] are carrier-label sets, normalized by removing duplicates and sorting numerically. The primary definition is P(A∩B)=P(A)P(B); conditional formulas require positive conditioning probability. Only two-event independence is checked, not mutual independence of a larger family. Use exact reduced rational outputs with positive denominators; omit /1 for integers. Require P(B)>0. Give (P_A,P_B,P_intersection,P_A_given_B,conditional_equal?,independent?).
Step-by-step derivation
S001 · calculation
Before
event model whole mass total := sum(30/49, 12/49, 5/49, 2/49)
After
event model whole mass total = 1
Conditions: none
Compute exactly from the original roles and complete established operands,without changing pairings,order or replacing guards by approximation.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001
S002 · implies
Before
complete carrier Fin(4);raw aligned masses=[[30, 49], [12, 49], [5, 49], [2, 49]]
After
normalized masses=[30/49, 12/49, 5/49, 2/49];nonnegative=Yes;total=1
Conditions: none
Qualify one complete finite PMF with nonnegative atoms and exact total1.Zero-mass atoms remain in the carrier;complements are not taken only within positive-mass support.
Step identifiers and dependencies
Rule: event_common_complete_probability_space · Uses: G001, S001
S003 · implies
Before
raw carrier events A=[2, 3];B=[1, 3];carrier size=4
After
normalized A=[2, 3];B=[1, 3];intersection=[3]
Conditions: none
Events are carrier-index sets,normalized without dropping zero-mass labels.Intersection requires the same label in A and B.This differs from coordinate-value events in a joint table.
Step identifiers and dependencies
Rule: event_carrier_label_sets_and_intersection · Uses: G001, S002
S004 · calculation
Before
A mass := sum(5/49, 2/49)
After
A mass = 1/7
Conditions: none
Compute exactly from the original roles and complete established operands,without changing pairings,order or replacing guards by approximation.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S003
S005 · calculation
Before
B mass := sum(12/49, 2/49)
After
B mass = 2/7
Conditions: none
Compute exactly from the original roles and complete established operands,without changing pairings,order or replacing guards by approximation.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S004
S006 · calculation
Before
A intersection B mass := sum(2/49)
After
A intersection B mass = 2/49
Conditions: none
Compute exactly from the original roles and complete established operands,without changing pairings,order or replacing guards by approximation.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S005
S007 · calculation
Before
event product P_A times P_B := mul(1/7, 2/7)
After
event product P_A times P_B = 2/49
Conditions: none
Compute exactly from the original roles and complete established operands,without changing pairings,order or replacing guards by approximation.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S006
S008 · implies
Before
P_A=1/7;P_B=2/7;P_intersection=2/49;product=2/49
After
two-event independent=Yes
Conditions: none
The primary definition is intersection probability equal to the marginal product,not disjointness.Do not assume independence before multiplying.This checks two events,not mutual independence of a larger family.
Step identifiers and dependencies
Rule: independence_primary_product_definition · Uses: G001, S007
S009 · implies
Before
conditioning event=[1, 3];P_B=2/7>0
After
positive denominator qualified before conditional ratio
Conditions: none
Establish P(B)>0 before division.A nonempty event alone does not guarantee positive probability.
Step identifiers and dependencies
Rule: positive_conditioning_guard_before_division · Uses: G001, S008
S010 · calculation
Before
conditional P_A_given_B := div(2/49, 2/7)
After
conditional P_A_given_B = 1/7
Conditions: none
Compute exactly from the original roles and complete established operands,without changing pairings,order or replacing guards by approximation.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S009
S011 · implies
Before
P_B=2/7>0;P_A_given_B=1/7;P_A=1/7
After
conditional equals marginal=Yes;equivalent product independence=Yes
Conditions: none
With a positive nonzero denominator,P_AB/P_B=P_A iff P_AB=P_A*P_B.Multiplying back by the same P_B is reversible,so the flags agree.
Step identifiers and dependencies
Rule: positive_denominator_conditional_equivalence · Uses: G001, S010