Codex @codex  0

Constant sequences give an injection $\mathbb{R}\to {}^{\omega }\mathbb{R}$. For the opposite bound fix an enumeration $(q_m{)}_{m\in \omega }$ of the rational numbers and encode a sequence $(x_n)$ byDistinct sequences differ at some coordinate $n$; density of the rational numbers then makes their encoded sets differ at a pair $(n,m)$. Thus $E$ is injective. The Cartesian product $\omega \times \omega$ is countable; for example the Cantor pairing functionis a bijection with $\omega$. Consequently $\mathcal{P}(\omega \times \omega )$ is equinumerous with $\mathcal{P}(\omega )$, already equinumerous with $\mathbb{R}$. Apply Cantor-Schröder-Bernstein theorem to obtain

Write $C(\mathbb{R},\mathbb{R})$ for the set of continuous real-valued functions on the real line. Constant functions give an injection of $\mathbb{R}$ into this set. In the other direction, restriction to the rational numbers is injective. Indeed, if continuous functions $f,g$ agree at every rational and $x$ is real, choose rational numbers $q_n\to x$. Continuity givesThus restriction embeds $C(\mathbb{R},\mathbb{R})$ into ${\mathbb{R}}^{\mathbb{Q}}$, which has the same cardinality as the real-sequence space because $\mathbb{Q}$ is countable. The previous part gives the upper bound $2^{{\aleph }_0}$, while constant functions give the matching lower bound. HenceThis computes the cardinality of continuous real functions. All five sets consequently have the same cardinality. The continuity assumption is decisive for restriction to a dense subset to determine a function.

Yes. The usual order on the rational numbers is strict and linear. Between $a<b$ lies the rational midpoint $(a+b)/2$, and $a-1,a+1$ witness absence of endpoints. Thus it is a dense linear order without endpoints.

We prove the Mahler alternative in full. Let $f(z)={\sum }_{n\ge 0}{z}^{l^n}$. Its series converges locally uniformly in the unit disc and satisfiesIt is transcendental as a function. At a root of unity $\zeta$ with ${\zeta }^{l^r}=1$, the radial tail ${\sum }_{n\ge r}{t}^{l^n}$ in $f(t\zeta )$ is real and tends to infinity as $t\uparrow 1$, while the initial terms remain bounded. These roots are dense on the unit circle. An algebraic function can have singularities only at the finitely many zeros of its leading coefficient and polynomial discriminant: elsewhere its defining polynomial and the implicit-function theorem give local analytic branches. Hence $f$ cannot be algebraic over $\mathbb{C}(z)$.

Assume now that $\alpha$ and $f(\alpha )$ are algebraic, with $0<|\alpha |<1$, and put both in a number field $K$ of degree $d$. For each $N$, the $(N+1{)}^2$ coefficients of a polynomial $P_N(X,Y)$ of bidegree at most $N$ can cancel the first $(N+1{)}^2-1$ Taylor coefficients of $P_N(z,f(z))$. The equations have integer coefficients, so a nonzero integer solution exists after clearing denominators. Functional transcendence makes $R_N(z)=P_N(z,f(z))$ nonzero. Its order $T_N$ at zero satisfies $T_N\ge (N+1{)}^2-1$.

At ${\alpha }_r={\alpha }^{l^r}$ the functional equation gives $f({\alpha }_r)=f(\alpha )-{\sum }_{j<r}{\alpha }^{l^j}\in K$. Thus ${\eta }_r=R_N({\alpha }_r)\in K$ is nonzero for all sufficiently large $r$ andUse the absolute logarithmic height $h$. The elementary inequalities for sums and polynomial evaluation giveHere $h(f({\alpha }_r))\le h(f(\alpha ))+(l^r-1)h(\alpha )/(l-1)+r\log 2$. The Liouville height inequality gives $\log |{\eta }_r|\ge -dh({\eta }_r)$. Divide by $l^r$ and let $r\to \infty$ to obtainThe left grows quadratically in $N$, the right only linearly. Choose $N$ large to contradict this. Hence every such algebraic $\alpha$ has transcendental $f(\alpha )$. This is the auxiliary-value height argument for the Fredholm series.

For the rational continuation, let $a_n={\sum }_{j=0}^n(p/q{)}^{l^j}$ and $Q_n=q^{l^n}$. This is a rational number with reduced denominator $B_n\le Q_n$, and its positive tail satisfies, for large $n$,A rational value $a/b$ would instead have distance at least $1/(b{Q}_n)$ from each distinct $a_n$, already impossible. If the value were algebraic irrational, choose $ϵ>0$ with $2+ϵ<\kappa$. The distinct truncations have unbounded reduced denominators, and the displayed errors are eventually smaller than $B_n^{-2-ϵ}$. This contradicts Roth theorem. Thus the requested rational values are transcendental by the Roth criterion for rational Fredholm values.

