auslander 0.9.0

Computational representation theory of finite-dimensional bound quiver algebras
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
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
//! Injective envelopes and minimal injective coresolutions, dual to
//! [`crate::resolution`].
//!
//! Each construction is `D` of the matching projective construction over the
//! opposite algebra. `D` is the vertexwise vector-space dual: the same
//! dimension vector, every arrow matrix transposed (see
//! [`crate::opposite::dual`]). Vector-space duality is exact, so `D` is an
//! exact contravariant functor. It sends the projective cover of `D(M)` over
//! `A^op` to the injective envelope of `M`, and a minimal projective
//! resolution of `D(M)` to a minimal injective coresolution of `M`.
//!
//! Minimality transports: a superfluous epimorphism dualizes to an essential
//! monomorphism, so `soc I^k` lies in the kernel of `d^k` at every step.
//! Partial coresolutions use the same typed status as projective resolutions,
//! [`ResolutionEnd`] and [`Bounded`].

use crate::algebra::AlgebraBuildError;
use crate::hom::{Morphism, cokernel};
use crate::module::{Module, same_morphism_data, same_representation, same_slice};
use crate::opposite::{dual, dual_morphism, opposite};
use crate::resolution::{Bounded, ResolutionEnd, bounded_dimension, projective_cover, resolve};

/// The injective envelope `M ↪ I(M)` with `I(M) ≅ ⊕_v I_v^{dim (soc M)_v}`.
///
/// The map is a monomorphism with essential image, dual to the minimality of
/// [`projective_cover`]: it is `D` of the projective cover of `D(M)` over the
/// opposite algebra. The returned morphism has `m` itself as its source.
/// For the zero module both the envelope and the map are zero. Errors when
/// building the opposite algebra fails (see [`opposite`]).
///
/// # Panics
/// Panics if the dual of the cover fails one of the duality checks of
/// [`dual_morphism`]. Such a failure is a bug in this crate, not bad input.
pub fn injective_envelope(m: &Module) -> Result<(Module, Morphism), AlgebraBuildError> {
    let op = opposite(m.algebra())?;
    let dm = dual(m, &op).expect("m lives over the algebra side of its own opposite pair");
    let (cover_term, cover) = projective_cover(&dm);
    let envelope =
        dual(&cover_term, &op).expect("the cover of D(m) lives over the opposite side of the pair");
    let embedding = dual_morphism(&cover, m, &envelope, &op)
        .expect("D(D(m)) is m entry for entry, and the envelope is D of the cover term");
    Ok((envelope, embedding))
}

/// A minimal injective coresolution prefix `0 → M → I^0 → I^1 → …`.
///
/// Layout: `terms[k]` is `I^k`; `maps[k]` is the differential `d^k: I^k → I^{k+1}`,
/// so `maps.len() == terms.len() − 1`; `coaugmentation` is the envelope `M ↪ I^0`.
/// Minimality: each `d^k` factors as `I^k ↠ C^{k+1} ↪ I^{k+1}` with the cosyzygy
/// `C^{k+1}` essential in `I^{k+1}`, so `soc I^k` lies in `ker d^k`.
#[derive(Clone)]
pub struct InjectiveCoresolution {
    pub terms: Vec<Module>,
    pub maps: Vec<Morphism>,
    pub coaugmentation: Morphism,
    pub end: ResolutionEnd,
}

impl InjectiveCoresolution {
    /// Whether two coresolution prefixes have the same end, terms, and maps.
    pub(crate) fn agrees_with(&self, other: &InjectiveCoresolution) -> bool {
        self.end == other.end
            && same_slice(&self.terms, &other.terms, same_representation)
            && same_slice(&self.maps, &other.maps, same_morphism_data)
            && same_morphism_data(&self.coaugmentation, &other.coaugmentation)
    }
}

/// The data that identifies an iterated cosyzygy.
#[derive(Clone)]
pub enum CosyzygyWitness {
    /// The zeroth cosyzygy is the source module itself.
    Identity,
    /// A minimal coresolution prefix whose last cokernel is the cosyzygy.
    Coresolution(InjectiveCoresolution),
}

