transfinite 0.2.2

Transfinite ordinal arithmetic library supporting ordinals up to epsilon-zero (ε₀) using Cantor Normal Form
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135

// prop_assert_eq! moves its arguments, causing false redundant_clone positives from clippy.
#![allow(clippy::redundant_clone)]

use proptest::prelude::*;
use transfinite::{CnfTerm, Ordinal};

/// Strategy to generate arbitrary ordinals for property testing.
/// Generates a mix of finite and transfinite ordinals with varying complexity.
fn arb_ordinal() -> impl Strategy<Value = Ordinal> {
    prop_oneof![
        // Finite ordinals (0 to 1000)
        (0u32..1000).prop_map(Ordinal::new_finite),
        // Simple transfinite: w * n for n in 1..10
        (1u32..10).prop_map(|n| {
            Ordinal::new_transfinite(&[CnfTerm::new(&Ordinal::one(), n).unwrap()]).unwrap()
        }),
        // Successor transfinite: w * n + m
        ((1u32..5), (1u32..100)).prop_map(|(n, m)| {
            Ordinal::new_transfinite(&[
                CnfTerm::new(&Ordinal::one(), n).unwrap(),
                CnfTerm::new_finite(m),
            ])
            .unwrap()
        }),
        // w^2 * n
        (1u32..5).prop_map(|n| {
            Ordinal::new_transfinite(&[CnfTerm::new(&Ordinal::new_finite(2), n).unwrap()]).unwrap()
        }),
        // w^2 * n + w * m + k
        ((1u32..3), (1u32..5), (1u32..50)).prop_map(|(n, m, k)| {
            Ordinal::new_transfinite(&[
                CnfTerm::new(&Ordinal::new_finite(2), n).unwrap(),
                CnfTerm::new(&Ordinal::one(), m).unwrap(),
                CnfTerm::new_finite(k),
            ])
            .unwrap()
        }),
    ]
}

proptest! {
    #![proptest_config(ProptestConfig::with_cases(500))]

    #[test]
    fn addition_associativity(a in arb_ordinal(), b in arb_ordinal(), c in arb_ordinal()) {
        let left = (a.clone() + b.clone()) + c.clone();
        let right = a + (b + c);
        prop_assert_eq!(left, right);
    }

    #[test]
    fn multiplication_associativity(a in arb_ordinal(), b in arb_ordinal(), c in arb_ordinal()) {
        let left = (a.clone() * b.clone()) * c.clone();
        let right = a * (b * c);
        prop_assert_eq!(left, right);
    }

    #[test]
    fn addition_identity(a in arb_ordinal()) {
        let zero = Ordinal::zero();
        prop_assert_eq!(a.clone() + zero.clone(), a.clone());
        prop_assert_eq!(zero + a.clone(), a);
    }

    #[test]
    fn multiplication_identity(a in arb_ordinal()) {
        let one = Ordinal::one();
        prop_assert_eq!(a.clone() * one.clone(), a.clone());
        prop_assert_eq!(one * a.clone(), a);
    }

    #[test]
    fn multiplication_by_zero(a in arb_ordinal()) {
        let zero = Ordinal::zero();
        prop_assert_eq!(a.clone() * zero.clone(), zero.clone());
        prop_assert_eq!(zero * a, Ordinal::zero());
    }

    #[test]
    fn ordering_reflexive(a in arb_ordinal()) {
        prop_assert!(a <= a.clone());
        prop_assert!(a >= a.clone());
        prop_assert_eq!(a.clone(), a);
    }

    #[test]
    fn ordering_transitive(a in arb_ordinal(), b in arb_ordinal(), c in arb_ordinal()) {
        if a < b && b < c {
            prop_assert!(a < c);
        }
        if a <= b && b <= c {
            prop_assert!(a <= c);
        }
    }

    #[test]
    fn ordering_antisymmetric(a in arb_ordinal(), b in arb_ordinal()) {
        if a <= b && b <= a {
            prop_assert_eq!(a, b);
        }
    }

    #[test]
    fn ordering_total(a in arb_ordinal(), b in arb_ordinal()) {
        prop_assert!(a <= b || b <= a);
    }

    #[test]
    fn successor_is_greater(a in arb_ordinal()) {
        let succ = a.successor();
        prop_assert!(succ > a);
    }

    #[test]
    fn left_distributivity(a in arb_ordinal(), b in arb_ordinal(), c in arb_ordinal()) {
        // a * (b + c) = a * b + a * c
        let left = a.clone() * (b.clone() + c.clone());
        let right = (a.clone() * b) + (a * c);
        prop_assert_eq!(left, right);
    }

    #[test]
    fn finite_addition_commutative(a in 0u32..1000, b in 0u32..1000) {
        let ord_a = Ordinal::new_finite(a);
        let ord_b = Ordinal::new_finite(b);
        prop_assert_eq!(ord_a.clone() + ord_b.clone(), ord_b + ord_a);
    }

    #[test]
    fn finite_multiplication_commutative(a in 0u32..1000, b in 0u32..1000) {
        let ord_a = Ordinal::new_finite(a);
        let ord_b = Ordinal::new_finite(b);
        prop_assert_eq!(ord_a.clone() * ord_b.clone(), ord_b * ord_a);
    }
}