Classical C1 Smoothness is Impossible at Finite Resolution

Note: This paper has been significantly revised and now forms Part 1 of "The Discrete Reality Tetralogy" (2025). The complete collection includes three additional papers that establish why derivatives cannot exist at finite resolution, present empirical evidence for discrete measurement, and explain why continuous models work through the Universal Averaging Principle. For the full framework, please see [The Discrete Reality Tetralogy].We prove, in three independent ways, that classical C¹ smoothness cannot occur in any discrete model with a nonzero resolution floor. The result formalizes a common intuition: you can refine triangles to approach a sphere but never be one at finite resolution. Our topology proof rules out positive-dimensional smooth structure in discrete metric spaces; our calculus proof shows finite step size prevents derivatives; and our geometry proof shows polyhedra cannot equal S². We conclude that exact smoothness exists only in the limit as ℓ_min → 0, and that discrete analogs are the appropriate tools at fixed scale.

Authors

Publication Details

Published
2025-09-15
DOI
https://doi.org/10.22541/au.175096308.87294983/v2
Primary Topic
Matrix Theory and Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Classical C1 Smoothness is Impossible at Finite Resolution

J. B. Oliver
Matrix Theory and Algorithms
article

Classical C1 Smoothness is Impossible at Finite Resolution

J. B. Oliver
article en

Abstract

Note: This paper has been significantly revised and now forms Part 1 of "The Discrete Reality Tetralogy" (2025). The complete collection includes three additional papers that establish why derivatives cannot exist at finite resolution, present empirical evidence for discrete measurement, and explain why continuous models work through the Universal Averaging Principle. For the full framework, please see [The Discrete Reality Tetralogy].We prove, in three independent ways, that classical C¹ smoothness cannot occur in any discrete model with a nonzero resolution floor. The result formalizes a common intuition: you can refine triangles to approach a sphere but never be one at finite resolution. Our topology proof rules out positive-dimensional smooth structure in discrete metric spaces; our calculus proof shows finite step size prevents derivatives; and our geometry proof shows polyhedra cannot equal S². We conclude that exact smoothness exists only in the limit as ℓ_min → 0, and that discrete analogs are the appropriate tools at fixed scale.

Openalex Percentile: Top 74%
Matrix Theory and Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.