auslander 0.10.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
use std::sync::Arc;

use crate::algebra::Algebra;
use crate::algebra_isomorphism::AlgebraIsomorphism;
use crate::certificate::Certificate;
use crate::control::{ComputationControl, ProgressStage};
use crate::derived_artifact::{ArtifactVerificationCut, declared_limits, exceeded};
use crate::derived_invariant::{
    DerivedInequivalenceWitness, DerivedInvariantKind, DerivedInvariants,
};
use crate::equivalence_edge::DerivedEquivalencePath;
use crate::field::{Fp, PrimeField};
use crate::verify::verify_certificate;

use super::super::stages::groups_by_key;
use super::super::verify::{covers_pairs, partitions, replay_edge, spanning_tree};
use super::super::{
    ClassSeparation, ClassificationStatus, DerivedClass, DerivedClassification, DerivedMerge,
};
use super::errors::DerivedAtlasError;
use super::model::{
    AtlasMerge, AtlasReading, AtlasSeparation, DerivedAtlasArtifact, DerivedAtlasVerifyLimits,
    encode_value,
};

/// A verified atlas and the classification it rebuilds.
#[derive(Clone, Debug)]
pub struct VerifiedDerivedAtlas {
    artifact: DerivedAtlasArtifact,
    classification: DerivedClassification,
}

impl VerifiedDerivedAtlas {
    accessor_methods! {
        /// The canonical parsed atlas.
        pub artifact() -> &DerivedAtlasArtifact = |this| &this.artifact;
        /// The rebuilt classification: the verified family, the recomputed
        /// invariants, and every replayed merge and separation.
        pub classification() -> &DerivedClassification = |this| &this.classification;
    }
}

/// A verified atlas, or a typed stop before the verifier decided.
#[derive(Clone, Debug)]
pub enum DerivedAtlasVerification {
    /// Every stored claim replayed.
    Verified(Box<VerifiedDerivedAtlas>),
    /// Cancellation or a verifier ceiling stopped the run. `Cancelled` and
    /// `WorkLimit` count the mutations replayed over all merges.
    Stopped(ArtifactVerificationCut),
}

/// Why replay ended before a verdict or with a rejection.
enum Halt {
    Stopped(ArtifactVerificationCut),
    Rejected(DerivedAtlasError),
}

impl From<DerivedAtlasError> for Halt {
    fn from(error: DerivedAtlasError) -> Self {
        Halt::Rejected(error)
    }
}

/// The replayed mutation count against the verifier ceiling, with the
/// cancellation check before each charge.
struct Budget<'a> {
    control: &'a ComputationControl,
    completed: usize,
    limit: usize,
}

impl Budget<'_> {
    fn charge(&mut self, mutations: usize) -> Result<(), Halt> {
        let completed = self.completed;
        if self.control.is_cancelled() {
            let completed_mutations = completed;
            return Err(Halt::Stopped(ArtifactVerificationCut::Cancelled {
                completed_mutations,
            }));
        }
        let next = completed.saturating_add(mutations);
        if next > self.limit {
            let limit = self.limit;
            return Err(Halt::Stopped(ArtifactVerificationCut::WorkLimit {
                completed,
                limit,
            }));
        }
        self.control
            .update(ProgressStage::ArtifactVerify, completed, next);
        self.completed = next;
        Ok(())
    }
}

/// Parses and verifies one untrusted atlas.
///
/// Runs no discovery. It rebuilds every member through the certificate
/// verifier, recomputes every reading, rebuilds every separation witness,
/// replays every merge recipe, and checks every isomorphism. See
/// [`DerivedAtlasArtifact::verify`].
pub fn verify_derived_atlas_artifact(
    text: &str,
    limits: DerivedAtlasVerifyLimits,
    control: &ComputationControl,
) -> Result<DerivedAtlasVerification, DerivedAtlasError> {
    control.update(ProgressStage::ArtifactVerify, 0, 0);
    DerivedAtlasArtifact::from_json(text, limits.parse)?.verify(limits, control)
}

