Background
Firstly, I don't think being a mathematician or not matters in this case. Mathematics is always open to all interested in it. It is similar to how one doesn't have to be a professional athlete to play sports :)
Secondly, we should write $``|S_1| = \mathfrak{c}"$ instead of $``|S_1| = \aleph_1"$. $\mathfrak{c} = |\mathbb{R}|$ is the cardinality of the real numbers, while $\aleph_1$ is the first uncountable cardinal in the sense that for all set $S$ with $\aleph_0 < |S|$ we have $\aleph_1 \le |S|$. It is well-known that the continuum hypothesis $\mathfrak{c} = \aleph_1$ can neither be proved nor disproved.
Now let's consider
- How to sum uncountably many real numbers?
- Is there a general concept extending both continuous (Riemann) integral and discrete sum?
In your question, you didn't separate these two cases. But I would argue we have different answers to each of them.
Summing uncountably many real numbers
A standard way to sum uncountably many non-negative real numbers $(p_j)_{j \in J}$ where $J$ is an uncountable index set and $p_j \ge 0$, is to define the sum to be the supremum of all finite partial sums
$$\sum_{j \in J} p_j = \\ \sup \left\{p_{j_1} + p_{j_2} + \dots + p_{j_k} \mid p_{j_1}, p_{j_2}, \dots , p_{j_k} \in J, k \in \mathbb{Z}_{\ge 0}\right\}$$
Note that the sum always exists because supremum always exists as a non-negative extended real number in $[0, +\infty]$. Also, the index set $J$ can be of any cardinality. The definition allows us to add up as many real numbers as we like, even $|\mathscr{P}(\mathscr{P}({\mathbb{R}}))|$ many real numbers.
Now to sum uncountably many real numbers, we split $(a_j)_{j \in J}$ into positive part and negative part by defining $$p_j = \begin{cases}a_j \text{ if }a_j > 0\ \\ 0 \text{ otherwise}\end{cases}$$ and $$n_j = \begin{cases}-a_j \text{ if }a_j < 0\ \\ 0 \text{ otherwise}\end{cases}$$ By definition, $(a_j) = (p_j) - (n_j)$ and $p_j, n_j \ge 0$ for all $j \in J$. It now makes sense to define $\sum_{j \in J} a_j = \sum_{j \in J} p_j - \sum_{j \in J} n_j$. Note that the sum exists as an extended real number in $[-\infty, +\infty]$ exactly when we don't have a $``\infty - \infty"$ situation.
Now you may ask: if we already have a perfectly fine definition for uncountable sum, why aren't people studying uncountable sum?
The answer is: if the sum of uncountably many real numbers is finite, i.e. $-\infty < \sum_{j \in J} a_j < +\infty$, then all but countable many terms $a_j$ are zeros! So basically, we gain nothing by considering uncountable sum. If we want the sum to be finite, we can only have countably many non-zero terms. The proof can be found in The sum of an uncountable number of positive numbers. The proof works for non-negative real numbers but can easily be extended to the general case.
The above definition extends the idea of absolute convergence to uncountable sum. The idea of conditional convergence can also be extended to uncountable sum, and we get the same result that finite sum implies all but countably many terms are zeroes (see Sum of a series indexed by ordinals).
Extending both continuous (Riemann) integral and discrete sum
Integral feels like a "continuous sum", but how to make this precise? To keep things simple, let's restrict ourselves to integration of real-valued function.
Lebesgue integral comes to rescue! It generalizes Riemann integral on closed bounded interval to any measure space.
If we (Lebesgue) integrate on the measure space $(\mathbb{R}, \mathcal{L}, \mu)$ where $\mu$ is the Lebesgue measure on $\mathbb{R}$ and $\mathcal{L}$ is the Lebesgue measurable sets on $\mathbb{R}$, we get an extension of Riemann integral, in the sense that any Riemann integrable function $f: [a, b] \to \mathbb{R}$ is also Lebesgue integrable and both integrals have the same value (see General condition that Riemann and Lebesgue integrals are the same).
If we (Lebesgue) integrate on the measure space $(\mathbb{N}, \mathscr{P}(\mathbb{N}), \#)$ where $\#$ is the counting measure and $\mathscr{P}(\mathbb{N})$ is the power set of the natural numbers, then we get discrete sum (see Is Lebesgue integral w.r.t. counting measure the same thing as sum (on an arbitrary set)?).
For example, let $f, f_n: \mathbb{N} \to \mathbb{R}$ be defined by $f(k) = \frac{1}{k^2}$ and
$$f_n(k) = \begin{cases} \frac{1}{k^2} \text{ if } k \le n \\ 0 \text{ otherwise}\end{cases}$$
Then
$$f_n(k) = \sum_{m = 1}^{n} \frac{1}{m^2} \chi_{\{m\}}(k)$$
and thus
$$\begin{align} \int_\mathbb{N} f \mathrm{d}\#
&= \sup_{n \in \mathbb{N}} \left\{\int_\mathbb{N} f_n \mathrm{d}\#\right\} \\
&= \sup_{n \in \mathbb{N}} \left\{\sum_{m = 1}^{n} \frac{1}{m^2} \#(\{m\})\right\} \\
&= \sup_{n \in \mathbb{N}} \left\{\sum_{m = 1}^{n} \frac{1}{m^2}\right\} \\
&= \sum_{m = 1}^{+\infty} \frac{1}{m^2}\end{align}$$
elementary-set-theory
orset-theory
tag. – 光復香港 時代革命 Free Hong Kong Mar 29 '21 at 15:18