/// An iterated cosyzygy with its minimal coresolution witness.
#[derive(Clone)]
pub struct Cosyzygy {
    source: Module,
    degree: usize,
    module: Module,
    witness: CosyzygyWitness,
}

impl Cosyzygy {
    accessor_methods! {
        /// The module whose cosyzygy was computed.
        pub source() -> &Module = |this| &this.source;
        /// The exponent `n` in `Ω^(-n)(source)`.
        pub degree() -> usize = |this| this.degree;
        /// The module `Ω^(-n)(source)`.
        pub module() -> &Module = |this| &this.module;
        /// The identity or minimal coresolution witness.
        pub witness() -> &CosyzygyWitness = |this| &this.witness;
    }

    /// Recomputes the cosyzygy and its minimal coresolution witness.
    pub fn verify(&self) -> bool {
        let Ok(rebuilt) = cosyzygy(&self.source, self.degree) else {
            return false;
        };
        same_representation(&self.module, &rebuilt.module)
            && match (&self.witness, &rebuilt.witness) {
                (CosyzygyWitness::Identity, CosyzygyWitness::Identity) => true,
                (CosyzygyWitness::Coresolution(left), CosyzygyWitness::Coresolution(right)) => {
                    left.agrees_with(right)
                }
                _ => false,
            }
    }
}

debug_fields! { Cosyzygy |this| {
    "degree" => this.degree;
    "source" => this.source.dim_vector();
    "module" => this.module.dim_vector();
} }

/// A minimal injective coresolution of `m` with at most `steps` differentials
/// (`terms.len() ≤ steps + 1`).
///
/// The dual of [`resolve`] applied to `D(m)` over the opposite algebra, term by
/// term and map by map, so exactness and minimality are inherited from that
/// resolution.
/// [`ResolutionEnd::Finite`] means the cosyzygy after the last term is zero, so
/// `0 → M → I^0 → … → I^L → 0` is exact. `Cut { at: steps }` means the
/// `(steps + 1)`-st cosyzygy is genuinely nonzero, and nothing is claimed past it.
/// Errors when building the opposite algebra fails (see [`opposite`]).
pub fn coresolve(m: &Module, steps: usize) -> Result<InjectiveCoresolution, AlgebraBuildError> {
    let op = opposite(m.algebra())?;
    let dm = dual(m, &op).expect("m lives over the algebra side of its own opposite pair");
    let resolution = resolve(&dm, steps);
    let terms: Vec<Module> = resolution
        .terms
        .iter()
        .map(|p| dual(p, &op).expect("resolution terms live over the opposite side of the pair"))
        .collect();
    let coaugmentation = dual_morphism(&resolution.augmentation, m, &terms[0], &op)
        .expect("D(D(m)) is m entry for entry, and terms[0] is D(P_0)");
    let maps = resolution
        .maps
        .iter()
        .enumerate()
        .map(|(k, d)| {
            dual_morphism(d, &terms[k], &terms[k + 1], &op)
                .expect("terms[k] is D(P_k) and terms[k + 1] is D(P_{k+1})")
        })
        .collect();
    Ok(InjectiveCoresolution {
        terms,
        maps,
        coaugmentation,
        end: resolution.end,
    })
}

/// Computes `Ω^(-degree)(m)` with the minimal coresolution prefix that proves it.
///
/// Degree zero returns `m` with [`CosyzygyWitness::Identity`]. If the
/// coresolution ends before `degree`, the returned module is zero and the
/// finite coresolution proves that value.
pub fn cosyzygy(m: &Module, degree: usize) -> Result<Cosyzygy, AlgebraBuildError> {
    if degree == 0 {
        return Ok(Cosyzygy {
            source: m.clone(),
            degree,
            module: m.clone(),
            witness: CosyzygyWitness::Identity,
        });
    }
    let coresolution = coresolve(m, degree - 1)?;
    let module = if coresolution.terms.len() < degree {
        Module::zero(m.algebra())
    } else {
        let boundary = if degree == 1 {
            &coresolution.coaugmentation
        } else {
            &coresolution.maps[degree - 2]
        };
        cokernel(boundary).0
    };
    Ok(Cosyzygy {
        source: m.clone(),
        degree,
        module,
        witness: CosyzygyWitness::Coresolution(coresolution),
    })
}

