# FOM: 108:Finite Boolean Relation Theory

Harvey Friedman friedman at math.ohio-state.edu
Tue Sep 18 12:20:47 EDT 2001

```In 100:Boolean Relation Theory IV corrected  3/21/01  11:29AM, we defined
ET(Z), which is the expansively trapped integral multivariate functions, as
follows.

"ET(Z) is the set of all expansively trapped elements of MF(Z). This class
turns out to play an important role in the theory. The condition is that
there are constants p,q > 1 such that p|x| < |f(x)| < q|x| for all x in
dom(f)."

Note that this inequality is technically impossible because of x = 0. What
I should have written was:

ET(Z) is the set of all expansively trapped elements of MF(Z). This class
turns out to play an important role in the theory. The condition is that
there are constants p,q > 1 such that p|x| <= |f(x)| <= q|x| for all x in
dom(f).

Here MF(Z) is the set of all functions which map a Cartesian power of Z
into Z.

We stated the following Proposition:

PROPOSITION 7.9. For all f,g in ET(Z) there exist bi-infinite A,B,C
containedin Z such that fA/C,gB and fB/C,gC.

We claimed that Proposition 7.9 is equivalent to the 1-consistency of MAH =
ZFC + {there exists an n-Mahlo cardinal}_n.

We now present a good clean finite form of Proposition 7.9.

It turns out to be more convenient to give a finite form of a closely
related proposition.

Instead of using a linear growth condition (expansively trapped), we use a
nonlinear power growth condition:

*NPT(Z) is the set of all nonlinear power trapped elements of MF(Z). I.e.,
there are real constants p,q > 1 such that |x|^p <= |f(x)| <= |x|^q.*

PROPOSITION 7.9'. For all f,g in NPT(Z) there exist bi-infinite A,B,C
containedin Z such that fA/C,gB and fB/C,gC.

Proposition 7.9' is equivalent to the 1-consistency of MAH = ZFC + {there
exists an n-Mahlo cardinal}_n.

Let E containedin Z and i >= 1. We write E[i] for the i-th smallest
positive element of E. Here E[1] is the least positive element of E
(assuming E is nonempty). If E has fewer than i positive elements then E[i]
is undefined.

PROPOSITION 1. Let k,r >= 8 and f,g:Z^k into Z lie in NPT(Z). There exist
finite A,B,C containedin Z such that fA/C,gB and fB/C,gC, where A =
{2,C[k!!],C[(k+1)!!],...,C[r!!]}.

By a finitely branching tree argument, we see that a bound can be placed on
the elements of A,B,C depending only on k,r, and the exponents for f,g in
NPT(Z), but not on f,g. This results in a demonstrably equivalent
explicitly Pi-0-2 sentence.

The numbers k!!,...,r!!, and 8, are of course crude, but nice on the page.

THEOREM 2. Proposition 1 is provably equivalent to 1-Con(MAH) over ACA.

To obtain a Pi-0-1 sentence along these lines, we can use integral
multivariate piecewise linear functions f,g subject to the weak inequality
|f(x)|,|g(x)| >= 2|x|, with no other change in the statement.
Alternatively, we can require that the set A itself be a geometric
progression (using no C[_]), whose base is a double exponential in the
data. We know that such statements can be proved using Con(MAH). However,
lots of details still need to be checked for the reversal to Con(MAH),
which we postpone to a later date - after the first paper on Boolean
relation theory has been completed.

******************************

This is the 108th in a series of self contained postings to FOM covering
a wide range of topics in f.o.m. Previous ones are:

1:Foundational Completeness   11/3/97, 10:13AM, 10:26AM.
2:Axioms  11/6/97.
3:Simplicity  11/14/97 10:10AM.
4:Simplicity  11/14/97  4:25PM
5:Constructions  11/15/97  5:24PM
6:Undefinability/Nonstandard Models   11/16/97  12:04AM
7.Undefinability/Nonstandard Models   11/17/97  12:31AM
8.Schemes 11/17/97    12:30AM
9:Nonstandard Arithmetic 11/18/97  11:53AM
10:Pathology   12/8/97   12:37AM
11:F.O.M. & Math Logic  12/14/97 5:47AM
12:Finite trees/large cardinals  3/11/98  11:36AM
13:Min recursion/Provably recursive functions  3/20/98  4:45AM
14:New characterizations of the provable ordinals  4/8/98  2:09AM
14':Errata  4/8/98  9:48AM
15:Structural Independence results and provable ordinals  4/16/98
10:53PM
16:Logical Equations, etc.  4/17/98  1:25PM
16':Errata  4/28/98  10:28AM
17:Very Strong Borel statements  4/26/98  8:06PM
18:Binary Functions and Large Cardinals  4/30/98  12:03PM
19:Long Sequences  7/31/98  9:42AM
20:Proof Theoretic Degrees  8/2/98  9:37PM
21:Long Sequences/Update  10/13/98  3:18AM
22:Finite Trees/Impredicativity  10/20/98  10:13AM
23:Q-Systems and Proof Theoretic Ordinals  11/6/98  3:01AM
24:Predicatively Unfeasible Integers  11/10/98  10:44PM
25:Long Walks  11/16/98  7:05AM
26:Optimized functions/Large Cardinals  1/13/99  12:53PM
27:Finite Trees/Impredicativity:Sketches  1/13/99  12:54PM
28:Optimized Functions/Large Cardinals:more  1/27/99  4:37AM
28':Restatement  1/28/99  5:49AM
29:Large Cardinals/where are we? I  2/22/99  6:11AM
30:Large Cardinals/where are we? II  2/23/99  6:15AM
31:First Free Sets/Large Cardinals  2/27/99  1:43AM
32:Greedy Constructions/Large Cardinals  3/2/99  11:21PM
33:A Variant  3/4/99  1:52PM
34:Walks in N^k  3/7/99  1:43PM
35:Special AE Sentences  3/18/99  4:56AM
35':Restatement  3/21/99  2:20PM
38:Existential Properties of Numerical Functions  3/26/99  2:21PM
39:Large Cardinals/synthesis  4/7/99  11:43AM
40:Enormous Integers in Algebraic Geometry  5/17/99 11:07AM
41:Strong Philosophical Indiscernibles
42:Mythical Trees  5/25/99  5:11PM
43:More Enormous Integers/AlgGeom  5/25/99  6:00PM
44:Indiscernible Primes  5/27/99  12:53 PM
45:Result #1/Program A  7/14/99  11:07AM
46:Tamism  7/14/99  11:25AM
47:Subalgebras/Reverse Math  7/14/99  11:36AM
48:Continuous Embeddings/Reverse Mathematics  7/15/99  12:24PM
49:Ulm Theory/Reverse Mathematics  7/17/99  3:21PM
50:Enormous Integers/Number Theory  7/17/99  11:39PN
51:Enormous Integers/Plane Geometry  7/18/99  3:16PM
52:Cardinals and Cones  7/18/99  3:33PM
53:Free Sets/Reverse Math  7/19/99  2:11PM
54:Recursion Theory/Dynamics 7/22/99 9:28PM
55:Term Rewriting/Proof Theory 8/27/99 3:00PM
56:Consistency of Algebra/Geometry  8/27/99  3:01PM
57:Fixpoints/Summation/Large Cardinals  9/10/99  3:47AM
57':Restatement  9/11/99  7:06AM
58:Program A/Conjectures  9/12/99  1:03AM
59:Restricted summation:Pi-0-1 sentences  9/17/99  10:41AM
60:Program A/Results  9/17/99  1:32PM
61:Finitist proofs of conservation  9/29/99  11:52AM
62:Approximate fixed points revisited  10/11/99  1:35AM
63:Disjoint Covers/Large Cardinals  10/11/99  1:36AM
64:Finite Posets/Large Cardinals  10/11/99  1:37AM
65:Simplicity of Axioms/Conjectures  10/19/99  9:54AM
66:PA/an approach  10/21/99  8:02PM
67:Nested Min Recursion/Large Cardinals  10/25/99  8:00AM
69:Baby Real Analysis  11/1/99  6:59AM
70:Efficient Formulas and Schemes  11/1/99  1:46PM
71:Ackerman/Algebraic Geometry/1  12/10/99  1:52PM
72:New finite forms/large cardinals  12/12/99  6:11AM
73:Hilbert's program wide open?  12/20/99  8:28PM
74:Reverse arithmetic beginnings  12/22/99  8:33AM
75:Finite Reverse Mathematics  12/28/99  1:21PM
76: Finite set theories  12/28/99  1:28PM
77:Missing axiom/atonement  1/4/00  3:51PM
79:Axioms for geometry  1/10/00  12:08PM
80.Boolean Relation Theory  3/10/00  9:41AM
81:Finite Distribution  3/13/00  1:44AM
82:Simplified Boolean Relation Theory  3/15/00  9:23AM
83:Tame Boolean Relation Theory  3/20/00  2:19AM
84:BRT/First Major Classification  3/27/00  4:04AM
85:General Framework/BRT   3/29/00  12:58AM
86:Invariant Subspace Problem/fA not= U  3/29/00  9:37AM
87:Programs in Naturalism  5/15/00  2:57AM
88:Boolean Relation Theory  6/8/00  10:40AM
89:Model Theoretic Interpretations of Set Theory  6/14/00 10:28AM
90:Two Universes  6/23/00  1:34PM
91:Counting Theorems  6/24/00  8:22PM
92:Thin Set Theorem  6/25/00  5:42AM
93:Orderings on Formulas  9/18/00  3:46AM
94:Relative Completeness  9/19/00  4:20AM
95:Boolean Relation Theory III  12/19/00  7:29PM
97.Classification of Set Theories  12/22/00  7:55AM
98:Model Theoretic Interpretation of Large Cardinals  3/5/01  3:08PM
99:Boolean Relation Theory IV  3/8/01  6:08PM
100:Boolean Relation Theory IV corrected  3/21/01  11:29AM
101:Turing Degrees/1  4/2/01  3:32AM
102: 102:Turing Degrees/2  4/8/01  5:20PM
103:Hilbert's Program for Consistency Proofs/1 4/11/01  11:10AM
104:Turing Degrees/3   4/12/01  3:19PM
105:Turing Degrees/4   4/26/01  7:44PM
106.Degenerative Cloning  5/4/01  10:57AM
107:Automated Proof Checking  5/25/01  4:32AM

```