逐步推導
S001 · implies
操作前
source roles = [qf-mod31-martdeep-fair-partial-sum, [domain, operation, scale, steps]]
操作後
derived = [martdeep-fair-partial-sum, Exact_finite_martingale_construction]
條件:無
原bank的operation是LOCAL hyphen,keys與domain各自精確匹配。欄位順序及數字/Boolean/字串角色依來源,所有有理數文字整數省略/1;不改原題與英文、MKO、AST或狀態。
步驟識別與依賴
規則:R66_EXACT_source_bank_keys_local_operation_domain · 依賴:G001
S002 · calculation
操作前
Fair ORIGINAL two positive signs k=0 := mul(2, 0)
操作後
Fair ORIGINAL two positive signs k=0 = 0
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S001
S003 · calculation
操作前
Fair ORIGINAL positive minus negative count k=0 := sub(0, 7)
操作後
Fair ORIGINAL positive minus negative count k=0 = -7
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S002
S004 · calculation
操作前
Fair ORIGINAL scale times signed count k=0 := mul(2, -7)
操作後
Fair ORIGINAL scale times signed count k=0 = -14
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S003
S005 · implies
操作前
source roles = [7, 2, 0]
操作後
derived = [-14, 1]
條件:無
k個正sign、n−k個負sign給scale*(2k−n),選正sign位置有choose(n,k)條;逐k=0..n保留全部terminal support與multiplicity。
步驟識別與依賴
規則:Martingale_FAIR_EACH_complete_terminal_support_binomial_count · 依賴:G001, S004
S006 · calculation
操作前
Fair ORIGINAL binomial previous times remaining k=1 := mul(1, 7)
操作後
Fair ORIGINAL binomial previous times remaining k=1 = 7
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S005
S007 · calculation
操作前
Fair ORIGINAL binomial recurrence division k=1 := div(7, 1)
操作後
Fair ORIGINAL binomial recurrence division k=1 = 7
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S006
S008 · calculation
操作前
Fair ORIGINAL two positive signs k=1 := mul(2, 1)
操作後
Fair ORIGINAL two positive signs k=1 = 2
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S007
S009 · calculation
操作前
Fair ORIGINAL positive minus negative count k=1 := sub(2, 7)
操作後
Fair ORIGINAL positive minus negative count k=1 = -5
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S008
S010 · calculation
操作前
Fair ORIGINAL scale times signed count k=1 := mul(2, -5)
操作後
Fair ORIGINAL scale times signed count k=1 = -10
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S009
S011 · implies
操作前
source roles = [7, 2, 1]
操作後
derived = [-10, 7]
條件:無
k個正sign、n−k個負sign給scale*(2k−n),選正sign位置有choose(n,k)條;逐k=0..n保留全部terminal support與multiplicity。
步驟識別與依賴
規則:Martingale_FAIR_EACH_complete_terminal_support_binomial_count · 依賴:G001, S010
S012 · calculation
操作前
Fair ORIGINAL binomial previous times remaining k=2 := mul(7, 6)
操作後
Fair ORIGINAL binomial previous times remaining k=2 = 42
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S011
S013 · calculation
操作前
Fair ORIGINAL binomial recurrence division k=2 := div(42, 2)
操作後
Fair ORIGINAL binomial recurrence division k=2 = 21
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S012
S014 · calculation
操作前
Fair ORIGINAL two positive signs k=2 := mul(2, 2)
操作後
Fair ORIGINAL two positive signs k=2 = 4
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S013
S015 · calculation
操作前
Fair ORIGINAL positive minus negative count k=2 := sub(4, 7)
操作後
Fair ORIGINAL positive minus negative count k=2 = -3
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S014
S016 · calculation
操作前
Fair ORIGINAL scale times signed count k=2 := mul(2, -3)
操作後
Fair ORIGINAL scale times signed count k=2 = -6
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S015
S017 · implies
操作前
source roles = [7, 2, 2]
操作後
derived = [-6, 21]
條件:無
k個正sign、n−k個負sign給scale*(2k−n),選正sign位置有choose(n,k)條;逐k=0..n保留全部terminal support與multiplicity。
步驟識別與依賴
規則:Martingale_FAIR_EACH_complete_terminal_support_binomial_count · 依賴:G001, S016
S018 · calculation
操作前
Fair ORIGINAL binomial previous times remaining k=3 := mul(21, 5)
操作後
Fair ORIGINAL binomial previous times remaining k=3 = 105
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S017
S019 · calculation
操作前
Fair ORIGINAL binomial recurrence division k=3 := div(105, 3)
操作後
Fair ORIGINAL binomial recurrence division k=3 = 35
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S018
S020 · calculation
操作前
Fair ORIGINAL two positive signs k=3 := mul(2, 3)
操作後
Fair ORIGINAL two positive signs k=3 = 6
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S019
S021 · calculation
操作前
Fair ORIGINAL positive minus negative count k=3 := sub(6, 7)
操作後
Fair ORIGINAL positive minus negative count k=3 = -1
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S020
S022 · calculation
操作前
Fair ORIGINAL scale times signed count k=3 := mul(2, -1)
操作後
Fair ORIGINAL scale times signed count k=3 = -2
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S021
S023 · implies
操作前
source roles = [7, 2, 3]
操作後
derived = [-2, 35]
條件:無
k個正sign、n−k個負sign給scale*(2k−n),選正sign位置有choose(n,k)條;逐k=0..n保留全部terminal support與multiplicity。
步驟識別與依賴
規則:Martingale_FAIR_EACH_complete_terminal_support_binomial_count · 依賴:G001, S022
S024 · calculation
操作前
Fair ORIGINAL binomial previous times remaining k=4 := mul(35, 4)
操作後
Fair ORIGINAL binomial previous times remaining k=4 = 140
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S023
S025 · calculation
操作前
Fair ORIGINAL binomial recurrence division k=4 := div(140, 4)
操作後
Fair ORIGINAL binomial recurrence division k=4 = 35
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S024
S026 · calculation
操作前
Fair ORIGINAL two positive signs k=4 := mul(2, 4)
操作後
Fair ORIGINAL two positive signs k=4 = 8
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S025
S027 · calculation
操作前
Fair ORIGINAL positive minus negative count k=4 := sub(8, 7)
操作後
Fair ORIGINAL positive minus negative count k=4 = 1
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S026
S028 · calculation
操作前
Fair ORIGINAL scale times signed count k=4 := mul(2, 1)
操作後
Fair ORIGINAL scale times signed count k=4 = 2
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S027
S029 · implies
操作前
source roles = [7, 2, 4]
操作後
derived = [2, 35]
條件:無
k個正sign、n−k個負sign給scale*(2k−n),選正sign位置有choose(n,k)條;逐k=0..n保留全部terminal support與multiplicity。
步驟識別與依賴
規則:Martingale_FAIR_EACH_complete_terminal_support_binomial_count · 依賴:G001, S028
S030 · calculation
操作前
Fair ORIGINAL binomial previous times remaining k=5 := mul(35, 3)
操作後
Fair ORIGINAL binomial previous times remaining k=5 = 105
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S029
S031 · calculation
操作前
Fair ORIGINAL binomial recurrence division k=5 := div(105, 5)
操作後
Fair ORIGINAL binomial recurrence division k=5 = 21
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S030
S032 · calculation
操作前
Fair ORIGINAL two positive signs k=5 := mul(2, 5)
操作後
Fair ORIGINAL two positive signs k=5 = 10
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S031
S033 · calculation
操作前
Fair ORIGINAL positive minus negative count k=5 := sub(10, 7)
操作後
Fair ORIGINAL positive minus negative count k=5 = 3
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S032
S034 · calculation
操作前
Fair ORIGINAL scale times signed count k=5 := mul(2, 3)
操作後
Fair ORIGINAL scale times signed count k=5 = 6
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S033
S035 · implies
操作前
source roles = [7, 2, 5]
操作後
derived = [6, 21]
條件:無
k個正sign、n−k個負sign給scale*(2k−n),選正sign位置有choose(n,k)條;逐k=0..n保留全部terminal support與multiplicity。
步驟識別與依賴
規則:Martingale_FAIR_EACH_complete_terminal_support_binomial_count · 依賴:G001, S034
S036 · calculation
操作前
Fair ORIGINAL binomial previous times remaining k=6 := mul(21, 2)
操作後
Fair ORIGINAL binomial previous times remaining k=6 = 42
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S035
S037 · calculation
操作前
Fair ORIGINAL binomial recurrence division k=6 := div(42, 6)
操作後
Fair ORIGINAL binomial recurrence division k=6 = 7
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S036
S038 · calculation
操作前
Fair ORIGINAL two positive signs k=6 := mul(2, 6)
操作後
Fair ORIGINAL two positive signs k=6 = 12
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S037
S039 · calculation
操作前
Fair ORIGINAL positive minus negative count k=6 := sub(12, 7)
操作後
Fair ORIGINAL positive minus negative count k=6 = 5
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S038
S040 · calculation
操作前
Fair ORIGINAL scale times signed count k=6 := mul(2, 5)
操作後
Fair ORIGINAL scale times signed count k=6 = 10
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S039
S041 · implies
操作前
source roles = [7, 2, 6]
操作後
derived = [10, 7]
條件:無
k個正sign、n−k個負sign給scale*(2k−n),選正sign位置有choose(n,k)條;逐k=0..n保留全部terminal support與multiplicity。
步驟識別與依賴
規則:Martingale_FAIR_EACH_complete_terminal_support_binomial_count · 依賴:G001, S040
S042 · calculation
操作前
Fair ORIGINAL binomial previous times remaining k=7 := mul(7, 1)
操作後
Fair ORIGINAL binomial previous times remaining k=7 = 7
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S041
S043 · calculation
操作前
Fair ORIGINAL binomial recurrence division k=7 := div(7, 7)
操作後
Fair ORIGINAL binomial recurrence division k=7 = 1
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S042
S044 · calculation
操作前
Fair ORIGINAL two positive signs k=7 := mul(2, 7)
操作後
Fair ORIGINAL two positive signs k=7 = 14
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S043
S045 · calculation
操作前
Fair ORIGINAL positive minus negative count k=7 := sub(14, 7)
操作後
Fair ORIGINAL positive minus negative count k=7 = 7
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S044
S046 · calculation
操作前
Fair ORIGINAL scale times signed count k=7 := mul(2, 7)
操作後
Fair ORIGINAL scale times signed count k=7 = 14
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S045
S047 · implies
操作前
source roles = [7, 2, 7]
操作後
derived = [14, 1]
條件:無
k個正sign、n−k個負sign給scale*(2k−n),選正sign位置有choose(n,k)條;逐k=0..n保留全部terminal support與multiplicity。
步驟識別與依賴
規則:Martingale_FAIR_EACH_complete_terminal_support_binomial_count · 依賴:G001, S046
S048 · calculation
操作前
Fair ORIGINAL all binomial multiplicities := sum(1, 7, 21, 35, 35, 21, 7, 1)
操作後
Fair ORIGINAL all binomial multiplicities = 128
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S047
S049 · implies
操作前
source roles = [7, 2, 128]
操作後
derived = [[time=0, prefixes=1, next_signs=+s,-s equiprobable, conditional_increment_mean=0], [time=1, prefixes=2, next_signs=+s,-s equiprobable, conditional_increment_mean=0], [time=2, prefixes=4, next_signs=+s,-s equiprobable, conditional_increment_mean=0], [time=3, prefixes=8, next_signs=+s,-s equiprobable, conditional_increment_mean=0], [time=4, prefixes=16, next_signs=+s,-s equiprobable, conditional_increment_mean=0], [time=5, prefixes=32, next_signs=+s,-s equiprobable, conditional_increment_mean=0], [time=6, prefixes=64, next_signs=+s,-s equiprobable, conditional_increment_mean=0]]
條件:無
前提為完整2^n等機率獨立sign product space與逐sign揭露filtration;每個prefix下一sign的正負延伸等多,條件增量mean=(s−s)/2=0,partial sum adapted/可積,故本有限process為martingale。不把獨立增量說成任意martingale必備,也不套stopping/收斂定理。
步驟識別與依賴
規則:Martingale_FAIR_PRODUCT_space_natural_filtration_EVERY_prefix · 依賴:G001, S048