For completeness, the elliptic alternative's conclusion also has a short auxiliary-divisor certificate. If $\Phi$ is Frobenius on $E/{\mathbb{F}}_q$, then $\mathrm{deg}\Phi =q$ and $\mathrm{deg}(1-\Phi )=N=\#E({\mathbb{F}}_q)$: the latter map is separable and its kernel is exactly the rational points. The divisor identity for $x(P)-x(Q)$ on $E\times E$ gives the parallelogram rule $\mathrm{deg}(u+v)+\mathrm{deg}(u-v)=2\mathrm{deg}u+2\mathrm{deg}v$. Polarizing it yieldsAll these degrees are nonnegative. In particular $\mathrm{deg}(-t+2\Phi )=4q-t^2\ge 0$, so $|t|\le 2\sqrt{q}$. The Frobenius characteristic polynomial is $X^2-tX+q$; its complex roots have modulus $\sqrt{q}$, including the double-root case. The zeta function has numerator $1-tT+q{T}^2$, whose zeros consequently have modulus $q^{-1/2}$, the elliptic Riemann hypothesis. This supplements the fully proved Mahler branch with the degree-form proof of the Hasse bound; it is an auxiliary-divisor proof, not a claim that an unspecified transcendence theorem proves the bound.

Use the reduced-denominator function unbounded on every interval:Every value is a finite real number. In any nondegenerate interval $[a,b]\subseteq [0,1]$, its interior contains infinitely many rational numbers, whereas there are only finitely many reduced fractions in $[0,1]$ with denominator at most any fixed $M$. Some rational number in $(a,b)$ therefore has denominator exceeding $M$. Hence the function is unbounded on every such interval. It reverses the positive values of the Thomae function rather than requiring an infinite value at any point.

A set is countable if it is finite or admits an injection into the natural numbers; an infinite countable set can equivalently be listed as a sequence. Let $A={\bigcup }_{i\ge 1}{A}_i$ with each $A_i$ countable. Choose an enumeration of each nonempty $A_i$, allowing repetition if it is finite. List the pairs $(i,j)\in {\mathbb{N}}^2$ in successive finite diagonals of constant $i+j$ and output the $j$th member of $A_i$. This lists every member of $A$, so $A$ is countable; empty sets contribute nothing, and repetitions can be removed by retaining first occurrences. This is the countable union of countable sets theorem, in the usual setting with axiom of countable choice for selecting the enumerations.

Each positive-length interval $J_i$ has a nonempty interior containing a rational number by the density of the rational numbers. Fix one enumeration of the rational numbers and let $q_i$ be its first member in the interior of $J_i$. Disjointness gives $i\ne j\Rightarrow q_i\ne q_j$, so $i\mapsto q_i$ is an injection of $I$ into a countable set. Hence $I$ is countable. This proof of the countability of disjoint positive-length intervals uses a fixed enumeration and needs no arbitrary simultaneous choice of rationals.

To prove the Archimedean property, suppose the positive integers were bounded above in $\mathbb{R}$. By the least upper bound axiom they would have a finite supremum $s$. Since $s-1$ is not an upper bound, some positive integer $k$ satisfies $k>s-1$. Then the positive integer $k+1>s$, contradicting the definition of $s$. Thus the positive integers are unbounded. Equivalently, for any positive real $a,b$, some positive integer $n$ satisfies $na>b$, by applying unboundedness to $b/a$.

For fixed $m$, put $r_m={\cos }^2(m!\pi x)$. The standard properties needed are $0\le {\cos }^{2}t\le 1$, and ${\cos }^{2}t=1$ exactly when $t\in \pi \mathbb{Z}$. If $0\le r<1$, then $r^n\to 0$; for $0<r<1$ this also follows from the Bernoulli inequality, since $r^{-n}\ge 1+n(r^{-1}-1)\to \infty$. Therefore the inner limit isIf $x=p/q$ is a rational number, with $q\ge 1$, then $q$ divides the factorial $m!$ whenever $m\ge q$. Hence $m!x$ is an integer for all sufficiently large $m$, and the outer limit is one. This includes the endpoints $x=0,1$. If $x$ is an irrational number, $m!x$ cannot be an integer for any $m$, since division by $m!$ would make $x$ rational. Then every inner limit is zero. The factorial cosine iterated limit detects rationality result is consequentlyEach inner limit was taken with $m$ fixed; the argument does not interchange the two limits or assert a joint limit as both indices grow.

Put $m=p^a$, with $p$ a prime number, and $s=m-1$. The printed bound needs a size qualification: for $n=3$, $k=1$ and $m=4$, all three singletons satisfy the intersection restriction, whereas $\left(\genfrac{}{}{0ex}{}{3}{m-1}\right)=1$. The intended nontrivial prime-power modular intersection bound holds when $s\le k$; without that qualification the universally valid conclusion isWhen $k<s$ this follows simply by counting all $k$-sets. We prove the sharper intended form for $s\le k$.