impl DerivedAtlasArtifact {
    /// Verifies the parsed atlas under `limits`.
    ///
    /// The checks run cheap first. The fingerprint must match, and every
    /// declared limit must lie within its ceiling. The classes must
    /// partition the family, the merges of each class must form a spanning
    /// tree, and each pair of classes must be separated or unresolved
    /// exactly once. No unresolved pair may be merged or separated, the
    /// walk records must match the merges, and the status must be
    /// `complete` exactly when no pair is unresolved. Then every member
    /// rebuilds, every reading recomputes to its stored form, every
    /// separation rebuilds a [`DerivedInequivalenceWitness`] with the
    /// stored values, and every merge replays to a target whose
    /// [`AlgebraIsomorphism`] onto the member verifies.
    ///
    /// Cancellation is checked before each member and each merge.
    pub fn verify(
        &self,
        limits: DerivedAtlasVerifyLimits,
        control: &ComputationControl,
    ) -> Result<DerivedAtlasVerification, DerivedAtlasError> {
        match self.replay(limits, control) {
            Ok(classification) => Ok(DerivedAtlasVerification::Verified(Box::new(
                VerifiedDerivedAtlas {
                    artifact: self.clone(),
                    classification,
                },
            ))),
            Err(Halt::Stopped(cut)) => Ok(DerivedAtlasVerification::Stopped(cut)),
            Err(Halt::Rejected(error)) => Err(error),
        }
    }

    fn replay(
        &self,
        limits: DerivedAtlasVerifyLimits,
        control: &ComputationControl,
    ) -> Result<DerivedClassification, Halt> {
        if !self.has_valid_fingerprint() {
            return Err(DerivedAtlasError::FingerprintMismatch.into());
        }
        if let Some(cut) = self.declared_cut(&limits) {
            return Err(Halt::Stopped(cut));
        }
        self.check_structure()?;
        let family = self.rebuild_family()?;
        let mut budget = Budget {
            control,
            completed: 0,
            limit: limits.replay.max_work_units,
        };
        let invariants = self.recompute(&family, &mut budget)?;
        let separations = self.rebuild_separations(&invariants)?;
        let classes = self.replay_classes(&family, &mut budget)?;
        control.update(ProgressStage::Complete, budget.completed, budget.completed);
        Ok(DerivedClassification {
            family,
            limits: self.limits.clone(),
            groups: groups_by_key(&invariants, &self.invariants),
            invariants,
            classes,
            separations,
            unresolved: self.unresolved.clone(),
            walks: self.walks.clone(),
        })
    }

    fn declared_cut(&self, limits: &DerivedAtlasVerifyLimits) -> Option<ArtifactVerificationCut> {
        let (invariants, bar) = (&self.limits.invariants, &self.limits.invariants.bar);
        let member = self.members.iter().map(Certificate::declared_dimension);
        let tilting = self.limits.discovery.tilting;
        let replay = declared_limits(tilting, &self.limits.target, &limits.replay);
        let own = [
            (
                "hochschild_degree",
                invariants.hochschild_degree as u64,
                limits.max_hochschild_degree,
            ),
            (
                "max_tensor_tuples",
                bar.max_tensor_tuples,
                limits.max_tensor_tuples,
            ),
            (
                "max_cochain_dim",
                bar.max_cochain_dim,
                limits.max_cochain_dim,
            ),
            (
                "bar.max_matrix_entries",
                bar.max_matrix_entries,
                limits.max_bar_matrix_entries,
            ),
            (
                "bar.max_work_units",
                bar.max_work_units,
                limits.max_bar_work_units,
            ),
            (
                "member_dimension",
                member.max().unwrap_or(0),
                limits.max_member_dimension,
            ),
        ];
        exceeded(own.into_iter().chain(replay))
    }

    /// The family is not empty, each member has a row, and the classes
    /// partition the family.
    fn check_family(&self) -> Result<(), DerivedAtlasError> {
        let size = self.members.len();
        if size == 0 {
            return Err(DerivedAtlasError::EmptyFamily);
        }
        if self.invariants.len() != size {
            let (rows, members) = (self.invariants.len(), size);
            return Err(DerivedAtlasError::RowCount { rows, members });
        }
        match partitions(size, self.classes.iter().map(|class| class.members())) {
            true => Ok(()),
            false => Err(DerivedAtlasError::Partition),
        }
    }

