Step-by-step derivation
S001 · implies
Before
source roles = [qf-density15-selection-one-distinguished-counts, density15_selection_one_distinguished_counts, finite_distinct_selection_protocol]
After
derived = [[total, included_label0, excluded_label0, partition_defect]]
Conditions: none
density14/15 use FULL-prefix underscores;density17 uses LOCAL hyphens.The coordinate and circle frames differ.Retain THIS family ordered answer roles/types and all original bilingual JSON/status.
Step identifiers and dependencies
Rule: R60_EXACT_perbank_operation_domain_FRAME_and_output_roles · Uses: G001
S002 · calculation
Before
Selection all subsets ordered ORIGINAL available-choice factor0 := mul(1, 11)
After
Selection all subsets ordered ORIGINAL available-choice factor0 = 11
Conditions: none
Use ORIGINAL operands for exact integer/rational arithmetic.Only RAW inputs use SAFE or the explicit family bounds;derived values do not inherit those caps or use floating approximations.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S001
S003 · calculation
Before
Selection all subsets ordered ORIGINAL available-choice factor1 := mul(11, 10)
After
Selection all subsets ordered ORIGINAL available-choice factor1 = 110
Conditions: none
Use ORIGINAL operands for exact integer/rational arithmetic.Only RAW inputs use SAFE or the explicit family bounds;derived values do not inherit those caps or use floating approximations.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S002
S004 · implies
Before
source roles = [Selection all subsets ordered, 11, 2]
After
derived = [[11, 10], 110]
Conditions: none
At position j there are n-j UNUSED distinct labeled objects.Multiply ALL k available-choice counts;at k0 there is exactly ONE empty ordered tuple.This is not replacement,circular or indistinguishable selection.
Step identifiers and dependencies
Rule: Selection_ORDERED_distinct_without_replacement_available_choices · Uses: G001, S003
S005 · calculation
Before
Selection all subsets within-subset ORIGINAL factorial factor2 := mul(1, 2)
After
Selection all subsets within-subset ORIGINAL factorial factor2 = 2
Conditions: none
Use ORIGINAL operands for exact integer/rational arithmetic.Only RAW inputs use SAFE or the explicit family bounds;derived values do not inherit those caps or use floating approximations.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S004
S006 · implies
Before
source roles = [Selection all subsets within-subset, 2]
After
derived = [2]
Conditions: none
Multiply the COMPLETE2..n factors;at n0/1 the empty product is1.Use exact BigInt,not floats or a SAFE cap on derived counts.
Step identifiers and dependencies
Rule: Selection_factorial_COMPLETE_integer_product_EMPTY0factorial1 · Uses: G001, S005
S007 · calculation
Before
Selection all subsets ORIGINAL exact ordered over k factorial := div(110, 2)
After
Selection all subsets ORIGINAL exact ordered over k factorial = 55
Conditions: none
Use ORIGINAL operands for exact integer/rational arithmetic.Only RAW inputs use SAFE or the explicit family bounds;derived values do not inherit those caps or use floating approximations.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S006
S008 · calculation
Before
Selection all subsets reverse unordered times k factorial := mul(55, 2)
After
Selection all subsets reverse unordered times k factorial = 110
Conditions: none
Use ORIGINAL operands for exact integer/rational arithmetic.Only RAW inputs use SAFE or the explicit family bounds;derived values do not inherit those caps or use floating approximations.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S007
S009 · implies
Before
source roles = [Selection all subsets, 11, 2, 110, 2]
After
derived = [55, 110]
Conditions: none
EACH k-subset has exactly k! orderings,so P/k! is the exact integer C.Multiply back to verify P.An empty subset and empty ordering each count once;no probability model is asserted.
Step identifiers and dependencies
Rule: Selection_UNORDERED_each_subset_has_kfactorial_orderings · Uses: G001, S008
S010 · calculation
Before
Selection subsets INCLUDING label0 ordered ORIGINAL available-choice factor0 := mul(1, 10)
After
Selection subsets INCLUDING label0 ordered ORIGINAL available-choice factor0 = 10
Conditions: none
Use ORIGINAL operands for exact integer/rational arithmetic.Only RAW inputs use SAFE or the explicit family bounds;derived values do not inherit those caps or use floating approximations.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S009
S011 · implies
Before
source roles = [Selection subsets INCLUDING label0 ordered, 10, 1]
After
derived = [[10], 10]
Conditions: none
At position j there are n-j UNUSED distinct labeled objects.Multiply ALL k available-choice counts;at k0 there is exactly ONE empty ordered tuple.This is not replacement,circular or indistinguishable selection.
Step identifiers and dependencies
Rule: Selection_ORDERED_distinct_without_replacement_available_choices · Uses: G001, S010
S012 · implies
Before
source roles = [Selection subsets INCLUDING label0 within-subset, 1]
After
derived = [1]
Conditions: none
Multiply the COMPLETE2..n factors;at n0/1 the empty product is1.Use exact BigInt,not floats or a SAFE cap on derived counts.
Step identifiers and dependencies
Rule: Selection_factorial_COMPLETE_integer_product_EMPTY0factorial1 · Uses: G001, S011
S013 · calculation
Before
Selection subsets INCLUDING label0 ORIGINAL exact ordered over k factorial := div(10, 1)
After
Selection subsets INCLUDING label0 ORIGINAL exact ordered over k factorial = 10
Conditions: none
Use ORIGINAL operands for exact integer/rational arithmetic.Only RAW inputs use SAFE or the explicit family bounds;derived values do not inherit those caps or use floating approximations.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S012
S014 · calculation
Before
Selection subsets INCLUDING label0 reverse unordered times k factorial := mul(10, 1)
After
Selection subsets INCLUDING label0 reverse unordered times k factorial = 10
Conditions: none
Use ORIGINAL operands for exact integer/rational arithmetic.Only RAW inputs use SAFE or the explicit family bounds;derived values do not inherit those caps or use floating approximations.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S013
S015 · implies
Before
source roles = [Selection subsets INCLUDING label0, 10, 1, 10, 1]
After
derived = [10, 10]
Conditions: none
EACH k-subset has exactly k! orderings,so P/k! is the exact integer C.Multiply back to verify P.An empty subset and empty ordering each count once;no probability model is asserted.
Step identifiers and dependencies
Rule: Selection_UNORDERED_each_subset_has_kfactorial_orderings · Uses: G001, S014
S016 · calculation
Before
Selection subsets EXCLUDING label0 ordered ORIGINAL available-choice factor0 := mul(1, 10)
After
Selection subsets EXCLUDING label0 ordered ORIGINAL available-choice factor0 = 10
Conditions: none
Use ORIGINAL operands for exact integer/rational arithmetic.Only RAW inputs use SAFE or the explicit family bounds;derived values do not inherit those caps or use floating approximations.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S015
S017 · calculation
Before
Selection subsets EXCLUDING label0 ordered ORIGINAL available-choice factor1 := mul(10, 9)
After
Selection subsets EXCLUDING label0 ordered ORIGINAL available-choice factor1 = 90
Conditions: none
Use ORIGINAL operands for exact integer/rational arithmetic.Only RAW inputs use SAFE or the explicit family bounds;derived values do not inherit those caps or use floating approximations.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S016
S018 · implies
Before
source roles = [Selection subsets EXCLUDING label0 ordered, 10, 2]
After
derived = [[10, 9], 90]
Conditions: none
At position j there are n-j UNUSED distinct labeled objects.Multiply ALL k available-choice counts;at k0 there is exactly ONE empty ordered tuple.This is not replacement,circular or indistinguishable selection.
Step identifiers and dependencies
Rule: Selection_ORDERED_distinct_without_replacement_available_choices · Uses: G001, S017
S019 · calculation
Before
Selection subsets EXCLUDING label0 within-subset ORIGINAL factorial factor2 := mul(1, 2)
After
Selection subsets EXCLUDING label0 within-subset ORIGINAL factorial factor2 = 2
Conditions: none
Use ORIGINAL operands for exact integer/rational arithmetic.Only RAW inputs use SAFE or the explicit family bounds;derived values do not inherit those caps or use floating approximations.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S018
S020 · implies
Before
source roles = [Selection subsets EXCLUDING label0 within-subset, 2]
After
derived = [2]
Conditions: none
Multiply the COMPLETE2..n factors;at n0/1 the empty product is1.Use exact BigInt,not floats or a SAFE cap on derived counts.
Step identifiers and dependencies
Rule: Selection_factorial_COMPLETE_integer_product_EMPTY0factorial1 · Uses: G001, S019
S021 · calculation
Before
Selection subsets EXCLUDING label0 ORIGINAL exact ordered over k factorial := div(90, 2)
After
Selection subsets EXCLUDING label0 ORIGINAL exact ordered over k factorial = 45
Conditions: none
Use ORIGINAL operands for exact integer/rational arithmetic.Only RAW inputs use SAFE or the explicit family bounds;derived values do not inherit those caps or use floating approximations.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S020
S022 · calculation
Before
Selection subsets EXCLUDING label0 reverse unordered times k factorial := mul(45, 2)
After
Selection subsets EXCLUDING label0 reverse unordered times k factorial = 90
Conditions: none
Use ORIGINAL operands for exact integer/rational arithmetic.Only RAW inputs use SAFE or the explicit family bounds;derived values do not inherit those caps or use floating approximations.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S021
S023 · implies
Before
source roles = [Selection subsets EXCLUDING label0, 10, 2, 90, 2]
After
derived = [45, 90]
Conditions: none
EACH k-subset has exactly k! orderings,so P/k! is the exact integer C.Multiply back to verify P.An empty subset and empty ordering each count once;no probability model is asserted.
Step identifiers and dependencies
Rule: Selection_UNORDERED_each_subset_has_kfactorial_orderings · Uses: G001, S022
S024 · calculation
Before
Selection ORIGINAL included plus excluded := sum(10, 45)
After
Selection ORIGINAL included plus excluded = 55
Conditions: none
Use ORIGINAL operands for exact integer/rational arithmetic.Only RAW inputs use SAFE or the explicit family bounds;derived values do not inherit those caps or use floating approximations.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S023
S025 · calculation
Before
Selection ORIGINAL partition sum minus whole := sub(55, 55)
After
Selection ORIGINAL partition sum minus whole = 0
Conditions: none
Use ORIGINAL operands for exact integer/rational arithmetic.Only RAW inputs use SAFE or the explicit family bounds;derived values do not inherit those caps or use floating approximations.
Step identifiers and dependencies
Rule: exact_rational_arithmetic · Uses: G001, S024
S026 · implies
Before
source roles = [11, 2]
After
derived = [55, 10, 45, 0]
Conditions: none
n>=1 ensures the GIVEN existing label0.Containing it leaves k-1 choices from the other n-1 objects;excluding it chooses k from those n-1.The two classes are disjoint and exhaustive.At k0 inclusion count0,and at k=n exclusion count0 are legal.
Step identifiers and dependencies
Rule: Selection_FIXED_EXISTING_label0_disjoint_complete_subset_partition · Uses: G001, S025