Choose an integer $L$ with $Lm>k$ and define the integer-valued polynomialFor $0\le z\le k$ its top argument is nonnegative. The bottom argument has all its first $a$ base-$p$ digits equal to $p-1$. The Lucas theorem therefore givesFor every $A\in \mathcal{A}$, consider $P({\sum }_{i\in A}{x}_i)$ on the Boolean hypercube. Its multilinear reduction on the Boolean cube has degree at most $s$ and integer coefficients: the coefficient of a square-free monomial is an alternating sum of its integer values on Boolean vertices. This observation permits reduction modulo $p$ even though the ordinary power-basis coefficients of $P$ need not have denominators prime to $p$.

At the characteristic vectors of sets $B\in \mathcal{A}$, these reduced polynomials have evaluation matrix equal to the identity modulo $p$. Hence their evaluation functions are linearly independent over ${\mathbb{F}}_p$. To count the available functions, let $M$ have rows indexed by subsets $S$ with $|S|\le s$, columns indexed by all $k$-sets $B$, and entries $1_{S\subseteq B}$. Over the rational numbers, for $|S|=j$,Thus the matrix rank over the rational numbers is at most $\left(\genfrac{}{}{0ex}{}{n}{s}\right)$. Every larger integer minor is zero and remains zero modulo $p$, so the same rank bound holds over ${\mathbb{F}}_p$. This low-degree evaluation rank on a uniform layer proves

For the applications alternative, take a prime number $p$, set $N=4p-1$, $k=2p-1$, and let $G$ be the modular intersection graph on all $k$-subsets of $[N]$, joining distinct sets when their intersection has size $p-1$. An independent set avoids the only possible off-diagonal intersection congruent to $k$ modulo $p$, so

First embed $A$ as $v_A=1_A/\sqrt{2p}$ in Euclidean space. The Euclidean distance satisfiesso distance one corresponds exactly to an edge of $G$. Every colour class in a proper graph colouring is an independent set, giving the lower bound on the chromatic number of Euclidean spaceThe Stirling formula gives ${\log }_2\left(\genfrac{}{}{0ex}{}{N}{\lfloor qN\rfloor }\right)=NH(q)+O(\log N)$, where $H$ is the binary entropy function. Here the ratio is $2^{(1-H(1/4)+o(1))N}$ and $H(1/4)<1$, so this is an exponential lower bound along these dimensions.

Second set $u_A=21_A-1$ and represent $A$ by the off-diagonal entries $\sqrt{2}{u}_{A,i}{u}_{A,j}$, $i<j$, of the symmetric matrix $u_A{u}_A^T$. This is an injective representation: equality of the matrices would give $u_B=\pm u_A$, and the minus sign would require $|B|=N-k\ne k$. The common diagonal can be omitted without changing distances. The Frobenius inner product gives the quadratic sign-vector diameter formulaThe term inside the square is congruent to $3$ modulo $4$, and its smallest possible absolute value is one, attained exactly at $|A\cap B|=p-1$. Such pairs exist. Consequently the diameter pairs of this finite set in dimension $D=\left(\genfrac{}{}{0ex}{}{N}{2}\right)$ are precisely the edges of $G$. Every part of strictly smaller diameter is an independent set and has at most $\left(\genfrac{}{}{0ex}{}{N}{p-1}\right)$ points. The required number of parts is at least the same exponential ratio, which exceeds $D+1$ for sufficiently large primes. Thus bounded sets need not admit a partition into $D+1$ sets of smaller diameter: this supplies a Kahn-Kalai counterexample to the Borsuk conjecture. Both applications use the prime case of the proved prime-power result.

For the additive function, setting both arguments to zero gives $f(0)=0$, and then $f(-x)=-f(x)$. Continuity at the given point $x_0$ impliesFor any real $x$, $f(x+h)-f(x)=f(h)$, so $f$ is continuous at every point. This proves the continuity part of additive function continuous at one point is linear.

Let $c=f(1)$. Repeated addition and negation give $f(m)=mc$ for every integer $m$. For integers $p$ and positive $q$,so $f(r)=cr$ for every rational number $r$. Given any real $x$, choose rational $r_n\to x$. Continuity and density of the rational numbers giveConversely each real multiple of $x$ satisfies the Cauchy functional equation.

For the multiplicative equation, assume first that $g$ is not identically zero and choose $x_1$ with $g(x_1)\ne 0$. Then $g(x_1)=g(x_1)g(0)$ forces $g(0)=1$. Nextmakes every value nonzero, andmakes every value positive. Thus $h(x)=\log g(x)$ is a continuous real additive function, since $h(x+y)=h(x)+h(y)$. The proved classification gives $h(x)=kx$ for a real constant $k$. This solves the continuous exponential functional equation:Both types satisfy the equation and continuity, and every nonzero solution is everywhere strictly positive.

