RefacteLibrary & Essays / Reading guide
Background reading paths
These routes navigate the retained studies. Begin with the current mechanism calculi when you want the operative constructions.
Mechanism calculi →The new hierarchy
Follow the operation
These routes connect a small example to a more demanding calculation. Follow what the change of viewpoint lets you do, and what has to be preserved when the setting changes. The mechanism calculi collect the individual constructions; the long studies supply their proofs and further reference chapters.
- Design quantities with controlled updates. A weighted difference separates a recurrence. Root coordinates separate the motions of a polynomial’s roots. Tensor chains require constructing a backwards move and proving that the resulting chains form a basis.
- Turn a diagram into a calculation. An incidence matrix gives exact counts and flows. The boundary-map study develops the common edge operation and its proofs.
- Retain the residual and test the repair. A square-zero increment makes a first-order rule exact. Elimination reveals a cubic interaction hidden in quadratic equations. The formal-logarithm calculation proves that a particular residual cannot be removed by any permitted correction.
- Make comparison independent of choices. Six Elements, One Comparison replaces chosen representatives by a relation. The quotient study first proves basis exchange and the direct group comparison, then generalises the latter to refinement.
- Turn words and coordinate choices into paths. Subgroup folding makes membership a path test. Tree gauge removes disposable edge labels and retains circuit products. Transporter traversal keeps track of components, stabilizers, and the words witnessing a comparison.
Reuse a construction
A projector can solve different problems
Weighted root sums and symmetric graph modes use the same finite-character calculation. Their readouts differ: multiplication constrains radicals in one case, while a determinant counts trees in the other.
Retain a constraint before changing coefficients
A simpler description must still support the operation you want to perform. The circle fibre and the ramified derivative show why specializing a complex can retain information that specializing its ordinary output loses. These are optional module calculations with different inputs.
Find the limit of a proposed simplification
Coordinate repair succeeds to one order and fails at the next in characteristic three. Identity and shear share eigenvalues but have different iterates. Chain probes recover the additional operator data. Each example identifies the particular information its question requires.
Each connection needs its own proof: shared moves do not make the mathematical settings interchangeable. Chapters on families, bundles, attachments, and coherent identifications state the additional geometric or homotopy-theoretic input they require. Choose the next chapter by the question left open by the calculation.
Root and operator routesGraph routesDerivative routesComparison routes
From mathematical examples to understanding and judgment
The expositions develop the calculations. This route moves from mathematical comparisons to the conditions of inquiry and its institutions. Each essay can be read independently.
- What a New Proof Makes Possible asks what another proof makes possible when its conclusion is already known: a procedure, an estimate, a generalization, or a reusable mechanism.
- When a Description Becomes a Verdict asks whether a description retains enough information for the particular conclusion drawn from it. Its mathematical comparisons prepare a discussion of explanation, expertise, and the scope of judgment.
- Mathematical Life in the Age of AI asks how understanding is cultivated and sustained, and how assistance, institutions, credit, and shared work affect the freedom to inquire. Its account of intellectual life develops its own evidence and arguments.
- What Sustains Mathematical Expertise asks what continuing human understanding can support in paid roles and institutions, and how independent expertise is renewed when fewer experts are needed in individual encounters.
- When Accountability Stops Being Reciprocal asks what happens when challenging a moral judgment becomes evidence against the challenger, and what permits scrutiny and correction. It draws on institutional cases, organizing testimony, and research on accountability.
- The Performance of Depth traces how credentials, performance measures, prestige, and research incentives acquire institutional force, and how they can reproduce intellectual conformity over time. Its historical argument distinguishes the movement of research resources from the movement of independent judgment.
Follow a specific example
A projection that measures the error
In What the connection between proofs reveals, the proof essay retains the orthogonal residual behind Cauchy–Schwarz and least squares. Boundary Map §3.4 uses orthogonality to identify the minimum energy of a current and the residual energy of another feasible current. The bridge uses linear algebra and inner products.
Ask what the description determines
Description §2 compares the identity and a shear: equal eigenvalues answer some questions and leave others undecided. Fourier §12.3 continues that exact example with the nilpotent module structure retained by the circle transform. Description §3 adds a different test involving induced maps. For an optional advanced comparison, Derivative §11 gives equal pointwise tangent complexes with different higher operations; it uses graded algebra and characteristic-zero formal deformation theory.
Quotients, Refinement, and Reconstruction supplies an algebraic route into the same question: equal simple-factor lists can conceal different extensions. Its probe calculations recover nilpotent chain lengths, giving a companion to the Fourier example.
Choose a workable next calculation
Mathematical Life’s account of becoming capable considers the means to understand and test an argument. The four mathematical entries above and their individual routes give prerequisites and stopping points. To examine a retained extension directly, its concluding section computes a relative logarithm. An advanced continuation is Boundary Map §9.3: an elliptic attachment changes reconstructed symmetry. The two extensions have different pure pieces, and the attachment calculation uses its stated motivic comparison hypotheses.
Film and interpretation
The Authority of a Vision asks how learned competence, knowledge, and collective hope become claims to command in Villeneuve’s Dune. It follows a related question about knowledge and authority through the films’ characters and form. Its companion Mathematical Life in the Age of AI considers the purposes and conditions of inquiry. The film essay is an independent route and contains spoilers for both films.
Routes through the polynomial and Fourier study
A complete cubic calculation
Start with centering (§4), then the root coordinates (§3) and Cardano (§5). The complete calculation ends at the worked example in §5.4: recover the two cubes, choose one cube root, and obtain the other from the mixed-product relation. The quartic (§§6–8) is a second application. The cover construction (§2) and radical-choice geometry (§10) explain the same operations in families; read them when that is the question you want to pursue.
An operator calculation with a complete endpoint
§12 constructs the transform from one matrix, compares identity and shear, and calculates a derived fibre. It is a complete operator study using Laurent-polynomial modules and two-term complexes. Continue to §13 to ask a new question about vector bundles. For a finite-dimensional companion, Quotients §10 reconstructs nilpotent operators from chain data.
Exponent arithmetic becomes polynomial inversion
§9 develops the two-frequency family; §9.4 uses it to invert a polynomial map over a finite field. The calculation is finished once the inverse exponent is found and transported back. Independently, §14 uses characters to count points and §15 studies a cancellation bound. Those later results use their stated geometric and cohomological input.
Routes through the boundary-map study
Calculate from the incidence matrix
§§1 and 3. The graph companion builds an explicit incidence matrix. In the study, §1 identifies cycles and §3 calculates counts and flows. The examples give a complete finite route. Section 3 proves the matrix-tree identity by incidence minors and Cauchy–Binet, and the joint edge probabilities by comparing determinant coefficients. §2 offers a separate determinant-line and gluing account.
Change the coefficients, keep the boundary
§§4–6. The integral lattice, graph Jacobian, and higher-cell calculations ask how changing coefficients changes counts and probability laws. Torsion contributes genuine information. These sections extend the boundary calculation under their stated hypotheses.
Cancel, normalize, or eliminate
§§7–11. §7 derives chromatic coefficients by cancellation and computes a seven-coordinate intersection form. §§8–9 gives a tree-gauge normal form, then compares branch matchings and period columns. §10 eliminates an edge parameter from the graph polynomial. §11 integrates parameters and tracks the resulting logarithm. Choose the calculation whose output you need; §§13–15 identify the further Hodge and motivic theorems.
Routes through the derivative study
Make first-order change exact
§§1–5. The first-order companion shows what setting the square of an increment to zero makes exact. Read §§1–5 for the geometric product rule, differentials, and tangent probes. Finish at §5 with the connection back to the analytic derivative.
Test which correction exists
§§6–9. §6 changes the coefficients; §7 distinguishes Frobenius from Artin–Schreier behaviour. §§8–9 retain the equation and calculate a failed lift. The coordinate-repair companion and formal logarithm study ask a related, separately specified correction problem.
Calculate the interaction beyond first order
§§10–13. §10 computes overlap and monomial data. §11 derives a hidden cubic by elimination and follows its coefficient recursion. §12 separates a tuple into its total and remaining labels and calculates the face rules; a separate divided-power calculation explains factorial localization. §13 constructs the mixed cell, tests it by a cup product, and calculates its path fiber. Each route states the extra background its later identifications require.
Background volumes and their operative routes
The four longer studies are retained as background. The current mechanism-calculi hub links directly to the revised chain, elimination, gauge and coupling arguments, alongside their stated dependencies.
- Fourier, Symmetry, and Reconstruction
- What a Boundary Map Can Prove
- What a Derivative Retains
- Quotients, Refinement, and Reconstruction
- Derive a weighted difference for a recurrence
- Build a graph calculation from its edges
- Make a first-order increment exact
For two shorter companion proofs, follow Make a composition law visible.
Turn choices into a canonical comparison
Begin with the same six elements throughout. A relation keeps every permitted output; removing the two ambiguities makes a well-defined isomorphism. The comparison then extends to a grid of decompositions. Other finite routes recover operators or count flags.
Current research
A cyclic entry point
Begin with the cyclic example in Finite generation of permutation twisted cohomology and Example 6.4. Quotients §10 studies nilpotent operators; Derivative §6 gives a companion calculation with a derived fiber. The full paper uses modular representation theory and tensor-triangular geometry.
Repair a coordinate and test its limit
Try to turn nonlinear addition into ordinary addition. The first correction works; the next is blocked in characteristic three. Begin with the coefficient calculation, then use the coefficient-and-filtration study to organise its obstruction in a filtered complex.
Make a composition law visible
Compare two ways of exposing the same polynomial constraint. A free-module expansion gives a direct remainder calculation; generic fibres and Frobenius give a second route with different prerequisites.
Turn a numerical question into exact arithmetic
Traces and a recurrence turn rounding into congruences. Factorial tests and valuations produce a prime selector. The first is a finite modular calculation; the second is an exact formula whose purpose is separate from efficient prime search.
Make local control survive aggregation
A product difference becomes separate oscillation bounds. Compactness produces a finite partition, and a measurable weight changes the scale point by point. Follow what each construction makes controllable and which hypotheses permit the passage to a global statement.
Other routes through the site
- Browse the full mathematical library, or follow the shorter paths through polynomial composition, exact arithmetic, and analysis.
- Supplementary sources collect formalization files and their scope notes. The research papers include current work in permutation twisted cohomology and earlier papers, with versions, publication details, and corrections.
- Interests offers personal pursuits, with its own entries and photographs. These can be explored independently of the mathematical and essay routes.
- About introduces the current inquiry, writing, background, and correspondence.