/// The injective dimension of `m`, coresolved up to `bound` differentials.
///
/// Returns `Exact(n)` with `n ≤ bound` when the minimal coresolution reaches
/// zero by step `bound`, and `AtLeast(bound + 1)` otherwise. The lower bound is
/// genuine: the coresolution is minimal, so a nonzero `(bound + 1)`-st cosyzygy
/// proves `id m > bound`. `AtLeast(bound + 1)` is not a claim that `id m` is
/// infinite. Convention: the zero module is injective, so `id 0 = Exact(0)`.
/// At `usize::MAX`, the stored lower bound stays `usize::MAX`, the strongest
/// value this return type can represent.
/// Errors when building the opposite algebra fails (see [`opposite`]).
pub fn injective_dimension(m: &Module, bound: usize) -> Result<Bounded<usize>, AlgebraBuildError> {
    let coresolution = coresolve(m, bound)?;
    Ok(bounded_dimension(
        coresolution.end,
        coresolution.terms.len(),
    ))
}

#[cfg(test)]
mod tests {
    use super::*;
    use crate::algebra::{
        Algebra, an_with_relations, commutative_square, cyclic_nakayama, dual_numbers, linear_an,
        linear_nakayama, radical_square_zero_cycle, truncated_poly,
    };
    use crate::field::PrimeField;
    use crate::hom::{image, kernel};
    use crate::iso::{IsoOutcome, is_isomorphic};
    use crate::module::direct_sum;
    use crate::radical::socle;
    use std::sync::Arc;

    fn fields() -> [PrimeField; 3] {
        [
            PrimeField::new(2).unwrap(),
            PrimeField::new(5).unwrap(),
            PrimeField::new(32003).unwrap(),
        ]
    }

    /// `⊕_v I_v^{dim (soc m)_v}`, built from the socle without any duality.
    fn socle_injective_sum(m: &Module) -> Module {
        let algebra = m.algebra();
        let (soc, _) = socle(m);
        let mut parts = Vec::new();
        for v in 0..algebra.quiver().num_vertices() {
            for _ in 0..soc.dim_at(v) {
                parts.push(Module::injective(algebra, v));
            }
        }
        if parts.is_empty() {
            return Module::zero(algebra);
        }
        let refs: Vec<&Module> = parts.iter().collect();
        direct_sum(&refs).0
    }

    fn is_mono(f: &Morphism) -> bool {
        let field = f.source().field();
        (0..f.source().algebra().quiver().num_vertices())
            .all(|v| f.map_at(v).rank(&field) == f.source().dim_at(v))
    }

    fn fixtures(field: PrimeField) -> Vec<Arc<Algebra>> {
        vec![
            linear_an(3, field),
            an_with_relations(3, &[(0, 2)], field).unwrap(),
            dual_numbers(field),
            truncated_poly(3, field).unwrap(),
            radical_square_zero_cycle(3, field),
            cyclic_nakayama(&[3, 3, 3], field).unwrap(),
            commutative_square(field),
        ]
    }

    fn assorted_modules(algebra: &Arc<Algebra>) -> Vec<Module> {
        let n = algebra.quiver().num_vertices();
        let mut modules = vec![Module::zero(algebra)];
        for v in 0..n {
            modules.push(Module::simple(algebra, v));
            modules.push(Module::projective(algebra, v));
            modules.push(Module::injective(algebra, v));
        }
        let s0 = Module::simple(algebra, 0);
        let p_last = Module::projective(algebra, n - 1);
        modules.push(direct_sum(&[&s0, &p_last]).0);
        modules
    }