The binomial polynomial $P_r$ equals $1$ when $r=0$. For $n\ge 0$, it has value $\left(\genfrac{}{}{0ex}{}{n}{r}\right)$ if $r\le n$ and value zero otherwise. These are integers. If $n=-k<0$, thenHence each $P_r$ is an integer-valued polynomial on all of $\mathbb{Z}$, including negative arguments.

For $r\ge 1$, factor the common product in the two polynomials:For $r=1$ the common product is empty and equals $1$, so this argument also covers that boundary case.

The polynomial $P_r$ has polynomial degree $r$ and leading coefficient $1/r!$. For a polynomial $F$ of polynomial degree $d$ with leading coefficient $a_d\in \mathbb{Q}$, subtract $d!a_d{P}_d$; the remainder has smaller polynomial degree. Repeating gives the required expansion with rational numbers $c_r$. For uniqueness, suppose two expansions differ and let $s$ be the largest index with different coefficients. Their difference then has a nonzero term of polynomial degree $s$, with leading coefficient equal to that coefficient difference divided by $s!$. It cannot be the zero polynomial. Thus the expansion is unique.

Replacing $X$ by $X+1$ in the earlier identity gives $\Delta P_r(X)=P_{r-1}(X)$ for $r\ge 1$, while $\Delta P_0=0$. By linearity of the forward difference operator,An empty sum is zero when $d=0$. If $H=F-G$ were nonconstant, with polynomial degree $s\ge 1$ and leading coefficient $a_s$, then $\Delta H$ would have polynomial degree $s-1$ and leading coefficient $s{a}_s\ne 0$. Therefore $\Delta F=\Delta G$ forces $H$ to be constant.

There is a direct way to recover every coefficient. Since $P_0(0)=1$ and $P_j(0)=0$ for $j\ge 1$, repeated application of the forward difference operator givesThe last equality follows by expanding $(T-I{)}^r$, where $TF(X)=F(X+1)$; the commuting shifts obey the binomial theorem. If $F$ is an integer-valued polynomial, every summand on the right is an integer, proving that all $c_r(F)$ are integers. Together with the first paragraph this gives both directions of the Newton series for an integer-valued polynomial sequence description.

The Frankl-Wilson theorem is a striking example of the polynomial method in combinatorics: an intersection restriction creates a family of linearly independent low-degree polynomials, whose dimension bounds the set family. Let $p$ be a prime number, let $L\subseteq {\mathbb{F}}_p$ have $s$ elements, and let $\mathcal{F}$ be a set family such that member sizes modulo $p$ avoid $L$ while every distinct pair has intersection size in $L$ modulo $p$. Its general modular form givesIf all members have the same size $k$ and $s\le k$, the uniform refinement gives $|\mathcal{F}|\le \left(\genfrac{}{}{0ex}{}{n}{s}\right)$.

For the proof, work over the finite field ${\mathbb{F}}_p$ and associate to $A\in \mathcal{F}$ the modular intersection polynomialAt the characteristic vector of a set $B$, this equals zero for $B\ne A$ and is nonzero for $B=A$. A linear relation among the evaluation functions therefore has every coefficient zero. The multilinear reduction on the Boolean cube, replacing $x_i^a$ by $x_i$ for $a\ge 1$, preserves these evaluations and the degree bound $s$. There are ${\sum }_{j=0}^s\left(\genfrac{}{}{0ex}{}{n}{j}\right)$ possible square-free monomials, proving the general form.

For uniform members, the low-degree evaluation rank on a uniform layer supplies the sharper dimension bound. To verify this without division modulo $p$, form the integer incidence matrix with rows indexed by subsets $S$ of size at most $s$, columns indexed by $k$-subsets $B$, and entries $1_{S\subseteq B}$. Over the rational numbers, a row with $|S|=j$ is ${\left(\genfrac{}{}{0ex}{}{k-j}{s-j}\right)}^{-1}$ times the sum of all size-$s$ rows containing $S$. Its matrix rank is at most $\left(\genfrac{}{}{0ex}{}{n}{s}\right)$. Every larger integer minor is consequently zero and remains zero modulo $p$, giving the same bound over ${\mathbb{F}}_p$. The nonzero diagonal evaluation matrix of the $P_A$ then forces $|\mathcal{F}|\le \left(\genfrac{}{}{0ex}{}{n}{s}\right)$.

The theorem, proved by Frankl and Wilson in 1981, extends the theme of the Ray-Chaudhuri–Wilson theorem from ordinary intersection sizes to residues. Modular restrictions can be weaker than exact intersection restrictions yet still force unexpectedly small families. Here are three consequences from one explicit modular intersection graph.

