For_Con.1#
n=p, a1,a2,…,am∈Z>0
Sk:={B⊂A ∣ σ(B)≡k (mod p)}, k=0,1,…,p−1
f(x):=(1−xa1)(1−xa2)⋯(1−xam)∈Fp/(xp−1)
f(x)=∑B⊂A(−1)∣B∣xσ(B)=∑k=0p−1(∑B∈Sk(−1)∣B∣)xk (⋆)
上式可看作是余式,所以表示方式是唯一的.
另一方面,又有 (1−xaj)=(1−x)(⋯) ,则
f(x)=(1−x)pg(x)
(1−x)p=1−(1p)x+(2p)x2+⋯+(−1)pxp==mod p1−xp==mod xp−10
⇒ f(x)=0 结合 (⋆) ⇒
∀ 0≤k≤p−1, ∑B∈Sk(−1)∣B∣≡0 (mod p)
特别的,k=0 时,∅∈Sk 而 ∑B∈Sk(−1)∣B∣≡0 (mod p)
⇒ ∃ B∈S0 and ∣B∣=0, s.t. σ(B)≡0 (mod p).
$\Box$
注意到这种方法给出了 比使用鸽巢原理更多的信息.For_Problem-1#
A={(ai,bi) ∣ ai,bi∈Z>0 ,i=1,2,…,2p−1}
f(X1,X2):=∏i=12p−1(1−X1aiX2bi)∈Fp[X1,X2]/(X1p−1,X2p−1)
记为向量形式: X=(X1,X2), αi=(ai,bi), Xαi=X1aiX2bi
Sα:={B⊂A ∣ σ(B)≡α (mod p)}, α={0,1,…,p−1}2
f(X1,X2)=∏i=12p−1(1−Xαi)=∑B⊂A(−1)∣B∣xσ(B)
f(X)=∑α∈{0,1,…,p−1}2(∑B∈Sα(−1)∣B∣)Xα
Lemma:
(1−X1aiX2bi)=(1−X1)⋅ui(X1,X2)+(1−X2)⋅vi(X1,X2)
It’s a simple task.
A={f(X1,X2) ∣ f(1,1)=0}, B=(X1−1,X2−1)
Fp[X1,X2]/A = Fp[X1,X2]/B ⇒A=B
f(X1,X2)=∏i=12p−1((1−X1)⋅ui(X1,X2)+(1−X2)⋅vi(X1,X2))=∑(1−X1)s(1−X2)t(⋯)
s+t=2p−1 ⇒ s≥p or t≥p
(1−X1)p=0 and (1−X2)p=0 ⇒ f(X1,X2)=0 ⇒
∀ α∈{0,1,…,p−1}2, ∑B∈Sα(−1)∣B∣≡0 (mod p)
∅∈S(0,0) ⇒ ∃ ∣B∣=0, s.t. σ(B)≡0 (mod p)
$\Box$