    #[test]
    fn envelope_of_a_simple_is_the_indecomposable_injective() {
        for field in fields() {
            for algebra in fixtures(field) {
                for v in 0..algebra.quiver().num_vertices() {
                    let s = Module::simple(&algebra, v);
                    let (envelope, embedding) = injective_envelope(&s).unwrap();
                    let i_v = Module::injective(&algebra, v);
                    assert_eq!(envelope.dim_vector(), i_v.dim_vector(), "I(S_{v})");
                    assert!(is_mono(&embedding));
                    assert!(embedding.source().ptr_eq(&s));
                }
            }
        }
    }

    #[test]
    fn envelope_of_the_zero_module_is_zero() {
        let algebra = linear_an(3, PrimeField::new(5).unwrap());
        let z = Module::zero(&algebra);
        let (envelope, embedding) = injective_envelope(&z).unwrap();
        assert!(envelope.is_zero());
        assert!(embedding.is_zero());
        assert_eq!(injective_dimension(&z, 4).unwrap(), Bounded::Exact(0));
    }

    // Cross-check of the duality route against the socle construction: the
    // envelope is ⊕_v I_v^{dim (soc M)_v}, the embedding is a monomorphism, and
    // its image is essential (a monomorphism whose source and target have equal
    // socle dimensions has soc I inside the image, so it meets every nonzero
    // submodule).
    #[test]
    fn envelope_agrees_with_the_socle_direct_sum_and_is_essential() {
        for field in fields() {
            for algebra in fixtures(field) {
                for m in assorted_modules(&algebra) {
                    let (envelope, embedding) = injective_envelope(&m).unwrap();
                    let by_socle = socle_injective_sum(&m);
                    assert_eq!(
                        envelope.dim_vector(),
                        by_socle.dim_vector(),
                        "envelope of {:?} over F_{}",
                        m.dim_vector(),
                        field.modulus()
                    );
                    assert!(is_mono(&embedding));
                    assert_eq!(
                        socle(&envelope).0.dim_vector(),
                        socle(&m).0.dim_vector(),
                        "essential image for {:?}",
                        m.dim_vector()
                    );
                }
            }
        }
    }

    #[test]
    fn envelope_is_isomorphic_to_the_socle_direct_sum() {
        for field in fields() {
            for algebra in [
                linear_an(3, field),
                an_with_relations(3, &[(0, 2)], field).unwrap(),
            ] {
                for m in assorted_modules(&algebra) {
                    let (envelope, _) = injective_envelope(&m).unwrap();
                    let by_socle = socle_injective_sum(&m);
                    assert!(
                        matches!(
                            is_isomorphic(&envelope, &by_socle).unwrap(),
                            IsoOutcome::Isomorphic(_)
                        ),
                        "envelope of {:?} over F_{}",
                        m.dim_vector(),
                        field.modulus()
                    );
                }
            }
        }
    }

    // Over kA_3 the injectives are I_0 = (1,0,0), I_1 = (1,1,0), I_2 = (1,1,1),
    // so S_0 = I_0 is injective while S_1 and S_2 embed in I_1 and I_2 with
    // cokernels I_0 and I_1.
    #[test]
    fn a3_simples_have_injective_dimensions_0_1_1() {
        for field in fields() {
            let algebra = linear_an(3, field);
            let expected = [0usize, 1, 1];
            for v in 0..3u32 {
                let s = Module::simple(&algebra, v);
                assert_eq!(
                    injective_dimension(&s, 5).unwrap(),
                    Bounded::Exact(expected[v as usize]),
                    "id S_{v}"
                );
            }
        }
    }

    // Over kA_3/(ab) the injectives are I_0 = (1,0,0), I_1 = (1,1,0),
    // I_2 = (0,1,1). The socle of S_2 sits at vertex 2, so I^0 = I_2 and the
    // cokernel is S_1, whose envelope is I_1 with cokernel S_0 = I_0.
    #[test]
    fn a3_mod_ab_simple_2_coresolves_through_i2_i1_i0() {
        for field in fields() {
            let algebra = an_with_relations(3, &[(0, 2)], field).unwrap();
            let s2 = Module::simple(&algebra, 2);
            let coresolution = coresolve(&s2, 5).unwrap();
            assert_eq!(coresolution.end, ResolutionEnd::Finite);
            let dims: Vec<&[usize]> = coresolution.terms.iter().map(Module::dim_vector).collect();
            assert_eq!(dims, vec![&[0, 1, 1][..], &[1, 1, 0], &[1, 0, 0]]);
            assert_eq!(injective_dimension(&s2, 5).unwrap(), Bounded::Exact(2));
            let s1 = Module::simple(&algebra, 1);
            let s0 = Module::simple(&algebra, 0);
            assert_eq!(injective_dimension(&s1, 5).unwrap(), Bounded::Exact(1));
            assert_eq!(injective_dimension(&s0, 5).unwrap(), Bounded::Exact(0));
        }
    }