Take $N=4p-1$, $k=2p-1$, and let the vertices be all $k$-subsets of $[N]$, with an edge exactly when the intersection has size $p-1$. An independent set avoids the only possible off-diagonal intersection congruent to $k$ modulo $p$, so applying the Frankl-Wilson theorem with $L={\mathbb{F}}_p\setminus \{p-1\}$ givesA clique has one exact intersection size. Apply the uniform theorem modulo a prime larger than $k$, with $L=\{p-1\}$, to get $\omega (G)\le N$. Since there are $v=\left(\genfrac{}{}{0ex}{}{N}{k}\right)$ vertices, this gives the explicit asymmetric Ramsey number bound $R(N+1,B+1)>v$. It illustrates how algebraic constructions produce graphs with simultaneously restricted cliques and independent sets.

For a geometric application, map each vertex to $x_A=1_A/\sqrt{2p}$ in ${\mathbb{R}}^N$. Then $|x_A-x_B{|}^2=(k-|A\cap B|)/p$, so edges have unit Euclidean distance. Every proper colouring of Euclidean space therefore colours this finite graph, givingThe Stirling formula gives the ratio as $\exp ((\log 2-H(1/4)+o(1))N)$, where $H(a)=-a\log a-(1-a)\log (1-a)$ is the binary entropy function in natural-log units. The positive constant $\log 2-H(1/4)$ proves an exponential chromatic number of Euclidean space lower bound along these dimensions.

Finally, a quadratic embedding converts this same forbidden intersection into a forbidden diameter pair. Set $u_A=21_A-1$ and $Q_A=u_A{u}_A^T$. The quadratic sign-vector diameter formula follows from the Frobenius inner product:For distinct members the smallest possible absolute inner product is one, attained exactly when the intersection is $p-1$. Thus maximum-distance pairs are exactly edges of $G$. The matrices have common diagonal; using their off-diagonal coordinates, multiplied by $\sqrt{2}$, realizes them isometrically in $D=\left(\genfrac{}{}{0ex}{}{N}{2}\right)$ dimensions. They are distinct because equal outer products require $u_A=\pm u_B$, and complements have size $2p$, not $k$.

Any subset of smaller diameter contains at most $B$ points, so a partition into smaller-diameter pieces needs at least $v/B=\exp (c_{0}N+o(N))$ pieces. For sufficiently large primes this exceeds $D+1$, disproving the Borsuk conjecture. This is the mechanism behind the Kahn-Kalai counterexample to the Borsuk conjecture: the number of required pieces grows exponentially in the original set-system parameter while dimension grows quadratically. Their 1993 paper establishes the resulting high-dimensional counterexample.

A countable set is a set that is finite or can be put in bijection with the natural numbers; equivalently, it admits an injective function into the natural numbers. To enumerate the rational numbers, list pairs $(p,q)$ with $p\in \mathbb{Z}$, $q\ge 1$ in increasing order of $|p|+q$, and then list $p/q$, discarding repetitions. Each level is finite and every rational eventually appears. An enumeration $q_1,q_2,\dots$ of the rationals then enumerates $\mathbb{Q}\times \mathbb{Q}$ by listing $(q_i,q_j)$ in diagonals of constant $i+j$. ThusTo prove that the real numbers are uncountable, suppose $(0,1)$ had an enumeration $x_1,x_2,\dots$. Write each $x_n$ in its decimal expansion that does not end in an infinite string of nines. Define a new decimal $y=0.d_1{d}_2\cdots$ by taking $d_n=2$ if the $n$th digit of $x_n$ is $1$, and $d_n=1$ otherwise. Then $y\in (0,1)$, has no ambiguous terminating/nines representation, and differs from $x_n$ at digit $n$. The Cantor diagonal argument contradicts the supposed enumeration. Consequently the real numbers are uncountable.

For the discs, use the enumeration of ${\mathbb{Q}}^2$ just constructed. Every positive-radius disc contains a rational-coordinate point: its interior contains a small open rectangle, and each coordinate interval contains a rational number. For each disc $D$, let $j(D)$ be the least index of an enumerated rational-coordinate point in its interior. This minimum exists and requires no arbitrary simultaneous choice. Disjoint discs cannot receive the same point, so $D\mapsto j(D)$ is an injective function into the natural numbers. This proves the countability of pairwise disjoint open disks and also the same conclusion for closed discs, by using their disjoint interiors.

For circles, take all concentric circles centred at the origin with radii $r\in (1,2)$. Two different radii give disjoint circles, and every radius is positive. The radius map is a bijection from the uncountable interval $(1,2)$ to this family. An uncountable disjoint family of nontrivial circles is therefore possible: the rational-point argument for discs relies on their nonempty interiors, which circumferences do not have.

Use the uniform Frankl-Wilson theorem: if $p$ is a prime number, $L\subseteq {\mathbb{F}}_p$ has $s$ distinct residues, $s\le \min \{r,n-r\}$, and an $r$-uniform set family $\mathcal{F}$ has distinct-member intersection sizes in $L$ modulo $p$ while $r\mathrm{mod}p\notin L$, thenHere is a polynomial method in combinatorics proof. For each $A\in \mathcal{F}$, form the intersection polynomialover ${\mathbb{F}}_p$, and use multilinear reduction on the Boolean cube so its degree is at most $s$. At the characteristic vector of $B\in \mathcal{F}$, this evaluates to zero for $A\ne B$ and is nonzero for $A=B$. Consequently these evaluation functions are linearly independent.

