When is $(fracv_11+fracv_22+ dots fracv_pp)+(fracv_1p+1+fracv_2p+2+dots fracv_p2p)+dots$ equal to zero?

Clash Royale CLAN TAG#URR8PPP
up vote
3
down vote
favorite
Let $V=vecv =(v_1,dots v_p): v_iin mathbbZ$.
And define $$phi(vecv,s)= sum_n=1^inftyfracv_nn^s$$
Where for all $k=1,2, dots$ we have $v_k+p=v_k$.
My question
(1) Is there a nice characterization of all the vectors such that $phi (vecv,1)=0$?
(2) Is there a nice characterization of all the vectors such that $phi(vecv,s)=0$?
Exposition
This is not a topic that has sprung from nowhere; I have asked quite a few questions (here and here) on this topic. In this notation we can rewrite some often discussed functions:
$beginalign
&
phi((1),s)=zeta(s), \
& phi((1,-1),s)=eta(s), \
& phi((1,0,-1,0),s)=beta(s)
endalign$
Where these functions are the zeta, Dirichlet eta and the Dirichlet beta function respectively.
For each $sin mathbbR^+$ we have a mapping $phi$ from $V$ into the real numbers(when this sum converges). For $s>1$ we needn't worry about convergence but for $s=1$ it looks like (I am fairly confident) $sum_n=1^pv_n=0$ is a necessary and sufficient condition for $phi(vecv,1)in mathbbR$.
Then one can ask what is the $ker(phi(vecv,1))$? That is what vectors are mapped to zero?
$beginalign
& (0) \
&(1,-3,1,1), \
&(1,âÂÂ1,âÂÂ2,âÂÂ1,1,2), \
&(1,1,âÂÂ5,1,1,âÂÂ5,1,1,4)
endalign$
Are all vectors in the kernel of $(phi(vecv,1))$.
The first line should be unsurprising but these others are kind of interesting:
The second line is
$$0=frac11 -frac32+frac13+frac14+frac15-frac36+frac17+frac18+dots $$
We can build these using the techniques laid out by Mats Granvik here.
Basically we can argue like this:
We know that
$$lim_sto 1 zeta(s)(1-frac1a^s-1)(1-frac1b^s-1) =ln(a)times 0 = 0 $$
But note that
$$ beginalign
& zeta(s)(1-frac1a^s-1)(1-frac1b^s-1) \
& = (sum_n=1^infty frac1n^s) (1-fracaa^s-fracbb^s+fracab(ab)^s)
endalign
$$
Taking $a=2,b=3$ and multiply through
$$= (sum_n=1^infty frac1n^s)
-(sum_n=1^infty frac2(2n)^s) -(sum_n=1^infty frac3(3n)^s) +(sum_n=1^infty frac6(6n)^s) $$
$phi([1],s)-phi([0,2],s)-phi([0,0,3],s)+phi([0,0,0,0,0,6],s)$
I will demonstrate how we can add within the vectors (Note that we are breaking some pretty serious rules if we take $s=1$ as all of these sums above diverge.)
$$
beginalign
&+phi([1,1,1,1,1,1],s)\
&-phi([0,2,0,2,0,2],s)\
&-phi([0,0,3,0,0,3],s)\
&+phi([0,0,0,0,0,6],s)\
&=phi([1,-1,-2,-1,1,2],s)\
endalign
$$
I will offer up one other notation which may prove useful. Let
$(d|n) = begincases
1 text when d\
0 text else
endcases$
Then this $(1,-1,-2,-1,1,2)$ can be rewritten $1(1|n)-2(2|n)-3(3|n)+6(6|n)$
So we can see this vector $(1,-1,-2,-1,1,2)$ didn't appear of thin air: we can build these. Now if we generalize this technique from two factors to more factors we can build all sorts of vectors which map to zero. In fact, this technique can let find elements in the kernel of $phi(vecv,17)$ if we wanted. We could just multiply $zeta(s)(1-frac1a^s-1)(1-frac1b^s-17)$
Questions
1) How can I characterize these vectors?
2) Have we found all the zeros of $phi(vecv,1)$ using this technique? That is, will this technique allow me to find a basis for the $ker phi(vecv,1)$? and what about $ker phi(vecv,s)?$
Motivations
I think it simply must make sense to explore the underlying algebraic structure of the module $A_s=phi(vecv,s): vecvin V $ where we can draw scalars from $p/q^s: p,q in mathbbZ $. Imagine for a second that $phi([1,0,-1,0],2) in mathbbQ$ which is unknown. Then wouldn't that have some pretty interesting implications about the underlying algebraic structure of $phi^-1(A_2,2)$? I am not really an algebraist and don't know whether it's really possible that Algebra could determine whether Catalan's Constant is irrational or not... but it doesn't seem impossible to me.
real-analysis sequences-and-series vector-spaces modules zeta-functions
add a comment |Â
up vote
3
down vote
favorite
Let $V=vecv =(v_1,dots v_p): v_iin mathbbZ$.
And define $$phi(vecv,s)= sum_n=1^inftyfracv_nn^s$$
Where for all $k=1,2, dots$ we have $v_k+p=v_k$.
My question
(1) Is there a nice characterization of all the vectors such that $phi (vecv,1)=0$?
(2) Is there a nice characterization of all the vectors such that $phi(vecv,s)=0$?
Exposition
This is not a topic that has sprung from nowhere; I have asked quite a few questions (here and here) on this topic. In this notation we can rewrite some often discussed functions:
$beginalign
&
phi((1),s)=zeta(s), \
& phi((1,-1),s)=eta(s), \
& phi((1,0,-1,0),s)=beta(s)
endalign$
Where these functions are the zeta, Dirichlet eta and the Dirichlet beta function respectively.
For each $sin mathbbR^+$ we have a mapping $phi$ from $V$ into the real numbers(when this sum converges). For $s>1$ we needn't worry about convergence but for $s=1$ it looks like (I am fairly confident) $sum_n=1^pv_n=0$ is a necessary and sufficient condition for $phi(vecv,1)in mathbbR$.
Then one can ask what is the $ker(phi(vecv,1))$? That is what vectors are mapped to zero?
$beginalign
& (0) \
&(1,-3,1,1), \
&(1,âÂÂ1,âÂÂ2,âÂÂ1,1,2), \
&(1,1,âÂÂ5,1,1,âÂÂ5,1,1,4)
endalign$
Are all vectors in the kernel of $(phi(vecv,1))$.
The first line should be unsurprising but these others are kind of interesting:
The second line is
$$0=frac11 -frac32+frac13+frac14+frac15-frac36+frac17+frac18+dots $$
We can build these using the techniques laid out by Mats Granvik here.
Basically we can argue like this:
We know that
$$lim_sto 1 zeta(s)(1-frac1a^s-1)(1-frac1b^s-1) =ln(a)times 0 = 0 $$
But note that
$$ beginalign
& zeta(s)(1-frac1a^s-1)(1-frac1b^s-1) \
& = (sum_n=1^infty frac1n^s) (1-fracaa^s-fracbb^s+fracab(ab)^s)
endalign
$$
Taking $a=2,b=3$ and multiply through
$$= (sum_n=1^infty frac1n^s)
-(sum_n=1^infty frac2(2n)^s) -(sum_n=1^infty frac3(3n)^s) +(sum_n=1^infty frac6(6n)^s) $$
$phi([1],s)-phi([0,2],s)-phi([0,0,3],s)+phi([0,0,0,0,0,6],s)$
I will demonstrate how we can add within the vectors (Note that we are breaking some pretty serious rules if we take $s=1$ as all of these sums above diverge.)
$$
beginalign
&+phi([1,1,1,1,1,1],s)\
&-phi([0,2,0,2,0,2],s)\
&-phi([0,0,3,0,0,3],s)\
&+phi([0,0,0,0,0,6],s)\
&=phi([1,-1,-2,-1,1,2],s)\
endalign
$$
I will offer up one other notation which may prove useful. Let
$(d|n) = begincases
1 text when d\
0 text else
endcases$
Then this $(1,-1,-2,-1,1,2)$ can be rewritten $1(1|n)-2(2|n)-3(3|n)+6(6|n)$
So we can see this vector $(1,-1,-2,-1,1,2)$ didn't appear of thin air: we can build these. Now if we generalize this technique from two factors to more factors we can build all sorts of vectors which map to zero. In fact, this technique can let find elements in the kernel of $phi(vecv,17)$ if we wanted. We could just multiply $zeta(s)(1-frac1a^s-1)(1-frac1b^s-17)$
Questions
1) How can I characterize these vectors?
2) Have we found all the zeros of $phi(vecv,1)$ using this technique? That is, will this technique allow me to find a basis for the $ker phi(vecv,1)$? and what about $ker phi(vecv,s)?$
Motivations
I think it simply must make sense to explore the underlying algebraic structure of the module $A_s=phi(vecv,s): vecvin V $ where we can draw scalars from $p/q^s: p,q in mathbbZ $. Imagine for a second that $phi([1,0,-1,0],2) in mathbbQ$ which is unknown. Then wouldn't that have some pretty interesting implications about the underlying algebraic structure of $phi^-1(A_2,2)$? I am not really an algebraist and don't know whether it's really possible that Algebra could determine whether Catalan's Constant is irrational or not... but it doesn't seem impossible to me.
real-analysis sequences-and-series vector-spaces modules zeta-functions
Sorry that my vectors change from being $()$ to being $$ at some point. I will fix that eventually. I also want to remember to some links to relevant terms that I use like kernel. And maybe give a better example for $s$ not equal to 1. Also I am taking for granted that this module is a free module when I ask for a basis...
â Mason
Aug 28 at 19:07
I wrote a comment as an answer below where I reframe this question in a related way. Let me just acknowledge that this question needs some work to get it to my standards. I am happy to take critiques but at this point mostly I want to reduce this down to the relevant content and combat TLDR.
â Mason
Aug 29 at 3:20
desmos.com/calculator/jwwoynlcz1
â Mason
Aug 29 at 4:05
This is a pretty cool paper: math.uga.edu/~pete/4400dirichlet.pdf
â Mason
Sep 8 at 2:02
add a comment |Â
up vote
3
down vote
favorite
up vote
3
down vote
favorite
Let $V=vecv =(v_1,dots v_p): v_iin mathbbZ$.
And define $$phi(vecv,s)= sum_n=1^inftyfracv_nn^s$$
Where for all $k=1,2, dots$ we have $v_k+p=v_k$.
My question
(1) Is there a nice characterization of all the vectors such that $phi (vecv,1)=0$?
(2) Is there a nice characterization of all the vectors such that $phi(vecv,s)=0$?
Exposition
This is not a topic that has sprung from nowhere; I have asked quite a few questions (here and here) on this topic. In this notation we can rewrite some often discussed functions:
$beginalign
&
phi((1),s)=zeta(s), \
& phi((1,-1),s)=eta(s), \
& phi((1,0,-1,0),s)=beta(s)
endalign$
Where these functions are the zeta, Dirichlet eta and the Dirichlet beta function respectively.
For each $sin mathbbR^+$ we have a mapping $phi$ from $V$ into the real numbers(when this sum converges). For $s>1$ we needn't worry about convergence but for $s=1$ it looks like (I am fairly confident) $sum_n=1^pv_n=0$ is a necessary and sufficient condition for $phi(vecv,1)in mathbbR$.
Then one can ask what is the $ker(phi(vecv,1))$? That is what vectors are mapped to zero?
$beginalign
& (0) \
&(1,-3,1,1), \
&(1,âÂÂ1,âÂÂ2,âÂÂ1,1,2), \
&(1,1,âÂÂ5,1,1,âÂÂ5,1,1,4)
endalign$
Are all vectors in the kernel of $(phi(vecv,1))$.
The first line should be unsurprising but these others are kind of interesting:
The second line is
$$0=frac11 -frac32+frac13+frac14+frac15-frac36+frac17+frac18+dots $$
We can build these using the techniques laid out by Mats Granvik here.
Basically we can argue like this:
We know that
$$lim_sto 1 zeta(s)(1-frac1a^s-1)(1-frac1b^s-1) =ln(a)times 0 = 0 $$
But note that
$$ beginalign
& zeta(s)(1-frac1a^s-1)(1-frac1b^s-1) \
& = (sum_n=1^infty frac1n^s) (1-fracaa^s-fracbb^s+fracab(ab)^s)
endalign
$$
Taking $a=2,b=3$ and multiply through
$$= (sum_n=1^infty frac1n^s)
-(sum_n=1^infty frac2(2n)^s) -(sum_n=1^infty frac3(3n)^s) +(sum_n=1^infty frac6(6n)^s) $$
$phi([1],s)-phi([0,2],s)-phi([0,0,3],s)+phi([0,0,0,0,0,6],s)$
I will demonstrate how we can add within the vectors (Note that we are breaking some pretty serious rules if we take $s=1$ as all of these sums above diverge.)
$$
beginalign
&+phi([1,1,1,1,1,1],s)\
&-phi([0,2,0,2,0,2],s)\
&-phi([0,0,3,0,0,3],s)\
&+phi([0,0,0,0,0,6],s)\
&=phi([1,-1,-2,-1,1,2],s)\
endalign
$$
I will offer up one other notation which may prove useful. Let
$(d|n) = begincases
1 text when d\
0 text else
endcases$
Then this $(1,-1,-2,-1,1,2)$ can be rewritten $1(1|n)-2(2|n)-3(3|n)+6(6|n)$
So we can see this vector $(1,-1,-2,-1,1,2)$ didn't appear of thin air: we can build these. Now if we generalize this technique from two factors to more factors we can build all sorts of vectors which map to zero. In fact, this technique can let find elements in the kernel of $phi(vecv,17)$ if we wanted. We could just multiply $zeta(s)(1-frac1a^s-1)(1-frac1b^s-17)$
Questions
1) How can I characterize these vectors?
2) Have we found all the zeros of $phi(vecv,1)$ using this technique? That is, will this technique allow me to find a basis for the $ker phi(vecv,1)$? and what about $ker phi(vecv,s)?$
Motivations
I think it simply must make sense to explore the underlying algebraic structure of the module $A_s=phi(vecv,s): vecvin V $ where we can draw scalars from $p/q^s: p,q in mathbbZ $. Imagine for a second that $phi([1,0,-1,0],2) in mathbbQ$ which is unknown. Then wouldn't that have some pretty interesting implications about the underlying algebraic structure of $phi^-1(A_2,2)$? I am not really an algebraist and don't know whether it's really possible that Algebra could determine whether Catalan's Constant is irrational or not... but it doesn't seem impossible to me.
real-analysis sequences-and-series vector-spaces modules zeta-functions
Let $V=vecv =(v_1,dots v_p): v_iin mathbbZ$.
And define $$phi(vecv,s)= sum_n=1^inftyfracv_nn^s$$
Where for all $k=1,2, dots$ we have $v_k+p=v_k$.
My question
(1) Is there a nice characterization of all the vectors such that $phi (vecv,1)=0$?
(2) Is there a nice characterization of all the vectors such that $phi(vecv,s)=0$?
Exposition
This is not a topic that has sprung from nowhere; I have asked quite a few questions (here and here) on this topic. In this notation we can rewrite some often discussed functions:
$beginalign
&
phi((1),s)=zeta(s), \
& phi((1,-1),s)=eta(s), \
& phi((1,0,-1,0),s)=beta(s)
endalign$
Where these functions are the zeta, Dirichlet eta and the Dirichlet beta function respectively.
For each $sin mathbbR^+$ we have a mapping $phi$ from $V$ into the real numbers(when this sum converges). For $s>1$ we needn't worry about convergence but for $s=1$ it looks like (I am fairly confident) $sum_n=1^pv_n=0$ is a necessary and sufficient condition for $phi(vecv,1)in mathbbR$.
Then one can ask what is the $ker(phi(vecv,1))$? That is what vectors are mapped to zero?
$beginalign
& (0) \
&(1,-3,1,1), \
&(1,âÂÂ1,âÂÂ2,âÂÂ1,1,2), \
&(1,1,âÂÂ5,1,1,âÂÂ5,1,1,4)
endalign$
Are all vectors in the kernel of $(phi(vecv,1))$.
The first line should be unsurprising but these others are kind of interesting:
The second line is
$$0=frac11 -frac32+frac13+frac14+frac15-frac36+frac17+frac18+dots $$
We can build these using the techniques laid out by Mats Granvik here.
Basically we can argue like this:
We know that
$$lim_sto 1 zeta(s)(1-frac1a^s-1)(1-frac1b^s-1) =ln(a)times 0 = 0 $$
But note that
$$ beginalign
& zeta(s)(1-frac1a^s-1)(1-frac1b^s-1) \
& = (sum_n=1^infty frac1n^s) (1-fracaa^s-fracbb^s+fracab(ab)^s)
endalign
$$
Taking $a=2,b=3$ and multiply through
$$= (sum_n=1^infty frac1n^s)
-(sum_n=1^infty frac2(2n)^s) -(sum_n=1^infty frac3(3n)^s) +(sum_n=1^infty frac6(6n)^s) $$
$phi([1],s)-phi([0,2],s)-phi([0,0,3],s)+phi([0,0,0,0,0,6],s)$
I will demonstrate how we can add within the vectors (Note that we are breaking some pretty serious rules if we take $s=1$ as all of these sums above diverge.)
$$
beginalign
&+phi([1,1,1,1,1,1],s)\
&-phi([0,2,0,2,0,2],s)\
&-phi([0,0,3,0,0,3],s)\
&+phi([0,0,0,0,0,6],s)\
&=phi([1,-1,-2,-1,1,2],s)\
endalign
$$
I will offer up one other notation which may prove useful. Let
$(d|n) = begincases
1 text when d\
0 text else
endcases$
Then this $(1,-1,-2,-1,1,2)$ can be rewritten $1(1|n)-2(2|n)-3(3|n)+6(6|n)$
So we can see this vector $(1,-1,-2,-1,1,2)$ didn't appear of thin air: we can build these. Now if we generalize this technique from two factors to more factors we can build all sorts of vectors which map to zero. In fact, this technique can let find elements in the kernel of $phi(vecv,17)$ if we wanted. We could just multiply $zeta(s)(1-frac1a^s-1)(1-frac1b^s-17)$
Questions
1) How can I characterize these vectors?
2) Have we found all the zeros of $phi(vecv,1)$ using this technique? That is, will this technique allow me to find a basis for the $ker phi(vecv,1)$? and what about $ker phi(vecv,s)?$
Motivations
I think it simply must make sense to explore the underlying algebraic structure of the module $A_s=phi(vecv,s): vecvin V $ where we can draw scalars from $p/q^s: p,q in mathbbZ $. Imagine for a second that $phi([1,0,-1,0],2) in mathbbQ$ which is unknown. Then wouldn't that have some pretty interesting implications about the underlying algebraic structure of $phi^-1(A_2,2)$? I am not really an algebraist and don't know whether it's really possible that Algebra could determine whether Catalan's Constant is irrational or not... but it doesn't seem impossible to me.
real-analysis sequences-and-series vector-spaces modules zeta-functions
edited Aug 29 at 4:10
asked Aug 28 at 17:46
Mason
1,2471224
1,2471224
Sorry that my vectors change from being $()$ to being $$ at some point. I will fix that eventually. I also want to remember to some links to relevant terms that I use like kernel. And maybe give a better example for $s$ not equal to 1. Also I am taking for granted that this module is a free module when I ask for a basis...
â Mason
Aug 28 at 19:07
I wrote a comment as an answer below where I reframe this question in a related way. Let me just acknowledge that this question needs some work to get it to my standards. I am happy to take critiques but at this point mostly I want to reduce this down to the relevant content and combat TLDR.
â Mason
Aug 29 at 3:20
desmos.com/calculator/jwwoynlcz1
â Mason
Aug 29 at 4:05
This is a pretty cool paper: math.uga.edu/~pete/4400dirichlet.pdf
â Mason
Sep 8 at 2:02
add a comment |Â
Sorry that my vectors change from being $()$ to being $$ at some point. I will fix that eventually. I also want to remember to some links to relevant terms that I use like kernel. And maybe give a better example for $s$ not equal to 1. Also I am taking for granted that this module is a free module when I ask for a basis...
â Mason
Aug 28 at 19:07
I wrote a comment as an answer below where I reframe this question in a related way. Let me just acknowledge that this question needs some work to get it to my standards. I am happy to take critiques but at this point mostly I want to reduce this down to the relevant content and combat TLDR.
â Mason
Aug 29 at 3:20
desmos.com/calculator/jwwoynlcz1
â Mason
Aug 29 at 4:05
This is a pretty cool paper: math.uga.edu/~pete/4400dirichlet.pdf
â Mason
Sep 8 at 2:02
Sorry that my vectors change from being $()$ to being $$ at some point. I will fix that eventually. I also want to remember to some links to relevant terms that I use like kernel. And maybe give a better example for $s$ not equal to 1. Also I am taking for granted that this module is a free module when I ask for a basis...
â Mason
Aug 28 at 19:07
Sorry that my vectors change from being $()$ to being $$ at some point. I will fix that eventually. I also want to remember to some links to relevant terms that I use like kernel. And maybe give a better example for $s$ not equal to 1. Also I am taking for granted that this module is a free module when I ask for a basis...
â Mason
Aug 28 at 19:07
I wrote a comment as an answer below where I reframe this question in a related way. Let me just acknowledge that this question needs some work to get it to my standards. I am happy to take critiques but at this point mostly I want to reduce this down to the relevant content and combat TLDR.
â Mason
Aug 29 at 3:20
I wrote a comment as an answer below where I reframe this question in a related way. Let me just acknowledge that this question needs some work to get it to my standards. I am happy to take critiques but at this point mostly I want to reduce this down to the relevant content and combat TLDR.
â Mason
Aug 29 at 3:20
desmos.com/calculator/jwwoynlcz1
â Mason
Aug 29 at 4:05
desmos.com/calculator/jwwoynlcz1
â Mason
Aug 29 at 4:05
This is a pretty cool paper: math.uga.edu/~pete/4400dirichlet.pdf
â Mason
Sep 8 at 2:02
This is a pretty cool paper: math.uga.edu/~pete/4400dirichlet.pdf
â Mason
Sep 8 at 2:02
add a comment |Â
1 Answer
1
active
oldest
votes
up vote
0
down vote
I think this may be a better way to frame the puzzle and I attempt to answer question $1$.
Let $V$ be the set of all infinite periodic integer sequences and for each $sin mathbbR^+$ define a homomorphism $phi_s:VtomathbbR$ as follows
$$ phi_sbigg((v_1,v_2, dots ) bigg)=sum_n=1^inftyfracv_nn^s$$
Note (as we did above) that the domain of $phi$ is dependent on our selection of $s$
We will define a $Wsubset V$ such that $forall vecwin W$
$phi_1(vecw)=0$ and conjecture that $W$ forms a basis for the $ker(phi_1)$
Let $m$ be a positive integer and write out it's prime factorization $m=p_1^e_1p_2^e_2 dots p_n^e_n$, and define a function
$$g_m(x)=prod_j=1^nx) bigg)^e_j$$
where $(d|n)= 1_dmathbbN(n)$ is $1$ when $d|n$ and otherwise $0$.
Then $ vecg_m:=bigg((g_m(1),g_m(2), dots bigg)$ is a periodic sequence and for non-prime $m$ we will define our set $W$.
That is, we let $W= vecg_m: 1<m not in mathbbP $ and then note that by the informal argument above (in the question) that $ [W] subset ker(phi_1)$ where $[ dot ]$ refers to the span of the set with scalars from the rationals. The selection of $m$ not prime guarantees that the product has at least $2$ non unit factors. Note that when $m$ is the $k$th prime we can say that $phi_1(g_p_k)=ln(k+1)$.
This then serves to answer my question (1). $[W]$ is the generalization I am after (I think). But I am not sure how I might attempt to show the other direction (which is question (2)): Is it the case that $[W] supset ker(phi_1)$?
I should really define operations in $V$: vector addition is what you'd expect and vectors interact with rationals as demonstrate in this post.
add a comment |Â
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
0
down vote
I think this may be a better way to frame the puzzle and I attempt to answer question $1$.
Let $V$ be the set of all infinite periodic integer sequences and for each $sin mathbbR^+$ define a homomorphism $phi_s:VtomathbbR$ as follows
$$ phi_sbigg((v_1,v_2, dots ) bigg)=sum_n=1^inftyfracv_nn^s$$
Note (as we did above) that the domain of $phi$ is dependent on our selection of $s$
We will define a $Wsubset V$ such that $forall vecwin W$
$phi_1(vecw)=0$ and conjecture that $W$ forms a basis for the $ker(phi_1)$
Let $m$ be a positive integer and write out it's prime factorization $m=p_1^e_1p_2^e_2 dots p_n^e_n$, and define a function
$$g_m(x)=prod_j=1^nx) bigg)^e_j$$
where $(d|n)= 1_dmathbbN(n)$ is $1$ when $d|n$ and otherwise $0$.
Then $ vecg_m:=bigg((g_m(1),g_m(2), dots bigg)$ is a periodic sequence and for non-prime $m$ we will define our set $W$.
That is, we let $W= vecg_m: 1<m not in mathbbP $ and then note that by the informal argument above (in the question) that $ [W] subset ker(phi_1)$ where $[ dot ]$ refers to the span of the set with scalars from the rationals. The selection of $m$ not prime guarantees that the product has at least $2$ non unit factors. Note that when $m$ is the $k$th prime we can say that $phi_1(g_p_k)=ln(k+1)$.
This then serves to answer my question (1). $[W]$ is the generalization I am after (I think). But I am not sure how I might attempt to show the other direction (which is question (2)): Is it the case that $[W] supset ker(phi_1)$?
I should really define operations in $V$: vector addition is what you'd expect and vectors interact with rationals as demonstrate in this post.
add a comment |Â
up vote
0
down vote
I think this may be a better way to frame the puzzle and I attempt to answer question $1$.
Let $V$ be the set of all infinite periodic integer sequences and for each $sin mathbbR^+$ define a homomorphism $phi_s:VtomathbbR$ as follows
$$ phi_sbigg((v_1,v_2, dots ) bigg)=sum_n=1^inftyfracv_nn^s$$
Note (as we did above) that the domain of $phi$ is dependent on our selection of $s$
We will define a $Wsubset V$ such that $forall vecwin W$
$phi_1(vecw)=0$ and conjecture that $W$ forms a basis for the $ker(phi_1)$
Let $m$ be a positive integer and write out it's prime factorization $m=p_1^e_1p_2^e_2 dots p_n^e_n$, and define a function
$$g_m(x)=prod_j=1^nx) bigg)^e_j$$
where $(d|n)= 1_dmathbbN(n)$ is $1$ when $d|n$ and otherwise $0$.
Then $ vecg_m:=bigg((g_m(1),g_m(2), dots bigg)$ is a periodic sequence and for non-prime $m$ we will define our set $W$.
That is, we let $W= vecg_m: 1<m not in mathbbP $ and then note that by the informal argument above (in the question) that $ [W] subset ker(phi_1)$ where $[ dot ]$ refers to the span of the set with scalars from the rationals. The selection of $m$ not prime guarantees that the product has at least $2$ non unit factors. Note that when $m$ is the $k$th prime we can say that $phi_1(g_p_k)=ln(k+1)$.
This then serves to answer my question (1). $[W]$ is the generalization I am after (I think). But I am not sure how I might attempt to show the other direction (which is question (2)): Is it the case that $[W] supset ker(phi_1)$?
I should really define operations in $V$: vector addition is what you'd expect and vectors interact with rationals as demonstrate in this post.
add a comment |Â
up vote
0
down vote
up vote
0
down vote
I think this may be a better way to frame the puzzle and I attempt to answer question $1$.
Let $V$ be the set of all infinite periodic integer sequences and for each $sin mathbbR^+$ define a homomorphism $phi_s:VtomathbbR$ as follows
$$ phi_sbigg((v_1,v_2, dots ) bigg)=sum_n=1^inftyfracv_nn^s$$
Note (as we did above) that the domain of $phi$ is dependent on our selection of $s$
We will define a $Wsubset V$ such that $forall vecwin W$
$phi_1(vecw)=0$ and conjecture that $W$ forms a basis for the $ker(phi_1)$
Let $m$ be a positive integer and write out it's prime factorization $m=p_1^e_1p_2^e_2 dots p_n^e_n$, and define a function
$$g_m(x)=prod_j=1^nx) bigg)^e_j$$
where $(d|n)= 1_dmathbbN(n)$ is $1$ when $d|n$ and otherwise $0$.
Then $ vecg_m:=bigg((g_m(1),g_m(2), dots bigg)$ is a periodic sequence and for non-prime $m$ we will define our set $W$.
That is, we let $W= vecg_m: 1<m not in mathbbP $ and then note that by the informal argument above (in the question) that $ [W] subset ker(phi_1)$ where $[ dot ]$ refers to the span of the set with scalars from the rationals. The selection of $m$ not prime guarantees that the product has at least $2$ non unit factors. Note that when $m$ is the $k$th prime we can say that $phi_1(g_p_k)=ln(k+1)$.
This then serves to answer my question (1). $[W]$ is the generalization I am after (I think). But I am not sure how I might attempt to show the other direction (which is question (2)): Is it the case that $[W] supset ker(phi_1)$?
I should really define operations in $V$: vector addition is what you'd expect and vectors interact with rationals as demonstrate in this post.
I think this may be a better way to frame the puzzle and I attempt to answer question $1$.
Let $V$ be the set of all infinite periodic integer sequences and for each $sin mathbbR^+$ define a homomorphism $phi_s:VtomathbbR$ as follows
$$ phi_sbigg((v_1,v_2, dots ) bigg)=sum_n=1^inftyfracv_nn^s$$
Note (as we did above) that the domain of $phi$ is dependent on our selection of $s$
We will define a $Wsubset V$ such that $forall vecwin W$
$phi_1(vecw)=0$ and conjecture that $W$ forms a basis for the $ker(phi_1)$
Let $m$ be a positive integer and write out it's prime factorization $m=p_1^e_1p_2^e_2 dots p_n^e_n$, and define a function
$$g_m(x)=prod_j=1^nx) bigg)^e_j$$
where $(d|n)= 1_dmathbbN(n)$ is $1$ when $d|n$ and otherwise $0$.
Then $ vecg_m:=bigg((g_m(1),g_m(2), dots bigg)$ is a periodic sequence and for non-prime $m$ we will define our set $W$.
That is, we let $W= vecg_m: 1<m not in mathbbP $ and then note that by the informal argument above (in the question) that $ [W] subset ker(phi_1)$ where $[ dot ]$ refers to the span of the set with scalars from the rationals. The selection of $m$ not prime guarantees that the product has at least $2$ non unit factors. Note that when $m$ is the $k$th prime we can say that $phi_1(g_p_k)=ln(k+1)$.
This then serves to answer my question (1). $[W]$ is the generalization I am after (I think). But I am not sure how I might attempt to show the other direction (which is question (2)): Is it the case that $[W] supset ker(phi_1)$?
I should really define operations in $V$: vector addition is what you'd expect and vectors interact with rationals as demonstrate in this post.
edited Aug 29 at 2:00
answered Aug 29 at 1:22
Mason
1,2471224
1,2471224
add a comment |Â
add a comment |Â
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2897525%2fwhen-is-fracv-11-fracv-22-dots-fracv-pp-fracv-1p1-fr%23new-answer', 'question_page');
);
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sorry that my vectors change from being $()$ to being $$ at some point. I will fix that eventually. I also want to remember to some links to relevant terms that I use like kernel. And maybe give a better example for $s$ not equal to 1. Also I am taking for granted that this module is a free module when I ask for a basis...
â Mason
Aug 28 at 19:07
I wrote a comment as an answer below where I reframe this question in a related way. Let me just acknowledge that this question needs some work to get it to my standards. I am happy to take critiques but at this point mostly I want to reduce this down to the relevant content and combat TLDR.
â Mason
Aug 29 at 3:20
desmos.com/calculator/jwwoynlcz1
â Mason
Aug 29 at 4:05
This is a pretty cool paper: math.uga.edu/~pete/4400dirichlet.pdf
â Mason
Sep 8 at 2:02