    // k[x]/(xⁿ) is self-injective: the regular module is the unique
    // indecomposable projective and equals the unique indecomposable injective.
    #[test]
    fn truncated_poly_projectives_are_injective() {
        for field in fields() {
            for n in 2..5 {
                let algebra = truncated_poly(n, field).unwrap();
                let p = Module::projective(&algebra, 0);
                assert_eq!(
                    injective_dimension(&p, 6).unwrap(),
                    Bounded::Exact(0),
                    "id A for x^{n}"
                );
                let i = Module::injective(&algebra, 0);
                assert_eq!(p.dim_vector(), i.dim_vector());
            }
        }
    }

    // Ω S = S over k[x]/(x²) dualizes to a periodic cosyzygy, so the minimal
    // coresolution of the simple never stops.
    #[test]
    fn dual_numbers_simple_coresolves_periodically() {
        for field in fields() {
            let algebra = dual_numbers(field);
            let s = Module::simple(&algebra, 0);
            let coresolution = coresolve(&s, 6).unwrap();
            assert_eq!(coresolution.end, ResolutionEnd::Cut { at: 6 });
            assert_eq!(coresolution.terms.len(), 7);
            for term in &coresolution.terms {
                assert_eq!(term.dim_vector(), &[2]);
            }
            assert_eq!(injective_dimension(&s, 10).unwrap(), Bounded::AtLeast(11));
        }
    }

    #[test]
    fn iterated_cosyzygies_keep_their_minimal_coresolution_witness() {
        for field in fields() {
            let algebra = dual_numbers(field);
            let simple = Module::simple(&algebra, 0);
            for degree in 0..5 {
                let value = cosyzygy(&simple, degree).unwrap();
                assert_eq!(value.source().dim_vector(), &[1]);
                assert_eq!(value.degree(), degree);
                assert_eq!(value.module().dim_vector(), &[1]);
                assert!(value.verify());
                assert_eq!(
                    matches!(value.witness(), CosyzygyWitness::Identity),
                    degree == 0
                );
            }
        }
    }

    #[test]
    fn cosyzygy_is_zero_past_a_finite_coresolution() {
        let algebra = linear_an(3, PrimeField::new(5).unwrap());
        let simple = Module::simple(&algebra, 2);
        assert_eq!(
            cosyzygy(&simple, 0).unwrap().module().dim_vector(),
            &[0, 0, 1]
        );
        assert_eq!(
            cosyzygy(&simple, 1).unwrap().module().dim_vector(),
            &[1, 1, 0]
        );
        assert!(cosyzygy(&simple, 2).unwrap().module().is_zero());
        let injective = Module::injective(&algebra, 1);
        assert!(cosyzygy(&injective, 1).unwrap().module().is_zero());
    }

    #[test]
    fn a_cosyzygy_with_a_changed_degree_fails_verification() {
        let algebra = dual_numbers(PrimeField::new(5).unwrap());
        let mut value = cosyzygy(&Module::simple(&algebra, 0), 2).unwrap();
        value.degree = 1;
        assert!(!value.verify());
    }