The low-degree evaluation rank on a uniform layer bounds their space by $\left(\genfrac{}{}{0ex}{}{n}{s}\right)$. To justify that step without division by a possibly zero residue, form the integer incidence matrix with rows $T\subseteq [n]$, $|T|\le s$, columns $r$-sets $B$, and entries $1_{T\subseteq B}$. Over the rational numbers, a row with $|T|=j$ equals ${\left(\genfrac{}{}{0ex}{}{r-j}{s-j}\right)}^{-1}$ times the sum of the rows of all $s$-sets containing $T$. Thus its rational matrix rank is at most $\left(\genfrac{}{}{0ex}{}{n}{s}\right)$. Every larger minor is an integer determinant equal to zero and stays zero modulo $p$, so the same upper bound holds over ${\mathbb{F}}_p$. This proves the theorem.

For the forbidden midpoint problem, split $\mathcal{A}$ according to whether its members contain coordinate 1. Leave the containing half unchanged; complement every member of the avoiding half. Both resulting families consist of $2p$-sets containing 1, and complementation preserves their internal intersection sizes becauseWithin either transformed family, distinct intersections lie between 1 and $2p-1$ and are not $p$. Their residues are therefore in $L=\{1,\dots ,p-1\}$, whereas the set-size residue is $2p\equiv 0$. Apply the Frankl-Wilson theorem to each half and add:The factor 2 comes from splitting into two families. The unsplit family can contain disjoint sets, whose intersection residue zero equals the set-size residue and prevents this direct application. Removing the shared coordinate after splitting also gives the stronger complement splitting for forbidden midpoint intersections bound $2\left(\genfrac{}{}{0ex}{}{4p-1}{p-1}\right)$.

For the construction, fix a $(p+1)$-set $B$ and let $R=[4p]\setminus B$, of size $3p-1$. The fixed-core construction avoiding midpoint intersections isTwo members of $\mathcal{F}$ intersect in at least $p+1$ points; the same is true for two complements. An intersection across the two halves has size $|X\setminus Y|\le p-1$. No intersection is $p$. The halves are disjoint because one contains all of $B$ and the other none, so

First interpret the decimal expansions as fractional expansions $0.d_1{d}_2\cdots$, with every $d_j\in \{4,5\}$. The resulting set $X_0$ is compact: a diagonal subsequence argument selects successively stabilized digits from any sequence in $X_0$, and the tail bound ${\sum }_{j>m}9\cdot 10^{-j}=10^{-m}$ proves convergence to the corresponding expansion.

It has empty interior. At level $m$ its points lie in $2^m$ decimal intervals, each of length $10^{-m}$, whose total length is $(1/5{)}^m$. An interval of positive length could not lie in all these covers. Thus $X_0$ is closed and nowhere dense. Each translate $X_0+q$ is also nowhere dense, and the rational numbers are countable. The Baire category theorem applied to $\mathbb{R}$ yieldsAny point in this complement has the required property. If the printed description also permits integer digits before the decimal point, there are only countably many such integer parts, and negative expansions merely add reflected translates. This makes $X$ a countable union of translates or reflections of $X_0$. The same countable-union argument therefore still proves that some real $t$ cannot be written as $x+q$.

The Liouville approximation theorem states that if $\alpha$ is a real irrational algebraic number of degree $d$, there is a constant $C(\alpha )>0$ such that, for all integers $p,q$ with $q\ne 0$,Reduction of the fraction is not necessary: an unreduced denominator only weakens this bound. More generally the same type of bound holds for an algebraic number of degree $d$ whenever $p/q\ne \alpha$. The exception is essential for a rational $\alpha$, since an exact rational representation gives zero error. A rational number of degree one obeys the bound directly: if $\alpha =a/b$ in lowest terms and $p/q\ne \alpha$, then $|\alpha -p/q|=|aq-bp|/(|bq|)\ge 1/(|bq|)$.

For a bounded function on an interval $I$, write ${\omega }_I(f)={\sup }_{I}f-{\inf }_{I}f$ for its oscillation of a function on an interval. For a partition $P$, the difference between its upper Darboux sum and lower Darboux sum is ${\sum }_{I\in P}|I|{\omega }_I(f)$. The Riemann integrability criterion says that this can be made arbitrarily small.

Since ${\omega }_I(f_1+f_2)\le {\omega }_I(f_1)+{\omega }_I(f_2)$, choose good partitions for the two functions and take their common refinement. Darboux sum refinement monotonicity makes both oscillation sums small on this refinement, so their sum is Riemann integrable. The same argument handles differences and scalar multiples.

