Normally, a long run of exact matching text in X along with access to Y is sufficient to easily proof beyond a reasonable doubt such copying from Y, which is good enough to prove any kind of copyright violation, whether criminal or civil.
Chapernowne's number and other normal numbers [1] are among the rare cases where similarity plus access would not be sufficient to prove copying.
Now, if you combined a normal number with some kind of instructions to find and extract, say, the part that exactly matches the first Harry Potter novel, then you would probably have a copyright violation, but it would be the instructions that infringed, not the normal number itself.
BTW, those instructions would take up about as much space as the Harry Potter novel they tell you how to find. The offset to a given long meaningful string S in a normal number is essentially a random number about the same length as S. Sometimes people like to imagine using normal number offsets as a form of data compression, albeit not a practical one, but the offsets are big enough to spoil that.
[1] A "normal" number in base b is a number whose base b expansion contains every sequence of k base b digits with density 1/b^k.
It’s truly the worst number!
Also the second part of your comment isn't making sense, it has been shown for Champernowne's constant so how can you say it hasn't been shown for any individually?
According to Wikipedia, no irrational algebraic number has been shown to be normal (normal is a slightly stronger condition; see last paragraph in https://en.wikipedia.org/wiki/Normal_number#Properties_and_e...).