逐步推導
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, 2)
操作後
Fair ORIGINAL positive minus negative count k=0 = -2
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S002
S004 · calculation
操作前
Fair ORIGINAL scale times signed count k=0 := mul(1, -2)
操作後
Fair ORIGINAL scale times signed count k=0 = -2
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S003
S005 · implies
操作前
source roles = [2, 1, 0]
操作後
derived = [-2, 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, 2)
操作後
Fair ORIGINAL binomial previous times remaining k=1 = 2
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S005
S007 · calculation
操作前
Fair ORIGINAL binomial recurrence division k=1 := div(2, 1)
操作後
Fair ORIGINAL binomial recurrence division k=1 = 2
條件:無
按本步原操作數與次序精確運算;來源有理數的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, 2)
操作後
Fair ORIGINAL positive minus negative count k=1 = 0
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S008
S010 · calculation
操作前
Fair ORIGINAL scale times signed count k=1 := mul(1, 0)
操作後
Fair ORIGINAL scale times signed count k=1 = 0
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S009
S011 · implies
操作前
source roles = [2, 1, 1]
操作後
derived = [0, 2]
條件:無
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(2, 1)
操作後
Fair ORIGINAL binomial previous times remaining k=2 = 2
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S011
S013 · calculation
操作前
Fair ORIGINAL binomial recurrence division k=2 := div(2, 2)
操作後
Fair ORIGINAL binomial recurrence division k=2 = 1
條件:無
按本步原操作數與次序精確運算;來源有理數的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, 2)
操作後
Fair ORIGINAL positive minus negative count k=2 = 2
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S014
S016 · calculation
操作前
Fair ORIGINAL scale times signed count k=2 := mul(1, 2)
操作後
Fair ORIGINAL scale times signed count k=2 = 2
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S015
S017 · implies
操作前
source roles = [2, 1, 2]
操作後
derived = [2, 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, S016
S018 · calculation
操作前
Fair ORIGINAL all binomial multiplicities := sum(1, 2, 1)
操作後
Fair ORIGINAL all binomial multiplicities = 4
條件:無
按本步原操作數與次序精確運算;來源有理數的pre-reduction界另行保留,不用浮點或偷偷跨bank放寬。
步驟識別與依賴
規則:exact_rational_arithmetic · 依賴:G001, S017
S019 · implies
操作前
source roles = [2, 1, 4]
操作後
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]]
條件:無
前提為完整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, S018