Index Mathematics Conjectures nbv lettuce Widgets

Finite and infinite fields and rings symbolically formed from sets.

Symbols & Logic

Define a set. A set contains some values or is the empty set ∅︀ (containing no elements).

A number is a symbol. Define the symbols 0,1,2,3,4,5,6,7,8,9: 1

0=∅︀ 1={∅︀}

2={∅︀,∅︀} 3={∅︀,∅︀,∅︀} 4={∅︀,∅︀,∅︀,∅︀} 5={∅︀,∅︀,∅︀,∅︀,∅︀} 6={∅︀,∅︀,∅︀,∅︀,∅︀,∅︀} 7={∅︀,∅︀,∅︀,∅︀,∅︀,∅︀,∅︀} 8={∅︀,∅︀,∅︀,∅︀,∅︀,∅︀,∅︀,∅︀} 9={∅︀,∅︀,∅︀,∅︀,∅︀,∅︀,∅︀,∅︀,∅︀}

Define a base k number system as an infinite symbol system. Represent numbers as addition of powers of a number k. Define the base 10 (deci) number system as k=10. e.g. 125=1⋅k2+2⋅k1+5⋅k0. A number system turns the finite set of symbols above, into an infinitely large set of symbols by making the amount of information required to represent a symbol non-constant. e.g. 10 and 11274981748971 are both members of the same number system, but can be accurately expressed independently of the system using different amounts of information. This concept is symbolically analyzed using big-O notation or logically as complexity theory.

Define the positive integers ℤ+, as sets of empty sets (aka zeroes) represented as a base k number system. By default we take k=10. Admit total order within the set by sorting by cardinality (number of elements).

Define addition as setwise union a+x=a∪x. e.g. logically 1+2={∅︀}∪{∅︀,∅︀}={∅︀,∅︀,∅︀}=3.

Define a symbolic representation of element-wise operations between sets of numbers, where the concrete representation of a number is logically opaque (defined only symbolically in a separate logic), the language nbv.

Define multiplication of a⋅x as a set with x elements in a one-dimension space where 0=a, followed by logical decoherence of the one-dimension space (removing the logical groupings of a elements) and taking the cardinality.

Define multiplication symbolically, where calloc represents an abstract symbol k as a vector of zero elements. e.g. k=5=0,0,0,0,0:

# logical scalar multiplication
(static a, static x)
# TODO: move this to the nbv docs
# the left hand side (lhs) contains the multiplication symbol
# the right hand side (rhs) contains only summation operations relative
assert_eq! a * x, loop_map_sum! calloc(a), {
  x
}

Notably, the language separates the logic of the number system from the logic of the symbol system.

Define the negative integers ℤ− by representing the relative difference between the cardinality of all sets of empty sets.

There are a logically infinite number of integers: for any integer n there exists n+1=n∪{∅︀}2. There are a symbolically infinite number of base k integers by taking the set of degree n univariate polynomials over the finite symbol system (aka the k=1 number system or the boolean hypercube).

We will call a set a ring if it contains integers which form an algebra where addition, subtraction, and multiplication behave as rational numbers.

We will call a set a field if it contains integers which form an algebra where addition, subtraction, multiplication, and division behave as rational numbers.

Given only the integers, we cannot form a field of infinite cardinality. There is no way to express the value m/n using a single integer k for all possible m and n values. This information space is instead consumed by the total order of the field, which admits addition and subtraction.3 Crucially, this is a symbolic/physical limitation but can be overcome by either logic or additional symbols. We can form an infinite field by introducing a new symbol: the decimal point. Now we can represent all combinations of operations because a decimal has two infinite dimensions, the value before the decimal, and the value after the decimal (logically separated by the decimal). Doing so forms the real numbers ℝ.

We can, however, logically form a field of finite cardinality! We do so by mapping all combinations of operations from ℤq∞→ℤ. From there, we form a congruence back from ℤq←ℤ to get a symbol of constant size with no loss of information. Given a set of symbols with cardinality q, a (possibly infinite) set of variables x, and a set of operations ⋄ define a ring as a function f(ℤ,ℤ∞,⋄)→ℤq. All possible combinations of operations and symbols can be represented with total accuracy.

If q has no non-identity divisors, the ring is a field because all values n/m can be represented by a single symbol ∈ℤq. This is an apparent property of primality.

notes

When people think of numbers they typically think of the set of real numbers: ℝ. This includes positive and negative numbers, decimals, as well as things like irrational numbers4. Having decimals and irrationals is the only way to form an algebra as we know it: the associative property, distributive property, reflexive property, etc. Without these properties operations such as addition, subtraction, division, and multiplication do not hold. For example, the number 1/2 does not exist in the set of integers. Specifically, it cannot be reduced to a single integer, but the ratio 1/2 does exist outside the integers, being the ratio of the set with one element, to the set with two elements. This ratio simply has no symbolic representation in the integers.

In the physical world decimals are important! They are the most common way to achieve precision and accuracy in e.g. scientific experiments or other mathematical logic. They represent the accumulated ratio between operations (potentially with loss of accuracy as a result of irrationals). Specifically they are a two dimension representation of a (potentially infinite) set of operations. Although this is appealing, there may be more accurate ways to construct symbol systems which approximate, or perhaps define, physics without loss of accuracy (e.g. using discrete mathematics and higher dimension intermediate representations of ratios). Conceptually the dimension of the final ratio would be the minimum amount of information required to fully represent a physical process.

In information theory decimals are largely irrelevant. Instead we will work with the integers (ℤ) by default. This includes all negative and positive integers, and zero. This does not include the division operation.

  1. This construction is inconsistent with set theory as written. This can be rectified logically as vectors of empty sets, or probabilistically as a set of sets of random cardinality in a high dimension space with the validity condition that all elements are pairwise distinct. Regardless, treat sets as multisets or unindexed vectors. See also conjecture of set and multiset equivalence given entropy ↩

  2. this assumes a theoretically infinite set space, that is a space where a number of infinite length can be represented by information that exists, which seems unlikely. regardless we get an asymptotically large space for complexity analysis purposes ↩

  3. Logically it follows that multiplicative groups can be formed without subtraction. TODO: look at binding this to expressions of logic symbolically. ↩

  4. e.g. π, the ratio of a circle to its radius ↩