Spectral Operadic Calculus: Norm-Analytic Functor Calculus
Abstract: Classical spectral theory provides powerful tools for analyzing linear operators, but does not extend naturally to nonlinear or compositional settings. In particular, there is no general way to transport spectral invariants in a functorial manner across structured categories. In earlier work, we showed that this failure is fundamental and introduced an operadic notion of spectrum that provides a canonical replacement. In this paper, we develop the analytic consequences of this construction and show that the operadic spectrum acts as a control parameter for a calculus of functors. We establish a criterion for polynomial behavior based on higher cross-effects, and prove convergence results for the associated Taylor tower, including explicit exponential error bounds. We further show that the derivatives of a functor form a structured algebraic object with symmetric and operadic features, and satisfy a chain rule governed by a natural composition operation (operadic plethysm). This leads to a reconstruction theorem, showing that analytic functors are completely determined by their derivative data, and hence to a classification in terms of algebraic structures. Compared with classical Goodwillie calculus, which is governed by homotopy-theoretic conditions, the present framework is analytic and quantitative in nature, providing explicit control over convergence and approximation. These results place functor calculus in a setting that combines spectral ideas, analytic methods, and operadic algebra, and suggest further connections with deformation theory and geometry.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Explain it Like I'm 14
Spectral Operadic Calculus: A Simple Explanation
What is this paper about?
This paper builds a new kind of “calculus” for understanding complicated mathematical machines called functors (think: transformers that take one kind of structured object and turn it into another). In normal math, “spectral theory” uses eigenvalues (like the notes a piano string can play) to study linear actions. But when things get nonlinear and compositional (you plug outputs of one machine into another), the old spectral tools break down.
The paper fixes this by introducing a new spectral fingerprint—called the operadic spectrum—that still works when you compose things. Then it shows how this new spectrum controls a whole calculus: you can approximate complicated functors by simpler “polynomials,” measure errors, and even rebuild the original functor from its “derivatives,” all with precise, number-based guarantees.
What questions does the paper try to answer?
Here are the key questions, phrased simply:
- Can we create a “spectrum” that still behaves correctly when we combine and compose complex structures?
- Can this spectrum tell us when a functor behaves like a polynomial of degree (i.e., is simple up to a certain level)?
- Can we approximate any nice (analytic) functor by a “Taylor series” (a tower of polynomial approximations) with guaranteed error bounds?
- Do the “derivatives” of functors obey a chain rule (like in ordinary calculus) when we compose functors?
- If we know all the derivatives of a functor (plus how they fit together), can we completely reconstruct the functor?
How do the authors approach it? (With simple analogies)
To keep things approachable, think of the main ideas like this:
- Operad: a rulebook for how to plug multiple pieces together, like an instruction booklet for Lego that tells you how smaller builds snap into bigger ones.
- Functor: a machine that takes in a structured object (like a Lego build) and outputs another object, doing so in a rule-following way.
- Classical spectrum: for a linear action, its “notes” (eigenvalues). But classical spectra don’t behave nicely when you keep plugging machines into each other.
- Operadic spectrum: a new, fixed-up spectral fingerprint that does behave nicely under composition. The authors previously showed you can’t just reuse the old spectrum; you need a “residue correction” (think: a universal patch) to make it work.
- Spectral size: how big the spectrum is (like the loudest note). This becomes the “knob” that controls how big the output of a functor can be.
- Admissible functor: a functor whose output size is bounded by a function of the spectral size of its input. In other words, if the input’s spectrum is small, the output will be controlled too.
- Cross-effects: these measure how much a functor’s output depends on mixing inputs together. For example, is the effect of turning on two inputs together just the sum of doing each separately, or is there an interaction term? Cross-effects capture those interaction terms at each level.
- Taylor tower: like a Taylor series in calculus (constant + linear + quadratic + ...), the paper builds a layered approximation of a functor by polynomial-like pieces. Each layer accounts for higher-order interactions.
- Chain rule (Faà di Bruno): how derivatives of a composite machine relate to derivatives of the parts. Here, composition follows operad rules (called plethysm), so the chain rule has an operadic flavor.
- Radius of convergence: how far you can go (how big the spectrum can be) while the Taylor approximation still works well.
Overall method: define the operadic spectrum; use it to control sizes (norms); measure nonlinearity via cross-effects; define a Taylor-like expansion; prove convergence with explicit error bounds; show the derivatives obey an operadic chain rule; and finally, prove you can reconstruct the whole functor from its derivative data.
What are the main results, and why do they matter?
The paper’s core theorems can be understood as four big wins:
- Theorem A (Detecting polynomial behavior by spectrum)
- Message: A functor behaves like a polynomial of degree at most if and only if its -st interaction term (its -st cross-effect) is spectrally invisible (its operadic spectrum is just ).
- Why it matters: You can tell “how polynomial” a functor is by checking its spectral fingerprint—no need for heavy topological conditions.
- Theorem B (Guaranteed approximation with explicit error bounds)
- Message: If a functor is “spectrally analytic,” then its Taylor tower converges with exponential-type error control. Roughly:
- Error after layers ≤ constant × (number < 1) × (spectral size).
- There’s a precise radius of convergence (like in power series) computed from the sizes of the derivatives.
- Why it matters: This turns a qualitative idea (“it converges”) into quantitative guarantees (“it converges this fast, up to this radius”).
- Theorem C (Chain rule for composed functors)
- Message: The derivatives of a composite functor follow a clean algebraic rule (an operadic version of the Faà di Bruno formula). This shows the “derivative structure” is stable under composition.
- Why it matters: It’s the backbone of any calculus—composition behaves predictably.
- Theorem D (You can rebuild the functor from its derivatives)
- Message: If a functor is spectrally analytic, then knowing all its derivatives (plus how they fit together algebraically) completely determines it. This gives a neat classification theorem: analytic functors ↔ certain algebraic data structures.
- Why it matters: It’s like saying: the Taylor series (with the right rules) uniquely identifies the function.
The paper also compares this new framework with Goodwillie calculus (a famous earlier theory):
- Goodwillie’s approach is topological and qualitative—great for homotopy theory but not designed for numerical control.
- This paper’s approach is analytic and quantitative—it gives explicit bounds, radii of convergence, and a full algebraic classification. For example, the exponential functor (like “exp”) is not analytic in Goodwillie’s sense but is “entire” here (it behaves nicely everywhere in this framework).
What does this mean in practice?
Here’s why this is exciting:
- It unifies three big areas: spectral theory (studying “notes”/eigenvalues), operadic algebra (composing many inputs in structured ways), and functor calculus (approximating complex machines by simpler layers).
- It gives practical tools: if you can bound the spectral size of your input, you get guaranteed control over approximations, errors, and convergence.
- It’s compositional: complex systems built from smaller parts can be analyzed because the chain rule works operadically.
- It opens doors to geometry and physics: the paper hints at links to deformation theory (studying small changes), higher category theory, and even structures seen in mathematical physics.
Final takeaway
The authors propose a new, spectrum-driven calculus for complex mathematical machines. The operadic spectrum acts like a “universal control knob” that:
- detects when a functor is polynomial-like,
- ensures Taylor-style approximations converge with explicit, exponential-quality error bounds,
- provides a chain rule for composed systems,
- and allows complete reconstruction from derivative data.
In short, they transform a previously qualitative theory into a precise, quantitative, and compositional framework—making it possible to analyze, approximate, and classify functors much like we do with functions in ordinary calculus.
Knowledge Gaps
Below is a single, consolidated list of concrete knowledge gaps, limitations, and open questions left unresolved by the paper. Each item is phrased to suggest actionable directions for future work.
- Foundations of the operadic spectrum:
- Specify precise hypotheses on the ambient category M and operad P under which the “analytic realization” of σ_P(A) as a subset of C exists, is unique, and is independent of auxiliary choices.
- Give an explicit construction and properties of the operadic residue object O_Pres in the present normed setting (beyond Part I), including functoriality, completeness, and stability under limits/colimits.
- Clarify when σ_P(A) reduces to the classical spectrum for standard operads (Assoc, Com, Lie) and identify counterexamples where it differs; provide criteria that recover or fail classical spectral properties (e.g., spectral radius formula).
- Norm structures and categorical prerequisites:
- Develop a coherent framework that reconciles Banach enrichment, stability, and homotopy limits: provide model/infinity-categorical conditions ensuring that total homotopy fibers (tfib) exist and interact well with norms.
- Identify broad classes of normed symmetric monoidal categories where the norm is faithful on objects and explain how to adapt results when faithfulness fails.
- Clarify the availability and norm-compatibility of coproducts in the categories of P-algebras used (e.g., free products of C*-algebras) and how this impacts the definition of cross-effects.
- Spectral size and quantitative control:
- Replace the non-constructive “minimal bound under all admissible realizations” in the definition of spectral size with a canonical, computable norm; prove functoriality, stability under limits, and comparison inequalities.
- Provide verifiable sufficient conditions ensuring a given functor is (linearly) admissible and methods to estimate the admissibility constant C_F from structural data of F.
- Spectral scaling and functional calculus:
- State precise conditions under which the operadic holomorphic functional calculus exists for P-algebras in M (domains of holomorphy, continuity, compatibility with tensor products) and prove the Spectral Mapping Theorem in this setting.
- Extend scaling and functional calculus results to real or non-Archimedean fields and identify the changes needed in the analytic control theory.
- Cross-effects and excision criterion:
- Provide general criteria ensuring the “spectral multilinearity” of cr_{n+1}F; characterize classes of functors where this holds or fails, and study how failure affects norm-excision.
- Establish checkable conditions guaranteeing the “spectral zero-control” inequality used in Theorem:Spectral Criterion for Norm-Excision, and demonstrate these conditions in canonical examples.
- Taylor tower, convergence, and radii:
- Define canonical norms on the spectral derivatives ∂_n{spec}F used in the Cauchy–Hadamard radius R_F and justify that the limsup is independent of model choices; provide procedures to compute/estimate R_F in practice.
- Analyze the dependence of the exponential error constants (C, ρ) on F, n, and the input; determine whether uniform bounds exist on natural subclasses of functors or inputs.
- Compare the spectral Taylor tower with the Goodwillie tower: characterize when they coincide (or diverge), and determine whether Goodwillie analyticity implies spectral analyticity (or conversely) under additional hypotheses.
- Algebraic structure of derivatives and operadic plethysm:
- Make precise the algebraic category of “integrable derivative algebras” (DerAlg_int): specify objects, morphisms, coherence data, and integrability constraints; prove completeness and cocompleteness where needed.
- Prove full coherence for the operadic Faà di Bruno chain rule (associativity, unit, and higher coherences) in the normed/analytic setting; extend to ∞-operads and homotopy-coherent symmetric sequences.
- Reconstruction and classification:
- Provide necessary and sufficient integrability criteria on a derivative algebra {∂_n{spec}F} ensuring that it integrates to a unique analytic functor; identify obstruction classes (e.g., H2-type) and give constructive integration procedures.
- Address set-theoretic and size issues in the equivalence SpecAn ≃ DerAlg_int, including existence of limits/colimits and essential surjectivity in large categories.
- Deformation theory and moduli:
- Define the cohomology theory underlying H1(∂{spec}F) rigorously (chain complexes, differentials, coefficients) and identify obstruction classes in H2 controlling deformations.
- Construct the moduli space M_spec as a genuine geometric (derived) object: specify atlases, representability, derived enhancements, and compare to known derived stacks in higher algebra.
- Computability and examples:
- Develop algorithms or calculational frameworks to compute σ_P(A) and ∂_n{spec}F for standard operads and concrete categories (e.g., C*-algebras, Banach spaces, dg-algebras); quantify complexity and stability of computations.
- Work out fully detailed examples (identity, quadratic, exponential, spectrum functor) with explicit norms, cross-effects, derivatives, convergence radii, and error bounds; identify failure modes and boundary cases (e.g., nilpotent, non-normal inputs).
- Robustness and stability properties:
- Study the behavior of admissibility, spectral analyticity, and convergence under composition, limits/colimits, base change of operads, and monoidal functors; provide preservation and reflection theorems.
- Analyze sensitivity to perturbations: Lipschitz/Holder stability of F and its derivatives with respect to spectral size; continuity of σ_P(-) and of the Taylor tower under small spectral perturbations.
- Scope and generalizations:
- Extend the framework beyond complex scalars: real, p-adic, and non-Archimedean analytic settings; identify which parts of the theory survive and how radii/error bounds change.
- Adapt the theory to braided/colored/weighted operads, PROPs, and higher-operadic structures; clarify how σ_P(-) and plethysm generalize.
- Explore connections to topological recursion and mathematical physics suggested in the outlook by formulating precise correspondences between spectral Taylor data and recursion kernels/invariants.
- Limitations of assumptions:
- Address the reliance on spectrally controlled subclasses (e.g., normal elements) where ∥A∥ ≈ ∥σ_P(A)∥; develop techniques to handle non-normal or nilpotent phenomena without restricting the domain.
- Provide a pathway to remove or weaken faithfulness of the norm and still obtain meaningful excision and convergence statements (e.g., via seminorms or quotient completions).
Practical Applications
Below we outline practical, real-world applications enabled by this paper’s core contributions (operadic spectrum, quantitative spectral Taylor towers with error/radius-of-convergence control, operadic Faà di Bruno chain rule, and reconstruction/classification via derivative data). We group them by deployment horizon and indicate sector, possible tools/workflows, and feasibility assumptions.
Immediate Applications
These can be prototyped with current tools by specializing to concrete normed settings (e.g., Banach/C*-contexts, Lipschitz modules) and using computable proxies for the operadic spectrum (e.g., spectral radius, operator/Lipschitz norms).
- Software engineering (compositional systems): stability and performance budgeting
- Use case: Static/dynamic analysis of microservice pipelines, dataflows, or plugin ecosystems where each component is modeled as a functor and the “spectral size” of a component controls growth/stability of the whole pipeline.
- Tools/workflows: CI plugin that (i) estimates component “spectral size” via operator norm/Lipschitz constants, (ii) computes low-degree spectral Taylor approximations P_n with explicit, exponential error bars, (iii) flags when the composite stays within a certified radius of convergence.
- Assumptions/dependencies: Model components as P-algebras/functors in a normed category; use faithful norms or calibrated proxies; implement cross-effect estimators via finite differences or symbolic expansion for small n.
- AI/ML (model compression and safety): spectral linearization and pruning with guarantees
- Use case: Approximate residual/transformer blocks or diffusion steps by low-degree spectral polynomials with explicit error bounds; enforce training-time regularizers that keep “spectral size” within a target radius; prune cross-effects that are spectrally negligible.
- Tools/workflows: PyTorch/JAX extension that (i) tracks per-layer/operator spectral size (via spectral norm/Lipschitz proxies), (ii) constructs spectral Taylor surrogates P_n and monitors radius-of-convergence conditions, (iii) applies an operadic chain-rule-like composition to aggregate local error bounds.
- Assumptions/dependencies: Define a practical operad encoding network composition; approximate operadic spectrum with norms; ensure admissibility (growth controlled by spectral size); integrate with existing autodiff stacks.
- Scientific computing (surrogate modeling and solver acceleration)
- Use case: Build error-controlled polynomial surrogates of composite nonlinear operators (e.g., multi-physics couplings, operator-splitting schemes) when the input’s “spectral size” is small, with explicit exponential error decay and a computable radius of convergence.
- Tools/workflows: Julia/Python library “SpecOpCalc” to construct spectral Taylor towers, compute cross-effects for problem-specific operads (e.g., tensor/composition operads), and emit a priori error certificates.
- Assumptions/dependencies: Identify a normed symmetric monoidal model for the operators; calibrate spectral size bounds; restrict to spectrally controlled regimes; verify multilinearity of cross-effects in the target setting.
- Finance (scenario analysis and risk decomposition)
- Use case: Fast stress testing using polynomial surrogates for risk functionals on portfolios/products; quantify pairwise or higher-order cross-effects of asset classes; drop spectrally negligible interactions to speed analysis while retaining error bars.
- Tools/workflows: Risk engine plugin that (i) models risk measures as admissible functors on compositional inputs (exposures, hedges), (ii) estimates “spectral size” via volatility/correlation proxies, (iii) builds P_n approximations with explicit bounds, (iv) prioritizes risk interactions by spectral negligibility.
- Assumptions/dependencies: Map risk functionals to admissible functors; justify chosen proxies for spectral size; ensure small-signal regimes where radius-of-convergence constraints are met.
- Healthcare IT (clinical decision pipelines and CDS safety)
- Use case: Guardrails for modular clinical pipelines (ingest → normalize → model → triage) that certify updates keep the pipeline within a safe radius; reject deployments that violate convergence bounds; identify negligible cross-module interactions to simplify validation.
- Tools/workflows: “Safety guard” that computes per-module spectral proxies, assembles a spectral Taylor approximation of the full pipeline, and uses SOC error bounds for release gating.
- Assumptions/dependencies: Robust proxies (e.g., Lipschitz constants) for modules; norm-faithfulness or conservative overestimates; evidence that pipeline behaves as an admissible functor.
- Education and research tooling
- Use case: Teaching modules and research notebooks that demonstrate spectral control, Taylor towers, and operadic chain rule on concrete examples (linear algebra, polynomial functors, exponential functors).
- Tools/workflows: Open-source notebooks in Julia/Python (SageMath for algebraic components) that implement cross-effects, spectral size tracking, and convergence visualization.
- Assumptions/dependencies: Tractable toy operads and categories; numerical stability for illustrative computations.
Long-Term Applications
These require further theoretical development (e.g., domain-specific operads, algorithms for operadic spectrum), scaling, or integration with specialized hardware/software.
- Quantum information and noncommutative systems
- Use case: Certified approximations of composed quantum channels/circuits with explicit error bounds derived from a noncommutative operadic spectrum; stable circuit synthesis within a provable radius of convergence.
- Tools/products: Verification tool for quantum pipelines (NISQ/FTQC) that computes spectral control parameters for channels and uses spectral Taylor layers for error budgeting.
- Assumptions/dependencies: Efficient computation/estimation of operadic spectra in C*-algebraic contexts; operational proxies linked to diamond norms; domain-specific operads for quantum circuit composition.
- Robotics and control (compositional controller synthesis)
- Use case: Design controllers by specifying derivative data (gains, higher-order responses) and reconstructing the global behavior via the reconstruction theorem; enforce stability by bounding “spectral size” across modules.
- Tools/workflows: CAD-like “Analytic Composer” that (i) takes derivative specs for control blocks, (ii) checks operadic chain-rule composition, (iii) certifies convergence/stability regions, (iv) auto-generates code with embedded spectral monitors.
- Assumptions/dependencies: Operads capturing serial/parallel feedback structures; faithful norms on function spaces; efficient cross-effect computation for nonlinear blocks.
- Formal verification and certified software
- Use case: Proof-carrying code artifacts where compositional properties (e.g., bounded growth, convergence radius) are machine-checked using a formalization of operadic spectrum and spectral calculus in proof assistants.
- Tools/workflows: Coq/Lean libraries implementing SOC primitives (cross-effects, plethysm, derivative algebras) and tactics to certify norm-excision and convergence bounds.
- Assumptions/dependencies: Formal semantics for normed symmetric monoidal categories; verified libraries for operator norms/spectral bounds; domain encodings as P-algebras.
- Energy systems and grid operations
- Use case: Compositional stability analysis of grid components (generators, inverters, controllers) with spectral size-based safety margins; error-controlled reduced-order models for real-time operations.
- Tools/workflows: Digital-twin modules that estimate per-component spectral size, compose error bounds via the SOC chain rule, and generate reduced models P_n with guaranteed approximation quality.
- Assumptions/dependencies: Domain operads modeling typical interconnections (series/parallel/feedback); computable spectral proxies from telemetry; validation against high-fidelity simulators.
- Policy and standards for safety-critical AI
- Use case: Certification frameworks that require a documented radius of convergence and spectral-size budgets for compositional AI (e.g., avionics, medical devices, autonomous driving).
- Tools/products: Standardized “spectral compliance” reports (radius, error decay rates, cross-effect audits) and test suites; regulators adopt SOC-inspired metrics for compositional safety.
- Assumptions/dependencies: Consensus definitions for admissibility and spectral proxies in industry; toolchain support for automatic report generation; interpretable thresholds.
- Advanced scientific computing (generalized functional calculus)
- Use case: Solver libraries that extend linear-functional calculus ideas to nonlinear/compositional operators with guaranteed error/radius control; adaptive algorithms upgrading local Taylor degree based on spectral feedback.
- Tools/workflows: HPC libraries integrating SOC-based adaptivity, selecting n to meet a global error target while monitoring spectral size in situ.
- Assumptions/dependencies: Efficient real-time estimation of spectral size in large-scale systems; scalable cross-effect approximations; parallelization of operadic compositions.
- Interdisciplinary mathematical physics (topological recursion and moduli)
- Use case: Applying SOC’s spectral Taylor structures to problems in enumerative geometry/recursion where compositional hierarchies and spectral control can yield new analytic approximations.
- Tools/workflows: Research pipelines integrating SOC derivative algebras with existing recursion toolkits, exploring plethystic composition rules for new invariants.
- Assumptions/dependencies: Mature ∞-categorical enhancements of SOC; domain-specific identifications of σ_P and derivative data with physical/geometric observables.
Notes on feasibility and dependencies across applications:
- Admissibility and spectral control: Many applications rely on bounding growth via spectral size. In practice, admissibility is enforced with computable proxies (operator norms, Lipschitz constants) and conservative bounds.
- Faithful norms and spectrally controlled classes: Strong results (e.g., strict excision) require faithful norms and/or classes where the identity functor is spectrally admissible (e.g., normal operators in C*-settings). For general systems, adopt conservative norms/proxies and accept weaker, yet useful, guarantees.
- Operad choice and modeling: Effectiveness depends on crafting operads that capture domain composition (software pipelines, control interconnections, quantum circuits). Early deployments can start with simple/trivial operads and gradually refine domain operads as tooling matures.
- Computation of cross-effects and σ_P: Exact computation may be costly. Practical workflows will use estimators, surrogates, or sampling-based approximations, coupled with a posteriori validation and safety margins.
By combining operadic spectrum as a control parameter, quantitative Taylor towers with explicit bounds, and the operadic chain rule, the paper’s framework offers a path to error-certifiable, compositional analysis and design across domains that rely on modular, nonlinear systems.
Glossary
- Admissible functor: A functor whose output norm is bounded by a function of the spectral size of its input. "We prove that an admissible functor is norm--excisive if and only if its -st cross-effect is spectrally negligible"
- Banach-enriched symmetric monoidal category: A symmetric monoidal category whose hom-sets are Banach spaces with compatible composition and tensor operations. "Let be a Banach-enriched stable symmetric monoidal category"
- Base change: Reinterpretation of objects along a change of operadic or categorical context, preserving structure. "compatible with operadic composition and base change."
- Cauchy–Hadamard formula: A formula giving the radius of convergence via the limsup of coefficient norms. "Moreover, the radius of convergence is given by the CauchyâHadamard formula"
- Chain rule: A rule describing how derivatives of composites relate to derivatives of their components. "and satisfy a chain rule governed by a natural composition operation (operadic plethysm)."
- Colored operad: An operad with multiple colors (types) that organizes multi-sorted operations. "Let be a colored operad in "
- Coproduct: A categorical sum object that universally receives maps from inputs. "where denotes the coproduct in "
- Cross-effect: A multivariable measure of a functor’s failure to be additive/polynomial, defined via a cube’s total homotopy fiber. "The -th cross-effect of is defined as the total homotopy fiber of this cube:"
- Derived geometry: A homotopy-enhanced geometric framework using -categorical and derived methods. "an outlook toward derived geometry (SOC III)."
- Deformation theory: The study of infinitesimal variations of algebraic structures and their obstructions via cohomology. "Deformation theory~\cite{Gerstenhaber1964, Kontsevich2003} studies infinitesimal variations of algebraic structures"
- Faà di Bruno chain rule (Operadic): The operadic analogue of the Faà di Bruno formula for higher-order derivatives of composites. "(Theorem C: Operadic Faà di Bruno Chain Rule)."
- Faithful norm: A norm such that zero norm implies the object is isomorphic to the zero object. "with a faithful norm (i.e., )"
- Functional calculus: A method for applying functions to operators using spectral data. "encoding essential structural information through eigenvalues, resolvents, and functional calculus."
- Gelfand theory: The functional analytic theory linking commutative Banach algebras to their spectra and characters. "On the spectral side, the classical Gelfand theory~\cite{Gelfand1941} provides a functional calculus for Banach algebras"
- Goodwillie calculus: A framework for approximating homotopy functors by polynomial towers. "Compared with classical Goodwillie calculus, which is governed by homotopy-theoretic conditions"
- Grothendieck group: The group completion capturing additive invariants of categories or monoids. "or in the Grothendieck group."
- Hochschild cohomology: A cohomological invariant of associative algebras controlling deformations. "The Hochschild homology and cohomology of algebras~\cite{Hochschild1945, Loday1992} provides algebraic invariants"
- Hochschild homology: A homological invariant capturing traces and cyclic data of algebras. "The Hochschild homology and cohomology of algebras~\cite{Hochschild1945, Loday1992} provides algebraic invariants"
- Homotopy functor: A functor that respects homotopy equivalences and is defined on homotopy categories. "who introduced polynomial approximations and Taylor towers for homotopy functors."
- Homotopy limits: Limits computed up to coherent homotopy in higher-categorical settings. "and that admits the relevant homotopy limits."
- Inclusion–exclusion: An alternating-sum formula expressing interactions among subsets. "represented formally by the inclusion-exclusion expression"
- Integrable derivative algebras: Algebraic structures consisting of compatible derivatives that reconstruct analytic functors. "is the category of integrable derivative algebras (Theorem~\ref{thm:equivalence})."
- Moduli space: A parameter space of isomorphism classes of objects/functors with geometric structure. "developing the moduli space $\mathcal{M}_{\mathrm{spec}$ of spectrally analytic functors"
- Nilpotent: An element/operator whose sufficiently high power is zero. "e.g., a nilpotent Jordan block has spectrum but non-zero norm"
- No-Go Theorem: A result demonstrating the impossibility of extending classical spectra functorially with desired properties. "the No-Go Theorem of Spectral Operadic Calculus~I shows that there is no functorial procedure"
- Norm-excision: A property that higher cross-effects vanish in norm, characterizing polynomial degree. "(Theorem A: Spectral Criterion for Norm-Excision)."
- Normed symmetric monoidal category: A symmetric monoidal category where hom-sets carry compatible norms. "A symmetric monoidal category is called a normed symmetric monoidal category"
- Operadic composition: Composition of operations structured by an operad, respecting its algebraic rules. "compatible with operadic composition and base change."
- Operadic functional calculus: A functional calculus adapted to operadic structures for scaling/composing algebraic operations. "the operadic functional calculus (Section~8.1, \cite{ChangSOC1}) is defined."
- Operadic plethysm: The composition operation for symmetric sequences or modules in operad theory. "where $\circ_{\mathrm{op}$ denotes operadic plethysm."
- Operadic residue object: A universal correction term ensuring functorial spectral invariants in operadic contexts. "we introduced the operadic residue object $\mathcal{O}_P^{\mathrm{res}$, constructed as a universal correction term"
- Operadic spectrum: A canonical spectral invariant extending classical spectrum to operadic settings. "show that the operadic spectrum acts as a control parameter for a calculus of functors."
- Polynomial functor: A functor built from finite sums and products of inputs via bounded-degree operations. "Let be a polynomial functor built from tensor products, direct sums, and applications of the -algebra structure maps"
- Resolvent: The operator used in spectral analysis. "encoding essential structural information through eigenvalues, resolvents, and functional calculus."
- Right P-module: A module over an operad with right action by operadic operations. "showing that they form symmetric sequences and, under operadic compatibility, right -modules."
- Spectral Mapping Theorem (Operadic): A theorem describing how spectra transform under applying functions in the operadic framework. "Operadic Spectral Mapping Theorem (Theorem~9, \cite{ChangSOC1})"
- Spectral radius: The supremum of absolute values in the spectrum, controlling growth. "This quantity generalizes the spectral radius in classical operator theory"
- Spectral Taylor tower: A tower of polynomial approximations built using spectral data with quantitative convergence. "For spectrally analytic functors, the spectral Taylor tower converges with explicit exponential bounds:"
- Spectrally negligible: Having operadic spectrum equal to {0}, making an effect spectrally invisible. "is spectrally negligible, i.e., "
- Stable symmetric monoidal category: A monoidal category with a stable (triangulated) structure supporting fibers/cofibers. "Banach-enriched stable symmetric monoidal category"
- Symmetric sequence: A sequence with actions of symmetric groups organizing operations/derivatives. "showing that they form symmetric sequences"
- Taylor tower: A sequence of polynomial approximations to a functor analogous to a Taylor series. "Taylor towers for homotopy functors."
- Total homotopy fiber: The homotopy-theoretic fiber over all faces of a cube, capturing multiway interactions. "The -th cross-effect of is defined as the total homotopy fiber of this cube:"
- Von Neumann algebra: A C*-algebra closed in the weak operator topology, central in noncommutative spectral theory. "von Neumann algebras"
- ∞-operad: A higher operadic structure encoding homotopy-coherent composition in -categories. "Higher category theory and -operads~\cite{Lurie2009, Lurie2017} provide a foundational framework for operadic composition and homotopy-coherent structures."
Collections
Sign up for free to add this paper to one or more collections.