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
//! The AR translate τ, computed two independent ways with an automatic
//! cross-check.
//!
//! Both routes start from the minimal presentation `P_1 -d1-> P_0 → M → 0` in
//! element-matrix form. Route 1 applies the Nakayama functor and takes a kernel:
//! `τM = ker(ν(d1): νP_1 → νP_0)`, from the exact sequence
//! `0 → τM → νP_1 → νP_0 → νM → 0` (see
//! [`crate::opposite::nu_of_presentation_map`]). Route 2 applies `Hom_A(−, A)` to
//! `d1`, which is the element-matrix transpose over the opposite algebra, takes
//! the cokernel to get `Tr M`, and dualizes back: `τM = D(Tr M)`.
//!
//! The routes share the checked minimal presentation and the
//! [`crate::opposite::ElementMatrix`] path-coefficient encoding. Everything
//! after that is independent: injectives plus kernel on one side, opposite-side
//! projectives plus cokernel plus dual on the other. Agreement tests every
//! step below the shared encoding, and nothing inside it.
//!
//! [`tau`] always runs both routes and answers only when
//! [`crate::iso::is_isomorphic`] certifies the two results isomorphic.
use crate::algebra::AlgebraBuildError;
use crate::hom::{cokernel, kernel};
use crate::iso::{IsoOutcome, Obstruction, is_isomorphic};
use crate::module::Module;
use crate::opposite::{ElementMatrix, OppositeMap, dual, nu_of_presentation_map, opposite};
use crate::profile::{Site, hit, hit_module};
use crate::resolution::minimal_presentation_matrix;
/// A [`tau`] cross-check that did not end in agreement.
///
/// The two failure variants are different claims.
/// [`TauError::RoutesDisagree`] carries a proof that the two routes produced
/// non-isomorphic modules. That is a bug in this library: one of the two
/// results is wrong. [`TauError::AgreementUnknown`] means the isomorphism test
/// reached no verdict. It says nothing about whether the routes agree. It is
/// evidence about the test, not about `τM`.
#[derive(Clone, Debug)]
pub enum TauError {
/// Building the opposite algebra failed, so the transpose-dual route
/// could not run. This is an engine limit or defect, not a statement
/// about the module.
Opposite(AlgebraBuildError),
/// [`crate::iso::is_isomorphic`] proved the two routes non-isomorphic.
RoutesDisagree {
/// `ker(ν(d1))`.
nakayama_kernel: Module,
/// `D(Tr M)`.
transpose_dual: Module,
/// The proof of non-isomorphism.
obstruction: Obstruction,
},
/// [`crate::iso::is_isomorphic`] certified neither an isomorphism nor an
/// obstruction, so the cross-check is undecided.
AgreementUnknown {
/// `ker(ν(d1))`.
nakayama_kernel: Module,
/// `D(Tr M)`.
transpose_dual: Module,
/// Why the isomorphism test could not certify either answer.
reason: String,
},
}
display_error! { TauError {
Self::Opposite(error) => "building the opposite algebra failed: {error}";
Self::RoutesDisagree { nakayama_kernel, transpose_dual, obstruction } => "τ routes disagree: Nakayama kernel has dimension vector {:?}, transpose dual {:?} ({obstruction:?})", nakayama_kernel.dim_vector(), transpose_dual.dim_vector();
Self::AgreementUnknown { nakayama_kernel, transpose_dual, reason } => "τ routes not certified isomorphic: Nakayama kernel has dimension vector {:?}, transpose dual {:?} ({reason})", nakayama_kernel.dim_vector(), transpose_dual.dim_vector();
} }
error_source! { TauError {
Self::Opposite(error) => Some(error),
_ => None,
} }
/// Route 1: `τM = ker(ν(d1))` for the minimal presentation `P_1 -d1-> P_0`.
/// Zero exactly when `m` is projective.
pub fn tau_via_nakayama_kernel(m: &Module) -> Module {
nakayama_kernel_route(&minimal_presentation_matrix(m))
}
fn nakayama_kernel_route(d1: &ElementMatrix) -> Module {
hit(Site::TauNakayamaRoute);
kernel(&nu_of_presentation_map(d1)).0
}
/// Route 2: `τM = D(Tr M)` with `Tr M = coker(Hom_A(d1, A))`, the transposed
/// element matrix realized between opposite-side projectives.
///
/// Zero exactly when `m` is projective. The result lives over the same algebra
/// [`std::sync::Arc`] as `m`. Errors with [`TauError::Opposite`] when building the
/// opposite algebra fails.
pub fn tau_via_transpose_dual(m: &Module) -> Result<Module, TauError> {
let op = opposite(m.algebra()).map_err(TauError::Opposite)?;
Ok(transpose_dual_route(&minimal_presentation_matrix(m), &op))
}
fn transpose_dual_route(d1: &ElementMatrix, op: &OppositeMap) -> Module {
hit(Site::TauTransposeDualRoute);
let transposed = d1
.transpose_over(op)
.expect("the presentation matrix lives over the algebra side of its own opposite pair");
let (tr, _) = cokernel(&transposed.morphism());
dual(&tr, op).expect("Tr M lives over the opposite side of the pair")
}
/// The AR translate `τM`, as the Nakayama-kernel result over `m`'s algebra.
///
/// Zero exactly when `m` is projective: a projective has empty `P_1` in its
/// minimal presentation, so both routes land on zero. Use [`Module::is_zero`]
/// for that case.
///
/// The presentation is computed once and both routes always run on it. An answer
/// comes back only when [`is_isomorphic`] certifies the two results isomorphic. A
/// certified disagreement is [`TauError::RoutesDisagree`]. An undecided
/// cross-check is [`TauError::AgreementUnknown`], a limit of the isomorphism test
/// rather than evidence about the routes.
pub fn tau(m: &Module) -> Result<Module, TauError> {
hit_module(Site::Tau, m);
let op = opposite(m.algebra()).map_err(TauError::Opposite)?;
tau_over(m, &op)
}
/// The same checked translate with a matching opposite algebra already built.
pub(crate) fn tau_with_opposite(m: &Module, op: &OppositeMap) -> Result<Module, TauError> {
hit_module(Site::TauWithOpposite, m);
tau_over(m, op)
}
fn tau_over(m: &Module, op: &OppositeMap) -> Result<Module, TauError> {
let d1 = minimal_presentation_matrix(m);
let nakayama_kernel = nakayama_kernel_route(&d1);
let transpose_dual = transpose_dual_route(&d1, op);
let outcome = is_isomorphic(&nakayama_kernel, &transpose_dual)
.expect("both routes land over m's algebra Arc");
match outcome {
IsoOutcome::Isomorphic(_) => Ok(nakayama_kernel),
IsoOutcome::NotIsomorphic(obstruction) => Err(TauError::RoutesDisagree {
nakayama_kernel,
transpose_dual,
obstruction,
}),
IsoOutcome::Unknown { reason } => Err(TauError::AgreementUnknown {
nakayama_kernel,
transpose_dual,
reason,
}),
}
}
#[cfg(test)]
mod tests {
use super::*;
use crate::algebra::{cyclic_nakayama, dual_numbers, kronecker, linear_an};
use crate::field::PrimeField;
fn fields() -> [PrimeField; 2] {
[PrimeField::new(2).unwrap(), PrimeField::new(5).unwrap()]
}
#[test]
fn nakayama_kernel_route_recovers_hand_derived_translates() {
for field in fields() {
let a3 = linear_an(3, field);
assert_eq!(
tau_via_nakayama_kernel(&Module::simple(&a3, 0)).dim_vector(),
&[0, 1, 0]
);
assert_eq!(
tau_via_nakayama_kernel(&Module::simple(&a3, 1)).dim_vector(),
&[0, 0, 1]
);
let kron = kronecker(2, field);
assert_eq!(
tau_via_nakayama_kernel(&Module::simple(&kron, 0)).dim_vector(),
&[3, 2]
);
}
}
#[test]
fn nakayama_kernel_route_is_zero_on_projectives() {
for field in fields() {
for algebra in [
linear_an(3, field),
dual_numbers(field),
cyclic_nakayama(&[3, 3, 3], field).unwrap(),
] {
for v in 0..algebra.quiver().num_vertices() {
let p = Module::projective(&algebra, v);
assert!(tau_via_nakayama_kernel(&p).is_zero(), "τ P_{v}");
}
}
}
}
#[test]
fn transpose_dual_route_lands_over_the_same_algebra_arc() {
for field in fields() {
let a3 = linear_an(3, field);
let s0 = Module::simple(&a3, 0);
let t = tau_via_transpose_dual(&s0).unwrap();
assert!(std::sync::Arc::ptr_eq(t.algebra(), &a3));
assert_eq!(t.dim_vector(), &[0, 1, 0]);
}
}
#[test]
fn tau_is_zero_exactly_on_projectives() {
for field in fields() {
for algebra in [
linear_an(3, field),
dual_numbers(field),
cyclic_nakayama(&[3, 3, 3], field).unwrap(),
] {
for v in 0..algebra.quiver().num_vertices() {
let p = Module::projective(&algebra, v);
assert!(tau(&p).unwrap().is_zero(), "τ P_{v}");
let s = Module::simple(&algebra, v);
if s.dim_vector() == p.dim_vector() {
continue;
}
assert!(!tau(&s).unwrap().is_zero(), "τ S_{v}");
}
}
}
}
#[test]
fn tau_of_the_zero_module_is_zero() {
let a = linear_an(3, PrimeField::new(5).unwrap());
let z = Module::zero(&a);
assert!(tau(&z).unwrap().is_zero());
}
#[test]
fn both_routes_agree_on_every_simple_of_the_fixtures() {
for field in fields() {
for algebra in [
linear_an(3, field),
kronecker(2, field),
dual_numbers(field),
cyclic_nakayama(&[3, 3, 3], field).unwrap(),
] {
for v in 0..algebra.quiver().num_vertices() {
let s = Module::simple(&algebra, v);
let left = tau_via_nakayama_kernel(&s);
let right = tau_via_transpose_dual(&s).unwrap();
assert!(
matches!(
is_isomorphic(&left, &right).unwrap(),
IsoOutcome::Isomorphic(_)
),
"routes for S_{v} over F_{}",
field.modulus()
);
assert!(tau(&s).is_ok());
}
}
}
}
}