    /// The spanning trees keep every merge inside its class, and the pair
    /// coverage lists each pair once, so no unresolved pair is merged or
    /// separated.
    fn check_structure(&self) -> Result<(), DerivedAtlasError> {
        self.check_family()?;
        for (index, class) in self.classes.iter().enumerate() {
            let edges = class
                .merges
                .iter()
                .map(|merge| (merge.source, merge.member));
            if !spanning_tree(&class.members, edges) {
                return Err(DerivedAtlasError::SpanningTree { class: index });
            }
        }
        let separated = self.separations.iter().map(|separation| separation.classes);
        if !covers_pairs(self.classes.len(), separated, &self.unresolved) {
            return Err(DerivedAtlasError::PairCoverage);
        }
        self.check_walks()?;
        let complete = self.status == ClassificationStatus::Complete;
        match complete == self.unresolved.is_empty() {
            true => Ok(()),
            false => Err(DerivedAtlasError::Status),
        }
    }

    /// The class of each member. The classes partition the family.
    fn class_of(&self) -> Vec<usize> {
        let mut class_of = vec![0; self.members.len()];
        for (class, members) in self.classes.iter().enumerate() {
            for &member in members.members() {
                class_of[member] = class;
            }
        }
        class_of
    }

    /// The walks run in member order, each walk added exactly the merges
    /// with a recipe from its member, and each unresolved pair lists every
    /// walk from a member of either class.
    ///
    /// Runs after the spanning-tree and pair checks, so every merge source
    /// is a member and every unresolved class exists.
    fn check_walks(&self) -> Result<(), DerivedAtlasError> {
        let merges = self.classes.iter().flat_map(|class| class.merges());
        let mut from = vec![0usize; self.members.len()];
        for merge in merges.filter(|merge| !merge.recipe.is_empty()) {
            from[merge.source] += 1;
        }
        let walks = &self.walks;
        let increasing = walks.windows(2).all(|pair| pair[0].member < pair[1].member);
        let counted = walks.iter().all(|w| from.get(w.member) == Some(&w.merges));
        let covered = || walks.iter().map(|w| from[w.member]).sum::<usize>();
        if !(increasing && counted && covered() == from.iter().sum::<usize>()) {
            return Err(DerivedAtlasError::Walks);
        }
        let class_of = self.class_of();
        let mut per_class = vec![0usize; self.classes.len()];
        walks
            .iter()
            .for_each(|walk| per_class[class_of[walk.member]] += 1);
        for pair in &self.unresolved {
            let (left, right) = pair.classes;
            let in_pair = |&walk: &usize| {
                walks.get(walk).is_some_and(|walk| {
                    let class = class_of[walk.member];
                    class == left || class == right
                })
            };
            let listed = pair.walks.len() == per_class[left] + per_class[right]
                && pair.walks.windows(2).all(|w| w[0] < w[1])
                && pair.walks.iter().all(in_pair);
            if !listed {
                let classes = pair.classes;
                return Err(DerivedAtlasError::UnresolvedWalks { classes });
            }
        }
        Ok(())
    }

    fn rebuild_family(&self) -> Result<Vec<Arc<Algebra>>, DerivedAtlasError> {
        PrimeField::new(self.field).map_err(DerivedAtlasError::Field)?;
        let rebuild = |(member, certificate): (usize, &Certificate)| {
            if certificate.field != self.field {
                let found = certificate.field;
                return Err(DerivedAtlasError::FieldMismatch { member, found });
            }
            let verified = verify_certificate(certificate.clone())
                .map_err(|error| DerivedAtlasError::Verify { member, error })?;
            Algebra::from_verified(verified)
                .map_err(|error| DerivedAtlasError::Algebra { member, error })
        };
        self.members.iter().enumerate().map(rebuild).collect()
    }

    fn recompute(
        &self,
        family: &[Arc<Algebra>],
        budget: &mut Budget,
    ) -> Result<Vec<DerivedInvariants>, Halt> {
        let mut records = Vec::with_capacity(family.len());
        for (member, algebra) in family.iter().enumerate() {
            budget.charge(0)?;
            let record =
                DerivedInvariants::compute(algebra, self.limits.invariants, budget.control)
                    .map_err(|error| DerivedAtlasError::Invariant { member, error })?;
            budget.charge(0)?;
            let stored = &self.invariants[member];
            let differs = |&&kind: &&DerivedInvariantKind| {
                AtlasReading::from_reading(record.reading(kind)).as_ref()
                    != Some(&stored[kind as usize])
            };
            if let Some(&kind) = DerivedInvariantKind::ALL.iter().find(differs) {
                return Err(DerivedAtlasError::ReadingMismatch { member, kind }.into());
            }
            records.push(record);
        }
        Ok(records)
    }

