# Bounded gaps between primes in arithmetic progressions

Has Zhang's work on bounded gaps between primes been extended to the following theorem?

For any arithmetic progression $an+b,\gcd(a,b)=1$, there is a constant $H$ (depending only on $a$) such that there are infinitely many prime pairs $p_1<p_2$ in this progression with $p_2-p_1<H$.

I have tried to look for this result online, the closest hit I got is this paper, which proves similar sounding statement.

How about extending this question to sets of primes of positive relative density (this extension and question as the whole inspired by answer to this question) and quantitative bounds?

Concerning your second question, even full relative density is not enough to produce bounded gaps. Using standard upper bounds on the number of solutions $p'-p=d$ (for a given even $d>0$) it is surely straightforward to show that a certain full relative density subset of primes avoids bounded gaps (I have not checked the details though).