Solution to Exercise of Polynomial Methods in Combinatorics

Solution to Exercise of
Polynomial Methods in Combinatorics

Yuda Chen
(Date: August 24, 2025, only contains chapter 2,3,6,7,8,10)
The author would like to expressed his gratitude to Prof. Shaoming Guo, who held a wonderful seminar in 2025 Spring semester.
Solution 2.1.

We can show the general case directly.

Claim. Given any N k-planes in ℝn and there exists a non-zero polynomial of degree ≲N1n−k that vanishes on all the k-planes.

Notice that, if a polynomial with degree of D vanishes at (D+kk)+1 points on a same k-plane, then it will vanish on this k-plane. Therefore, there exists a non-zero polynomial satisfying the condition when (D+nn)>N⁢(D+kk)+N, that is Dn≳Dk⁢N, which means D≲N1n−k. ∎

Solution 2.2.

Since the general process of proving the lemma using the Vandermonde determinant has been given in the question, we omit the proof using this method and instead use the proof of constructing the polynomial fj⁢(x).

Define D={|xi−xj|}xi,xj∈S,xi≠xj and fj⁢(x)=∏d∈D(x−d), then we have fj⁢(xi)=0 if and only if i≠j so that we know ES is injective. Further, ES is an isomorphism.

Regarding the implication relation between the two lemmas, if Q vanishes on every point in S, that is, Q⁢(xi)=0 for every i, we have ES⁢(Q)=0, which implies Q=0. ∎

Solution 2.3.

We will use induction to prove this lemma.

If n=1, we know P have at most D zero points. Now we proceed by induction on n. We can rewrite P⁢(x1,x2,⋯,xn) as Q⁢(xn)=∑j=0DPj⁢(x1,⋯,xn−1)⁢xnj. And we know Z⁢(P)=⋃an∈An{x∈Z⁢(P)∣xn=an}=⋃an∈An{(x1,⋯,xn−1,an)∣(x1,⋯,xn−1)∈Z⁢(Q⁢(an))}, so we have |Z⁢(P)|=∑an∈An#⁢{(x1,⋯,xn−1,an)∣(x1,⋯,xn−1)∈Z⁢(Q⁢(an))}≤N⋅D⁢N(n−1)−1=D⁢Nn−1 by induction hypothesis. ∎

Solution 2.4.
11 1 This part of the proof comes from [3].

We will use induction to prove this conclusion. Suppose this conclusion is established for polynomials in n−1 variables. We can rewrite P⁢(x,xn)=∑j=0dPj⁢(x)⁢xnj, where x=(x1,⋯,xn−1). Notice that, if (x,xn)∈Z⁢(P), then x,xn must satisfy at least one condition:
(1) For any i=0,⋯,d, Pi⁢(x)=0
(2) Fix x, then xn∈Z⁢(∑j=0dPj⁢(x)⁢xnj) (Notice that ∑j=0dPj⁢(x)⁢xnj≢0).

First, We assume E={(x,xn)∣x⁢ satisfies condition (1)} and F={(x,xn)∣xn,x⁢ satisfy condition (2)}. By inductive hypothesis, we know m⁢(E)=0. For any fixed x, we know there only exist at most d roots of ∑j=0dPj⁢(x)⁢xnj by fundamental theorem of algebra. Now applying Fubini’s theorem then we have m⁢(F)=0, which leads m⁢(Z⁢(P))=m⁢(E∪F)=0. ∎

Solution 2.5.

We can take c⁢(d,n)=12n⁢(d+1)n⁢n!. If this conclusion isn’t established, assuming k=min⁡(d,q−1), we can find P∈PolyD⁡(𝔽qn) that vanishes at all points in ⋃a∈𝔽qnΓa with D=⌊qk+1⌋≥1 because

(D+nn)≥⌊qk+1⌋nn!≥qn2n⁢(k+1)n⁢n!≥12n⁢(d+1)n⁢n!⁢qn=c⁢(d,n)⁢qn>|⋃a∈𝔽qnΓa|

We can also assume that da,j=deg⁡Qa,j won’t exceed q−1 (if not, we can assume da,j′ as da,j−⌊da,jq−1⌋⁢(q−1) to replace da,j). Further, we have da,j≤k and deg⁡QP,a≤D⁢k≤q−D≤q−1 if assuming QP,a⁢(t)=P⁢(Qa,1⁢(t),⋯,Qa,n−1⁢(t),t).

Claim. If P∈PolyD⁡(𝔽qn) that vanishes at all points in ⋃a∈𝔽qnΓa, then we have xn|P⁢(x1,⋯,xn) and P⁢(x1,⋯,xn)xn also vanishes at all points in ⋃a∈𝔽qnΓa.

Because of (a,0)∈Γa for any a∈𝔽qn−1, P⁢(a,0)=0 holds for any a∈𝔽qn−1, that is, xn|P⁢(x1,⋯,xn). If we assume P1⁢(x1,⋯,xn)=P⁢(x1,⋯,xn)xn, we have deg⁡QP1,a≤q−2. Now take t=1,⋯,q−1 and we know QP1,a⁢(t)=QP,a⁢(t)t=0 for any a∈𝔽qn−1. Further, we know QP1,a⁢(0)=0 for any a∈𝔽qn−1, that is, P1⁢(a,0)=0, which means P⁢(x1,⋯,xn)xn also vanishes at all points in ⋃a∈𝔽qnΓa.

If we assume that P is the polynomial with the lowest degree satisfying that P vanishes at all points in ⋃a∈𝔽qnΓa, we have deg⁡P=0, implying P≡0, which causes the contradiction. ∎

Solution 2.6.

Assuming the maximum number of joints generated by L lines is JL, then we have the following claim.

Claim. There exists one line with at most n⁢JL1n joints.

First we know we can find a non-zero polynomial P with degree at most n⁢JL1n vanishing at every joint. (Let P be the polynomial with the lowest degree that satisfies this condition.) If every line contains over n⁢JL1n joints, then P vanishes on every line. So we know ∇P also vanish on every joint. Due to the minimum degree of P, we have deg⁡P=0, which leads a contradiction.

Now we can know JL≤(n⁢L)nn−1 from

JL≤JL−1+n⁢JL1n≤JL−2+2⁢n⁢JL1n≤⋯≤n⁢L⁢JL1n

∎

Solution 2.7.

We assume that set X contains all the joints. For each coordinate axis j, define the indicator function fj:ℝ→{0,1} as:

