为什么实数系里不存在最小正数?(Why the smallest positive real number doesn't exist in the real number system ?)
We define the smallest positive real number as the number which is explicitly greater than zero and yet less than all other positive real numbers except itself.
The smallest positive real number, if exists, implies the existence of the second greater positive real number after it, which subtracts the smallest positive real number equals the smallest positive real number. The difference between the second greater positive real number and smallest positive real number could not be any other positive real number greater than the smallest positive real number, otherwise there must be a number with the magnitude of twice the smallest positive real number between the smallest positive real number and the second greater positive real number, which contradicts to the definition of the second greater positive real number, that is there is no number between it and the the smallest positive real number. Follow the same meaning, one could define the third greater positive real number which subtracts the second greater positive real number equals the smallest positive real number, then the 4th greater positive real number, 5th, ...this would finally make the set of positive real number countable, while Cantor already proved the set of positive real number is uncountable using the diagonal argument.
The smallest positive real number, if exists, also implies the existence of the indivisible unit. The smallest positive real number is not legitimate to divide, otherwise one would get numbers less than the smallest positive real number, which contradicts to the definition of the smallest positive real number. N.B. the conclusion is conducted out in terms of assuming the existence of the smallest positive real number. In such a number system, the ultimate unit of measurement would be the smallest positive real number, based on such idea one would be eventually led to the world of atomism.
The Greek scientist Democritus (about 460– 380 B.C.) apparently considered solids as "sums" of a tremendous number of extremely small "indivisible" atoms (don't get confused with that in chemistry). Democritus held that his atoms, being not only very small but the smallest possible particles of matter, were not only too small to be divided physically but also logically indivisible. In such a system, the ultimate unit of measurement would be the size of an atom.
Obviously, the atom unit size is equal to the smallest positive real number. However, Euclidean geometry, in particular, the Pythagorean theorem denies the existence of such indivisible atom size, therefore denied the existence of the indivisible unit-the smallest positive real number.
Consider any geometrical figures (e.g., squares, triangles, etc.) with line segments as sides from atomism, then the length of each side will be measured in atoms, and each side will be assigned an integer as its measure. (Each side will be n atomic units long, where n is a positive integer.) Now consider an isosceles right triangle with side composed of 100 atoms, how many atoms its hypotenuse includes? Using the Pythagorean theorem \(\sqrt{100^2 + 100^2}=\sqrt{2\times 100^2}=100\sqrt{2}\), the hypotenuse includes \(100\sqrt{2}\) atoms, while \(100\sqrt{2}\) is not a whole number. And notice that this is true irrespective of the size of the side, so the situation does not change if we suppose that the side of the isosceles right triangle are composed of a very large number of very small “space atoms”. Even if the sides are billions of atoms long, the length of the hypotenuse will still be an irrational number of such atoms. Let \(a\), the whole number of atoms in the side of a isosceles right triangle, be as large as you like, and let \(c\) be the number of atoms in the hypotenuse; \(c\) will still be an irrational number, for \(c = a\sqrt{2}\) . This means that there is no integer \(c\) such that the hypotenuse of an isosceles right triangle is \(c\) space atoms long if its side is some integer \(n\) space atoms long. To put it another way, the diagonal and the side of a square cannot both be measured atomistically.
In one word, the smallest positive real number doesn't exist !
为什么实数系里不存在最小正数?(Why the smallest positive real number doesn't exist in the real number system ?)的更多相关文章
- Java输出double类型中的最小正数和最大正数
这是<写给大忙人看的java核心技术>中的一道练习题. 1. 输出最大正数值 System.out.println(Double.MAX_VALUE); 直接输出包装类Double的MAX ...
- Leetcode之二分法专题-744. 寻找比目标字母大的最小字母(Find Smallest Letter Greater Than Target)
Leetcode之二分法专题-744. 寻找比目标字母大的最小字母(Find Smallest Letter Greater Than Target) 给定一个只包含小写字母的有序数组letters ...
- LeetCode 41. 缺失的第一个正数(First Missing Positive)
题目描述 给定一个未排序的整数数组,找出其中没有出现的最小的正整数. 示例 1: 输入: [1,2,0] 输出: 3 示例 2: 输入: [3,4,-1,1] 输出: 2 示例 3: 输入: [7,8 ...
- [Swift]LeetCode483. 最小好进制 | Smallest Good Base
For an integer n, we call k>=2 a good base of n, if all digits of n base k are 1. Now given a str ...
- C#LeetCode刷题之#744-寻找比目标字母大的最小字母(Find Smallest Letter Greater Than Target)
问题 该文章的最新版本已迁移至个人博客[比特飞],单击链接 https://www.byteflying.com/archives/4001 访问. 给定一个只包含小写字母的有序数组letters 和 ...
- 【ZOJ 3609】Modular Inverse 最小乘法逆元
The modular modular multiplicative inverse of an integer a modulo m is an integer x such that a-1≡x ...
- ZOJ 3609 Modular Inverse(拓展欧几里得求最小逆元)
Modular Inverse Time Limit: 2 Seconds Memory Limit: 65536 KB The modular modular multiplicative ...
- OPTM-Optimal Marks-SPOJ839最小割
You are given an undirected graph G(V, E). Each vertex has a mark which is an integer from the range ...
- HDU 1394 Minimum Inversion Number(最小逆序数 线段树)
Minimum Inversion Number [题目链接]Minimum Inversion Number [题目类型]最小逆序数 线段树 &题意: 求一个数列经过n次变换得到的数列其中的 ...
随机推荐
- Intro to Jedis – the Java Redis Client Library
转自:http://www.baeldung.com/jedis-java-redis-client-library 1. Overview This article is an introducti ...
- runtime MethodSwizzle 实践之扩展 NIAttributedLabel
runtime MethodeSwizzle 提供 简单的方法交换已知类的 Method IMP. Method 可以是 外部可访问的 public 或者 private Method .所谓的属性 ...
- [docker]macvlan实现双vlan互通
关于vlan的冷知识 vlan范围:0~4095 0,4095 保留 仅限系统使用 用户不能查看和使用这些VLAN 1 正常 Cisco默认VLAN 用户能够使用该VLAN,但不能删除它 2-1001 ...
- 对ThreadLocal实现原理的一点思考
前言 在<透彻理解Spring事务设计思想之手写实现>中,已经向大家揭示了Spring就是利用ThreadLocal来实现一个线程中的Connection是同一个,从而保证了事务.本篇博客 ...
- Lua 5.1 5.3 参考手册
Lua 5.1 参考手册: https://www.codingnow.com/2000/download/lua_manual.html Lua 5.3 参考手册: http://cloudwu.g ...
- 阿里巴巴CI:CD之分层自动化实践之路
阿里巴巴CI:CD之分层自动化实践之路 2018-05-30 摘自:阿里巴巴CI:CD之分层自动化实践之路 目录 1 自动化 1.1 为什么要做自动化? 1.2 自动化的烦恼 1.3 自动化的追 ...
- Java知多少(55)线程
和其他多数计算机语言不同,Java内置支持多线程编程(multithreaded programming). 多线程程序包含两条或两条以上并发运行的部分.程序中每个这样的部分都叫一个线程(thread ...
- 程序-代写(qq:928900200)
CS 310 Programming Assignment 4 Due April 27, 2014 5:00 P.M. About 15 years in the future... The Mar ...
- JavaScript高级用法二之内置对象
综述 本篇的主要内容来自慕课网,内置对象,主要内容如下 1 什么是对象 2 Date 日期对象 3 返回/设置年份方法 4 返回星期方法 5 返回/设置时间方法 6 String 字符串对象 7 返回 ...
- Oracle HAVING子句 - 转
使用 HAVING 子句选择行 HAVING 子句对 GROUP BY 子句设置条件的方式与 WHERE 子句和 SELECT 语句交互的方式类似.WHERE 子句搜索条件在进行分组操作之前应用:而 ...