Blog Archive

Thursday, February 29, 2024

Generalization of Gauss Trick(1+2+3+...+100)

The initial idea comes from the proof of (1)

(1)d|nd=nd(n)2

As reader will see, it is just a generalization of the trick from Gauss.

Let (L,T,,,¬) be a finite poset. T is someting else. Here ¬ is an anti-isomorphism on L. i.e. ab¬b¬a.

Here is a commutative, associate operator (L need not be closed under ), but aL,a¬a=T.

Again, Let f:L{T}A be a function that satisfies f(T)=f(a¬a)=f(a)f(¬a).

Here (A,) is a commutative semigroup.

Then we have

(2)aLf(a)=f(T)|L|2

Proof.

(3)aLf(a)aLf(¬a)=(aLf(a))2=aLf(a)f(¬a)=f(T)|L|

Example.

Let 100↓:={1,...,100}. Here F=1,T=101 , ab=a+b,¬a=100a.

Let the monoid be (N,+), f(a)=a, then 1a100a=12(1a100a+1a100¬a)=1002×101=5050

Example.

The lattice here is (n,0,n,|,×,¬). Here n↓={dN,d|n} and ¬d=nd.

Let d(n)=|n|,

Then

(4)d|nd=nd(n)2

Example.

Let (M,Ω,μ) be a measure space, suppose that μ(M) and Ω are finite.

Then ωΩμ(ω)=|Ω|2μ(M).

One of the key point of this proof is aLf(¬a)=aLf(a).

It only depend on (A,) is commutative semigroup.

Let S be a set, f:S(A,) is a function. Then sSf(σs)=sSf(s)

Example.

Consider Um, id:UmUm, for aUm, define σ(s)=as.

Then

(5)sUmas=aφ(m)sUms=sUmsaφ(m)=1

 

No comments:

Post a Comment

Popular Posts