    fn rebuild_separations(
        &self,
        invariants: &[DerivedInvariants],
    ) -> Result<Vec<ClassSeparation>, DerivedAtlasError> {
        let rebuild = |separation: &AtlasSeparation| {
            self.witness(separation, invariants)
                .map(|witness| ClassSeparation {
                    classes: separation.classes,
                    members: separation.members,
                    witness,
                })
                .ok_or(DerivedAtlasError::Separation {
                    classes: separation.classes,
                })
        };
        self.separations.iter().map(rebuild).collect()
    }

    /// The witness of `separation` from the recomputed records, when its
    /// members lie in its classes and its values are the recomputed ones.
    fn witness(
        &self,
        separation: &AtlasSeparation,
        invariants: &[DerivedInvariants],
    ) -> Option<DerivedInequivalenceWitness> {
        let (left, right) = separation.members;
        let (left_class, right_class) = separation.classes;
        let holds = |class: usize, member| self.classes[class].members.binary_search(&member);
        let inside = holds(left_class, left).is_ok() && holds(right_class, right).is_ok();
        let witness = inside.then(|| {
            DerivedInequivalenceWitness::new(&invariants[left], &invariants[right], separation.kind)
        })?;
        let witness = witness.ok()?;
        let stored = (&separation.left, &separation.right);
        let values = (
            &encode_value(witness.left_value()),
            &encode_value(witness.right_value()),
        );
        (stored == values).then_some(witness)
    }

    fn replay_classes(
        &self,
        family: &[Arc<Algebra>],
        budget: &mut Budget,
    ) -> Result<Vec<DerivedClass>, Halt> {
        let mut classes = Vec::with_capacity(self.classes.len());
        for class in &self.classes {
            let merges = class.merges().iter();
            let merges = merges.map(|merge| self.replay_merge(family, merge, budget));
            classes.push(DerivedClass {
                members: class.members.clone(),
                merges: merges.collect::<Result<_, _>>()?,
            });
        }
        Ok(classes)
    }

    /// Replays the recipe of `merge` and checks its isomorphism. An empty
    /// recipe is a duplicate: the target is the source member itself.
    fn replay_merge(
        &self,
        family: &[Arc<Algebra>],
        merge: &AtlasMerge,
        budget: &mut Budget,
    ) -> Result<DerivedMerge, Halt> {
        budget.charge(merge.recipe.len())?;
        let (source, member) = (merge.source, merge.member);
        let algebra = &family[source];
        let (path, target) = if merge.recipe.is_empty() {
            (DerivedEquivalencePath::identity(algebra), algebra.clone())
        } else {
            let edge = replay_edge(algebra, &merge.recipe, &self.limits)
                .ok_or(DerivedAtlasError::Replay { source, member })?;
            (edge.path(), edge.target().clone())
        };
        let rejected = DerivedAtlasError::Isomorphism { source, member };
        let isomorphism = AlgebraIsomorphism {
            source: target,
            target: family[member].clone(),
            vertex_map: merge.vertex_map.clone(),
            arrow_images: self.coordinates(merge).ok_or(rejected.clone())?,
        };
        if !isomorphism.verify() {
            return Err(rejected.into());
        }
        Ok(DerivedMerge {
            source,
            member,
            recipe: merge.recipe.clone(),
            path,
            isomorphism,
        })
    }

    /// The arrow images as field elements, or `None` when a residue lies
    /// outside `0..p`.
    fn coordinates(&self, merge: &AtlasMerge) -> Option<Vec<Vec<Fp>>> {
        let field = PrimeField::new(self.field).ok()?;
        let element = |&value: &u64| (value < self.field).then(|| field.elem(value as i64));
        let image = |values: &Vec<u64>| values.iter().map(element).collect::<Option<Vec<_>>>();
        merge.arrow_images.iter().map(image).collect()
    }
}