| 1. Domain | 1.1 Scope of the Domain | Boundaries | The range of phenomena the science includes and excludes. | Studies integers through analytic methods, especially limits, sums, integrals, complex analysis, asymptotics, and estimates. Includes distribution of primes, L-functions, zeta functions, character sums, exponential sums, and analytic techniques for arithmetic functions. Excludes purely algebraic or geometric number theory unless analysis is explicitly applied. |
| | Scale | The spatial, temporal, or organizational level at which the science operates (e.g., quantum, cellular, social, cosmic). | Operates at large-scale asymptotic regimes: growth of π(x), behavior of arithmetic functions over long intervals, analytic continuation regions for L-functions, zero distributions, short/long interval averages. |
| 1.2 Ontological Commitments | Entities | The kinds of things assumed to exist within the domain (particles, organisms, agents, fields, etc.). | Zeta functions, L-functions, Dirichlet characters, primes, arithmetic functions (Λ, μ, τ, σ, φ), exponential sums, Dirichlet series, Euler products, zeros and poles of analytic functions. |
| | Properties | The fundamental attributes these entities possess (mass, charge, genotype, preference, etc.). | Analytic continuation, functional equations, zero distributions, asymptotic behavior, mean values, error terms, orthogonality relations, Euler-product factorization, growth rates. |
| | Categories | The basic ontological types used to classify domain elements (substances, processes, relations, structures). | L-functions, Dirichlet series, character sums, prime-counting functions, multiplicative functions, exponential sums, modular forms (in analytic context), zeta-type invariants. |
| 1.3 State-Variables | Variables | The measurable or definable properties that describe system conditions. | Complex variables s, real variables x or n, moduli q, coefficients of arithmetic functions, values of L(s,χ), zero locations, analytic error terms, short-interval parameters. |
| | Parameterization | How variables encode and represent the system’s state. | Encoded via Dirichlet series coefficients, Euler products, moduli for characters, analytic regions of convergence, zero ordinates, growth exponents, cutoff parameters for sums/integrals. |
| 1.4 Admissible Idealizations | Simplifications | Conceptual reductions used to make the domain tractable (point masses, rational agents, perfect gases). | Using approximate functional equations; replacing sums with integrals; assuming GRH-type bounds; ignoring secondary main terms; treating error terms as negligible; using smooth cutoffs for analytic convenience. |
| | Validity Conditions | The limits and contexts in which idealizations hold or break down. | Break down for small x or short intervals; invalid near poles/critical zeros; unreliable without uniform control of error terms; analytic continuation may fail beyond certain regions; conditional results depend on unproven hypotheses (e.g., RH, GRH). |
| 1.5 Domain Assumptions | Structural Assumptions | Background ontological stances such as determinism, continuity, randomness, discreteness. | Assumes integers behave statistically; analytic continuation exists for major L-functions; primes follow asymptotic laws; Euler products converge where required; harmonic-analysis techniques apply; approximate functional equations hold. |
| | Implicit Commitments | Unstated but necessary assumptions that shape the field’s conceptual structure. | Assumes analytic properties mirror arithmetic structure; zeros of L-functions control distribution of primes; averages reveal true behavior; random-model heuristics approximate integer behavior; multiplicativity supports analytic decomposition. |
| 1.6 Internal Coherence Requirements | Consistency | The demand that domain concepts do not contradict one another. | Functional equations must align with Euler products; zero distributions must match explicit formulas; asymptotics must be consistent with analytic continuation; prime-number estimates must obey known bounds. |
| | Compatibility | The requirement that entities, variables, and assumptions fit together into a unified descriptive framework. | Requires harmony among Dirichlet series, Euler products, functional equations, orthogonality relations of characters, explicit formulas, and asymptotic number-theoretic results. |
| 2. Evidence Layer | 2.1 Observable Phenomena | Observables | The aspects of the domain that can produce detectable signals accessible to measurement. | Prime-counting behavior (\pi(x)); distribution of primes in progressions; oscillatory behavior of arithmetic functions (μ(n), Λ(n)); size/growth of L-functions; zero locations; exponential-sum cancellation. |
| | Detection Limits | The boundaries of what can be resolved or sensed by current instruments or methods. | Cannot resolve individual primes via analytic tools; limited precision in short intervals; zeros detected only statistically or numerically; large error terms obscure fine structure; analytic continuation may not reveal arithmetic exceptions. |
| 2.2 Measurement Systems | Units | Standardized quantifications (meters, seconds, volts, decibels, dollars, etc.) necessary for consistent comparison. | Values of L(s); magnitudes of sums (\sum_{n\le x} a_n); growth rates; analytic error terms; modulus q; zero ordinates; partial-sum lengths; log-scale growth factors. |
| | Instruments | Devices and tools (microscopes, spectrometers, sensors, surveys, detectors) used to produce measurements. | Dirichlet series; Euler products; contour integration; Fourier transforms; explicit formulas; Mellin transforms; approximate functional equations; exponential-sum estimates (e.g., van der Corput, Weyl). |
| 2.3 Operational Definitions | Definitions | Terms defined by specific measurement procedures, ensuring empirical clarity. | Definitions of L-functions, Dirichlet characters, exponential sums, prime-counting functions, mean values, error terms, analytic continuation, functional equations. |
| | Procedures | The explicit steps required to perform a measurement in a reproducible way. | Evaluating L-functions numerically; computing partial sums; performing contour integrals; applying explicit formulas; estimating exponential sums; smoothing or weighting sums; deriving asymptotics. |
| 2.4 Data Acquisition | Protocols | Formal processes for gathering data under controlled or standardized conditions. | Sampling integer ranges; computing prime tables; generating character tables; evaluating Dirichlet-series coefficients; computing zeros numerically; gathering partial-sum data for arithmetic functions. |
| | Sampling | Rules determining which subset of the domain is measured and how representative it is. | Sampling intervals of integers; sampling characters modulo q; sampling short-interval sums; sampling zeros of L-functions; sampling arithmetic function values for statistical behavior. |
| 2.5 Data Character & Format | Data Types | The form raw evidence takes (time series, spectra, images, counts, qualitative records). | Tables of primes; zero tables; partial-sum tables; Dirichlet-series coefficients; exponential-sum output; error-term estimates; asymptotic-growth plots. |
| | Resolution | The granularity or precision with which data is captured. | Controlled by numerical precision, interval length, modulus size, accuracy of L-function evaluation, zero-finding resolution, and depth of truncation in series expansions. |
| 2.6 Reliability & Calibration | Calibration | Adjustment procedures ensuring instruments produce accurate results. | Checking numerical precision; validating asymptotic approximations; verifying functional equations; cross-checking prime tables; confirming zero computations; calibrating character tables. |
| | Error Characterization | Identification and quantification of noise, uncertainty, bias, and measurement error. | Numerical instability; truncation errors; inaccurate zero locations; large analytic error terms; rounding errors in exponential sums; unreliable data in extreme ranges; dependency on unproven hypotheses (e.g., RH). |
| 3. Structural Layer | 3.1 Patterns & Regularities | Laws / Relations | Stable, repeatable patterns governing how observables behave across conditions. | Explicit formulas linking primes to zeros of L-functions; orthogonality of characters; mean-value laws for arithmetic functions; prime number theorem asymptotics; zero-density relations; cancellation patterns in exponential sums. |
| | Invariants | Quantities or properties that remain constant under transformations (symmetries, conservation laws). | Residue class distributions; analytic rank of L-functions; zero ordinates; functional-equation invariants; Euler-product coefficients; main-term constants in asymptotics; character orthogonality constants. |
| 3.2 Causal Architecture | Mechanisms | Underlying processes or structures that produce the observed regularities. | Euler products generating analytic structure; zeros of L-functions controlling prime distributions; contour integration producing explicit formulas; harmonic analysis generating cancellation in sums; Tauberian principles linking sums and integrals. |
| | Pathways | Organized sequences of interactions forming a causal chain or network. | Dirichlet-series extension pathways; analytic-continuation pathways; zero-finding pathways; explicit-formula derivation sequences; exponential-sum reduction pathways; contour-shifting procedures. |
| 3.3 Theoretical Vocabulary | Concepts | Core terms that encode the domain’s structure (force, gene, equilibrium, field). | Zeta function, L-function, Dirichlet series, Euler product, analytic continuation, functional equation, zero-free region, prime-counting function, exponential sum, character sum, error term. |
| | Classifications | Taxonomies, categories, or typologies that organize entities and relations. | L-functions (Dirichlet, Hecke, automorphic); character classes; multiplicative vs additive functions; smooth vs oscillatory sums; main-term vs error-term dominated phenomena; zero-density classes. |
| 3.4 Formal Representations | Equations | Mathematical constructs expressing laws, relations, or mechanisms. | Dirichlet series expansions; Euler-product formulas; functional equations; explicit formulas (e.g., Weil’s formula); asymptotic relations (PNT); approximate functional equations; exponential-sum identities. |
| | Models | Structured representations—mathematical, computational, or conceptual—used to predict and explain phenomena. | Analytic models of prime distribution; zero-distribution models; Dirichlet-character tables; exponential-sum models; asymptotic-growth models; probabilistic models for primes (Cramér-type). |
| 3.5 Idealized Structures | Simplified Models | Purposeful abstractions that capture essential dynamics while omitting irrelevant detail. | Smoothed sums; truncated Euler products; simplified L-function approximations; short-interval models; idealized error-term bounds; toy exponential-sum setups (e.g., linear phase, quadratic phase). |
| | Limit Conditions | Regimes where specific models or approximations hold (classical vs. quantum, linear vs. nonlinear). | Breakdown of asymptotics in short intervals; divergence beyond region of analytic continuation; instability near zeros; dependence on unproven hypotheses (RH, GRH); uncontrollable error terms; failure of uniformity across moduli. |
| 3.6 Integrative Frameworks | Unifying Theories | Higher-order structures that connect disparate laws or mechanisms under a coherent whole. | L-function theory; explicit-formula framework; harmonic-analysis approach to number theory; Tauberian theorems; spectral theory of automorphic forms; random-matrix models of L-function zeros. |
| | Interdisciplinary Links | Points where the theory connects to adjacent sciences or larger explanatory systems. | Links to harmonic analysis, spectral theory, algebraic number theory (via L-functions), probability (random models), mathematical physics (quantum chaos and zero statistics), and combinatorics (sieve methods). |
| 4. Method Layer | 4.1 Inquiry Design | Experimental Design | Structured plans for manipulating variables to test causal claims. | Varying smoothing functions, adjusting summation ranges, altering moduli, shifting contours, modifying exponential-sum phases, and using alternate Dirichlet-series coefficients to test analytic behavior. |
| | Observational Design | Systematic approaches for gathering non-manipulated data (surveys, field studies, natural experiments). | Observing prime-distribution patterns, monitoring oscillatory behavior of arithmetic functions, tracking L-function growth, observing zero distributions, examining asymptotic stability without direct manipulation. |
| 4.2 Testing & Validation | Hypothesis Testing | Procedures for evaluating whether evidence supports or contradicts specific claims. | Testing explicit formulas; validating functional equations; checking orthogonality of characters; verifying bounds on exponential sums; testing asymptotic predictions; probing zero-free regions; numerically testing conjectures (RH, GRH). |
| | Replication | The requirement that results be independently reproducible under similar conditions. | Recomputing Dirichlet-series values; repeating zero-finding computations; re-evaluating exponential sums with different truncations; repeating asymptotic estimates using alternate approximations; verifying stability across moduli. |
| 4.3 Inference & Evaluation | Statistical Inference | Rules for drawing conclusions from noisy or incomplete data. | Analyzing mean-value theorems; studying variance of arithmetic functions; examining distribution of zeros; comparing error-term growth; evaluating cancellation in exponential sums; assessing asymptotic fits. |
| | Model Comparison | Criteria (fit, simplicity, predictive accuracy, robustness) used to evaluate competing models. | Comparing L-functions by conductor, degree, and zeros; comparing explicit formulas; comparing sieve estimates vs. analytic estimates; comparing exponential-sum bounds; contrasting models under different smoothing methods. |
| 4.4 Error Management | Error Analysis | Identification and quantification of random and systematic errors. | Truncation errors in series; instability in zero computations; large analytic error terms; rounding error in numerical integration; non-uniformity in asymptotics; misestimation in exponential-sum bounds. |
| | Bias Control | Methods for minimizing subjective, instrumental, or procedural biases. | Avoiding selective sampling (e.g., only small moduli or special characters); preventing reliance on smoothing functions that artificially improve cancellation; ensuring unbiased selection of intervals for asymptotic testing. |
| 4.5 Adjudication & Revision | Peer Scrutiny | Collective evaluation of claims through critique, review, and debate. | Independent verification of zero computations, contour integrals, explicit-formula derivations, exponential-sum estimates, character-orthogonality proofs, and analytic-continuation arguments. |
| | Theory Revision | Procedures for modifying, replacing, or discarding models based on new evidence. | Updating bounds on error terms; refining zero-density estimates; modifying explicit formulas; strengthening or weakening conjectures; adjusting analytic frameworks when counterexamples or improved techniques arise. |
| 4.6 Integrity Conditions | Transparency | Requirements to disclose methods, data, assumptions, and limitations. | Full disclosure of truncation parameters, smoothing choices, analytic continuation ranges, numerical precision, zero-detection algorithms, and assumptions used in asymptotic claims. |
| | Ethical Standards | Norms ensuring responsible conduct in experimentation, data handling, and publication. | Honest reporting of numerical uncertainty; no overstating heuristic models; proper attribution of classical analytic results; clear distinction between unconditional results and conjecture-dependent statements. |