    // A cyclic Nakayama algebra with constant Kupisch series is self-injective;
    // the linear one with series [3, 2, 1] is kA_3, where P_1 = (0,1,1) is not
    // injective and embeds in I_2 = (1,1,1) with cokernel I_0.
    #[test]
    fn cyclic_nakayama_is_self_injective_and_linear_nakayama_is_not() {
        for field in fields() {
            let cyclic = cyclic_nakayama(&[3, 3, 3], field).unwrap();
            for v in 0..3u32 {
                let p = Module::projective(&cyclic, v);
                assert_eq!(
                    injective_dimension(&p, 6).unwrap(),
                    Bounded::Exact(0),
                    "id P_{v}"
                );
            }
            let linear = linear_nakayama(&[3, 2, 1], field).unwrap();
            let p1 = Module::projective(&linear, 1);
            assert_eq!(p1.dim_vector(), &[0, 1, 1]);
            assert_eq!(injective_dimension(&p1, 6).unwrap(), Bounded::Exact(1));
        }
    }

    #[test]
    fn coresolve_with_zero_steps_reports_cut_for_a_noninjective_module() {
        let field = PrimeField::new(32003).unwrap();
        let algebra = linear_an(3, field);
        let s2 = Module::simple(&algebra, 2);
        let coresolution = coresolve(&s2, 0).unwrap();
        assert_eq!(coresolution.end, ResolutionEnd::Cut { at: 0 });
        assert_eq!(coresolution.terms.len(), 1);
        let i0 = Module::injective(&algebra, 0);
        assert_eq!(coresolve(&i0, 0).unwrap().end, ResolutionEnd::Finite);
    }

    #[test]
    fn coresolution_prefixes_are_complexes_and_exact() {
        for field in fields() {
            for algebra in fixtures(field) {
                for m in assorted_modules(&algebra) {
                    let coresolution = coresolve(&m, 4).unwrap();
                    assert!(is_mono(&coresolution.coaugmentation));
                    if let Some(d0) = coresolution.maps.first() {
                        assert!(
                            coresolution.coaugmentation.then(d0).unwrap().is_zero(),
                            "d^0 ∘ ι = 0"
                        );
                    }
                    for pair in coresolution.maps.windows(2) {
                        assert!(pair[0].then(&pair[1]).unwrap().is_zero(), "d² = 0");
                    }
                    for k in 0..coresolution.terms.len() {
                        let (incoming, _) = if k == 0 {
                            image(&coresolution.coaugmentation)
                        } else {
                            image(&coresolution.maps[k - 1])
                        };
                        if k + 1 < coresolution.terms.len() {
                            let (ker, _) = kernel(&coresolution.maps[k]);
                            assert_eq!(
                                ker.dim_vector(),
                                incoming.dim_vector(),
                                "exactness at I^{k}"
                            );
                        } else if coresolution.end == ResolutionEnd::Finite {
                            assert_eq!(
                                incoming.dim_vector(),
                                coresolution.terms[k].dim_vector(),
                                "a finite coresolution ends onto its last term"
                            );
                        }
                    }
                }
            }
        }
    }

    // Minimality dualizes "differentials land in the radical" to "soc I^k lies
    // in ker d^k".
    #[test]
    fn differentials_vanish_on_socles() {
        for field in fields() {
            for algebra in fixtures(field) {
                for m in assorted_modules(&algebra) {
                    let coresolution = coresolve(&m, 4).unwrap();
                    for (k, d) in coresolution.maps.iter().enumerate() {
                        let (_, inclusion) = socle(&coresolution.terms[k]);
                        assert!(
                            inclusion.then(d).unwrap().is_zero(),
                            "soc I^{k} survives d^{k}"
                        );
                    }
                }
            }
        }
    }

    #[test]
    fn every_first_term_is_the_injective_envelope() {
        for field in fields() {
            for algebra in fixtures(field) {
                for m in assorted_modules(&algebra) {
                    let coresolution = coresolve(&m, 3).unwrap();
                    let (envelope, _) = injective_envelope(&m).unwrap();
                    assert_eq!(coresolution.terms[0].dim_vector(), envelope.dim_vector());
                    assert_eq!(
                        injective_dimension(&coresolution.terms[0], 3).unwrap(),
                        Bounded::Exact(0),
                        "I^0 of {:?} is injective",
                        m.dim_vector()
                    );
                }
            }
        }
    }
}