fj⁢(xj)={1if ⁢xj∈πj⁢(X),0otherwise.

Then we know ∑xj∈ℝfj⁢(xj)=|πj⁢(X)|≤|𝔏j| and the cardinality of X can be expressed as:

|X|=∑(x1,x2,…,xn)∈X1=∑x1,x2,…,xnf1⁢(x1)⁢f2⁢(x2)⁢⋯⁢fn⁢(xn).

For n non-negative functions f1,f2,…,fn, Hölder’s inequality states:

∑x1,…,xnf1⁢(x1)⁢f2⁢(x2)⁢⋯⁢fn⁢(xn)≤∏j=1n(∑xjfj⁢(xj)n−1)1n−1.

Notice that (∑xjfj⁢(xj)n−1)1n−1=(∑xj∈πj⁢(X)1)1n−1=|𝔏j|1n−1, so we have |X|≤∏j=1n|𝔏j|1n−1, which finishes the proof. ∎

Solution 2.8.

It’s trivial that P vanishes at all points. If there exist a polynomial Q⁢(x1,x2,x3) with deg⁡Q≤|A|, we can rewrite it as ∑i=0|A|−1Qi⁢(x2,x3)⁢x1i and get Qi⁢(x2,x3)≡0 for any i, from Q vanishing at |A| points when x2 and x3 are fixed. And we can rewrite Qi⁢(x2,x3) as ∑j=0|A|−iQi⁢j⁢(x3)⁢x2j. Similarly, we know Qi⁢j≡0 for any j. Then we have Q≡0, which leads a contradiction.

Now we know that every minimal degree polynomial Q vanishing on the grid has degree of |A|. Consider that for every fixed x2 and x3, we have ∏a∈A(x1−a)∣Q. Then Q⁢(x1,x2,x3) must be form of R⁢(x1,x2,x3)⁢∏a∈A(x1−a). Considering the degree, we know R⁢(x1,x2,x3) is a constant, that is, Q is a multiple of P.

For the case of |A|=|B|=|C|, we will prove this conclusion: for every minimal degree polynomial P vanishing on the grid, P must be the form of

c1⁢∏a∈A(x1−a)+c2⁢∏b∈B(x2−b)+c3⁢∏c∈C(x3−c)
22 2 This part of the proof comes from [7].

Assuming |A|=|B|=|C|=n, we can rewrite

P⁢(x1,x2,x3)=c1⁢∏a∈A(x1−a)+c2⁢∏b∈B(x2−b)+c3⁢∏c∈C(x3−c)+Q⁢(x1,x2,x3)

where Q satisfying:
(1) Its degree is at most n;
(2) None of its monomials contains the nth power of a single variable;
(3) It vanishes on any combination where each of its variables is drawn from a fixed set of n distinct points.

Claim. Any polynomial Q⁢(x1,⋯,xm) satisfying these three properties must be the zero polynomial.

We will prove this conclusion by induction on the number of variables. It’s obvious that the conclusion establish when m=1 because we know it has degree at most n−1 from condition (1) and (2). Suppose that the conclusion holds for polynomials with m−1 variables. Let Q⁢(x1,⋯,xm) satisfy the three conditions and vanish on A1×⋯×Am where |Ak|=n. Now we can rewrite Q as ∑k=0n−1Qk⁢(x1,⋯,xm−1)⁢xmk, then we know Qk⁢(x1,⋯,xm−1)≡0 by degxm⁡Q≤n−1 and condition (3). Then we know that Qk vanishes on A1×⋯×Am−1 and also satisfies condition (1) and (2), for any k. Now we can know Qk≡0 by induction hypothesis, which finishes the proof.

Finally, let m=3 and the proof of the conclusion is completed. ∎

Solution 2.9.

The conclusion of this exercise can be fully supported by the proof presented in [8]. ∎

Solution 3.1.

Firstly, we can define ⟨v,w⟩ in 𝔽q3 as v⋅w¯, which equals to ∑i=13vi⁢wip, so every point x on the Hermitian variety satisfies ⟨x,x⟩=1.

Claim. For any v,w∈H, there exist g∈U⁢(𝔽q3) satisfying g⁢v=w.

For any v∈H, we can extend it to an orthonormal basis {v,e2,e3} satisfying

⟨v,v⟩=1,⟨v,ei⟩=0,⟨ei,ej⟩=δi⁢j

Also, we can construct another orthonormal basis {w,f2,f3} satisfying

⟨w,w⟩=1,⟨w,fi⟩=0,⟨fi,fj⟩=δi⁢j

Then let g⁢(v)=w,g⁢(e2)=f2,g⁢(e3)=f3, it’s obvious that g keeps the inner product, which implies U⁢(𝔽q3). Now we know this group action is transitively. ∎

Solution 3.2.

Firstly, about the number of points on hypersurface Q, we can rewrite the equation as x12+x22=1+x32+x42 and let 1+x32+x42=c. By results in [6], we know the equation x12+x22=c has ∼q solutions for (x1,x2) if c is fixed. Allow x3 and x4 to vary, then we know the number of the solutions is ∼q3, which means there are ∼q3 points on Q.

Secondly, about the number of lines lying on Q, we need the following claim.

Claim. Each point of Q lies on ∼q lines.

Consider that (x1+v1⁢t)2+(x2+v2⁢t)2−(x3+v3⁢t)2−(x4+v4⁢t)2=1 always holds for every t, it implies x1⁢v1+x2⁢v2−x3⁢v3−x4⁢v4=0 and v12+v22−v32−v42=0. Let Sr={(v1,v2,v3,v4)∈𝔽q4∣v12+v22=v32+v42=r} and it’s obvious that Sr contains ∼q2 points for fixed r by [6]. Notice that x1⁢v1+x2⁢v2−x3⁢v3−x4⁢v4=0 are linear for (v1,v2,v3,v4), so the number of points on Sr satisfying the above linear equation is ∼q. Allow r to vary from 0 to q−1, we know the number of solutions for (v1,v2,v3,v4) of initial equations is ∼q2. And because the above equations which contain vi are all homogeneous, there are only ∼q2q−1∼q different directions, that is, each point corresponds to ∼q lines.

Because each point contributes ∼q lines and there are ∼q3 points on Q, each line is shared by q points. Now we know there are ∼ q3⋅qq=q3 lines on Q.

Finally, regarding of fact that the lines through each point x∈Q lie in a 3 -plane, we can know every line passing x is in x1⁢v1+x2⁢v2−x3⁢v3−x4⁢v4=0, which is a 3 -plane, by the knowledge of linear algebra. ∎

Solution 3.3.

For the case of n=1, we can consider the linear map E:W→𝔽D+1,f↦(f⁢(x0),⋯,f⁢(xD)). If dimW≥D+2, then there exist linear independent functions f1,⋯,fdimW∈Fcn⁡(𝔽,𝔽), and we know dimker⁡E+dimIm⁡E=dimW by Rank-Nullity Theorem, which leads dimker⁡E≥1. So there exists a non-zero function g=c1⁢f1+⋯+cdimW⁢fdimW satisfying E⁢(g)=0, which is a contradiction.

When n≥2, we assume that the case of n−1 is established. If regarding P⁢(t1,⋯,tn) as a function with respect to tn, we have

P⁢(t1,⋯,tn)=∑k=0DPk⁢(t1,⋯,tn−1)⁢tnk

where Pk∈Fcn⁡(𝔽n−1,𝔽) (the reason why we can make this decomposition is that {1,tn,⋯,tnk} forms a group of basis). Notice that Pk satisfies vanishing lemma of degree D, we have

dimW≤(D+1)n−1⏟choices of ⁢P0+(D+1)n−1⏟choices of ⁢P1+⋯+(D+1)n−1⏟choices of ⁢PD=(D+1)n

according to the induction hypothesis. ∎

Solution 6.1.

We use the Bezout theorem in [4] to prove the following claim.

Claim. If deg⁡P,deg⁡Q<|𝔽|, then the theorem is still true when |𝔽| is finite.

Firstly, we know

∑ji⁢(Y,H;Zj)⋅deg⁡Zj=deg⁡Y⋅deg⁡H

from [4]. We consider P=0 and Q=0 as algebraic curve defined in 𝔽q¯ and here Y=V⁢(P),H=V⁢(Q)⊂𝔽q¯2. So for every line in initial Z⁢(P,Q), it’s also in the ”new Z⁢(P,Q)”.

Let lines be L1,…,Lr⊂Y∩H and now

∑j=1ri⁢(Y,H;Zj)⋅deg⁡Zj≤d1⁢d2

Because Zj are lines on P=0 and Q=0, deg⁡Zj=1 and i⁢(Y,H;Zj)≥1 hold. So

∑j=1ri⁢(Y,H;Zj)⋅deg⁡Zj=∑j=1ri⁢(Y,H;Zj)≥r

which means

r≤∑ji⁢(Y,H;Zj)⋅deg⁡Zj≤d1⁢d2

Notice that the lines in initial Z⁢(P,Q) are all in {Li}i=1r then the claim is true. ∎

Solution 6.2.

For the first question, parameterize curve P⁢(𝔽) as (P1⁢(t),P2⁢(t)) and define polynomials

f⁢(t)=P1⁢(t)−x,g⁢(t)=P2⁢(t)−y,

here x,y are varible. Because deg⁡P1≤D and deg⁡P2≤D, we have degt⁡f≤D and degt⁡g≤D. So resultant rest⁡(f,g) is polynomial wrt x,y and let Q⁢(x,y)=rest⁡(f,g). When (x,y)=(P1⁢(t),P2⁢(t)), we know f and g have common root t, then the resultant equals to 0. So Q⁢(P1⁢(t),P2⁢(t))=0 holds for every t, which means P⁢(𝔽)⊆Z⁢(Q). Consider the form of resultant (a 2⁢D×2⁢D determinant), we know x,y only appear in the right D columns, so deg⁡Q≤D.

For the second question, firstly parameterize H:

s⁢(u)=u2+12⁢u,t⁢(u)=u2−12⁢u,

and here u∈𝔽∖{±1}, then let

X⁢(u)=P1⁢(s⁢(u),t⁢(u)),Y⁢(u)=P2⁢(s⁢(u),t⁢(u)).

Let X⁢(u)=A⁢(u)/C⁢(u) and Y⁢(u)=B⁢(u)/D⁢(u), here A,B,C,D are polynomials and deg⁡A,deg⁡C≤2⁢D, deg⁡B,deg⁡D≤2⁢D.

f⁢(u)=C⁢(u)⁢x−A⁢(u),g⁢(u)=D⁢(u)⁢y−B⁢(u).

Now let Q⁢(x,y)=resu⁡(f,g). Notice that C⁢(u) and D⁢(u) are all like (2⁢u)k and k≤D. Similar as the first proof, just consider the 4⁢D×4⁢D determinant, we know deg⁡Q≤2⁢D because there are only 2⁢D columns containing x,y.

For the general case, if P:H→𝔽k is a polynomial map where H is a curve or (hyper)surface with dimension of r and degree of m, and every deg⁡Pi is not more than D, then there exist Q such that P⁢(H)⊆Z⁢(Q) and deg⁡Q≤m⁢Dr. The details of proof can be read here: [1]. ∎

Solution 7.1.
33 3 Hint of this problem may has defect. This solution has fixed that.

Using the hint of exercise, for an integer a≥2, let D⁢(a,Q) be the set of pairs (p,q) with 1≤p<q≤Q, and so that a divides both p and q. So we have |D⁢(a,Q)|≤(⌊Qa⌋2)≤(Q2)⁢a−2.

Note that R⁢(Q) can be formed by starting with all pairs (p,q) with 1≤p< q≤Q and then removing D⁢(a,Q) for every prime a. Therefore,

|R⁢(Q)|≥(Q2)−∑a⁢ prime|D⁢(a,Q)|≥(1−∑a≥2, primea−2)⁢(Q2)

When Q≥5, we have (Q2)=Q−1Q⋅Q22≥25⁢Q2, which means we only need prove that 1−∑a≥2, primea−2≥14. And we can use ∑a=2∞a−2<23 to finish this proof. When Q=2,3,4, the ratios are 14,13,516 respectively. So we have |R⁢(Q)|≥110⁢Q2. ∎

Solution 7.2.

Let S′⁢(r) be the set of fractions in S⁢(r) whose numerator and denominator are both at least r1210. We will state that |S′⁢(r)|≥r2. We only need to prove that there are no more than r2 fractions whose numerator or denominator is less than r10. Notice that ∑k=1nφ⁢(k)≥n24 (just consider φ⁢(k)≥k+12 for odd k), then every fraction in S′⁢(r) has a denominator less than 4⁢r. So there are at most r10⋅4⁢r≤r5 fractions with numerator greater than r10 and at most ∑k=1r10φ⁢(k)≤∑k=1r10k<r100 fractions with denominator greater than r10. Sum them up then we know the conclusion is true.

Let 𝔏N,r′⊆𝔏N,r be the lines with slope in S′⁢(r). Then every line with slope of pq in 𝔏N,r′ intersects the N×N grid GN at most 1+min⁡(N−1p,N−1q)≤1+10⁢Nr≲N⁢r−12 points. But every point in GN lies in at least r2 lines of 𝔏N,r′. By double counting, we know |𝔏N,r|≥|𝔏N,r′|≥N2N⁢r−12r2∼N⁢r32, so the proof finishes. ∎

Solution 7.3.

Every line in ℙ⁢𝔽q2 can be written as a⁢x+b⁢y+c⁢z=0 where [x,y,z] represents point on the line and (a,b,c)≠(0,0,0). Then line a1⁢x+b1⁢y+c1⁢z=0 intersects line a2⁢x+b2⁢y+c2⁢z=0 at only [b2⁢c1−b1⁢c2,a1⁢c2−a2⁢c1,a2⁢b1−a1⁢b2]. Also, for a fixed point [x,y,z] in ℙ⁢𝔽q2, because ba can take q+1 different values (including ∞), there are q+1 different lines in ℙ⁢𝔽q2 passing it. Then we know |Pq+1⁢𝔏|=(|𝔏|2)(q+12) immediately. ∎

Solution 7.4.

With some simple calculation, we know L∼H⁢r. For every (x0,y0) satisfying |x0|≤H⁢r−1 and |y0|≤H, we have y=m⁢x+(y0−m⁢x0) passing (x0,y0), for m=1,2,⋯,r (notice that |y0−m⁢x0|≤2⁢H), which means every (x0,y0) is an r-rich point. So Pr⁢(𝔏)≳H⁢r−1⋅H∼L2⁢r−3. ∎

Solution 7.5.

Take 𝒮=Pr⁢(𝔏) in Theorem 7.11 and then we have I⁢(Pr,𝔏)≲S23⁢L23+S+L. Also, we have trivial bound of I⁢(Pr,𝔏)≥S⁢r (for every point, only consider the r lines passing through it). Now we have S⁢r≲S23⁢L23+S+L. Because S≤(L2)≤L22<L2, we have S23⁢L23>S.

If S2≤L, which implies L≥S23⁢L23, we have S⁢r≲L, that is, S≲L⁢r−1.

If S2≥L, which implies L≤S23⁢L23, we have S⁢r≲S23⁢L23, that is, S≲L2⁢r−3.

Then we have |Pr⁢(𝔏)|=S≲L⁢r−1+L2⁢r−3, which is Theorem 7.1. ∎

Solution 7.6.

Using 𝔏 and 𝒮 we construct a graph drawn in the plane. The vertices of our graph G are the points of 𝒮. We join two vertices with an edge of G if the two points are two consecutive points of 𝒮 along a line ℓ∈𝔏. We let kℓ denote the number of points on ℓ. Notice that |I⁢(𝒮,𝔏)|=∑ℓ∈𝔏kℓ−1 and E=∑ℓ∈𝔏max⁡(kℓ−1,0), we have |I⁢(𝒮,𝔏)|≤E+L. The crossing number of this drawing is at most (L2)≤L2, since each crossing of the graph G must correspond to an intersection of two lines of 𝔏. This is also a straight line drawing. So we see that L2≥ks⁢t⁢r⁢(G).

Claim. We have E≤max⁡(4⁢L23⁢S23,4⁢S).

If E≥4⁢S, we can apply the estimate ks⁢t⁢r⁢(G)≥164⁢E3⁢S−2, then we get L2≥164⁢E3⁢S−2, which means E≤4⁢L23⁢S23. If E<4⁢S, the conclusion holds naturally.

Now we know I⁢(𝒮,𝔏)≤E+L≲S23⁢L23+S+L immediately. ∎

Solution 7.7.

Proof by Theorem 7.11: Take 𝔏=𝔏r in Theorem 7.11 and then we have I⁢(𝒮,𝔏r)≲S23⁢L23+S+L. Also, we have trivial bound of I⁢(𝒮,𝔏r)≥L⁢r (for every line, only consider the r points lying on it). Now we have L⁢r≲S23⁢L23+S+L. Because L≤(S2)≤S22<S2, we have S23⁢L23>L. If L2≤S, which implies S≥L23⁢S23, we have L⁢r≲S, that is, L≲S⁢r−1. If L2≥S, which implies S≤L23⁢S23, we have L⁢r≲L23⁢S23, that is, L≲S2⁢r−3. So the conclusion is established.

Proof by Theorem 7.1: Consider the polarity transformation

f:(a,b)↦ax+by=1,ax+by+c=0↦(−ac,−bc)

where c≠0, assuming 𝒮,𝔏 both don’t contain or pass origin point, we have f⁢(𝒮) is a set of lines and f⁢(𝔏) is a set of points. And for every point Q, we have f⁢(Q) passing Q. For every line ℓ, we have f⁢(ℓ) lying on ℓ. By Theorem 7.1, we know |Pr⁢(𝔏)|≲L⁢r−1+L2⁢r−3. We get the conclusion since

|𝔏r|=|f⁢(Pr⁢(f⁢(𝒮)))|=|Pr⁢(f⁢(𝒮))|≲|f⁢(𝒮)|⁢r−1+|f⁢(𝒮)|2⁢r−3=S⁢r−1+S2⁢r−3

∎

Solution 7.8.

Let S=[xi,yi,zi]i=1n, there must exist α∈ℝ such that xi+α⁢yi+α2⁢zi≠0 for i=1,2,⋯,n (just let α not equal to the root of xi+α⁢yi+α2⁢zi=0 for every i). So the projective transformation

p:(xyz)↦(1000101αα2)⁢(xyz)

can map S to a set in ℝ2. Because projective transformation don’t change the number of lines, points and incidences, directly, we know that Szemeredi-Trotter Theorem of ℝ⁢ℙ2 version holds. Because every line in ℝ⁢ℙ2 corresponds to unique point lying on it (vice versa), let this map be f, we have

Im⁢a⁢x⁢(𝒮,𝔏)=Im⁢a⁢x⁢(f−1⁢(𝔏),f⁢(𝒮))=Im⁢a⁢x⁢(p⁢(f−1⁢(𝔏)),p⁢(f⁢(𝒮)))

If we assume Im⁢a⁢x⁢(𝔏,𝒮)=g⁢(S,L), then we have Im⁢a⁢x⁢(p⁢(f−1⁢(𝔏)),p⁢(f⁢(𝒮)))=g⁢(L,S), which means Im⁢a⁢x⁢(𝔏,𝒮) is symmetric for S and L. ∎

Solution 7.9.

Firstly, it’s trivial that there doesn’t exist a component with only one side. If there exist a component K with two sides, assuming they’re ℓ1,ℓ2 and P=ℓ1∩ℓ2, then consider ℓ3 that intersects ℓ1 and ℓ2 at points other than P. Such a line ℓ3 must exist, because if not, then every line passes P. Notice that ℓ3 intersects area K, we know K isn’t connected, which leads a contradiction.

Let Vk be the number of vertices on exactly k lines and Fk be the number of faces with exactly k sides. Notice that 2⁢E=∑k=3∞k⁢Fk≥3⁢F and E=∑k=2∞k⁢Vk, if V2=0, we have E≥3⁢Vk. Now

V−E+F≤V−E+23⁢E=V−13⁢E≤V−13⁢(3⁢V)=0

but we know V−E+F=1>0 by Euler’s formula. So that leads a contradiction, which means V2≥1.

Using the map f in the previous question, we can get the claim quickly:

Claim. Suppose that 𝒮 is a finite set of points in ℝ⁢ℙ2, not all lying on one line. Then, there is a line that contains exactly two points of 𝒮.

Just use the conclusion above for f−1⁢(𝒮), we know there exist a point v on exactly two lines ℓv⁢1 and ℓv⁢2. Then line f⁢(v) contains exact two points f⁢(ℓv⁢1) and f⁢(ℓv⁢2). The claim is true for ℝ⁢ℙ2, so the claim is of course true for ℝ2. ∎

Solution 7.10.

Because the vi are chosen generically, the values of vi+vj⁢(i≠j) and values of vi+vj+vk⁢(i≠j,j≠k,k≠i) are all distinct. So the number of points in X is N=(m2)∼m2. Let Ci⁢j denote the unit circle centered at vi+vj. Then every point with form vi+vj+vk is on circle Ci⁢j,CCj⁢k,Ck⁢i∈Γ, which implies vi+vj+vk is 3-rich. Thus the number of 3-rich point of Γ is at least (m3)∼m3∼N32. ∎

Solution 7.11.

For every point (x0,y0) such that 1x0∈A and −y0∈A, it lies on y=(x0⋅a)⁢x−(a+y0) for every a∈A. So (x0,y0) is a r -rich point and Pr⁢(𝔏)≥|A|2. By Theorem 7.1, we know

|A|2 ≲|A+A|⋅|A⋅A|⋅|A|−1+|A+A|2⋅|A⋅A|2⋅|A|−3
=|A+A|⋅|A⋅A|⋅|A|2⋅|A|−3+|A+A|−2⋅|A⋅A|−2⋅|A|−3
≤2⁢|A+A|2⋅|A⋅A|2⋅|A|−3

then we have |A+A|⋅|A⋅A|≳|A|52, which means max⁡(|A+A|,|A⋅A|)≳|A|54.

Regarding of the case max⁡(|A−A|,|A/A|), let 𝔏′ be the set of lines y=n⁢x−c with n∈A/A and c∈A−A. For every point (x0,y0) such that x0∈A and y0∈A, it lies on y=ax0⁢x−(a−y0) for every a∈A. So (x0,y0) is a r -rich point and Pr⁢(𝔏′)≥|A|2. By Theorem 7.1, we know

|A|2 ≲|A−A|⋅|A/A|⋅|A|−1+|A−A|2⋅|A/A|2⋅|A|−3
=|A−A|⋅|A/A|⋅|A|2⋅|A|−3+|A−A|−2⋅|A/A|−2⋅|A|−3
≤2⁢|A−A|2⋅|A/A|2⋅|A|−3

then we have |A−A|⋅|A/A|≳|A|52, which means max⁡(|A−A|,|A/A|)≳|A|54. ∎

Solution 7.12.

Consider the simple graph H corresponding to G, which has the same vertices as G. Every edge of G (regardless of the number of repetitions) corresponds to a single edge in H. Let EH be the number of edges in H. We have E≤M⁢EH. Thus there is EH≥EM≥4⁢M⁢VM=4⁢V. Using Theorem 7.6 and we know k⁢(H)≥164⁢EH3⁢V−2≥(EM)3⁢V−2. Notice that k⁢(G)≥k⁢(H), we get k⁢(G)≥164⁢E3⁢M−3⁢V−2. ∎

Solution 7.13.

Let P denote the set of N points. Assuming |d⁢(P)|=t≤N, let P be vertices of G and we consider the circles centered at points in P with radii in d⁢(P). The number of circles C=N⁢t. Let the edges of G be the arcs of circles between consecutive points, for the circles containing more than one point. We don’t construct an edge for the circles containing only one point to avoid loops.

Notice that, for every circle with more than one point lying on it, the number of arcs equals to the points. Let U be the circles with only one point. Then E=N⁢(N−1)−|U|≥N⁢(N−1)−C=N⁢(N−1−t). Because there are up to 99 points on the perpendicular bisector of every two points, the number of parallel edges between two points is at most 198, which means M⁢u⁢l⁢t⁢(G)≤198.

Firstly, consider the case of E≥4⁢M⁢V=792⁢N, we can use Proposition 7.13 and get k⁢(G)≥164⁢E31983⁢N2. In addition, there is k⁢(G)≤2⁢(C2)≤(N⁢t)2. Therefore, we have

(N⁢t)2≥k⁢(G)≥164⁢E31983⁢N2≥164⁢N3⁢(N−1−t)31983⁢N2

Assume u=tN<110 and N≥2, then

u2≥164⁢(1−1N−u)31983≥(1−2⁢u)364⋅1983⋅23

which means

164⋅1983⁢u3+(1−1128⋅1983)⁢u2+1256⋅1983⁢u≥1512⋅1983

Thus, we have 2⁢u≥1512⋅1983, that is, t≥17948689408⁢N. We call c as 17948689408.

For the case of E<792⁢N, we have 792⁢N>N⁢(N−1−t), which is equivalent to t>N−793. When N≥794, we know t>N−793>c⁢N. When N≤793, because t≥1, t≥c⁢N is established. All in all, we have t≥17948689408⁢N. ∎

Solution 7.14.

Let S be vertices of G and we consider the unit circles centered at points in S. Let the edges of G be the arcs of circles between consecutive points, for the circles containing more than one point. Let mc={p∈S∣|p−c|=1} denote the number of points on the unit circle centered at c∈S and D denote the number of unit distances. Then we have E=∑c∈S,mc≥2mc,2⁢D=∑c∈Smc and M⁢u⁢l⁢t⁢(G)≤4. Further, we have

D=∑c∈Smc2=E+|{c∈S∣mc=1}|2

Because two unit circles intersect in at most two points, we have k⁢(G)≤2⁢(N2)≤N2. When E≥16⁢N, we know E34096⁢N2≤k⁢(G)≤N2, which means E≤16⁢N43. So there is D≤16⁢N43+N2≤172⁢N43. When E<16⁢N, we also have D≤E+N2≤172⁢N≤172⁢N43. Thus the conclusion is established. ∎

Solution 7.15.

Use the following method to construct the graph G: Let P=Pr⁢(Γ) be vertices of G. For every curve γ∈Γ, we can consider Pγ=γ∩P, the set of points on γ. Let the edges of G be the arcs of curves between consecutive points, for the every curve γ with |Pγ|≥2.

Assuming that eγ is the number of edges in G on γ and mγ=|Pγ|, for mγ≥2, we know eγ=mγ if γ closed and eγ=mγ−1 if γ open. Because any two points lie in at most s curves of Γ, we get M⁢u⁢l⁢t⁢(G)≤2⁢s.

Notice that every point p∈P is r -rich, we have ∑γ∈Γmγ=∑p∈P{γ:p∈γ}≥r⁢V. And notice that max⁡(mγ−1,0)≤eγ≤mγ, we have

E=∑γ∈Γeγ≥∑γ∈Γmax⁡(mγ−1,0)≥∑γ∈Γ(mγ−1)=∑γ∈Γmγ−L≥r⁢V−L

Because any two curves of Γ intersect in at most s points, we know k⁢(G)≤s⁢(L2)≤s⁢L22.

If E≥4⁢M⁢V=8⁢s⁢V, we get E3512⁢V2⁢s3≤k⁢(G)≤s⁢L22, which means E≤283⁢s43⁢L23⁢V23. By E≥r⁢V−L, we know r⁢V−L≤283⁢s43⁢L23⁢V23. Let K denote 283⁢s43. For the case of r⁢V≥2⁢L, we know r⁢V2≤r⁢V−L≤K⁢L23⁢V23, that is,

V≤(2⁢K⁢L23r)3=8⁢K3⁢L2r3=2048⁢s4⁢L2⁢r−3

For the case of r⁢V<2⁢L, we have V<2⁢L⁢r−1.

If E<8⁢s⁢V, from E≥r⁢V−L, we know V⁢(r−8⁢s)≤L. For the case of r≥16⁢s, we have V≤Lr−8⁢s≤Lr2=2⁢L⁢r−1. For the case of r<16⁢s, by V≤s⁢(L2)≤s⁢L22, we have

V≤s⁢L22=s⁢L22⁢r3⁢r−3≤s⁢L22⁢r−3⁢(16⁢s)3=256⁢s4⁢L2⁢r−3

In summary, we get |Pr⁢(Γ)|≤C⁢(s)⁢(L2⁢r−3+L⁢r−1). ∎

Solution 7.16.
44 4 The condition r≳N13 in this problem should be r∼N13, or we have L⁢r−1=N⁢r−1<N and L2⁢r−3=N2⁢r−3<N.

Consider the set of parabolas Γ={x2+a⁢x+b∣a=0,1,⋯,k−1,b=0,1,⋯,k2−1} with |Γ|=N=k3 and set of points S={(m,n)∣0≤m≤k+1,n=0,1,⋯,k2−1−m⁢(k−1)}∪{(m,n)∣−k−1≤m≤−1,n=−m⁢(k−1),−m⁢(k−1)+1,⋯,k2−1} with |S|=k3+k2+k+2≥N and |S|∼N. Because every (m,n)∈S satisfies n=m2+a⁢m+b for (a,b)=(0,n−m2),(1,n−m2−m),⋯,(k−1,n−m2−(k−1)⁢m), we know every point in S is r -rich point, with r=k∼N13. So the conclusion is established. ∎

Solution 7.17.

Firstly, we will show this conclusion.

Claim. Curve γ0 intersects γ0+v in at most 2 points, assuming v≠0.

WLOG, we can assume that v=(0,m) with m>0. Choose a and b as the left and right endpoint of γ0 (that is, the points on γ0 with the smallest and largest x coordinate). Let fu⁢(x)=max⁡{y∣(x,y)∈γ0} and fl⁢(x)=min⁡{y∣(x,y)∈γ0}. Then we have γ0={(x,fu⁢(x))∣x∈[a,b]}∪{(x,fl⁢(x))∣x∈[a,b]} and γ0+v={(x,fu⁢(x)+m)∣x∈[a,b]}∪{(x,fl⁢(x)+m)∣x∈[a,b]}. 55 5 This part of the proof comes from [5].Since m>0, graphs of fu and fu+m are disjoint, the graphs of fl,fl+m are disjoint and the graphs of fl,fu+m are also disjoint. Only the graphs of fl+m and fu can intersect. Then, the conclusion reduces to the claim that the graph of a strictly convex function h1 can intersect the graph of a strictly concave function h2 in at most two points. Notice that h1−h2 is strictly convex, we know it has at most 2 roots, so the claim is established.

If there are 3 curves γ0,γ0+t,γ0+s all passing p,q, then γ0 passes p,p−t,p−s and q,q−t,q−s. That means γ0 intersects γ0+(q−p) at 3 points, which leads a contradiction. So any two points in the plane lie in at most two of the curves of Γ.

Now applying Theorem 7.16, we know |Pr⁢(Γ)|≲|Γ|2⁢r−3+|Γ|⁢r−1. Suppose that γ0 has diameter of d, assuming d≥1, we choose a 10⁢d×10⁢d square B such that γ0⊆B¯. We call ΓB as {γ0+v∣v∈ℤ2,(γ0+v)∩B¯≠0} and r⁢(p) as the number of curves in Γ passing p, assuming Γ={γ0+v∣v∈ℝ2}. Consider 𝒫=B¯∩ℤ2 and S=γ0∩ℤ2 with |S|=n, we know for every point p∈𝒫,

r⁢(p)=|{v∈ℤ2∣p−v∈γ0}|=|{s∈γ0∣s=p−v⁢ for some ⁢v∈ℤ2}|=|S|=n

which means every p is contained by n curves in ΓB. Notice that |ΓB|≤k⁢d2 and |𝒫|≥c⁢d2, we know

c⁢d2≤|𝒫|≤|Pn⁢(Γ)|≤|ΓB|2⁢n−3+|ΓB|⁢n−1=k2⁢d4⁢n−3+k⁢d2⁢n−1

by the inequality above. So we have c≤k2⁢d2⁢n−3+k⁢n−1.

For the case of k2⁢d2⁢n−3≥k⁢n−1, we know n≤(2⁢k2c)13⁢d23 because c≤k2⁢d2⁢n−3+k⁢n−1≤2⁢k2⁢d2⁢n−3. For the case of k2⁢d2⁢n−3≤k⁢n−1, we have c≤k2⁢d2⁢n−3+k⁢n−1≤2⁢k⁢n−1, so there is n≤2⁢kc≤2⁢kc⁢d23. Anyway, the conclusion is established. ∎

Solution 7.18.

We’ll prove this claim firstly.

Claim. For every G with E>22−i⁢M⁢V satisfying that between any two vertices of G, the number of edges is either 0 or lies in [M2i+1,M2i], its crossing number k⁢(G)≥2i−8⁢E3⁢V−2⁢M−1.

Consider the simple graph H corresponding to G, we have 2i⁢EM≤EH≤2i+1⁢EM, which implies EH>22−i⁢2i⁢M⁢VM=4⁢V. Take a random subgraph G′⊆G consisting of one edge between each pair of vertices. In the induced embedding on the subgraph, each crossing occurs with probability ≤(2i+1M)2, since it occurs if and only if both edges are in G′. Now we have 𝔼⁢(k⁢(G′))≤22⁢i+2M2⁢k⁢(G), that is,

k⁢(G)≥2−2⁢i−2⁢M2⁢𝔼⁢(k⁢(G′))≥164⋅22⁢i+2⁢M2⁢EH3⁢V−2≥2i−8⁢E3⁢V−2⁢M−1

since EG′=EH>4⁢V and EH≥2i⁢EM.

66 6 This idea comes from [9].

For 0≤i≤[log2⁡m], let Gi be the subgraph of G, satisfying that between any two vertices of Gi, the number of edges is either 0 or lies in [2i,2i+1). Define A={i∣EGi≤2i+3⁢V} and B={0,1,⋯,log2⁡M}\A, from ∑i∈AEGi≤2⋅2[log2⁡M]+3≤16⁢M⁢V, we know

∑i∈BEGi=E−∑i∈AEGi≥E−16⁢M⁢V≥E2

Notice that

k⁢(G)≥∑i=0[log2⁡m]k⁢(Gi)≥∑i∈Bk⁢(Gi)≥2−8⁢V−2⁢M−1⁢∑i∈B2i⁢EGi3

by Holder inequality, we know

∑i∈B2i⁢EGi3=∑i∈BEGi32−i≥(∑i∈BEGi)3(∑i∈B2−i2)2≥(E2)3

so we have k⁢(G)≥2−11⁢E3⁢V−2⁢M−1=12048⁢E3⁢V−2⁢M−1. ∎

Solution 7.19.

We let kC be the number of points on circle C∈Γ. Let fp denote the number of circles containing point p. Now we know

E=∑C∈ΓkC=∑p∈Sfp

Let gp be the number of circles in Γ0\Γ, only containing p and sq be the number of circles in Γ0\Γ, centered at q. Notice ∑p∈Sgp=∑q∈Ssq≤∑q∈St=N⁢t, we have

∑q∈Ssq≤∑q∈St=N⁢t≤1100⁢N2

So

E=∑p∈Sfp=∑p∈S(N−1−gp)=N⁢(N−1)−∑q∈Sgq≥N⁢(N−1)−1100⁢N2≥12⁢N2

for N≥3. ∎

Solution 7.20.
77 7 Besides hint, this idea also comes from [9].

We assume t≤c⁢N45, otherwise we have t≳N45 trivially. By Lemma 7.19, the number of edges of G with multiplicity at least M is at most C⁢[N2⁢M−2⁢t+N⁢log⁡N⁢t]. We take M=12⁢C⁢t, then the value above changed into N212+C⁢N⁢log⁡N⁢t. Using the bound t≤c⁢N45, we know

E≥M ≥EG−(N212+C⁢N⁢log⁡N⁢t)≥12⁢N2−(N212+C⁢N⁢log⁡N⁢t)
=512N2−CNlogNt≥512N2−CNlogcN95=≥N23

when N sufficient large. Therefore we have E≤M≥N23≥100⁢12⁢C⁢N75=100⁢M⁢V when N sufficient large. Now apply Theorem 7.17 on G≤M and we know

k⁢(G≤M)≥c0⁢E≤M3⁢V−2⁢M−1≥c0⁢(N23)3⁢N−2⁢M−1=c027⁢N4⁢M−1

Using k⁢(G≤M)≤k⁢(G)≤2⁢(N⁢t)2, we know

2⁢N2⁢t2≥c027⁢N4⁢M−1=c027⁢N4⁢(12⁢C⁢t)−1=c027⁢12⁢C⁢t⁢N4

Thus we have t≥(c054⁢12⁢C)25⁢N45, which means t∼N45. That is, we have t≳N45. ∎

Solution 8.1.
88 8 Hint of this problem may has defect. This solution has fixed that.

For any point x=(x1,x2,x3)∈ℝ3, with x≠0,1, we define a map ρx:ℝ2→ℝ2 as follows. If v∈ℝ2, then we define ρx⁢(v) so that (v,0), x and (ρx⁢(v),1) are collinear. Now observe that x is r -rich if and only if |ρx⁢(G0)∩G1|≥r. Construct a vertical line ℓ perpendicular to plane x3=0 through point x, assume ℓ intersects x3=0 and x3=1 at h0,h1 respectively. We can get △⁢x⁢h0⁢(v,0) is similar to △⁢x⁢h1⁢(ρx⁢(v),1), which means px⁢(v1,v2)=−1−x3x3⁢v+1x3⁢(x1,x2). Let k=−1−x3x3 and t=1x3, we have ρx⁢(v)=k⁢v+t⁢x. We let fk⁢(x)=|{a∈{1,2,⋯,N}∣k⁢a+t⁢x∈{1,2,⋯,N}}|, where N=L14≥20, then x is r -rich if and only if fk⁢(x1)⁢fk⁢(x2)≥r. Let’s consider k=q−dq, where q,d are both positive integers satisfying gcd⁡(q,d)=1 and 0<d<2⁢q. Now x3=qd,t=dq and k=1−dq.

Claim. Assuming N≥2⁢q, then for k=q−dq, the number of x satisfying fk⁢(x)≥N2⁢q is at least N⁢q.

For x=1d,2d,⋯,N⁢qd, we know q−dq⋅(−(q−d)−1⁢d⁢x+m⁢q)+dq⁢x∈{1,2,⋯,N}, for m=0,1,⋯,[Nq]−1, where (q−d)−1 is the number-theoretic inverse of q−d modulo q. Notice m can take [Nq]≥N2⁢q values, we know the claim is established.

When r is fixed, let Q=⌈N4⁢r⌉. For every (q,d) pair, which satisfies gcd⁡(q,d)=1,0<d<2⁢q and q≤Q, contribute (N⁢q)2 choices for (x1,x2) pairs. (Because 2≤r≤N2400, we know q≤Q≤N2⁢r, which means N≥2⁢r⁢q≥2⁢q, we can use the claim above.) And for every fixed q, there are 2⁢φ⁢(q) choices of d, for gcd⁡(q,d)=1 and 0<d<2⁢q. Now the number of lines passing x is fk⁢(x1)⁢fk⁢(x2)≥(N2⁢q)2≥(N2⁢Q)2≥r.

Then we know

|Pr⁢(𝔏)| ≥∑q=1Q2⁢φ⁢(q)⁢N2⁢q2=2⁢N2⁢∑q=1Qφ⁢(q)⁢q2≥2⁢N2⁢∑1≤q≤Q,q⁢ odd1+q2⁢q2
≥N2⁢Q⁢(Q+2)⁢(3⁢Q2−2⁢Q−2)24≥N2⁢Q412≥112⁢L32r2≳L32⁢r−2

when Q≥3. Since Q≥N4⁢r=N216⁢r≥5, we know the inequality above is true. ∎

Solution 8.2.

Step 1: For every y∈S⁢(u,r)∩S⁢(v,r), it satisfies ∑i=13(ui−yi)2=r and ∑i=13(vi−yi)2=r. Then we know

0=∑i=13(ui−yi)2−(vi−yi)2=∑i=13(ui2−vi2+2⁢yi⁢vi−2⁢yi⁢ui)=∑i=13(ui2−vi2)−2⁢yi⁢(ui−vi)

which means ∑i=13(ui−vi)⁢yi=∑i=13(ui−vi)⁢2−1⁢(ui+vi).

Step 2: If Perp⁡(u,v)=Perp⁡(u,w), we know there exist c≠0 satisfying ui−vi=c⁢(ui−wi) for i=1,2,3 and ∑i=13(ui−vi)⁢2−1⁢(ui+vi)=c⁢(∑i=13(ui−wi)⁢2−1⁢(ui+wi)).

Step 3: Notice that S⁢(u,r)∩S⁢(v,r)∩S⁢(w,r)⊆Perp⁡(u,v),Perp⁡(v,w) and Perp⁡(w,u), thus S⁢(u,r)∩S⁢(v,r)∩S⁢(w,r)⊆Perp⁡(u,v)∩Perp⁡(v,w)∩Perp⁡(w,u). We can know Perp⁡(u,v)∩Perp⁡(v,w)∩Perp⁡(w,u) is a line from the equation of plane. We call this line as ℓ.

Step 4: From S⁢(0,r) doesn’t contain any line, we know S⁢(u,r) also doesn’t contain any line. Since S⁢(u,r)∩S⁢(v,r)∩S⁢(w,r)⊆ℓ∩S⁢(u,r), we consider the points in |ℓ∩S⁢(u,r)|. It can be realized as finding roots of a quadratic equation whose coefficients are not all 0. (Specifically, we substitute ℓ:y=a⁢t+b into the equation S⁢(u,r) to solve for t.) Thus we know |ℓ∩S⁢(u,r)|≤2, which leads the conclusion.

Step 5: Suppose that S⁢(0,r) contains the line parametrized by γ⁢(t)=m→⁢t+b→, where m→=(m1,m2,m3) and b→=(b1,b2,b3). This is equivalent to saying that ∑i=13(mi⁢t+bi)2−r=0 for all t∈𝔽q3. If we expand the left-hand side as a polynomial in t, each coefficient must vanish, leading to the equations

∑i=13mi3=0;∑i=13mi⁢bi=0;∑i=13bi2=r

These formulas lead to a tricky way of writing r as a negative square. Since −1 is a quadratic residue, we can conclude that r is a quadratic residue.

m12⁢r =m12⁢(b12+b22+b32)=(m1⁢b1)2+m12⁢(b22+b32)
=(m2⁢b2+m3⁢b3)2−(m22+m32)⁢(b22+b32)=−(m2⁢b3−m3⁢b2)2

If m1=0, we can know r=b12 by calculation. So the conclusion is established.

Step 6: If r1,r2 are any two quadratic non-residues, we have

χ⁢(r2⁢r1−1)=χ⁢(r2)⁢χ⁢(r1−1)=(−1)⁢(−1)=1

which means r2⁢r1−1 is a quadratic residue. So there exists k∈𝔽q∗ such that k2=r2⁢r1−1. Consider bijection φ⁢(y)=k⁢y, it maps the element in S⁢(0,r1) to S⁢(0,r2) since for every y∈S⁢(0,r1), we have

‖φ⁢(y)‖2=(k⁢y1)2+(k⁢y2)2+(k⁢y3)2=k2⁢(y12+y22+y32)=k2⁢r1=r2

Therefore we have |S⁢(0,r1)|=|S⁢(0,r2)|.

If r1,r2 are both non-zero quadratic residues, assuming r1=a2 and r2=b2, we can consider bijection φ⁢(y)=b⁢a−1⁢y. Then we know |S⁢(0,r1)|=|S⁢(0,r2)| similarly.

For the case of r=0, we consider the equation of y12+y22=−y32. Using the formula in [6]:

N⁢(c)=q−χ⁢(−1)⁢ for ⁢c≠0andN⁢(0)=q+χ⁢(−1)⁢(q−1)

where N⁢(c) represents the number of roots of u2+v2=c in 𝔽q. If y3=0, we have N⁢(0)=2⁢q−1. If y3≠0, we have N⁢(−y32)=q−1. Adding them up and we get |S⁢(0,0)|=2⁢q−1+(q−1)⁢(q−1)=q2.

For the case of r=s2≠0, we consider the equation of y12+y22=s2−y32. If y3=±s, we know N⁢(0)=2⁢q−1. If y3≠±s, we know N⁢(s2−y32)=q−1. Adding them up and we get |S⁢(0,s2)|=2⁢(2⁢q−1)+(q−2)⁢(q−1)=q2+q.

For the case of r is quadratic non-residue, we consider the equation of y12+y22=r−y32. For every y3, we have r−y32≠0. Since N⁢(r−y32)=q−1, we know |S⁢(0,r)|=q⁢(q−1)=q2−q. ∎

Solution 8.3.

Consider the equation of quadratic surface: Q⁢(x)=x⊤⁢A⁢x+b⊤⁢x+c=0, where A is a symmetric matrix and b is a vector. Since the scalar equivalence, we know its degrees of freedom can be realized as a 9-dimension projective space. Every line li can be parameterized as ri⁢(t)=pi+t⁢di. So Q⁢(pi+t⁢di)=0 for i=1,2,3 and every t, which means the coefficients of a quadratic polynomial in t are all 0. That is, for i=1,2,3 and every t,

di⊤⁢A⁢di=0, 2⁢pi⊤⁢A⁢pi+b⊤⁢di=0,pi⊤⁢A⁢pi+b⊤⁢pi+c=0

There are 9 linear equations. Then the dimension of solution is 0, in the sense of scalar equivalence. So there is only one degree 2 algebraic surface containing the three lines. ∎

Solution 8.4.

About the smoothness of R⁢(l1,l2,l3), we consider the singularity p such that Q⁢(p)=0 and ∇Q⁢(p)=2⁢A⁢p+b=0. Assuming ℓ:r⁢(t)=p⁢t+d is a line passing p, since the two conditions above, we have

Q⁢(p+t⁢d)=(p+t⁢d)⊤⁢A⁢(p+t⁢d)+b⊤⁢(p+t⁢d)+c=t2⁢(d⊤⁢A⁢d)

Let d=q−p, here q∈R⁢(l1,l2,l3), we know d⊤⁢A⁢d=0, which means the line passing p,q is on R⁢(l1,l2,l3). Since the conclusion above is established for any q∈R⁢(l1,l2,l3), we know R⁢(l1,l2,l3) is a conical surface with vertex p. Then l1,l2,l3 won’t be skew because they all passes p, which leads a contradiction.

For any point p∈R⁢(l1,l2,l3), assume that line r⁢(t)=p+t⁢d passes it. Using Taylor expansion, we know Q⁢(p+t⁢d)=Q⁢(p)+t⁢∇Q⁢(p)⋅d+t2⁢d⊤⁢A⁢d=t⁢(∇Q⁢(p)⋅d+)⁢t2⁢(d⊤⁢A⁢d). Now we have ∇Q⁢(p)⋅d=0 and d⊤⁢A⁢d=0. Equation ∇Q⁢(p)⋅d=0 shows d is on tangent plane passing p. Notice that reguli are irreducible, we know d⊤⁢A⁢d is not always 0 in that tangent plane. (Otherwise, any d≠0 will match the condition above, which means R⁢(l1,l2,l3) vanish in that tangent plane, leading that R⁢(l1,l2,l3) is reducible.) Since d⊤⁢A⁢d is quadratic, it has at most two linear factors. That is, there are at most two lines satisfy the condition above.

For other fields, the conclusions are also true. For 𝔽≠𝔽2n, the proof above also works.. When 𝔽=𝔽2n, the proof should be modified a bit.

Regarding of the smoothness, if there is a singularity, we know b=0. Choose p,q∈R⁢(l1,l2,l3), we have p⊤⁢A⁢p+c=0 and q⊤⁢A⁢q+c=0. Let r⁢(t)=p+t⁢(q−p), then

Q⁢(r⁢(t))=(p+t⁢(q−p))⊤⁢A⁢(p+t⁢(q−p))+c

Expand it and use p⊤⁢A⁢q=q⊤⁢A⁢p and 2=0 to simplify, we have Q⁢(r⁢(t))=0, which means r⁢(t)∈R⁢(l1,l2,l3). Because it is established for any p,q, we know R⁢(l1,l2,l3) contains a plane, which is contradictory to that R⁢(l1,l2,l3) is irreducible.

Regarding that there are at most two lines in R⁢(l1,l2,l3) passing one point, just expand Q⁢(p+t⁢d)=(p+t⁢d)⊤⁢A⁢(p+t⁢d)+b⊤⁢(p+t⁢d)+c and simplify. We can get Q⁢(p+t⁢d)=t⁢(b⊤⁢d)+t2⁢(d⊤⁢A⁢d), which means b⊤⁢d=0 and d⊤⁢A⁢d=0 if r⁢(t)=p+t⁢d∈R⁢(l1,l2,l3) for any t. And that’s contradictory to that R⁢(l1,l2,l3) is irreducible. ∎

Solution 8.5.

With a similar proof of Theorem 8.18, we can know:

Claim. Suppose that 𝔏 is a set of L lines in 𝔽3 with ≤B lines in any plane or degree 2 surface. Then the number of intersection points of 𝔏 is ≤K⁢B13⁢L53, where K≥1 is constant .

Just replace all ”10” of the proof of Theorem 8.18 with ”B”, we can finish proof of the claim above.

We will prove by induction that a set of L lines determines at most C⁢L74 joints. More precisely, here C=K34⁢214.

Take B=K−34⁢234⁢L14, let β=K−34⁢234, now B=β⁢L14. If L=3, we have J⁢(𝔏)≤1 and K34⁢214⁢L74≥1. So the inductive foundation is established. We can assume that, for any 𝔏′ containing L′<L lines, we have J⁢(𝔏′)≤C⁢(L′)74. Now consider the line set 𝔏 with L lines.

For the case that there is no plane or regulus containing more than B lines, consider the number of intersections, we have J⁢(𝔏)≤K⁢B13⁢L53=K⁢β13⁢L74=C⁢L74.

If there exist a plane or regulus containing more than B lines, we call it Σ and let 𝔏Σ⊆𝔏 denote the lines in Σ. Notice that |𝔏Σ|>B, let 𝔏′=𝔏\𝔏Σ and we have |𝔏′|<L−B. If Σ is plane, any three lines are coplanar,then there doesn’t exist joint on Σ. If Σ is regulus, any point lies on at most two lines, then there doesn’t exist joint on it. So there’s no joint in 𝔏Σ.

The joints in 𝔏 can be divided into two categories. In the first category, the three lines that make up the joints are all in 𝔏, the number of these joints is J⁢(𝔏). In the second category, those three lines have at least one in Σ and at least one in 𝔏′. For this category, every line in 𝔏′ intersects Σ at most 2 points. So the number of joints in the second category is at most 2⁢|𝔏′|≤2⁢L. Now we have

J⁢(𝔏)≤|J⁢(𝔏′)|+2⁢L≤C⁢(L−B)74+2⁢L≤C⁢L74

The last inequality holds when L≥3 and K≥1, here we omit some of the calculation details. So the induction finishes and conclusion is established. ∎

Solution 10.1.

Let D be a degree that we will choose later. By Theorem 10.3, we can find a non-zero polynomial P of degree ≤D so that each component of the complement of Z⁢(P) contains ≲S⁢D−2 points of 𝒮. Let Oi be the components of ℝ2\Z⁢(P). For each i, let 𝒮i=𝒮∩Oi and let Γi⊆Γ be the set of unit circles of Γ that intersect Oi. Let Si=|𝒮i| and Ni=|Γi|. Since circle is a quadratic curve, if it isn’t contained in Z⁢(P), then it intersects Z⁢(P) in at most 2⁢D points, by Bezout Theorem. Thus every unit circle passes ≲D cells, which means ∑iNi≲N⁢D.

Claim. If 𝒮 is a set of S points in ℝ2, and Γ is a set of N unit circles in ℝ2, then
(1) I⁢(𝒮,Γ)≤N+2⁢S2;
(2) I⁢(𝒮,Γ)≤2⁢N2+S.

Fix x∈𝒮. Let Nx be the number of circles of Γ that contain x and no other point of 𝒮. For each other point y∈S, there is at most two circles of Γ containing x and y. Therefore, I⁢(x,Γ)≤2⁢S+Nx. So I⁢(𝒮,Γ)≤2⁢S2+∑x∈𝒮Nx≤2⁢S2+N. The proof of the other inequality is similar.

If N>S2 or S>N2, then the conclusion follows from the claim above. Therefore, we can now restrict to the case that S12≤N≤S2.

Applying the claim in each cell, we get I⁢(𝒮i,Γi)≤Ni+2⁢Si2 then

I⁢(𝒮c⁢e⁢l⁢l,Γ)=∑iI⁢(𝒮i,Γi)≲∑iNi+∑iSi2≲N⁢D+S⁢D−2⁢∑iSi≤N⁢D+S2⁢D−2

Since every circle intersects Z⁢(P) in at most 2⁢D points if it isn’t contained in Z⁢(P), we have I⁢(𝒮a⁢l⁢g,Γc⁢e⁢l⁢l)≤2⁢N⁢D. Consider the degree, the number of circles in Z⁢(P) is at most D2. Using the claim above, we get I⁢(𝒮a⁢l⁢g,Γa⁢l⁢g)≤S+D22.

Adding them up and we know I⁢(𝒮,Γ)≲N⁢D+S2⁢D−2+S+D2. Take D∼S23⁢N−13, from N≤S2, we know S23⁢N−13≥1. Also from S12≤N, we know D2∼S43⁢N−23≤S. Therefore, I⁢(𝒮,Γ)≲S23⁢N23+S. And let Γ be the unit circles centered at 𝒮, we know S=N and I⁢(𝒮,Γ)≲N43, which means a set of N points in the plane determines ≲N43 unit distances. ∎

Solution 10.2.
99 9 Conclusions needed to prove should be I⁢(𝒮,Γ)≲S3+N and I⁢(𝒮,Γ)≲S35⁢N45+N+S.

Consider the circumcenter of a triangle, we can know a set of 3 points lies on a unique circle immediately. Fix x∈𝒮. Let Γh⁢i⁢g⁢h⊆Γ be the circles containing at least 3 points in 𝒮 and Γl⁢o⁢w=Γ\Γh⁢i⁢g⁢h. Therefore, I⁢(x,Γ)=I⁢(x,Γh⁢i⁢g⁢h)+I⁢(x,Γl⁢o⁢w)≤(S−12)+I⁢(x,Γl⁢o⁢w). So I⁢(𝒮,Γ)≤S⋅S2+∑x∈𝒮I⁢(x,Γl⁢o⁢w)≤S3+(N+2⁢N)≲S3+N.

Let D be a degree that we will choose later. By Theorem 10.3, we can find a non-zero polynomial P of degree ≤D so that each component of the complement of Z⁢(P) contains ≲S⁢D−2 points of 𝒮. Let Oi be the components of ℝ2\Z⁢(P). For each i, let 𝒮i=𝒮∩Oi and let Γi⊆Γ be the set of circles of Γ that intersect Oi. Let Si=|𝒮i| and Ni=|Γi|. Since circle is a quadratic curve, if it isn’t contained in Z⁢(P), then it intersects Z⁢(P) in at most 2⁢D points, by Bezout Theorem. Thus every circle passes ≲D cells, which means ∑iNi≲N⁢D.

Applying that in each cell, we get

I⁢(𝒮c⁢e⁢l⁢l,Γ)=∑iI⁢(𝒮i,Γi)≲∑iNi+∑iSi3≲N⁢D+(S⁢D−2)2⁢∑iSi≤N⁢D+S3⁢D−4

Since every circle intersects Z⁢(P) in at most 2⁢D points if it isn’t contained in Z⁢(P), we have I⁢(𝒮a⁢l⁢g,Γc⁢e⁢l⁢l)≤2⁢N⁢D. Consider the degree, the number of circles in Z⁢(P) is at most D2.

We can prove I⁢(𝒮,Γ)≤S+2⁢N2 by the method in Exercise 10.1. Using the inequality above, we get I⁢(𝒮a⁢l⁢g,Γa⁢l⁢g)≤S+D22.

If N>S3 or S>N2, then we know I⁢(𝒮,Γ)≲N or S respectively. Therefore, we can now restrict to the case that S12≤N≤S3.

Adding them up and we know I⁢(𝒮,Γ)≲N⁢D+S3⁢D−4+S+D2. Take D∼S35⁢N−15, from N≤S3, we know S35⁢N−13≥1. Also from S12≤N, we know D2∼S65⁢N−25≤S. Therefore, I⁢(𝒮,Γ)≲S35⁢N45+S.

Regarding of the r -rich point. Consider the Pr⁢(Γ) as 𝒮, we have S≤2⁢(N2)≤N2. For the case of N≥S3, we have I⁢(𝒮,Γ)≲S35⁢N45 and I⁢(𝒮,Γ)≥r⁢S. Then we have S≲N2⁢r−52 immediately.1010 10 If N>S3, the conclusion may be not established. Consider an counterexample: there is a point lying on N circles and we have PN⁢(Γ)≥1, but let N→∞ we have PN⁢(Γ)≲N−12→0.

∎

Solution 10.3.

Suppose that Γ is a set of N parabolas in the plane and 𝒮 is a set of S points in the plane. Here is an example of I⁢(𝒮,Γ)∼S23⁢N23. Take Y=3⁢X2,A=1,B=X,C=X2, we assume X as a large integer. Notice that for every integer x such that |x|≤X, we have (x,a⁢x2+b⁢x+c)∈𝒮 since |a⁢x2+b⁢x+c|≤x2+|b⁢x|+|c|≤3⁢X2≤Y. Now we have I⁢(𝒮,Γ)=N⋅2⁢X∼X4 and S∼N∼X3. Thus we have I⁢(𝒮,Γ)∼S23⁢N23. ∎

Solution 10.4.

First, if there exist two irreducible algebraic curves γ1 and γ2 with degree at most d, the number of intersections of them is at most d2, since Bezout Theorem. So for any set of d2+1 points in ℝ2, there is at most one curve γ∈Γ containing all the points.

Fix x∈𝒮. Let Γh⁢i⁢g⁢h⊆Γ be the irreducible algebraic curves containing at least k points in 𝒮 and Γl⁢o⁢w=Γ\Γh⁢i⁢g⁢h. Therefore, I⁢(x,Γ)=I⁢(x,Γh⁢i⁢g⁢h)+I⁢(x,Γl⁢o⁢w)≤(S−1k−1)+I⁢(x,Γl⁢o⁢w). So I⁢(𝒮,Γ)≤S⋅Sk−1+∑x∈𝒮I⁢(x,Γl⁢o⁢w)≤Sk+(N+2⁢N+⋯+(k−1)⁢N)≲Sk+N.

Let D be a degree that we will choose later. By Theorem 10.3, we can find a non-zero polynomial P of degree ≤D so that each component of the complement of Z⁢(P) contains ≲S⁢D−2 points of 𝒮. Let Oi be the components of ℝ2\Z⁢(P). For each i, let 𝒮i=𝒮∩Oi and let Γi⊆Γ be the set of irreducible algebraic curves of Γ that intersect Oi. Let Si=|𝒮i| and Ni=|Γi|. Since the degree of irreducible algebraic curves is at most d, if it isn’t contained in Z⁢(P), then it intersects Z⁢(P) in at most d⁢D points, by Bezout Theorem. Thus every irreducible algebraic curve passes ≲D cells, which means ∑iNi≲N⁢D.

Applying that in each cell, we get

I⁢(𝒮c⁢e⁢l⁢l,Γ) =∑iI⁢(𝒮i,Γi)≲∑iNi+∑iSik
≲N⁢D+(S⁢D−2)k−1⁢∑iSi≤N⁢D+Sk⁢D−2⁢(k−1)

Since every irreducible algebraic curve intersects Z⁢(P) in at most d⁢D points if it isn’t contained in Z⁢(P), we have I⁢(𝒮a⁢l⁢g,Γc⁢e⁢l⁢l)≤N⁢d⁢D. Consider the degree, the number of irreducible algebraic curves in Z⁢(P) is at most Dd.

We can prove I⁢(𝒮,Γ)≤S+d2⁢N2 by the method in Exercise 10.1. Using the inequality above, we get I⁢(𝒮a⁢l⁢g,Γa⁢l⁢g)≤S+D2.

If N≥Sk or S>N2, then we know I⁢(𝒮,Γ)≲N or S respectively. Therefore, we can now restrict to the case that S12≤N≤Sk.

Adding them up and we know I⁢(𝒮,Γ)≲N⁢D+Sk⁢D−2⁢(k−1)+S+D2. Take D∼Sk2⁢k−1⁢N−12⁢k−1, from N≤Sk, we know Sk2⁢k−1⁢N−12⁢k−1≥1. Also from S12≤N, we know D2∼S2⁢k2⁢k−1⁢N−22⁢k−1≤S. Therefore, I⁢(𝒮,Γ)≲Sk2⁢k−1⁢N2⁢k−22⁢k−1+S. ∎

Solution 10.5.

We will use induction to prove the following claim firstly.

Claim. For any ε>0, if 𝔏 is a set of L lines in the plane, and 𝒮 is a set of S points in the plane, then I⁢(𝒮,𝔏)≤C⁢(ε)⁢S23+ε⁢L23+ε+(D2+1)⁢(S+L).

We can observe that the conclusion is established when S=1,L=1. Assuming that the conclusion is true for 𝒮′,𝔏′ such that |𝒮′|<|𝒮|,|𝔏′|<|𝔏|.

By Theorem 10.3, we can find a non-zero polynomial P of degree ≤D so that each component of the complement of Z⁢(P) contains ≤K⁢S⁢D−2 points of 𝒮, where K is a constant. Let k⁢D2 is the number of cells and Oi be the components of ℝ2\Z⁢(P). For each i, let 𝒮i=𝒮∩Oi and let 𝔏i⊆𝔏 be the set of lines of 𝔏 that intersect Oi. Let Si=|𝒮i| and Li=|𝔏i|. Since every line intersects Z⁢(P) in at most D points, then every line passes D+1 cells, which means ∑i=1k⁢D2Li≤L⁢(D+1).

If N≥S2 or S>N2, then we know I⁢(𝒮,𝔏)≤2⁢N or 2⁢S respectively. Therefore, we can now restrict to the case that S12≤N≤S2.

In following content, we assume that

Kp⁢D2−4⁢p⁢(D+1)p⁢k1−p<1andC⁢(ε)≥(2+D)⁢(D2+1)1−Kp⁢D2−4⁢p⁢(D+1)p⁢k1−p

which are possible when D=D⁢(ε) and C⁢(ε) are both large, where p=23+ε<1.

Applying that in each cell, using Jensen’s inequality, we get

I⁢(𝒮c⁢e⁢l⁢l,𝔏) =∑i=1k⁢D2I⁢(𝒮i,𝔏i)≤∑i=1k⁢D2C⁢(ε)⁢((K⁢Si⁢D−2)p⁢Lip)+(D2+1)⁢(Si+Li)
≤C⁢(ε)⁢Kp⁢D−2⁢p⁢(k⁢D2)⁢Sp⁢(L⁢(D+1)k⁢D2)p+(D2+1)⁢(S+L⁢(D+1))
=C⁢(ε)⁢Kp⁢D2−4⁢p⁢(D+1)p⁢k1−p⁢Sp⁢Lp+(D2+1)⁢(2+D)⁢Sp⁢Lp
≤C⁢(ε)⁢Sp⁢Lp

Also, similar to the proof of Theorem 10.10, we know I⁢(𝒮a⁢l⁢g,𝔏c⁢e⁢l⁢l)≤L⁢D and I⁢(𝒮a⁢l⁢g,𝔏a⁢l⁢g)≤S+D2. Then we know

I⁢(𝒮a⁢l⁢g,𝔏c⁢e⁢l⁢l)+I⁢(𝒮a⁢l⁢g,𝔏a⁢l⁢g)≤L⁢D+S+D2≤(D2+1)⁢(S+L)

since S,L≥1 and D≥1. Now adding them up and we finish the proof of this claim.

Notice that C⁢(ε)>D2+1, we have

I⁢(𝒮,𝔏)≤C⁢(ε)⁢S23+ε⁢L23+ε+(D2+1)⁢(S+L)≤C⁢(ε)⁢(S23+ε⁢L23+ε+S+L)

∎

Solution 10.6.

Fix x∈𝒮. Let Nx be the number of planes of Γ that contain x and no other point of 𝒮. For each other point y∈S, there is at most two planes of Γ containing x and y. Therefore, I⁢(x,Γ)≤2⁢S+Nx. So I⁢(𝒮,Γ)≤2⁢S2+∑x∈𝒮Nx≤2⁢S2+N.

Fix γ∈Γ. Let 𝒮h⁢i⁢g⁢h⊆𝒮 be the points contained in least 3 planes in Γ and 𝒮l⁢o⁢w=𝒮\𝒮h⁢i⁢g⁢h. Therefore, I⁢(𝒮,γ)=I⁢(𝒮h⁢i⁢g⁢h,γ)+I⁢(𝒮l⁢o⁢w,γ)≤(N−12)+I⁢(𝒮l⁢o⁢w,γ). So I⁢(𝒮,Γ)≤N⋅N22+∑γ∈ΓI⁢(𝒮l⁢o⁢w,γ)≤N32+(S+2⁢S)≤N32+3⁢S.

Claim. For any ε>0, if Γ is a set of N planes in ℝ3, and 𝒮 is a set of S points in ℝ3, then I⁢(𝒮,Γ)≤C⁢(ε)⁢S45+ε⁢N35+ε+(D3+3)⁢(S+N).

We can observe that the conclusion is established when S=1,L=1. Assuming that the conclusion is true for 𝒮′,𝔏′ such that |𝒮′|<|𝒮|,|𝔏′|<|𝔏|.

By Theorem 10.3, we can find a non-zero polynomial P of degree ≤D so that each component of the complement of Z⁢(P) contains ≤K⁢S⁢D−3 points of 𝒮, where K is a constant. Let k⁢D3 is the number of cells and Oi be the components of ℝ3\Z⁢(P). For each i, let 𝒮i=𝒮∩Oi and let Γi⊆Γ be the set of planes of Γ that intersect Oi. Let Si=|𝒮i| and Ni=|Γi|. According to Harnack inequality, every plane intersects Z⁢(P) in at most M⁢D2 cells, which means ∑i=1k⁢D3Ni≤M⁢N⁢D2, where M is a constant. Assume Γa⁢l⁢g is the set of planes of Γ that lie in Z⁢(P) and Γc⁢e⁢l⁢l=Γ\Γa⁢l⁢g.

1111 11 Idea of this part comes from [2].

Let 𝒮a⁢l⁢g be the set of points of 𝒮 that lie in Z⁢(P) and 𝒮a⁢l⁢ga⁢l⁢g the set of points of 𝒮a⁢l⁢g that lie in Z⁢(Q). Again by Theorem 10.3, we can find a non-zero polynomial Q of degree ≤D which is co-prime to P so that each component of the complement of Z⁢(Q) contains ≤T⁢S⁢D−3 points of 𝒮a⁢l⁢g, where T is a constant. (That is possible because if not, we can consider a small perturbation of Q to make they are co-prime.) Let t⁢D3 is the number of cells and Ui be the components of ℝ3\Z⁢(Q). For each i, let 𝒮a⁢l⁢gi=𝒮a⁢l⁢g∩Ui and let Γi⊆Γ be the set of planes of Γ that intersect Ui. Let si=|𝒮a⁢l⁢gi| and ni=|Γi|. According to Harnack inequality, every plane intersects Z⁢(Q) in at most m⁢D2 cells, which means ∑i=1t⁢D3ni≤m⁢N⁢D2, where m is a constant.

If N>S2 or S>N3, then we know I⁢(𝒮,𝔏)≤3⁢N or 4⁢S respectively. Therefore, we can now restrict to the case that S13≤N≤S2.

In following content, we assume that

Kp⁢k1−p⁢D3−3⁢p−q⁢Mq+Tp⁢t1−p⁢D3−3⁢p−q⁢mq<1

and

C⁢(ε)≥(D3+3)⁢(M⁢D2+m⁢D2+2)1−Kp⁢k1−p⁢D3−3⁢p−q⁢Mq−Tp⁢t1−p⁢D3−3⁢p−q⁢mq

which are possible when D=D⁢(ε) and C⁢(ε) are both large, where p=35+ε and q=45+ε<1.

Applying that in each cell, using Jensen’s inequality, let 𝒮c⁢e⁢l⁢l=𝒮\𝒮a⁢l⁢g, we get

I⁢(𝒮c⁢e⁢l⁢l,Γ) =∑i=1k⁢D3I⁢(𝒮i,Γi)≤∑i=1k⁢D3C⁢(ε)⁢((K⁢Si⁢D−3)p⁢Niq)+(D3+3)⁢(Si+Ni)
≤C⁢(ε)⁢Kp⁢D−3⁢p⁢(k⁢D3)⁢Sp⁢(M⁢N⁢D2k⁢D3)q+(D3+3)⁢(S+M⁢D2⁢N)
=C⁢(ε)⁢Kp⁢k1−p⁢D3−3⁢p−q⁢Mq⁢Sp⁢Nq+(D3+3)⁢(1+M⁢D2)⁢Sp⁢Nq

Assume 𝒮a⁢l⁢gc⁢e⁢l⁢l=𝒮a⁢l⁢g\𝒮a⁢l⁢ga⁢l⁢g, we have

I⁢(𝒮a⁢l⁢gc⁢e⁢l⁢l,Γ) =∑i=1t⁢D3I⁢(𝒮a⁢l⁢gi,Γi)≤∑i=1t⁢D3C⁢(ε)⁢((T⁢si⁢D−3)p⁢niq)+(D3+3)⁢(si+ni)
≤C⁢(ε)⁢Tp⁢D−3⁢p⁢(t⁢D3)⁢Sp⁢(m⁢N⁢D2t⁢D3)q+(D3+3)⁢(S+m⁢D2⁢N)
=C⁢(ε)⁢Tp⁢t1−p⁢D3−3⁢p−q⁢mq⁢Sp⁢Nq+(D3+3)⁢(1+m⁢D2)⁢Sp⁢Nq

Now we know I⁢(𝒮c⁢e⁢l⁢l,Γ)+I⁢(𝒮a⁢l⁢gc⁢e⁢l⁢l,Γ)≤C⁢(ε)⁢Sp⁢Nq.

Consider Bezout Theorem, each plane of Γ has at most D2 intersection points with Z⁢(P)∩Z⁢(Q), and so it has at most D2 incidences with 𝒮a⁢l⁢g, we know I⁢(𝒮a⁢l⁢ga⁢l⁢g,Γc⁢e⁢l⁢l)≤N⁢D2. And using the inequality above, we have I⁢(𝒮a⁢l⁢ga⁢l⁢g,Γa⁢l⁢g)≤3⁢S+D32. Then we know

I⁢(𝒮a⁢l⁢ga⁢l⁢g,Γc⁢e⁢l⁢l)+I⁢(𝒮a⁢l⁢ga⁢l⁢g,Γa⁢l⁢g)≤N⁢D2+3⁢S+D32≤(D3+3)⁢(S+N)

since S,L≥1 and D≥1. Now adding them up and we finish the proof of this claim.

Notice that C⁢(ε)>D3+3, we have

I⁢(𝒮,Γ)≤C⁢(ε)⁢S45+ε⁢N35+ε+(D3+3)⁢(S+N)≤C⁢(ε)⁢(S45+ε⁢N35+ε+S+N)

∎

Solution 10.7.

Considering a circle S large enough, which isn’t contained in Z⁢(P), we know |Z⁢(P)∩S|≤2⁢D by Bezout Theorem. Notice that every unbounded component must intersect S, we know the number of unbounded components is at most 2⁢D.

Regarding the bounded components, in every bounded component U, we know P must reach a local maximum or a local minimum, which means there is a critical point in U. If there’s no common factor of ∂1P and ∂2P, then the number of points such that ∂1P=∂2P=0 is at most (deg⁢∂1P)⁢(deg⁢∂2P)≤(D−1)2. Then the number of bounded components is at most (D−1)2.

For the case of ∂1P and ∂2P have at least one common factor, we can consider the polynomial Q=P+w1⁢x1+w2⁢x2. Let m=min⁡U⁢ bounded⁢maxx∈U⁡|P⁢(x)|, we take w1 and w2 small enough such that |w1⁢x1+w2⁢x2|<m2 for x in every bounded component. So for every bounded U, there exist a point x in it such that |Q⁢(x)|≥m−|w1⁢x1+w2⁢x2|>m2. And for x∈∂U⊆Z⁢(P), we know |Q⁢(x)|=|w1⁢x1+w2⁢x2|<m2. Thus there is a critical point of Q in U. Notice that, for c small enough (for all 0<c<K where K is a constant depending P), ∂1P+c and ∂2P+c have no common factor, we know that we can always make ∂1Q and ∂2Q have no common factor. Therefore we know the number of bounded components is at most (D−1)2. The number of components of ℝ2\Z⁢(P) is at most D2+1∼D2. ∎

Solution 10.8.

Suppose that there are three unit 2-spheres S1,S2,S3. Notice that S1∩S2 and S1∩S3 are both circles and S1∩S2∩S3=(S1∩S2)∩(S1∩S3), we know |S1∩S2∩S3|≤2 since two circles intersect in at most 2 points.

Fix x∈𝒮. Let Γh⁢i⁢g⁢h⊆Γ be the unit 2-spheres containing at least 3 points in 𝒮 and Γl⁢o⁢w=Γ\Γh⁢i⁢g⁢h. Notice that 3 points can determine at most two unit 2-spheres. Therefore, I⁢(x,Γ)=I⁢(x,Γh⁢i⁢g⁢h)+I⁢(x,Γl⁢o⁢w)≤2⁢(S−12)+I⁢(x,Γl⁢o⁢w). So I⁢(𝒮,Γ)≤S⋅S2+∑x∈𝒮I⁢(x,Γl⁢o⁢w)≤S3+(N+2⁢N)=S3+3⁢N.

Fix γ∈Γ. Let 𝒮h⁢i⁢g⁢h⊆𝒮 be the points contained in least 3 unit 2-spheres in Γ and 𝒮l⁢o⁢w=𝒮\𝒮h⁢i⁢g⁢h. Notice that 3 unit 2-spheres intersect in at most two points. Therefore, I⁢(𝒮,γ)=I⁢(𝒮h⁢i⁢g⁢h,γ)+I⁢(𝒮l⁢o⁢w,γ)≤2⁢(N−12)+I⁢(𝒮l⁢o⁢w,γ). So I⁢(𝒮,Γ)≤N⋅N2+∑γ∈ΓI⁢(𝒮l⁢o⁢w,γ)≤N3+(S+2⁢S)=N3+3⁢S.

Claim. For any ε>0, if Γ is a set of N unit 2-spheres in ℝ3, and 𝒮 is a set of S points in ℝ3, then I⁢(𝒮,Γ)≤C⁢(ε)⁢S34+ε⁢N34+ε+(2⁢D3+3)⁢(S+N).

By Theorem 10.3, we can find a non-zero polynomial P of degree ≤D so that each component of the complement of Z⁢(P) contains ≤K⁢S⁢D−3 points of 𝒮, where K is a constant. Let k⁢D3 is the number of cells and Oi be the components of ℝ3\Z⁢(P). For each i, let 𝒮i=𝒮∩Oi and let Γi⊆Γ be the set of unit 2-spheres of Γ that intersect Oi. Let Si=|𝒮i| and Ni=|Γi|. According to spherical version of the Harnack inequality, every unit 2-sphere intersects Z⁢(P) in at most M⁢D2 cells, which means ∑i=1k⁢D3Ni≤M⁢N⁢D2, where M is a constant. Assume Γa⁢l⁢g is the set of unit 2-spheres of Γ that lie in Z⁢(P) and Γc⁢e⁢l⁢l=Γ\Γa⁢l⁢g.

Let 𝒮a⁢l⁢g be the set of points of 𝒮 that lie in Z⁢(P) and 𝒮a⁢l⁢ga⁢l⁢g the set of points of 𝒮a⁢l⁢g that lie in Z⁢(Q). Again by Theorem 10.3, we can find a non-zero polynomial Q of degree ≤D which is co-prime to P so that each component of the complement of Z⁢(Q) contains ≤T⁢S⁢D−3 points of 𝒮a⁢l⁢g, where T is a constant. (That is possible because if not, we can consider a small perturbation of Q to make they are co-prime.) Let t⁢D3 is the number of cells and Ui be the components of ℝ3\Z⁢(Q). For each i, let 𝒮a⁢l⁢gi=𝒮a⁢l⁢g∩Ui and let Γi⊆Γ be the set of unit 2-spheres of Γ that intersect Ui. Let si=|𝒮a⁢l⁢gi| and ni=|Γi|. According to spherical version of the Harnack inequality, every unit 2-spheres intersects Z⁢(Q) in at most m⁢D2 cells, which means ∑i=1t⁢D3ni≤m⁢N⁢D2, where m is a constant.

If N>S3 or S>N3, then we know I⁢(𝒮,𝔏)≤4⁢N or 4⁢S respectively. Therefore, we can now restrict to the case that S13≤N≤S3.

In following content, we assume that

Kp⁢k1−p⁢D3−4⁢p⁢Mp+Tp⁢t1−p⁢D3−4⁢p⁢mp<1

and

C⁢(ε)≥(D3+3)⁢(M⁢D2+m⁢D2+2)1−Kp⁢k1−p⁢D3−3⁢p−q⁢Mq−Tp⁢t1−p⁢D3−3⁢p−q⁢mq

which are possible when D=D⁢(ε) and C⁢(ε) are both large, where p=34+ε<1.

Applying that in each cell, using Jensen’s inequality, let 𝒮c⁢e⁢l⁢l=𝒮\𝒮a⁢l⁢g, we get

I⁢(𝒮c⁢e⁢l⁢l,Γ) =∑i=1k⁢D3I⁢(𝒮i,Γi)≤∑i=1k⁢D3C⁢(ε)⁢((K⁢Si⁢D−3)p⁢Nip)+(2⁢D3+3)⁢(Si+Ni)
≤C⁢(ε)⁢Kp⁢D−3⁢p⁢(k⁢D3)⁢Sp⁢(M⁢N⁢D2k⁢D3)p+(2⁢D3+3)⁢(S+M⁢D2⁢N)
=C⁢(ε)⁢Kp⁢k1−p⁢D3−4⁢p⁢Mp⁢Sp⁢Np+(2⁢D3+3)⁢(1+M⁢D2)⁢Sp⁢Np

Assume 𝒮a⁢l⁢gc⁢e⁢l⁢l=𝒮a⁢l⁢g\𝒮a⁢l⁢ga⁢l⁢g, we have

I⁢(𝒮a⁢l⁢gc⁢e⁢l⁢l,Γ) =∑i=1t⁢D3I⁢(𝒮a⁢l⁢gi,Γi)≤∑i=1t⁢D3C⁢(ε)⁢((T⁢si⁢D−3)p⁢nip)+(2⁢D3+3)⁢(si+ni)
≤C⁢(ε)⁢Tp⁢D−3⁢p⁢(t⁢D3)⁢Sp⁢(m⁢N⁢D2t⁢D3)p+(2⁢D3+3)⁢(S+m⁢D2⁢N)
=C⁢(ε)⁢Tp⁢t1−p⁢D3−4⁢p⁢mp⁢Sp⁢Np+(2⁢D3+3)⁢(1+m⁢D2)⁢Sp⁢Np
≤C⁢(ε)⁢Sp⁢Np

Now we know I⁢(𝒮c⁢e⁢l⁢l,Γ)+I⁢(𝒮a⁢l⁢gc⁢e⁢l⁢l,Γ)≤C⁢(ε)⁢Sp⁢Nq.

Consider Bezout Theorem and that sphere is irreducible in ℝ, each unit 2-sphere of Γ has at most 2⁢D2 intersection points with Z⁢(P)∩Z⁢(Q), and so it has at most 2⁢D2 incidences with 𝒮a⁢l⁢g, we know I⁢(𝒮a⁢l⁢ga⁢l⁢g,Γc⁢e⁢l⁢l)≤2⁢N⁢D2. Consider the degree, the number of unit 2-sphere in Z⁢(P) is at most D2. And using the inequality above, we have I⁢(𝒮a⁢l⁢ga⁢l⁢g,Γa⁢l⁢g)≤3⁢S+(D2)3. Then we know

I⁢(𝒮a⁢l⁢ga⁢l⁢g,Γc⁢e⁢l⁢l)+I⁢(𝒮a⁢l⁢ga⁢l⁢g,Γa⁢l⁢g)≤2⁢N⁢D2+3⁢S+(D2)3≤(2⁢D3+3)⁢(S+N)

since S,L≥1 and D≥1. Now adding them up and we finish the proof of this claim.

Notice that C⁢(ε)>2⁢D3+3, we have

I⁢(𝒮,Γ)≤C⁢(ε)⁢S34+ε⁢N34+ε+(D3+3)⁢(S+N)≤C⁢(ε)⁢(S34+ε⁢N34+ε+S+N)

Take Γ as the unit 2-spheres centered at points in 𝒮 and we have N=S. And we can get that N points in ℝ3 determine at most N32+ε unit distances immediately. ∎

Solution 10.9.

Fix x∈𝒮. Let Γh⁢i⁢g⁢h⊆Γ be the 2-spheres containing at least 11 points in 𝒮 and Γl⁢o⁢w=Γ\Γh⁢i⁢g⁢h. Notice that 11 points can determine a sphere. Therefore, I⁢(x,Γ)=I⁢(x,Γh⁢i⁢g⁢h)+I⁢(x,Γl⁢o⁢w)≤(S−110)+I⁢(x,Γl⁢o⁢w). So I⁢(𝒮,Γ)≤S⋅S2+∑x∈𝒮I⁢(x,Γl⁢o⁢w)≤S1⁢1+(N+2⁢N+⋯+10⁢N)=S11+55⁢N.

Fix γ∈Γ. Let Sγ be the number of points of 𝒮 that contained in γ and no other sphere of Γ. Notice that two spheres intersect in at most 10 points. Therefore, I⁢(𝒮,γ)≤Sγ+10⁢N, so we have I⁢(𝒮,Γ)≤N⋅(10⁢N)+∑γ∈ΓSγ≤10⁢N2+S≤10⁢N3+S. 1212 12 Since here we can use a more accurate estimate of 10⁢N2+S, it is possible that the result of this problem can be better.

Claim. For any ε>0, if Γ is a set of N 2-spheres in ℝ3, and 𝒮 is a set of S points in ℝ3, then I⁢(𝒮,Γ)≤C⁢(ε)⁢S1116+ε⁢N1516+ε+(2⁢D3+1)⁢(S+N).

By Theorem 10.3, we can find a non-zero polynomial P of degree ≤D so that each component of the complement of Z⁢(P) contains ≤K⁢S⁢D−3 points of 𝒮, where K is a constant. Let k⁢D3 is the number of cells and Oi be the components of ℝ3\Z⁢(P). For each i, let 𝒮i=𝒮∩Oi and let Γi⊆Γ be the set of 2-spheres of Γ that intersect Oi. Let Si=|𝒮i| and Ni=|Γi|. According to spherical version of the Harnack inequality, every 2-sphere intersects Z⁢(P) in at most M⁢D2 cells, which means ∑i=1k⁢D3Ni≤M⁢N⁢D2, where M is a constant. Assume Γa⁢l⁢g is the set of 2-spheres of Γ that lie in Z⁢(P) and Γc⁢e⁢l⁢l=Γ\Γa⁢l⁢g.

Let 𝒮a⁢l⁢g be the set of points of 𝒮 that lie in Z⁢(P) and 𝒮a⁢l⁢ga⁢l⁢g the set of points of 𝒮a⁢l⁢g that lie in Z⁢(Q). Again by Theorem 10.3, we can find a non-zero polynomial Q of degree ≤D which is co-prime to P so that each component of the complement of Z⁢(Q) contains ≤T⁢S⁢D−3 points of 𝒮a⁢l⁢g, where T is a constant. (That is possible because if not, we can consider a small perturbation of Q to make they are co-prime.) Let t⁢D3 is the number of cells and Ui be the components of ℝ3\Z⁢(Q). For each i, let 𝒮a⁢l⁢gi=𝒮a⁢l⁢g∩Ui and let Γi⊆Γ be the set of 2-spheres of Γ that intersect Ui. Let si=|𝒮a⁢l⁢gi| and ni=|Γi|. According to spherical version of the Harnack inequality, every 2-spheres intersects Z⁢(Q) in at most m⁢D2 cells, which means ∑i=1t⁢D3ni≤m⁢N⁢D2, where m is a constant.

If N>S11 or S>N3, then we know I⁢(𝒮,𝔏)≤56⁢N or 11⁢S respectively. Therefore, we can now restrict to the case that S13≤N≤S11.

In following content, we assume that

Kp⁢k1−p⁢D3−3⁢p−q⁢Mq+Tp⁢t1−p⁢D3−3⁢p−q⁢mq<1

and

C⁢(ε)≥(2⁢D3+1)⁢(M⁢D2+m⁢D2+2)1−Kp⁢k1−p⁢D3−3⁢p−q⁢Mq−Tp⁢t1−p⁢D3−3⁢p−q⁢mq

which are possible when D=D⁢(ε) and C⁢(ε) are both large, where p=1116+ε and q=1516+ε<1.

Applying that in each cell, using Jensen’s inequality, let 𝒮c⁢e⁢l⁢l=𝒮\𝒮a⁢l⁢g, we get

I⁢(𝒮c⁢e⁢l⁢l,Γ) =∑i=1k⁢D3I⁢(𝒮i,Γi)≤∑i=1k⁢D3C⁢(ε)⁢((K⁢Si⁢D−3)p⁢Niq)+(2⁢D3+1)⁢(Si+Ni)
≤C⁢(ε)⁢Kp⁢D−3⁢p⁢(k⁢D3)⁢Sp⁢(M⁢N⁢D2k⁢D3)q+(2⁢D3+1)⁢(S+M⁢D2⁢N)
=C⁢(ε)⁢Kp⁢k1−p⁢D3−3⁢p−q⁢Mq⁢Sp⁢Nq+(2⁢D3+1)⁢(1+M⁢D2)⁢Sp⁢Nq

Assume 𝒮a⁢l⁢gc⁢e⁢l⁢l=𝒮a⁢l⁢g\𝒮a⁢l⁢ga⁢l⁢g, we have

I⁢(𝒮a⁢l⁢gc⁢e⁢l⁢l,Γ) =∑i=1t⁢D3I⁢(𝒮a⁢l⁢gi,Γi)≤∑i=1t⁢D3C⁢(ε)⁢((T⁢si⁢D−3)p⁢niq)+(2⁢D3+1)⁢(si+ni)
≤C⁢(ε)⁢Tp⁢D−3⁢p⁢(t⁢D3)⁢Sp⁢(m⁢N⁢D2t⁢D3)q+(2⁢D3+1)⁢(S+m⁢D2⁢N)
=C⁢(ε)⁢Tp⁢t1−p⁢D3−3⁢p−q⁢mq⁢Sp⁢Nq+(2⁢D3+1)⁢(1+m⁢D2)⁢Sp⁢Nq

Now we know I⁢(𝒮c⁢e⁢l⁢l,Γ)+I⁢(𝒮a⁢l⁢gc⁢e⁢l⁢l,Γ)≤C⁢(ε)⁢Sp⁢Nq.

Consider Bezout Theorem and that sphere is irreducible in ℝ, each 2-sphere of Γ has at most 2⁢D2 intersection points with Z⁢(P)∩Z⁢(Q), and so it has at most 2⁢D2 incidences with 𝒮a⁢l⁢g, we know I⁢(𝒮a⁢l⁢ga⁢l⁢g,Γc⁢e⁢l⁢l)≤2⁢N⁢D2. Consider the degree, the number of unit 2-sphere in Z⁢(P) is at most D2. And using the inequality above, we have I⁢(𝒮a⁢l⁢ga⁢l⁢g,Γa⁢l⁢g)≤S+10⁢(D2)3≤S+2⁢D3. Then we know

I⁢(𝒮a⁢l⁢ga⁢l⁢g,Γc⁢e⁢l⁢l)+I⁢(𝒮a⁢l⁢ga⁢l⁢g,Γa⁢l⁢g)≤2⁢N⁢D2+S+2⁢D3≤(2⁢D3+1)⁢(S+N)

since S,L≥1 and D≥1. Now adding them up and we finish the proof of this claim.

Notice that C⁢(ε)>2⁢D3+1, we have

I⁢(𝒮,Γ)≤C⁢(ε)⁢S1116+ε⁢N1516+ε+(2⁢D3+1)⁢(S+N)≤C⁢(ε)⁢(S1116+ε⁢N1516+ε+S+N)

∎

Solution 10.10.

By Theorem 10.3, there exist a polynomial P∈PolyD⁡(ℝ3) such that ℝ3\Z⁢(P) is decomposed into ∼D3 cells, satisfying |Oi∩Pr⁢(𝔏)|≲D−3⁢|Pr⁢(𝔏)| for every i. We have |Pr⁢(𝔏)|=|Pr⁢(𝔏)∩Z⁢(P)|+|Pr⁢(𝔏)∩(ℝ3)\Z⁢(P)|.

For the case of |Pr⁢(𝔏)∩Z⁢(P)|≤|Pr⁢(𝔏)∩(ℝ3)\Z⁢(P)|, we know for every Oi, we have |Pr⁢(𝔏)|≲D3⁢|Pr⁢(𝔏)∩Oi|≤D3⁢|Pr⁢(𝔏i)|, where 𝔏i⊆𝔏 is set of lines that intersect Oi. Notice that every line intersects at most D+1 cells, we have ∑i|𝔏i|≤(D+1)⁢L≲D⁢L. Since the number of cells is ∼D3, there exist a cell Oi such that |𝔏i|≲L⁢D−2. So there is

|Pr⁢(𝔏)|≲D3⁢|Pr⁢(𝔏i)|≤D3⁢I⁢(B,D,|𝔏i|,r)≤D3⁢I⁢(B,D,K⁢L⁢D−2,r)

For the case of |Pr⁢(𝔏)∩Z⁢(P)|≥|Pr⁢(𝔏)∩(ℝ3)\Z⁢(P)|, we know |Pr⁢(𝔏)|≤2⁢|Pr⁢(𝔏)∩Z⁢(P)|≲D⁢L⁢r−1+B2⁢r−3 by Lemma 10.15.

Therefore, we know I⁢(B,D,L,r)≲(D3⁢I⁢(B,D,K⁢L⁢D−2,r)+D⁢L⁢r−1+B2⁢r−3), which means I⁢(B,D,L,r)≤M⁢(D3⁢I⁢(B,D,K⁢L⁢D−2,r)+D⁢L⁢r−1+B2⁢r−3). Take C=max⁡{M,K}, we get

I⁢(B,D,L,r)≲C⁢(D3⁢I⁢(B,D,C⁢L⁢D−2,r)+D⁢L⁢r−1+B2⁢r−3)

∎

Solution 10.11.

We will use induction on L to prove this conclusion. It obvious that it is established for L=1. We know there is a constant K such that I⁢(B,D,L,r)≤K⁢(D3⁢I⁢(B,D,K⁢L⁢D−2,r)+D⁢L⁢r−1+B2⁢r−3). We assume that this conclusion is established for 𝔏′ with |𝔏′|=L′≤L, that is, I⁢(B,D,L′,r)≤C⁢(ε)⁢B12−ε⁢(L′)32+ε⁢r−2.

Suppose that C⁢(ε) and D=D⁢(ε) large enough, satisfying the following four conditions:

K52+ε⁢D−2⁢ε≤13,K⁢D−2≤12,K⁢D≤16⁢C⁢(ε),K⁢B32+ε≤13⁢C⁢(ε)

Since K⁢L⁢D−2≤L2, we can use the induction hypothesis that

I⁢(B,D,K⁢L⁢D−2,r)≤C⁢(ε)⁢B12−ε⁢(K⁢L⁢D−2)32+ε⁢r−2

So we have

I⁢(B,D,L,r)≤K⁢(D3⋅C⁢(ε)⁢B12−ε⁢(K⁢L⁢D−2)32+ε⁢r−2+D⁢L⁢r−1+B2⁢r−3)

that is

I⁢(B,D,L,r)≤C⁢(ε)⁢K52+ε⁢D−2⁢ε⁢B12−ε⁢L32+ε⁢r−2+K⁢D⁢L⁢r−1+K⁢B2⁢r−3

Use the conditions above, we have

C⁢(ε)⁢K52+ε⁢D−2⁢ε⁢B12−ε⁢L32+ε⁢r−2≤13⁢C⁢(ε)⁢B(1/2)−ε⁢L(3/2)+ε⁢r−2
K⁢D⁢L⁢r−1≤13⁢C⁢(ε)⁢B(1/2)−ε⁢L(3/2)+ε⁢r−2
K⁢B2⁢r−3≤13⁢C⁢(ε)⁢B(1/2)−ε⁢L(3/2)+ε⁢r−2

Thus we have I⁢(B,D,L,r)≤C⁢(ε)⁢B12−ε⁢L32+ε⁢r−2, which leads the conclusion. ∎

Solution 10.12.

For the case of r>2⁢L12, then Pr⁢(𝔏)≤2⁢L⁢r−1 by Lemma 10.16.

If r≤2⁢L12, notice that Lemma 10.15 is also available for ℝn and also sharp, because all B lines can be on the same 2-plane contained by Z⁢(P). Similar to Exercise 10.10, we can prove that there exists a constant K such that

I⁢(B,D,L,r)≤K⁢(Dn⁢I⁢(B,D,C⁢L⁢D−(n−1),r)+D⁢L⁢r−1+B2⁢r−3)

Claim. We have I⁢(B,D,L,r)≤C⁢(ε)⁢Bn−2n−1−ε⁢Lnn−1+ε⁢r−n+1n−1.

We use induction on L to prove this conclusion. It obvious that it is established for L=1. We assume that this conclusion is established for 𝔏′ with |𝔏′|=L′≤L, that is, I⁢(B,D,L′,r)≤C⁢(ε)⁢Bn−2n−1−ε⁢(L′)nn−1+ε⁢r−n+1n−1.

Suppose that C⁢(ε) and D=D⁢(ε) large enough, satisfying the following four conditions:

K2⁢n−1n−1+ε⁢D−(n−1)⁢ε≤13,K⁢D−(n−1)≤12,K⁢D≤13⋅22n−1⁢C⁢(ε),K⁢Bnn−1+ε≤13⁢C⁢(ε)

Since K⁢L⁢D−(n−1)≤L2, we can use the induction hypothesis that

I⁢(B,D,K⁢L⁢D−(n−1),r)≤C⁢(ε)⁢Bn−2n−1−ε⁢(K⁢L⁢D−(n−1))nn−1+ε⁢r−n+1n−1

So we have

I⁢(B,D,L,r)≤K⁢(Dn⋅C⁢(ε)⁢Bn−2n−1−ε⁢(K⁢L⁢D−(n−1))nn−1+ε⁢r−n+1n−1+D⁢L⁢r−1+B2⁢r−3)

that is

I⁢(B,D,L,r)≤C⁢(ε)⁢K2⁢n−1n−1+ε⁢D−(n−1)⁢ε⁢Bn−2n−1−ε⁢Lnn−1+ε⁢r−n+1n−1+K⁢D⁢L⁢r−1+K⁢B2⁢r−3

Use the conditions above, we have

K2⁢n−1n−1+ε⁢D−(n−1)⁢ε⁢Bn−2n−1−ε⁢Lnn−1+ε⁢r−n+1n−1≤C⁢(ε)⁢Bn−2n−1−ε⁢Lnn−1+ε⁢r−n+1n−1
K⁢D⁢L⁢r−1≤C⁢(ε)⁢Bn−2n−1−ε⁢Lnn−1+ε⁢r−n+1n−1
K⁢B2⁢r−3≤C⁢(ε)⁢Bn−2n−1−ε⁢Lnn−1+ε⁢r−n+1n−1

Thus we have I⁢(B,D,L,r)≤C⁢(ε)⁢Bn−2n−1−ε⁢Lnn−1+ε⁢r−n+1n−1. So we have |Pr⁢(𝔏)|≤C⁢(ε)⁢Bn−2n−1−ε⁢Lnn−1+ε⁢r−n+1n−1. ∎

References

  • [1] Angelo Degree of image of a polynomial map. Note: MathOverflowURL:https://mathoverflow.net/q/63463 (version: 2011-04-29) External Links: https://mathoverflow.net/q/63463, Link Cited by: Solution 6.2.
  • [2] A. Basit and A. Sheffer (2014-Dec.) Incidences with k-non-degenerate sets and their applications. Journal of Computational Geometry 5 (1), pp. 284–302. External Links: Link, Document Cited by: footnote 11.
  • [3] N. Eldredge The lebesgue measure of zero set of a polynomial function is zero. Note: Mathematics Stack ExchangeURL:https://math.stackexchange.com/q/1920527 (version: 2021-07-22) External Links: https://math.stackexchange.com/q/1920527, Link Cited by: footnote 1.
  • [4] R. Hartshorne (1977) Varieties. In Algebraic Geometry, pp. 1–59. External Links: ISBN 978-1-4757-3849-0, Document, Link Cited by: Solution 6.1, Solution 6.1.
  • [5] M. Kohan C1 And C2 are non-crossing if they are translates of a convex disc. Note: Mathematics Stack ExchangeURL:https://math.stackexchange.com/q/3225611 (version: 2019-05-14) External Links: https://math.stackexchange.com/q/3225611, Link Cited by: footnote 5.
  • [6] R. Lidl and H. Niederreiter (1996) Equations over finite fields. In Finite Fields, Encyclopedia of Mathematics and its Applications, pp. 268–346. Cited by: Solution 3.2, Solution 3.2, Solution 8.2.
  • [7] G. Martin Polynomial that can be represented as a linear combination. Note: Mathematics Stack ExchangeURL:https://math.stackexchange.com/q/5051406 (version: 2025-03-30) External Links: https://math.stackexchange.com/q/5051406, Link Cited by: footnote 2.
  • [8] Z. Nie and A. Y. Wang (2015) Hilbert functions and the finite degree zariski closure in finite field combinatorial geometry. Journal of Combinatorial Theory, Series A 134, pp. 196–220. External Links: ISSN 0097-3165, Document, Link Cited by: Solution 2.9.
  • [9] L. A. Szekely (1997) Crossing numbers and hard erdos problems in discrete geometry. Combinatorics, Probability and Computing 6 (3), pp. 353–358. External Links: Document Cited by: footnote 6, footnote 7.