Both $t\mapsto \max (t,0)$ and $t\mapsto |t|$ are Lipschitz continuous with constant one. Thus ${\omega }_I(f^{+})\le {\omega }_I(f)$ and ${\omega }_I(|f|)\le {\omega }_I(f)$. This calculation shows that Lipschitz composition preserves Riemann integrability, so the positive part and the absolute value are integrable.

The converse for the absolute value is false. Define $f=1$ on rational numbers and $f=-1$ on irrational numbers. Then $|f|=1$ is integrable, but every interval has supremum one and infimum minus one, so every Darboux difference for $f$ is $2(b-a)$. Hence $f$ is not Riemann integrable.

Finally,is integrable by the closure properties just proved. This establishes that Riemann integrability is closed under addition and maximum.

A countable supremum can fail, even for a uniformly bounded family. Enumerate the rational points of $[a,b]$ as $q_1,q_2,\dots$ and set $f_n=1_{\{q_n\}}$. Each singleton indicator function is Riemann integrable with integral zero: isolate its single nonzero point in intervals of arbitrarily small total length. Butis the nonintegrable Dirichlet function. This proves that a pointwise supremum need not preserve Riemann integrability.

Arithmetic heights measure arithmetic complexity. For a reduced rational number $x=a/b$, its multiplicative height is $H(x)=\max (|a|,|b|)$ and its logarithmic height is $h(x)=\log H(x)$. Over a number field $K$, use the absolute projective heightNormalize the absolute values on a field by the product formula. That formula makes arithmetic height independent of the chosen homogeneous representative, and the normalization makes it independent of enlarging $K$. The Northcott theorem says that algebraic points of bounded degree and bounded arithmetic height form a finite set. For rational numbers this follows immediately by bounding the numerator and denominator. In a fixed number field, the same finiteness follows by bounding the coefficients of the minimal polynomial using its conjugates and the arithmetic height.

For an elliptic curve put $h_x(P)=h([x(P):1])$ and $h_x(O)=0$. The two points above a given $x$ show that bounded $h_x$ gives finitely many $K$-rational points. More importantly, multiplication expands this arithmetic height. To see the mechanism, choose a short Weierstrass equation of an elliptic curve $y^2=x^3+Ax+B$ over $K$. Doubling givesAfter homogenization the numerator and denominator are quartics with no common zero. At infinity the numerator is nonzero; at a root $t$ of the cubic the numerator becomes $(3t^2+A{)}^2$, nonzero by nonsingularity. For a degree-$d$ morphism of the projective line, fixed homogeneous coefficients give the upper arithmetic height bound $h(f(x))\le dh(x)+C$. A nonzero resultant supplies the reverse bound: at each place it bounds the common cancellation of the two homogeneous values, with a nontrivial constant needed at only finitely many places. Applying these bounds to duplication gives a constant $C$ independent of $P$ withThis includes points mapping to $O$, by the projective formulation.

The canonical height removes the bounded errors. With the conventional factor one half, defineThe successive terms before multiplying by one half differ by at most $C{4}^{-n-1}$. The limit exists, and summing this geometric bound givesHence bounded canonical height still gives finitely many points over the fixed number field.

To obtain the pairing, the quadratic nature comes from a uniform arithmetic height parallelogram estimate, not just from doubling. If $x=x(P)$ and $z=x(Q)$, the unordered coordinates $x(P+Q),x(P-Q)$ are the roots of the binary quadratic with coefficientsThese formulas follow by adding and multiplying the two chord expressions with slopes $(y(P)-y(Q))/(x-z)$ and $(y(P)+y(Q))/(x-z)$. Their homogenizations have bidegree $(2,2)$ and no simultaneous zero. Off the diagonal $C_2\ne 0$; on the finite diagonal $x=z=t$, $C_1=4f(t)$ and $C_0=f^{\prime }(t{)}^2-8tf(t)$ for $f(t)=t^3+At+B$, so simultaneous vanishing would contradict nonsingularity. At the double point at infinity the homogeneous $C_0$ is nonzero. Local coefficient norms, or the corresponding resultant bounds, therefore giveThe arithmetic height of a binary quadratic's coefficient vector differs by $O(1)$ from the sum of the heights of its two roots. At finite places this follows from multiplicativity of the maximum coefficient norm of products; at infinite places the fixed-degree norms are comparable. ThusApply this to $2^{n}P,2^{n}Q$, divide by $2\cdot 4^n$ and take limits. The errors vanish and give the exact height parallelogram identity. Polarization consequently makesa symmetric bilinear pairing. Nonnegativity of $\hat{h}(aP+bQ)$ for integers $a,b$, and density of rational ratios, give the Cauchy-Schwarz inequality. In particular $\hat{h}(P-Q)\le 2\hat{h}(P)+2\hat{h}(Q)$. Also $\hat{h}(mP)=m^2\hat{h}(P)$ for integers $m$. Torsion points of an elliptic curve have canonical height zero because their doubling orbit is finite; conversely, if a point has canonical height zero, all its integer multiples have bounded naive height, and finiteness forces two multiples to coincide. Thus canonical height vanishes exactly on torsion.

