Lattice theory of torsion classes: Beyond 𝜏-tilting theory
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
The aim of this paper is to establish a lattice theoretical framework to study the partially ordered set <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="sans-serif t sans-serif o sans-serif r sans-serif s upper A"> <mml:semantics> <mml:mrow> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi mathvariant="sans-serif">t</mml:mi> <mml:mi mathvariant="sans-serif">o</mml:mi> <mml:mi mathvariant="sans-serif">r</mml:mi> <mml:mi mathvariant="sans-serif">s</mml:mi> </mml:mrow> <mml:mi>A</mml:mi> </mml:mrow> <mml:annotation encoding="application/x-tex">\mathsf {tors} A</mml:annotation> </mml:semantics> </mml:math> </inline-formula> of torsion classes over a finite-dimensional algebra <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper A"> <mml:semantics> <mml:mi>A</mml:mi> <mml:annotation encoding="application/x-tex">A</mml:annotation> </mml:semantics> </mml:math> </inline-formula> . We show that <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="sans-serif t sans-serif o sans-serif r sans-serif s upper A"> <mml:semantics> <mml:mrow> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi mathvariant="sans-serif">t</mml:mi> <mml:mi mathvariant="sans-serif">o</mml:mi> <mml:mi mathvariant="sans-serif">r</mml:mi> <mml:mi mathvariant="sans-serif">s</mml:mi> </mml:mrow> <mml:mi>A</mml:mi> </mml:mrow> <mml:annotation encoding="application/x-tex">\mathsf {tors} A</mml:annotation> </mml:semantics> </mml:math> </inline-formula> is a complete lattice which enjoys very strong properties, as <italic>bialgebraicity</italic> and <italic>complete semidistributivity</italic> . Thus its Hasse quiver carries the important part of its structure, and we introduce the brick labelling of its Hasse quiver and use it to study lattice congruences of <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="sans-serif t sans-serif o sans-serif r sans-serif s upper A"> <mml:semantics> <mml:mrow> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi mathvariant="sans-serif">t</mml:mi> <mml:mi mathvariant="sans-serif">o</mml:mi> <mml:mi mathvariant="sans-serif">r</mml:mi> <mml:mi mathvariant="sans-serif">s</mml:mi> </mml:mrow> <mml:mi>A</mml:mi> </mml:mrow> <mml:annotation encoding="application/x-tex">\mathsf {tors} A</mml:annotation> </mml:semantics> </mml:math> </inline-formula> . In particular, we give a representation-theoretical interpretation of the so-called <italic>forcing order</italic> , and we prove that <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="sans-serif t sans-serif o sans-serif r sans-serif s upper A"> <mml:semantics> <mml:mrow> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi mathvariant="sans-serif">t</mml:mi> <mml:mi mathvariant="sans-serif">o</mml:mi> <mml:mi mathvariant="sans-serif">r</mml:mi> <mml:mi mathvariant="sans-serif">s</mml:mi> </mml:mrow> <mml:mi>A</mml:mi> </mml:mrow> <mml:annotation encoding="application/x-tex">\mathsf {tors} A</mml:annotation> </mml:semantics> </mml:math> </inline-formula> is <italic>completely congruence uniform</italic> . When <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper I"> <mml:semantics> <mml:mi>I</mml:mi> <mml:annotation encoding="application/x-tex">I</mml:annotation> </mml:semantics> </mml:math> </inline-formula> is a two-sided ideal of <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper A"> <mml:semantics> <mml:mi>A</mml:mi> <mml:annotation encoding="application/x-tex">A</mml:annotation> </mml:semantics> </mml:math> </inline-formula> , <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="sans-serif t sans-serif o sans-serif r sans-serif s left-parenthesis upper A slash upper I right-parenthesis"> <mml:semantics> <mml:mrow> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi mathvariant="sans-serif">t</mml:mi> <mml:mi mathvariant="sans-serif">o</mml:mi> <mml:mi mathvariant="sans-serif">r</mml:mi> <mml:mi mathvariant="sans-serif">s</mml:mi> </mml:mrow> <mml:mo stretchy="false">(</mml:mo> <mml:mi>A</mml:mi> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mo>/</mml:mo> </mml:mrow> <mml:mi>I</mml:mi> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> <mml:annotation encoding="application/x-tex">\mathsf {tors} (A/I)</mml:annotation> </mml:semantics> </mml:math> </inline-formula> is a lattice quotient of <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="sans-serif t sans-serif o sans-serif r sans-serif s upper A"> <mml:semantics> <mml:mrow> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi mathvariant="sans-serif">t</mml:mi> <mml:mi mathvariant="sans-serif">o</mml:mi> <mml:mi mathvariant="sans-serif">r</mml:mi> <mml:mi mathvariant="sans-serif">s</mml:mi> </mml:mrow> <mml:mi>A</mml:mi> </mml:mrow> <mml:annotation encoding="application/x-tex">\mathsf {tors} A</mml:annotation> </mml:semantics> </mml:math> </inline-formula> which is called an <italic>algebraic quotient</italic> , and the corresponding lattice congruence is called an <italic>algebraic congruence</italic> . The second part of this paper consists in studying algebraic congruences. We characterize the arrows of the Hasse quiver of <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="sans-serif t sans-serif o sans-serif r sans-serif s upper A"> <mml:semantics> <mml:mrow> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi mathvariant="sans-serif">t</mml:mi> <mml:mi mathvariant="sans-serif">o</mml:mi> <mml:mi mathvariant="sans-serif">r</mml:mi> <mml:mi mathvariant="sans-serif">s</mml:mi> </mml:mrow> <mml:mi>A</mml:mi> </mml:mrow> <mml:annotation encoding="application/x-tex">\mathsf {tors} A<
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it