| 1. Domain | 1.1 Scope of the Domain | Boundaries | The range of phenomena the science includes and excludes. | Studies numbers that are not algebraic over ℚ, focusing on proving transcendence or algebraic independence of specific constants (e, π, log α, ζ-values, exponential values). Includes linear/analytic independence results, transcendence criteria, Diophantine approximation, and auxiliary polynomial methods. Excludes algebraic numbers and analytic number theory except where used to establish transcendence. |
| | Scale | The spatial, temporal, or organizational level at which the science operates (e.g., quantum, cellular, social, cosmic). | Operates at the arithmetic–analytic scale: integer polynomial relations, height bounds, Diophantine approximations, exponential and logarithmic behaviors, asymptotic lower bounds, and algebraic-independence frameworks across ℝ or ℂ. |
| 1.2 Ontological Commitments | Entities | The kinds of things assumed to exist within the domain (particles, organisms, agents, fields, etc.). | Transcendental numbers, algebraic numbers, heights of algebraic numbers, auxiliary polynomials, linear forms in logarithms, Baker-type quantities, exponential values, special constants (e, π), Diophantine-approximation functions. |
| | Properties | The fundamental attributes these entities possess (mass, charge, genotype, preference, etc.). | Transcendence, algebraic independence, approximation strength, irrationality measure, lower bounds for linear forms, nonvanishing constraints, complexity of algebraic relations. |
| | Categories | The basic ontological types used to classify domain elements (substances, processes, relations, structures). | Transcendental vs algebraic numbers; classes of special values (exponential, logarithmic, gamma values); Baker-type linear-form problems; Diophantine-approximation regimes; algebraic-independence hierarchies. |
| 1.3 State-Variables | Variables | The measurable or definable properties that describe system conditions. | Polynomial coefficients; heights of algebraic numbers; approximation exponents; linear-form values; logarithmic arguments; bound parameters; irrationality and transcendence measures. |
| | Parameterization | How variables encode and represent the system’s state. | Encoded via minimal polynomials, heights, degrees, Diophantine-approximation parameters, size of auxiliary functions, exponents in linear forms, and error-term bounds. |
| 1.4 Admissible Idealizations | Simplifications | Conceptual reductions used to make the domain tractable (point masses, rational agents, perfect gases). | Using asymptotic lower bounds; assuming nonvanishing of auxiliary functions; ignoring computational complexity; assuming strong separation between algebraic numbers; idealizing small-height behavior. |
| | Validity Conditions | The limits and contexts in which idealizations hold or break down. | Break down when algebraic numbers satisfy near-relations; auxiliary constructions fail to vanish at desired orders; approximation bounds too weak; nonzero linear forms approach zero too rapidly; heights grow beyond manageable levels. |
| 1.5 Domain Assumptions | Structural Assumptions | Background ontological stances such as determinism, continuity, randomness, discreteness. | Assumes unique factorization in ℤ; availability of effective heights; analytic behavior of exponentials/logarithms; linear independence over algebraic numbers; Diophantine lower bounds exist and can be made explicit. |
| | Implicit Commitments | Unstated but necessary assumptions that shape the field’s conceptual structure. | Assumes sufficiently many transcendence methods exist to distinguish constants; logarithms/exponentials behave algebraically “as expected”; polynomials can approximate functions well enough to create contradictions; heights encode arithmetic complexity accurately. |
| 1.6 Internal Coherence Requirements | Consistency | The demand that domain concepts do not contradict one another. | Height functions must align with Diophantine estimates; approximation inequalities must agree with algebraic-number theory; auxiliary functions must behave compatibly with analytic continuation and vanishing orders. |
| | Compatibility | The requirement that entities, variables, and assumptions fit together into a unified descriptive framework. | Requires harmony between algebraic number theory, Diophantine approximation, geometry of numbers, auxiliary polynomial constructions, and analytic estimates of special functions. |
| 2. Evidence Layer | 2.1 Observable Phenomena | Observables | The aspects of the domain that can produce detectable signals accessible to measurement. | Failure of algebraic relations among special constants; nonzero linear forms in logarithms; size of transcendence measures; approximation quality of rationals to e, π, log α; growth of auxiliary polynomials at integer points; irrationality exponents. |
| | Detection Limits | The boundaries of what can be resolved or sensed by current instruments or methods. | Cannot observe exact algebraic independence numerically; approximation tests cannot confirm transcendence; large heights obscure computation; auxiliary-function behavior hidden at large degrees; near-zero values mimic forbidden algebraic relations. |
| 2.2 Measurement Systems | Units | Standardized quantifications (meters, seconds, volts, decibels, dollars, etc.) necessary for consistent comparison. | Heights, degrees of algebraic numbers, approximation exponents, lower bounds for linear forms, error-term magnitudes, coefficients of auxiliary polynomials, evaluation points. |
| | Instruments | Devices and tools (microscopes, spectrometers, sensors, surveys, detectors) used to produce measurements. | Diophantine-approximation inequalities, auxiliary polynomials, zero estimates, height formulas, Baker-type methods, Padé approximants, Nesterenko/Schneider techniques, linear forms in logarithms. |
| 2.3 Operational Definitions | Definitions | Terms defined by specific measurement procedures, ensuring empirical clarity. | Definitions of transcendence, algebraic independence, irrationality measure, linear forms in logarithms, height of an algebraic number, approximation exponent, auxiliary polynomial, small-value estimate. |
| | Procedures | The explicit steps required to perform a measurement in a reproducible way. | Constructing auxiliary polynomials; evaluating linear forms; applying Baker-type bounds; computing heights; testing smallness conditions; applying zero estimates; constructing Padé approximants; bounding Diophantine approximations. |
| 2.4 Data Acquisition | Protocols | Formal processes for gathering data under controlled or standardized conditions. | Computing algebraic heights; gathering rational approximations; evaluating special transcendental constants to high precision; assembling sequences approaching conjectured small values; building families of auxiliary functions. |
| | Sampling | Rules determining which subset of the domain is measured and how representative it is. | Sampling algebraic numbers of bounded height; sampling rational approximations to constants; sampling candidate linear forms; sampling evaluation points for auxiliary polynomials; sampling exponents in approximation inequalities. |
| 2.5 Data Character & Format | Data Types | The form raw evidence takes (time series, spectra, images, counts, qualitative records). | Height tables; approximation-error tables; coefficient lists of auxiliary polynomials; numerical evaluations of constants; lower-bound datasets; Padé approximant coefficient sets. |
| | Resolution | The granularity or precision with which data is captured. | Determined by precision of numerical evaluation, degree/height of algebraic inputs, complexity of auxiliary polynomials, sharpness of lower bounds, and sensitivity of small-value detection. |
| 2.6 Reliability & Calibration | Calibration | Adjustment procedures ensuring instruments produce accurate results. | Checking polynomial-construction correctness; verifying height calculations; confirming accuracy of approximation bounds; validating nonvanishing estimates; cross-checking numerical approximations with independent computations. |
| | Error Characterization | Identification and quantification of noise, uncertainty, bias, and measurement error. | Numerical precision limits; incorrectly computed heights; poorly conditioned auxiliary polynomials; false near-zero values; failure of inequality bounds at high degrees; misestimated irrationality measures. |
| 3. Structural Layer | 3.1 Patterns & Regularities | Laws / Relations | Stable, repeatable patterns governing how observables behave across conditions. | Linear forms in logarithms obey lower-bound laws; Baker-type inequalities yield structured transcendence results; algebraic numbers obey predictable height relations; transcendental numbers defy nontrivial polynomial relations; approximation exponents follow Diophantine laws. |
| | Invariants | Quantities or properties that remain constant under transformations (symmetries, conservation laws). | Heights, degrees, irrationality measures, transcendence measures, linear-form lower bounds, algebraic-independence ranks, nonvanishing constraints for auxiliary functions. |
| 3.2 Causal Architecture | Mechanisms | Underlying processes or structures that produce the observed regularities. | Auxiliary-polynomial mechanisms forcing contradictions; analytic mechanisms bounding approximation quality; height-measure mechanisms governing polynomial relations; logarithmic/exponential mechanisms generating algebraic independence; zero estimates enforcing nonvanishing. |
| | Pathways | Organized sequences of interactions forming a causal chain or network. | Construction of auxiliary polynomials; descent/contradiction pathways; Diophantine-approximation pathways; lower-bound amplification pathways; linear-form evaluation pathways; algebraic-independence escalation sequences. |
| 3.3 Theoretical Vocabulary | Concepts | Core terms that encode the domain’s structure (force, gene, equilibrium, field). | Transcendence, algebraic independence, height, linear forms in logarithms, irrationality measure, approximation exponent, auxiliary polynomial, Baker-type inequality, zero estimate, Diophantine approximation. |
| | Classifications | Taxonomies, categories, or typologies that organize entities and relations. | Transcendental vs algebraic numbers; measures of transcendence; Baker-type vs Schneider–Lang types of theorems; linear vs nonlinear independence problems; exponential/logarithmic classes; special constants families (e.g., e, π, log α). |
| 3.4 Formal Representations | Equations | Mathematical constructs expressing laws, relations, or mechanisms. | Height inequalities; lower bounds for linear forms ( |
| | Models | Structured representations—mathematical, computational, or conceptual—used to predict and explain phenomena. | Height models of algebraic numbers; Diophantine-approximation models; auxiliary-polynomial frameworks; Baker-style transcendence models; algebraic-independence towers; analytic models of exponential/logarithmic behavior. |
| 3.5 Idealized Structures | Simplified Models | Purposeful abstractions that capture essential dynamics while omitting irrelevant detail. | Low-degree auxiliary polynomials; simplified height functions; single-logarithm transcendence problems; linear-approximation-only models; toy examples like proving e or π transcendental using schematic arguments. |
| | Limit Conditions | Regimes where specific models or approximations hold (classical vs. quantum, linear vs. nonlinear). | Failures occur with high-degree or large-height algebraic numbers; auxiliary polynomials become unmanageable; near-algebraic relations defy lower-bound methods; no known methods for many constants (e.g., π+e); algebraic independence largely open. |
| 3.6 Integrative Frameworks | Unifying Theories | Higher-order structures that connect disparate laws or mechanisms under a coherent whole. | Baker’s theory of linear forms in logarithms; Schneider–Lang theory; Gel’fond–Schneider method; Diophantine approximation theory; height theory; zero-estimate frameworks; conjectural frameworks such as Schanuel’s conjecture. |
| | Interdisciplinary Links | Points where the theory connects to adjacent sciences or larger explanatory systems. | Links to algebraic number theory (heights, algebraic relations), analytic number theory (L-value transcendence), differential algebra (functional transcendence), Diophantine geometry (heights and varieties), and logic (undecidability of relations). |
| 4. Method Layer | 4.1 Inquiry Design | Experimental Design | Structured plans for manipulating variables to test causal claims. | Varying heights, degrees, and algebraic parameters; adjusting auxiliary-polynomial degree; modifying approximation targets; tuning Diophantine exponents; controlling zero-order conditions to test transcendence or algebraic independence. |
| | Observational Design | Systematic approaches for gathering non-manipulated data (surveys, field studies, natural experiments). | Observing the size of linear forms in logarithms, monitoring growth of auxiliary polynomials, observing approximation quality of rationals, checking nonvanishing behavior, tracking height escalation without altering underlying constants. |
| 4.2 Testing & Validation | Hypothesis Testing | Procedures for evaluating whether evidence supports or contradicts specific claims. | Testing lower-bound inequalities; checking Baker-type estimates; validating height calculations; verifying independence of logarithms; testing whether auxiliary polynomials vanish to required order; checking Diophantine bounds against expected behavior. |
| | Replication | The requirement that results be independently reproducible under similar conditions. | Recomputing heights; repeating auxiliary-polynomial constructions; recalculating approximation exponents; re-evaluating linear forms with modified coefficients; checking lower bounds with alternative constructions. |
| 4.3 Inference & Evaluation | Statistical Inference | Rules for drawing conclusions from noisy or incomplete data. | Logical analogues only: comparing approximation error decay; evaluating distribution of near-relations; assessing robustness of lower bounds; analyzing behavior under degree/height changes; comparing multiple auxiliary-polynomial families. |
| | Model Comparison | Criteria (fit, simplicity, predictive accuracy, robustness) used to evaluate competing models. | Comparing different auxiliary-polynomial constructions; comparing Baker vs. Schneider–Lang methods; contrasting height models; evaluating performance of various Diophantine-approximation frameworks; comparing bounds across multiple constants. |
| 4.4 Error Management | Error Analysis | Identification and quantification of random and systematic errors. | Height miscalculation; instability in constructing auxiliary polynomials; numerical errors in evaluating constants; small-value misclassification; failure of nonvanishing arguments; breakdown of approximation inequalities at large degrees. |
| | Bias Control | Methods for minimizing subjective, instrumental, or procedural biases. | Avoiding selective constants with known structure; preventing cherry-picking of low-degree polynomials; avoiding bias toward “easy” Diophantine targets; ensuring coefficients and height constraints are not manipulated to force outcomes. |
| 4.5 Adjudication & Revision | Peer Scrutiny | Collective evaluation of claims through critique, review, and debate. | Independent verification of height formulas, auxiliary-polynomial correctness, linear-form bounds, independence proofs, and Diophantine inequalities; rigorous checking of nonvanishing and zero-estimate arguments. |
| | Theory Revision | Procedures for modifying, replacing, or discarding models based on new evidence. | Updating bounds in Baker-type theorems; refining auxiliary constructions; adjusting height theory; modifying criteria for algebraic independence; reformulating Diophantine estimates when counterexamples or stronger results emerge. |
| 4.6 Integrity Conditions | Transparency | Requirements to disclose methods, data, assumptions, and limitations. | Full disclosure of height computations, polynomial degrees, coefficient bounds, approximation parameters, zero-estimate assumptions, and analytic estimates used in deriving inequalities. |
| | Ethical Standards | Norms ensuring responsible conduct in experimentation, data handling, and publication. | Honest handling of numerical precision limits; clear separation of proven vs. conjectural results; avoidance of overstated claims for algebraic independence; correct attribution of techniques and theorems. |