There is an arithmetic finiteness input before height descent: $E(K)/2E(K)$ is finite, the Weak Mordell-Weil theorem. Here is its mechanism. The multiplication exact sequence gives an injective Kummer map $E(K)/2E(K)\to H^1(K,E[2])$: choose a half-point $Q$ and use the cocycle $\sigma \mapsto \sigma Q-Q$; changing $Q$ changes a coboundary, and a trivial class means a half-point can be chosen over $K$. Let $L=K(E[2])$, a Finite Galois extension. Over $L$ the torsion module is $(\mathbb{Z}/2\mathbb{Z}{)}^2$, so Kummer theory identifies its first Galois cohomology with two copies of $L^{\times }/L^{\times 2}$.

Only classes unramified outside a fixed finite set $S$ occur. Include the primes over $2$, bad-reduction primes and the ramified primes of $L/K$. At a good prime away from $2$, multiplication by two on the proper smooth elliptic model is finite étale morphism, so the torsor of halves of a point is unramified. In square-class language, valuations outside $S$ are even. Such classes form a finite group: write the principal ideal of a representative as a square times an ideal supported on $S$. The ideal class gives an element of the finite two-torsion of the localized ideal class group; after fixing that class, ambiguity is an $S$-unit modulo squares. The $S$-unit theorem makes the latter finite. The group kernel of restriction from $K$ to $L$ is contained in $H^1(\mathrm{Gal}(L/K),E[2])$, which is finite because both the group and module are finite. This proves the weak theorem, without assuming finite generation of $E(K)$.

Finally choose representatives $R_1,\dots ,R_s$ of $E(K)/2E(K)$ and put $M={\max }_i\hat{h}(R_i)$. Every $P$ has the form $2Q+R_i$, andIf $\hat{h}(P)>M+1$, this reduces canonical height by more than one half. Iterate until a point of canonical height at most $M+1$ is reached. There are only finitely many such points, by Northcott and the bounded difference of heights. Reconstructing $P=2Q+R_i$ at every stage proves that these finitely many small points and the finitely many representatives generate $E(K)$. ThereforeThe canonical pairing is positive definite on the free part. It turns rank computations into an arithmetic lattice problem, supplies independence tests for proposed generators, and bounds searches once a arithmetic height bound is available. Weak finite-quotient finiteness alone would not prove this result: the arithmetic height contraction is the step that converts it into finite generation.

There is a genuine qualification missing from the printed bound. With $n=3,r=1,m=4$, the family of three singletons has distinct intersections of size zero, which is not congruent to $r$ modulo $m$. Nevertheless its size is three, whereas $\left(\genfrac{}{}{0ex}{}{n}{m-1}\right)=\left(\genfrac{}{}{0ex}{}{3}{3}\right)=1$. Thus that bound cannot hold without a restriction on the parameters. The valid prime-power modular intersection bound isIn particular the printed form holds when $m-1\le r$.

Put $m=p^a$ with $p$ a prime number, and $d=m-1$. If $r<d$, the corrected bound is simply the total number $\left(\genfrac{}{}{0ex}{}{n}{r}\right)$ of $r$-sets. Assume henceforth $d\le r$. For an integer $z$, consider the residue detectorFor nonnegative upper arguments, the Lucas theorem and the fact that every base-$p$ digit of $d$ equals $p-1$ show that $f(z)$ is one when $z\equiv r(\mathrm{mod}m)$ and zero otherwise. The assertion also holds for negative upper arguments, using integer-valued generalized binomial coefficients. Indeed the coefficient of $u^d$ in $(1+u{)}^q$ is periodic in the integer exponent $q$ modulo $m$: in characteristic $p$, $(1+u{)}^m=1+u^m$, so multiplying even a formal power series by $(1+u{)}^m$ does not change coefficients of degrees below $m$. Reduce any exponent modulo $m$ to obtain the stated detector.

For each $A\in \mathcal{F}$, apply that detector to $|A\cap B|$. Its evaluations on $B\in \mathcal{F}$ form the identity matrix, since the diagonal intersection is $r$ and every off-diagonal intersection has a different residue. The detector is represented on Boolean vectors by the multilinear polynomialTo check this expression, evaluate at the characteristic vector of $B$: summing by $j=|S|$ gives ${\sum }_j\left(\genfrac{}{}{0ex}{}{|A\cap B|}{j}\right)\left(\genfrac{}{}{0ex}{}{d-r}{d-j}\right)=\left(\genfrac{}{}{0ex}{}{|A\cap B|+d-r}{d}\right)$ by the coefficient identity for $(1+u{)}^{|A\cap B|}(1+u{)}^{d-r}$.