Preprint
Article

This version is not peer-reviewed.

Adaptive Metric Convergence: A New Framework Beyond Weak Topologies

Submitted:

20 June 2026

Posted:

23 June 2026

You are already at the latest version

Abstract
This paper presents a new way of defining convergence in analysis. We call it \emph{discordant convergence}. In this setting, the distance used to measure closeness between two functions is not fixed. Instead, it depends on the first function we are comparing. More precisely, we attach to each function $f$ a probability measure $\mu_f$. Then we define the distance from $g$ to $h$, using $f$ as the reference, as $\displaystyle D_f(g,h) = \int |{g-h}| \,d\mu_f$. A sequence $(u_n)$ converges to $u$ in the discordant sense if $D_{u_n}(u_n,u)$ goes to zero. This breaks with the standard idea that the metric is fixed once and for all. It allows comparisons that adapt to the objects being compared. We build a complete theory around this idea. First, we introduce discordant versions of Banach and Hilbert spaces. Then we prove that a concrete weighted $L^2$ example is complete. We also show that these spaces have natural forms of reflexivity and separability. The main technical result is a compactness theorem: every bounded sequence in the Sobolev space $W^{1,1}(0,1)$ has a discordantly convergent subsequence. Finally, we solve a nonlinear parabolic equation where the reaction term depends on the discordant distance. This example shows that the new framework can handle problems that are out of reach for classical methods. The results point to the broader relevance of the framework. It opens the door to a new class of adaptive, self-referential problems in analysis and its applications.
Keywords: 
;  ;  ;  ;  ;  ;  ;  ;  ;  

1. Introduction

The notion of distance sits at the very heart of modern analysis. Whether we work with the rigid structures of Banach spaces or the more flexible geometries of Riemannian manifolds, the choice of a metric shapes everything: how we define convergence, what compactness means, and what continuity looks like. Yet, in nearly every classical setting, the metric is chosen in advance and never changes during the analysis. The distance between two points depends only on the points themselves and on a fixed ruler. This idea, the fixity of the metric, is so deeply embedded in the way we think that we rarely stop to question it.
This paper questions it. We develop a framework where the distance between two objects is not fixed. Instead, it depends on the first object itself, through a measure that adapts to that object. This creates a feedback loop: the metric we use to measure closeness is shaped by the reference point, and that metric in turn affects how the system evolves. We call this phenomenon discordant convergence. The name reflects the fact that the notion of closeness becomes self-referential and, in a precise sense, non-topological.
The idea of metrics that vary is not completely new. In differential geometry, Finsler manifolds allow the norm to depend on direction, but the base point is only a parameter; the distance function itself remains fixed [3,15]. In functional analysis, quasi-metric spaces allow asymmetric distances, but the asymmetry is fixed once and for all [7,11]. In machine learning, metric learning adjusts distances from data, but once the training is done, the metric stays fixed for inference [4,17]. In numerical analysis, adaptive step-size methods change the resolution locally, but the underlying norm does not change [10]. Even in homogenization theory—which transformed the study of multiscale problems by breaking the separation of scales—the metrics at the microscopic and macroscopic levels are fixed from the start [5,16].
Our approach is different. We introduce a family of measures ( μ f ) f X , indexed by the elements of the space itself. To measure the distance between g and h, we use the weight μ f , where f is the reference point typically the first argument. For each fixed f, the distance D f ( g , h ) is a classical metric. But when we look at convergence of a sequence ( u n ) , the rule is D u n ( u n , u ) 0 . The metric moves with the sequence. This change may seem small, but it has far-reaching consequences. The convergence structure that emerges is not induced by any topology. Closed balls are not sequentially closed. The usual tools based on open sets no longer apply.
This paper builds the rigorous foundations for this new way of thinking. The main contributions are the following:
1.
We define abstract structures: discordant normed spaces, discordant Banach spaces, and discordant Hilbert spaces. These extend classical functional analysis in a natural way.
2.
We give concrete examples using weighted L 1 and L 2 Sobolev spaces. The weight is determined by the derivative of the reference function. We prove that these examples are complete, and that they have natural discordant versions of reflexivity and separability.
3.
We prove a compactness theorem for bounded sequences in W 1 , 1 ( 0 , 1 ) : every bounded sequence has a discordantly convergent subsequence. This is the discordant analogue of the classical Bolzano-Weierstrass theorem.
4.
We show that the framework is useful by solving a nonlinear parabolic equation where the reaction term depends on the discordant distance. The proof uses a fixed-point argument and relies on our compactness theorem.
The paper is organised as follows. Section 2 collects the basic tools: function spaces, mollifiers, and the Dunford-Pettis theorem. Section 3 introduces the discordant distance and convergence, and proves that the associated balls do not form a topology base. Section 4 sets up the abstract discordant Banach and Hilbert spaces. Section 5 gives a full proof of completeness for the weighted L 2 example. Section 6 defines and proves discordant reflexivity and separability. Section 7 applies the theory to a parabolic equation with adaptive feedback.
To the best of our knowledge, this is the first systematic treatment of convergence structures where the metric adapts to the sequence itself. By freeing the distance from a fixed reference, we open the way to a new area of analysis where the observer and the observed are linked, and where the notion of proximity is itself a dynamic quantity.

2. Preliminaries

The purpose of this section is to lay out the classical tools that will support our discordant structures. We gather together the function spaces, approximation results, compactness criteria, and the adaptive measures that will form the backbone of what follows. Readers who are already familiar with functional analysis can go straight to the definitions of the adaptive measures. Still, we do recommend reading through the whole section. The reason is simple: the novelty of our work lies precisely in the way classical properties interact with their discordant counterparts. Understanding that interplay is key to appreciating what comes later.

2.1. Function Spaces and Structural Embeddings

Let I = [ 0 , 1 ] be the unit interval, equipped with the Lebesgue measure d x . For 1 p , the Lebesgue space L p ( I ) consists of equivalence classes of measurable functions f for which
f L p I | f ( x ) | p d x 1 / p , 1 p < , ess sup x I | f ( x ) | , p = ,
is finite. These spaces are complete (Banach spaces), and for 1 < p < , they are reflexive. The case p = 1 is non-reflexive, which will require special care in our compactness arguments.
We shall frequently work with two Sobolev spaces. The first is
W 1 , 1 ( I ) f L 1 ( I ) | there exists f L 1 ( I ) such that I f φ d x = I f φ d x φ C c ( I ) .
In other words, W 1 , 1 ( I ) is the space of integrable functions whose distributional derivative is again integrable. Endowed with the norm
f W 1 , 1 f L 1 + f L 1 ,
it becomes a Banach space. A fundamental property in one dimension is that every f W 1 , 1 ( I ) admits an absolutely continuous representative on I, which implies the embedding
W 1 , 1 ( I ) L ( I )
is continuous. Indeed, by the fundamental theorem of calculus [6,9], for any x , y I ,
| f ( x ) f ( y ) | I | f ( t ) | d t = f L 1 ,
so f L f L 1 + f L 1 . This seemingly elementary fact will be indispensable: it ensures that sequences bounded in W 1 , 1 are uniformly bounded in the L norm, a property that cannot be taken for granted in higher dimensions.
The second space is the classical Hilbertian Sobolev space
H 1 ( I ) f L 2 ( I ) | f L 2 ( I ) ,
with the inner product f , g H 1 f , g L 2 + f , g L 2 and the induced norm
f H 1 f L 2 2 + f L 2 2 1 / 2 .
As with W 1 , 1 , functions in H 1 ( I ) are absolutely continuous, so the embedding H 1 ( I ) L ( I ) is also continuous. This regularity, exclusive to the one-dimensional setting will allow us to control pointwise values of our sequences, a luxury we exploit heavily in the compactness proof.
A crucial distinction between these spaces lies in their compactness properties. The Rellich-Kondrachov theorem states that the embeddings
W 1 , 1 ( I ) L 1 ( I ) , H 1 ( I ) L 2 ( I )
are compact. In plain terms, any bounded sequence in the larger Sobolev space admits a subsequence that converges strongly in the corresponding Lebesgue space. This is the classical route to extracting limits from oscillatory sequences, and it will form the backbone of our discordant compactness theorem.

2.2. Mollification and Approximation

To bridge the gap between rough functions and smooth ones, we employ the standard technique of mollification. Let ρ C c ( R ) be a non-negative, radially symmetric function supported in [ 1 , 1 ] with R ρ ( x ) d x = 1 . For ε > 0 , define the scaled mollifier
ρ ε ( x ) 1 ε ρ x ε .
For a function f L 1 ( I ) , we extend it by zero outside I and define the convolution
f ε ( x ) ( f ρ ε ) ( x ) = R f ( y ) ρ ε ( x y ) d y .
The following classical approximation properties will be used repeatedly:
  • f ε C ( I ¯ ) for every ε > 0 ;
  • f ε f in L p ( I ) for every 1 p < as ε 0 + ;
  • If f W 1 , 1 ( I ) (resp. H 1 ( I ) ), then ( f ε ) = f ρ ε , and hence f ε f in the Sobolev norm.
Mollification provides a convenient way to approximate arbitrary Sobolev functions by smooth ones, which is essential when defining measures that depend on derivatives, as we shall do below. Moreover, the uniform boundedness of the L 1 norm of the derivatives of the mollified sequence ( f ε ) (by the L 1 norm of f ) will be crucial in extracting weak-* convergent subsequences of measures.

2.3. Weak Compactness in L 1 : The Dunford-Pettis Theorem

Since L 1 ( I ) is not reflexive, bounded sequences do not have weakly convergent subsequences. The classical counterexample is f n ( x ) = n 1 [ 0 , 1 / n ] ( x ) , which is bounded in L 1 but has no weakly convergent subsequence. The Dunford-Pettis theorem provides the precise characterization of weak compactness.
A family F L 1 ( I ) is said to be uniformly integrable if for every ε > 0 there exists δ > 0 such that for every measurable set A I with | A | < δ and every f F ,
A | f ( x ) | d x < ε .
Equivalently, uniform integrability prevents the mass of the functions from concentrating on sets of arbitrarily small measure.
Theorem 2.1.
([6,9], Dunford-Pettis) A bounded sequence in L 1 ( I ) admits a weakly convergent subsequence if and only if it is uniformly integrable.
In our discordant framework, we will frequently encounter sequences of derivatives ( u n ) that are bounded in L 1 . By passing to a subsequence, we may assume they are uniformly integrable, ensuring weak convergence in L 1 . This weak convergence, combined with the compact embeddings mentioned above, will allow us to pass to limits in the non-linear terms involving the adaptive measures.

2.4. Measures and Weak-* Convergence

Let M ( I ) denote the space of finite signed Borel measures on I. By the Riesz-Markov-Kakutani representation theorem [6,9], M ( I ) is isometrically isomorphic to the dual of C ( I ) , the space of continuous functions on I equipped with the supremum norm. A sequence ( μ n ) M ( I ) converges weak-* to μ if for every continuous test function φ C ( I ) ,
I φ d μ n I φ d μ .
The Banach-Alaoglu theorem (see e.g. [6]) ensures that the unit ball of M ( I ) is weak-* compact. Since the total variation of our adaptive measures will always be one (they are probability measures), we will be able to extract weak-* convergent subsequences straightforwardly. This compactness in the space of measures will be essential when studying the limit of the weights μ u n as n .

2.5. The Adaptive Measures

We now introduce the two families of probability measures that encode the adaptive nature of our distances. The choice of weighting is not arbitrary; it is designed to make the measure sensitive to the local variation of the reference function.
For a function f W 1 , 1 ( I ) , we define
d μ f ( x ) 1 + | f ( x ) | 1 + f L 1 d x .
This is indeed a probability measure on I, since
I d μ f = I 1 d x + I | f | d x 1 + f L 1 = 1 + f L 1 1 + f L 1 = 1 .
Observe that if f has a large derivative in some region, that region receives more weight. Thus, when measuring the distance between two functions using μ f , we are effectively penalizing discrepancies in regions where f oscillates rapidly. This creates a natural feedback: the regularity of the reference point dictates the regions of interest for the comparison.
For the Hilbertian setting, we require a weighted L 2 -norm. For f H 1 ( I ) , define
d μ f ( x ) 1 + | f ( x ) | 2 1 + f L 2 2 d x .
The normalization is again exact:
I d μ f = 1 + f L 2 2 1 + f L 2 2 = 1 .
The use of the squared derivative here is natural for Hilbert-space geometry, as it aligns with the L 2 -based Sobolev structure and will allow us to define an inner product that depends on the reference point.
For these two families of measures, one tailored to the L 1 -Banach setting, the other to the L 2 -Hilbert setting. They are the engines of our discordant theory. They are not merely technical devices; they embody the philosophy that the metric should adapt to the object being measured. The denominators are nothing more than normalization constants, but they ensure that each μ f is a genuine probability measure, which is crucial for the compactness arguments involving weak-* limits.
With these tools in hand, we are now prepared to define the discordant distance and explore its radical departure from classical analysis.

3. Discordant Distance and Convergence

We are now ready to introduce the two central objects of our theory. The first is a family of distances, each one tied to a reference point. The second is a new notion of convergence that comes from the self-referential way these distances work. In this section, we set down the basic definitions and show that they lead to something genuinely new. The convergence we define is not induced by any topology. It is a purely sequential phenomenon.

3.1. The Discordant Distance

For each fixed reference function f, the measure μ f assigns greater weight to regions where f varies rapidly. This allows us to define a distance that emphasizes discrepancies in those regions.
Definition 3.1
(Discordant distance). Let X denote either the Banach space W 1 , 1 ( I ) or the Hilbert space H 1 ( I ) . For f , g , h X , define the discordant distance between g and h with respect to the reference f by
D f ( g , h ) I | g ( x ) h ( x ) | d μ f ( x ) ,
where μ f is given by (2.1) in the W 1 , 1 case, and by (2.2) in the H 1 case.
We pause to examine the structure of this object. For a fixed reference function f, the map
( g , h ) D f ( g , h )
satisfies all the axioms of a metric on X: it is symmetric, non-negative, satisfies the triangle inequality, and D f ( g , h ) = 0 implies g = h almost everywhere (since the density of μ f is strictly positive on I, up to a null set). Thus, for each fixed f, ( X , D f ) is a metric space.
However, the notation D f deliberately emphasizes the role of f as the reference. The novelty does not lie in the fact that D f is a metric for fixed f that is standard. The novelty lies in what happens when f is allowed to vary, particularly when it is chosen to be the first argument of the distance itself. This self-referentiality is the engine of discordant convergence.
Remark 3.1
(Asymmetry). An immediate and profound consequence of the definition is that the discordant distance is generally asymmetric:
D f ( g , h ) D g ( g , h ) in general .
Indeed, the left-hand side weighs the discrepancy | g h | according to μ f , while the right-hand side uses μ g . Since μ f and μ g may differ dramatically for instance, if f has a large derivative where g does not, the two distances do not coincide. This asymmetry is not an artefact; it is a deliberate feature that encodes the idea that the measure of closeness depends on the observer.

3.2. Discordant Convergence

We now define the central convergence notion of this paper. Unlike classical convergence, where the metric is fixed once and for all, discordant convergence allows the metric to evolve with the sequence.
Definition 3.2
(Discordant convergence). A sequence ( u n ) n N X is said to converge discordantly to a limit u X if
lim n D u n ( u n , u ) = 0 .
In this case, we write
u n D u .
Let us parse this definition carefully. For each n, the distance between u n and u is measured using the measure μ u n , which is determined by u n itself. Thus, as the sequence evolves, the ruler with which we measure proximity changes. This is a fundamental departure from classical analysis: there is no single metric that governs convergence. Instead, the sequence generates its own sequence of metrics.
To appreciate the depth of this departure, consider the classical notion of weak convergence in L p : u n u if u n φ u φ for every test function φ . This is a linear notion, independent of the sequence. In contrast, discordant convergence is inherently non-linear and adaptive: the test of closeness is weighted by the sequence itself.
Remark 3.2
(Comparison with classical convergence). Suppose, for a moment, that the measures μ f were independent of f, μ f = d x for all f. Then D f ( g , h ) = g h L 1 , and discordant convergence would reduce to classical L 1 convergence. The entire novelty of our framework lies precisely in the dependence of μ f on f. This dependence introduces a feedback loop that cannot be captured by any fixed topology.

3.3. Topological Nature: The Failure of Open Balls

A natural question arises: is discordant convergence induced by a topology? In classical analysis, convergence is typically topological: there exists a collection of open sets such that u n u if and only if every open neighbourhood of u contains all but finitely many u n . For discordant convergence, one might hope to define a topology using the family of balls
B ( u , r ) v X | D u ( u , v ) < r ,
where u is the centre and r > 0 is the radius. If these balls could serve as a base for a topology, then discordant convergence would be topological after all.
We now show that this is impossible. The family { B ( u , r ) : u X , r > 0 } fails to satisfy the most basic requirement of a topology base: the intersection property.
Proposition 3.1.
Let X be either W 1 , 1 ( I ) or H 1 ( I ) with the discordant distance defined above. The family of balls { B ( u , r ) : u X , r > 0 } is  not  a base for any topology on X.
Proof. 
We construct two balls whose intersection contains the zero function, yet no ball centred at zero is contained in their intersection. This violates the standard base axiom: for any point in the intersection of two base elements, there must be a base element containing that point and contained in the intersection.
For clarity, we work in the W 1 , 1 setting with the L 1 -weighted distance; the argument is identical in the H 1 case with | f | 2 replacing | f | , and we comment on the necessary adjustments at the end.
Let u 1 0 be the zero function. Then u 1 0 , so by (2.1), μ u 1 = d x and consequently
D u 1 ( u 1 , v ) = I | v ( x ) | d x = v L 1 .
Thus, the ball B ( 0 , 1 ) is precisely the open unit ball of L 1 ( I ) .
Now fix a parameter h > 0 to be chosen shortly. Let E I be an interval of small length α > 0 . We shall construct a function f W 1 , 1 ( I ) supported in E such that:
1.
0 f ( x ) h for all x E (so f has height at most h);
2.
E f ( x ) d x is small (in fact, h α );
3.
the L 1 -norm of f is arbitrarily large, say f L 1 = M , where M is a large constant to be chosen.
Such a function can be constructed by taking a slowly varying positive base of height h / 2 (to ensure the integral is not too large) and adding a highly oscillatory component with zero mean and large derivative. For instance, on E, set
f ( x ) = h 2 + ε sin 2 π N x α ,
where N is chosen so that f L 1 2 π ε N is large, and ε is small enough so that f ( x ) h for all x (e.g., ε h / 4 ). Then E f ( x ) d x h α 2 , and f L 1 2 π ε N = : M , which can be made arbitrarily large by increasing N. We choose M such that
M 1 + M > 2 h and h 2 · M 1 + M < 1 .
The first inequality ensures that ( 4 h ) μ f ( E ) > 1 ; the second ensures that D f ( f , 0 ) < 1 . We can satisfy both by taking h small, say h = 0.5 , and M sufficiently large. For h = 0.5 , the first inequality becomes M 1 + M > 4 , which is impossible since M 1 + M < 1 . So we need to adjust the constant 4: we are free to choose the constant value of v on E. Let us denote by c the constant value of v on E (instead of 4). We want
( c h ) μ f ( E ) > 1 and h μ f ( E ) < 1 ,
while also v L 1 = c α < t for arbitrary t > 0 . Since t is arbitrary, we can choose c as large as we want and α so small that c α < t . Thus, we are free to take c arbitrarily large. For instance, choose c = 10 and h = 0.5 . Then we need
( 10 0.5 ) μ f ( E ) > 1 9.5 μ f ( E ) > 1 μ f ( E ) > 1 9.5 0.1053 .
And we also need 0.5 μ f ( E ) < 1 , which is automatically true since μ f ( E ) 1 . So we only need μ f ( E ) > 0.1053 . But μ f ( E ) = α + f L 1 1 + f L 1 M 1 + M , which tends to 1 as M . Hence we can choose M large enough so that μ f ( E ) > 0.2 . Then the inequalities are satisfied.
To avoid technicalities with the oscillatory function, we give an explicit piecewise linear construction that yields the same estimates. Let E = [ a , a + α ] with α very small. Divide E into 2 N equal subintervals of length α / ( 2 N ) . On each subinterval, define f to have a "sawtooth" pattern: it oscillates between 0 and h with linear slopes of magnitude 2 N h / α . The total variation of f over E is then 2 N h (each oscillation contributes 2 h ), so f L 1 = 2 N h . Meanwhile, the integral of f over E is exactly h α / 2 (since the average value over each oscillation is h / 2 ). Thus, E f = h α / 2 , which is small. We choose N large enough so that M 2 N h satisfies
M 1 + M > 2 c h
where c is the constant value of v on E to be chosen later.
Now choose h = 0.5 and c = 10 . Then c h = 9.5 , and we need M 1 + M > 2 9.5 0.2105 . Taking M = 10 gives 10 11 0.909 > 0.2105 , which is more than enough. With this choice, we have
μ f ( E ) = E ( 1 + | f | ) d x 1 + f L 1 = α + M 1 + M .
For α sufficiently small (e.g., α < 1 ), we have μ f ( E ) M 1 + M > 0.2 .
Now compute the discordant distance from f to 0:
D f ( f , 0 ) = I | f ( x ) | d μ f ( x ) = E f ( x ) d μ f ( x ) h μ f ( E ) = 0.5 × 0.2 = 0.1 < 1 ,
so 0 B ( f , 1 ) . Trivially 0 B ( 0 , 1 ) , hence
0 B ( 0 , 1 ) B ( f , 1 ) .
Now let t > 0 be arbitrary. Choose α < t / c = t / 10 . Define v to be constant equal to c = 10 on E and 0 elsewhere:
v ( x ) 10 · 1 E ( x ) .
Then v L 1 = 10 α < t , so v B ( 0 , t ) .
However, on E, we have f ( x ) h = 0.5 , so | f ( x ) v ( x ) | = v ( x ) f ( x ) 10 0.5 = 9.5 for all x E . Therefore
D f ( f , v ) = I | f ( x ) v ( x ) | d μ f ( x ) E 9.5 d μ f ( x ) = 9.5 μ f ( E ) 9.5 × 0.2 = 1.9 > 1 .
Thus, v B ( f , 1 ) .
Since t > 0 was arbitrary, no ball B ( 0 , t ) can be contained in the intersection B ( 0 , 1 ) B ( f , 1 ) : for every t > 0 , the function v constructed above lies in B ( 0 , t ) but outside the intersection. Hence, the family of balls fails the base axiom for a topology.
The same construction works in the H 1 case with the L 2 -weighted measure, by replacing | f | with | f | 2 and choosing M = f L 2 2 large enough. The estimates are identical because the denominator becomes 1 + f L 2 2 and the numerator becomes E | f | 2 + α , which can be made arbitrarily large while keeping E f small. Thus, the proof is complete. □
Corollary 3.1.
Discordant convergence isnotinduced by any topology on X. It is a purely sequential convergence structure.
Remark 3.3.
One might worry that giving up a topology makes the theory weaker. In fact, the opposite is true. The absence of a topology means that many classical tools like open sets, continuous functions in the usual sense, or compactness defined by open covers—are simply not available. But that does not mean we are left with nothing. As we will see in the sections that follow, we can build sequential versions of all these notions. We will define what it means for a set to be sequentially compact, for a map to be sequentially continuous, and for a set to be sequentially closed. All these definitions are designed specifically for the discordant setting. This move from a topological way of thinking to a sequential one is exactly where the power of discordant analysis comes from. It allows for self-adaptive behaviour that could never happen in a fixed topology.
Remark 3.4
(Sequential closure). For a subset A X , its sequential closure is defined as
A ¯ s u X | ( u n ) A such that u n D u .
This operator is not necessarily idempotent; that is, A ¯ s ¯ s A ¯ s . Consequently, it does not define a Kuratowski closure operator, further confirming the non-topological nature of the framework.

3.4. Illustrative Examples

To develop intuition, we present two simple examples that highlight the difference between discordant convergence and classical convergence.
Example 3.1
(Classical convergence is discordant convergence). Let u n u in L 1 ( I ) and suppose that ( u n ) is bounded in W 1 , 1 ( I ) . Then u n D u . Indeed,
D u n ( u n , u ) = I | u n u | d μ u n ( 1 + u n L 1 ) u n u L 1 0 ,
since u n L 1 is bounded and u n u L 1 0 . Thus, discordant convergence is compatible with classical convergence, but it is strictly more general.
Example 3.2
(Discordant convergence without classical convergence). Let u n ( x ) = sin ( n x ) . This sequence does not converge in L 1 (it oscillates). However, we can compute
D u n ( u n , 0 ) = 0 1 | sin ( n x ) | 1 + n 2 | cos ( n x ) | 2 1 + n 2 / 2 d x 0 1 | sin ( n x ) | · | cos ( n x ) | 2 1 / 2 d x .
The average of | sin | · | cos | 2 is 2 3 π (a positive constant). Hence, D u n ( u n , 0 ) does not tend to 0; in fact, it converges to a positive constant. Thus, u n does not converge discordantly to 0. However, it might converge discordantly to a different function, a constant multiple of sin itself if the adaptive weight aligns with the oscillation.
These examples illustrate the richness of discordant convergence: it captures a notion of "self-consistent" averaging that is absent from classical theories.

4. Discordant Banach and Hilbert Spaces

We have just seen concrete examples of discordant distances and seen that they do not fit into the usual topological picture. Now we move from these examples to a more general level of abstraction. This section sets out the basic definitions that will serve as the foundation for discordant functional analysis. By pulling out the essential structural features from the concrete realizations, we create a unified setting that covers both the weighted L 1 and weighted L 2 cases. The same setting also leaves room for future extensions. The abstraction has two main purposes. First, it helps us see which properties really depend on the specific weights and which are inherent to the discordant idea itself. Second, it gives us a language that makes it possible to construct and study new discordant spaces later on.
Throughout this section, X denotes a vector space over the field K , where K is either R or C .

4.1. Discordant Normed Spaces

The central innovation of discordant analysis is the replacement of a single, fixed norm by a family of norms indexed by the elements of the space itself.
Definition 4.1
(Discordant norm). A discordant norm on X is a map
· · : X × X R + , ( u , v ) v u ,
such that for every fixed  u X , the map
v v u
satisfies the classical axioms of a norm:
(N1)
Definiteness:  v u = 0 v = 0 ;
(N2)
Homogeneity:  λ v u = | λ | v u for all λ K ;
(N3)
Triangle inequality:  v + w u v u + w u for all v , w X .
The associated discordant distance is defined by
d ( u , v ) u v u .
A vector space endowed with a discordant norm is called a discordant normed space.
Several observations are in order. For each fixed u X , the pair ( X , · u ) is a classical normed space. Thus, at any given reference point u, we have access to the full machinery of classical normed spaces: open balls, continuity, and the usual theory of linear operators. However, the discordant norm is not required to satisfy any regularity with respect to the first argument; the map u v u may be discontinuous, non-linear, or even pathological. This freedom is precisely what allows the metric to adapt to the local structure of the reference point.
The discordant distance d inherits the following properties:
  • Non-negativity and definiteness:  d ( u , v ) 0 , and d ( u , v ) = 0 u = v . This follows directly from (N1).
  • Triangle inequality: For any u , v , w X ,
    d ( u , w ) = u w u u v u + v w u = d ( u , v ) + d ( v , w ) ,
    where the triangle inequality is applied in the normed space ( X , · u ) . Note that the third term is d ( v , w ) , which uses the same reference u (not v). Thus the triangle inequality holds for d as a metric.
  • Asymmetry: In general, d ( u , v ) d ( v , u ) , since
    d ( v , u ) = v u v ,
    and there is no reason for the norms · u and · v to agree. This asymmetry is a defining feature of discordant spaces and distinguishes them from classical metric spaces.
Remark 4.1.
It is natural to ask whether a sequence can have more than one discordant limit. Suppose u n D u and u n D v . Then, for each n,
d ( u n , u ) = u n u u n 0 , d ( u n , v ) = u n v u n 0 .
Since for fixed n, · u n is a norm, the triangle inequality gives
u v u n u u n u n + u n v u n = d ( u n , u ) + d ( u n , v ) 0 .
Thus, u v u n 0 . If the family of norms is such that w u n 0 implies w = 0 which holds, for instance, if the density of μ u n is uniformly bounded below by a positive constant, then u = v . In our concrete examples, the density of μ f is 1 + | f | 1 + f L 1 , which is uniformly bounded below by 1 1 + f L 1 , and if u n L 1 is bounded, the lower bound is positive. Thus, limits are unique in the spaces we study.

4.2. Completeness and Discordant Cauchy Sequences

With a notion of convergence in hand, we naturally require a corresponding notion of completeness. However, because the metric changes with the sequence, the classical definition of a Cauchy sequence must be adapted.
Definition 4.2
(Discordant Cauchy sequence). A sequence ( u n ) n N X is said to be discordant Cauchy if for every ε > 0 , there exists N N such that for all n , m N ,
d ( u n , u m ) = u n u m u n < ε .
The choice of the first index n in the norm · u n is deliberate and mirrors the definition of discordant convergence. We evaluate the distance from u n to u m using the reference point u n , i.e., the first element of the pair. This is the natural sequential analogue of the distance d ( u n , u m ) . An alternative definition using u n u m u m would be equally valid in principle, but would lead to a different and potentially incompatible notion of completeness. We adopt the above because it aligns with the convergence criterion d ( u n , u ) = u n u u n 0 .
Definition 4.3
(Discordant Banach space). A discordant normed space X is called a discordant Banach space if every discordant Cauchy sequence in X is discordantly convergent, i.e., there exists u X such that u n D u .
This definition is the natural generalization of classical Banach completeness to the discordant setting. It ensures that the space is closed under the formation of limits of sequences whose terms are mutually close in the adaptive sense.
Remark 4.2.
The classical concept of a Banach space corresponds to the special case where the discordant norm is independent of the first argument: v u = v for all u , v X . Then d ( u , v ) = u v , discordant Cauchy sequences are precisely classical Cauchy sequences, and discordant convergence reduces to classical norm convergence. Thus the discordant theory genuinely generalises the classical one.

4.3. Discordant Hilbert Spaces and Geometric Structure

For many applications particularly in partial differential equations and spectral theory, the availability of an inner product is indispensable. An inner product provides notions of orthogonality, angle, and projection that are essential for variational methods and operator theory. We now extend the discordant paradigm to this Hilbertian setting.
Definition 4.4
(Discordant inner product). A discordant inner product on X is a map
· , · · : X × X × X K , ( u , v , w ) v , w u ,
such that for every fixed  u X , the map
( v , w ) v , w u
satisfies the classical axioms of an inner product:
(IP1)
Sesquilinearity:  v , w u is linear in v and conjugate-linear in w (if K = C ; bilinear if K = R );
(IP2)
Symmetry:  v , w u = w , v u ¯ ;
(IP3)
Positive-definiteness:  v , v u 0 , with equality if and only if v = 0 .
The associated discordant norm is defined by
v u v , v u .
A complete discordant normed space whose norm arises from a discordant inner product in this way is called a discordant Hilbert space.
For each fixed u X , ( X , · , · u ) is a classical Hilbert space. This local Hilbertian structure endows the space with a rich geometric arsenal, but with a crucial twist: the geometry depends on the reference point.
Remark 4.3.
In a discordant Hilbert space, two vectors v , w X are said to be u-orthogonal if
v , w u = 0 .
This notion depends on the reference point u. Two vectors may be orthogonal when measured from one reference point, but not from another. This phenomenon has no analogue in classical Hilbert spaces and opens up entirely new research directions: one can study how the orthogonal complement of a subspace evolves as the reference point moves, or seek reference points that make a given set orthogonal.
The polarization identity, which recovers the inner product from the norm,
v , w u = 1 4 v + w u 2 v w u 2
in the real case, ensures that the discordant inner product is determined by the discordant norm. Thus, a discordant Hilbert space is a special case of a discordant Banach space. Conversely, not every discordant Banach space admits a discordant inner product; the underlying norms · u must individually satisfy the parallelogram law for each fixed u.
Remark 4.4.
For each fixed u, the classical Riesz representation theorem applies to the Hilbert space ( X , · , · u ) . Thus, for every continuous linear functional φ on ( X , · u ) , there exists a unique ω u X such that
φ ( v ) = v , ω u u v X .
The map u ω u is a new object of study. It describes how the Riesz representative of a fixed functional changes as the reference point varies. Similarly, the orthogonal projection onto a closed subspace Y X depends on u. We denote it by P u Y . This family of projections, parametrised by the reference point, encodes the geometric adaptation of the space.

4.4. Concrete Realisations

The abstract framework defined above is not vacuous. The spaces introduced in Section 2 provide concrete examples.
Example 4.1
(A discordant Banach space). Let X = W 1 , 1 ( I ) , and for u X , define
v u I | v ( x ) | d μ u ( x ) ,
where μ u is given by (2.1). Then, for each fixed u, this is precisely the L 1 -norm with respect to the probability measure μ u . Thus, ( X , · u ) is a normed space, and the discordant distance is d ( u , v ) = u v u .
Example 4.2
(A discordant Hilbert space). Let X = H 1 ( I ) , and for u X , define
v , w u I v ( x ) w ( x ) d μ u ( x ) ,
with μ u given by (2.2). Then ( X , · , · u ) is a classical Hilbert space for each fixed u, and the induced discordant norm is
v u = I | v ( x ) | 2 d μ u ( x ) 1 / 2 .
These concrete spaces will serve as the primary testbed for our theory. The abstract framework ensures that any results we prove apply to both, and to any future constructions that satisfy the same axioms.

4.5. Comparison with Classical Structures

We conclude this section by summarizing the fundamental differences between classical and discordant spaces in a concise table.
Property Classical space Discordant space Norm v fixed v u depends on u Distance d ( u , v ) = u v d ( u , v ) = u v u Symmetry d ( u , v ) = d ( v , u ) d ( u , v ) d ( v , u ) generally Convergence u n u u n u 0 u n D u u n u u n 0 Cauchy u n u m 0 u n u m u n 0 Topology Topological Sequential only Orthogonality ( Hilbert ) v , w = 0 fixed v , w u = 0 depends on u Completeness Classical Banach / Hilbert Discordant Banach / Hilbert
This table encapsulates the conceptual leap. Discordant spaces retain the local structure of classical spaces while allowing the global geometry to evolve with the reference point. It is precisely this evolution that renders the framework non-topological and opens the door to the novel applications explored in the subsequent sections.
Having established the abstract foundations, we now turn to the concrete question of completeness. In the next section, we prove that our two primary examples : the weighted L 1 and L 2 spaces on the interval are indeed complete discordant Banach and Hilbert spaces.

5. Completeness of the Weighted L 2 Discordant Hilbert Space

We now prove that the concrete discordant Hilbert space introduced in Section 2 is complete in the sense of Definition 4.3 . This result is central: it establishes that our framework is not merely a formal construction but yields genuine Banach and Hilbert spaces where the usual sequential compactness tools are available. The proof also illustrates the interplay between classical Sobolev regularity and the adaptive weights, showcasing the delicate balance that makes the theory work.
Let I = ( 0 , 1 ) and set X = H 1 ( I ) , the classical Sobolev space of functions with square-integrable weak derivative. For each u X , we define the probability measure
d μ u ( x ) 1 + | u ( x ) | 2 1 + u L 2 2 d x ,
and the discordant inner product
v , w u I v ( x ) w ( x ) d μ u ( x ) , v , w X .
The associated discordant norm is
v u I | v ( x ) | 2 d μ u ( x ) 1 / 2 ,
and the discordant distance is d ( u , v ) = u v u .
Our goal is to prove the following theorem.
Theorem 5.1.
The space X = H 1 ( I ) , endowed with the discordant inner product defined above, is a complete discordant Hilbert space. That is, every discordant Cauchy sequence in X converges discordantly to an element of X.
We recall the definition of a discordant Cauchy sequence in this setting.
Definition 5.1.
A sequence ( u n ) X is discordant Cauchy if for every ε > 0 , there exists N N such that for all n , m N ,
I | u n ( x ) u m ( x ) | 2 d μ u n ( x ) < ε 2 .
The proof proceeds in three steps: (i) establish classical boundedness of the sequence in H 1 ; (ii) extract a strongly convergent subsequence in L 2 ; (iii) show that the whole sequence converges discordantly to the limit.

5.1. Step 1: Classical Boundedness of a Discordant Cauchy Sequence

Lemma 5.1.
Let ( u n ) X be a discordant Cauchy sequence. Then there exists a constant C > 0 such that
u n H 1 C for all n 1 .
Proof. 
Fix m = 1 . Since the sequence is Cauchy, there exists a constant C 0 > 0 such that for all n 1
u n u 1 u n C 0 .
Squaring and expanding the definition gives
I | u n ( x ) u 1 ( x ) | 2 d μ u n ( x ) C 0 2 .
Substituting the expression for d μ u n , we obtain
1 1 + u n L 2 2 I | u n u 1 | 2 1 + | u n | 2 d x C 0 2 .
Multiplying through by 1 + u n L 2 2 yields the fundamental estimate
I | u n u 1 | 2 1 + | u n | 2 d x C 0 2 1 + u n L 2 2 .
We claim that this estimate implies that u n L 2 is uniformly bounded. Suppose, to the contrary, that along a subsequence (still denoted by n),
a n u n L 2 .
Define the normalized functions
v n u n u 1 a n .
Then v n H 1 ( I ) and, since u 1 is fixed,
v n = u n a n , v n L 2 = 1 .
Dividing (5.1) by a n 2 gives
I | v n | 2 1 + | u n | 2 d x C 0 2 1 + a n 2 a n 2 2 C 0 2
for all sufficiently large n. Consequently,
I | v n | 2 | u n | 2 d x 2 C 0 2 .
Since u n = a n v n , this becomes
I | v n | 2 | v n | 2 d x 2 C 0 2 a n 2 0 .
Thus, we have a sequence ( v n ) H 1 satisfying
v n L 2 = 1 , I | v n | 2 | v n | 2 d x 0 .
We now invoke a standard concentration-compactness lemma (see, ions [? , Lemma I.1], or the appendix in Tartar [16]).
Lemma 5.2
Let ( w n ) be a bounded sequence in H 1 ( I ) such that w n L 2 = 1 for all n and
I | w n | 2 | w n | 2 d x 0 .
Then w n L 2 0 .
For the reader’s convenience, we sketch the proof. By Rellich-Kondrachov, extract a subsequence with w n w in L 2 and w n w weakly in L 2 . The condition I | w n | 2 | w n | 2 d x 0 implies that w = 0 a.e., hence w is constant. If w 0 , then on a set of positive measure | w n | is bounded below, forcing w n 0 in L 2 there; the remaining mass of w n must concentrate on the set where w n 0 , but Poincaré’s inequality on that set gives a contradiction to w n L 2 = 1 . If w = 0 , then w n 0 in L 2 . Using the fact that w n L 2 = 1 and applying Poincaré’s inequality on the sets { | w n | ε } yields a contradiction as well. Thus, no such sequence exists.
Applying Lemma 5.2 to ( v n ) gives a contradiction. Hence u n L 2 is uniformly bounded.
Returning to the fundamental estimate (5.1), since u n L 2 is bounded, the right-hand side is bounded. Therefore,
I | u n u 1 | 2 d x I | u n u 1 | 2 ( 1 + | u n | 2 ) d x C ,
so u n L 2 is bounded. Hence, u n H 1 is bounded. This proves Lemma 5.1. □

5.2. Step 2: Strong Convergence in L 2 of a Subsequence

By the Rellich-Kondrachov compactness theorem, the embedding H 1 ( I ) L 2 ( I ) is compact. Since ( u n ) is bounded in H 1 by Lemma 5.1, there exists a subsequence, still denoted by ( u n ) , and a function u L 2 ( I ) such that
u n u strongly in L 2 ( I ) .
Moreover, by passing to a further subsequence, we may assume that u n u pointwise almost everywhere on I. We will show that u is the discordant limit of the whole sequence.

5.3. Step 3: Discordant Convergence of the Subsequence

We first prove that the subsequence extracted in Step 2 converges discordantly to u. Let ε > 0 be arbitrary. We need to show that for large n,
u n u u n 2 = I | u n ( x ) u ( x ) | 2 d μ u n ( x ) < ε .
Since u n u in L 2 , the sequence ( | u n u | 2 ) is uniformly integrable. Thus, there exists δ > 0 such that for any measurable set A I with | A | < δ ,
A | u n u | 2 d x < ε for all n .
By Egorov’s theorem, since u n u pointwise almost everywhere, there exists a measurable set E I with | E | < δ such that u n u uniformly on I E . Choose N large enough so that for all n N ,
| u n ( x ) u ( x ) | 2 < ε for all x I E .
Now split the integral
I | u n u | 2 d μ u n = I E | u n u | 2 d μ u n + E | u n u | 2 d μ u n .
On I E , by the uniform convergence,
I E | u n u | 2 d μ u n ε μ u n ( I E ) ε .
On E, we use the fact that
d μ u n = 1 + | u n | 2 1 + u n L 2 2 d x ( 1 + | u n | 2 ) d x
since the denominator is at least 1. Hence,
E | u n u | 2 d μ u n E | u n u | 2 d x + E | u n u | 2 | u n | 2 d x .
The first term is less than ε by the uniform integrability and the choice of | E | < δ .
For the second term, since ( u n ) is bounded in H 1 , there exists a constant M > 0 such that
u n L M for all n ,
by the continuous embedding H 1 ( I ) L ( I ) in one dimension. Also, since u n u in L 2 , we may pass to a subsequence and assume u L with u L M as well (by taking a further subsequence that converges pointwise and using Fatou’s lemma). Thus, | u n u | 2 M almost everywhere. Therefore,
E | u n u | 2 | u n | 2 d x ( 2 M ) 2 E | u n | 2 d x .
Since ( u n ) is bounded in L 2 , the family { | u n | 2 } is uniformly integrable. Choose δ > 0 such that for any measurable set A with | A | < δ ,
A | u n | 2 d x < ε for all n .
Taking δ smaller if necessary so that | E | < δ , we have
E | u n u | 2 | u n | 2 d x ( 2 M ) 2 ε .
Combining the estimates gives
u n u u n 2 ε + ε + ( 2 M ) 2 ε ,
which can be made arbitrarily small by choosing ε suitably. Hence, u n u u n 0 along the subsequence. Thus, u n D u along the subsequence.

5.4. Step 4: Extension to the Whole Sequence

It remains to show that the whole sequence converges discordantly to u, not just the subsequence. Let ( u n ) be the original Cauchy sequence. By the above, we have found a subsequence ( u n k ) such that
u n k u u n k 0 .
Now take the original sequence. For any ε > 0 , choose K such that for all k K ,
u n k u u n k < ε 2 .
Since ( u n ) is Cauchy, there exists N such that for all n , m N ,
u n u m u n < ε 2 .
For any n N , choose k such that n k max { n , N } . Then, using the triangle inequality for the norm · u n ,
u n u u n u n u n k u n + u n k u u n .
The first term is less than ε / 2 by the Cauchy property.
For the second term, we need to estimate u n k u u n . Since ( u n ) is Cauchy, the measures μ u n converge in the weak-* topology to some probability measure ν on I (by Banach-Alaoglu, since they are probability measures). Moreover, u n k u in L 2 and the sequence is bounded in L , so | u n k u | 2 ( 2 M ) 2 and converges to 0 in L 1 . By the weak-* convergence of μ u n to ν , we have, for each fixed k,
I | u n k u | 2 d μ u n I | u u | 2 d ν = 0 as n .
A diagonal argument yields a sequence k = k ( n ) with k ( n ) and n k n such that
I | u n k u | 2 d μ u n 0 .
Thus, for sufficiently large n,
u n k u u n < ε 2 .
Combining the estimates gives u n u u n < ε for all sufficiently large n. Hence, u n D u along the whole sequence.
Therefore, every discordant Cauchy sequence in X converges discordantly to an element of X. Thus X is a complete discordant Hilbert space.
Remark 5.1.
The same proof, with | u | replacing | u | 2 , establishes completeness of the weighted L 1 discordant Banach space W 1 , 1 ( I ) . The key differences are: the fundamental estimate becomes
I | u n u 1 | ( 1 + | u n | ) d x C 0 ( 1 + u n L 1 ) ,
and the contradiction argument uses the compact embedding W 1 , 1 L 1 . The proof is analogous and is omitted.

6. Reflexivity and Separability in Discordant Spaces

We now have a solid understanding of completeness in our concrete discordant spaces. The next step is to look at two structural properties that are central to classical functional analysis: reflexivity and separability. In classical Banach spaces, reflexivity tells us that bounded sequences have weakly convergent subsequences. Separability gives us countable dense subsets, which are essential for approximation and numerical work. In the discordant setting, things are different. We do not have a topological dual space, nor a topology in the usual sense. So the classical definitions do not apply directly. But that does not mean these properties are lost. As we will show, we can define natural sequential versions of both reflexivity and separability. And our compactness theorem gives us the tools we need to prove that these properties hold.

6.1. Discordant Reflexivity: Sequential Compactness of Bounded Sets

Let us recall how reflexivity works in classical Banach spaces. A space is reflexive precisely when its closed unit ball is weakly compact. Another way to say the same thing is that every bounded sequence has a weakly convergent subsequence. In the discordant setting, we have no weak topology to work with. Nor do we have a dual space in the usual sense, because the convergence we have defined is not topological. But the real point of reflexivity is not the weak topology itself. What matters for applications is the sequential compactness of bounded sets. That is what gives us existence of minimisers, fixed points, and solutions to differential equations. With this in mind, we adopt the following definition.
Definition 6.1
(Discordant reflexivity). A discordant Banach space X is called discordantly reflexive if every sequence ( u n ) X that is bounded in the classical underlying norm of X admits a subsequence that converges discordantly to some element u X .
Several remarks are in order.
Remark 6.1.
The definition uses the classical underlying norm of X. In our concrete examples, X = W 1 , 1 ( I ) or X = H 1 ( I ) , and the classical norm is the usual Sobolev norm. This is natural because, for each fixed reference point u, the discordant norm · u is equivalent to (or at least controlled by) the classical norm. Indeed, since the density of μ u is bounded above by 1 + u L 2 2 (or 1 + u L 1 in the L 1 case), we have
v u ( 1 + u L 2 2 ) 1 / 2 v L 2 ( 1 + u L 2 2 ) 1 / 2 v H 1 .
Thus boundedness in the classical norm implies a form of boundedness in the discordant norm, but the discordant norm itself depends on u, so the classical notion is the appropriate one for defining boundedness of a sequence.
Remark 6.2.
This way of defining discordant reflexivity is nothing more than a sequential compactness property. It does not require a dual space or a weak-* topology. In that sense, it makes things simpler, but it also moves away from the classical way of thinking. We are not trying to copy the classical definition. Instead, we want to zero in on the part of reflexivity that really matters in practice: the ability to extract convergent subsequences from bounded sequences. That is what applications need, and that is what we have captured here.
Our compactness theorem (Theorem 6.1) immediately implies that both W 1 , 1 ( I ) and H 1 ( I ) are discordantly reflexive.
Theorem 6.1
(Discordant compactness). Let ( u n ) W 1 , 1 ( I ) be bounded in the classical Sobolev norm, i.e., there exists C > 0 such that
u n W 1 , 1 = u n L 1 + u n L 1 C for all n 1 .
Then there exists a subsequence ( u n k ) and a function u L 1 ( I ) such that
u n k D u ,
i.e.,
D u n k ( u n k , u ) = I | u n k ( x ) u ( x ) | d μ u n k ( x ) 0 .
Proof. 
By Rellich–Kondrachov, extract a subsequence with u n u in L 1 . The measures μ u n (from (2.1)) are probability measures, so a subsequence converges weak-* to ν . For ε > 0 , choose compact K with ν ( I K ) < ε . Then μ u n ( I K ) < ε for large n. By Egorov, find E with | E | < δ where u n u uniformly on K E . Then
K E | u n u | d μ u n ε .
On E, since d μ u n ( 1 + | u n | ) d x and | u n u | is bounded, and u n is uniformly integrable (after extraction), the integral over E is small. The integral over I K is bounded by ε times the uniform bound on | u n u | . Thus D u n ( u n , u ) 0 . □
The proof for the L 2 -weighted Hilbert case is analogous.
Theorem 6.2.
The discordant Banach space X = W 1 , 1 ( I ) with the weighted L 1 discordant norm, and the discordant Hilbert space X = H 1 ( I ) with the weighted L 2 discordant norm, are discordantly reflexive.
Proof. 
Let ( u n ) be a bounded sequence in the classical norm of X. In the case X = W 1 , 1 ( I ) , this means u n W 1 , 1 C for all n. By Theorem 6.1, there exists a subsequence ( u n k ) and a function u L 1 ( I ) such that u n k D u . In the case X = H 1 ( I ) , the same theorem applies with the L 2 -weighted discordant norm. Thus, every bounded sequence has a discordantly convergent subsequence, which is precisely the definition of discordant reflexivity. □
This is a strong statement. It tells us that even though we have given up on a topology, our discordant spaces still possess the compactness property that matters most in reflexive Banach spaces. That is what we need to prove existence results in applications—like the ODE with discordant feedback that we study in Section 7.
Before we go any further, let us be clear about one thing. Discordant reflexivity is a sequential compactness property. It is not the same as classical reflexivity. In classical theory, the space W 1 , 1 ( I ) is not reflexive, simply because L 1 is not reflexive. That does not cause any trouble here. Our definition only asks that every sequence bounded in the classical norm has a subsequence that converges in the discordant sense. This is a weaker requirement than classical reflexivity, because the notion of convergence is different. We do not need a weak topology to make it work.

6.2. Discordant Separability: Countable Dense Subsets

The next concept we need is separability. In classical analysis, separability means that a space has a countable dense subset. That is, we can approximate any element of the space by elements taken from a fixed countable family. This property is essential in practice. It underpins numerical analysis, Galerkin methods, and the construction of bases. In our discordant setting, the standard definition of density does not quite fit. The reason is that our distance depends on the reference point. So we need to adapt the notion of density to the discordant distance. We will do that in what follows.
Definition 6.2
(Discordant separability). A discordant metric space ( X , d ) is called discordantly separable if there exists a countable set S X such that for every u X and every ε > 0 , there exists s S with
d ( u , s ) < ε .
Note that the distance is d ( u , s ) = u s u , which depends on the reference point u. Thus, for each u, we need an element s S that is close to u in the metric that is adapted to u itself. This is a stronger requirement than classical separability, because the metric changes with u. Nevertheless, for our concrete spaces, we can prove discordant separability by exploiting the control of the discordant norm by the classical norm.
Proposition 6.1.
Let X = H 1 ( I ) be endowed with the weighted L 2 discordant norm defined in Section 2. Then X is discordantly separable.
Proof. 
Let S be a countable dense subset of H 1 ( I ) with respect to the classical H 1 norm. Such a set exists because H 1 ( I ) is a separable Banach space; for example, one can take the set of polynomials with rational coefficients, which is countable and dense in H 1 ( I ) (since polynomials are dense in H 1 by the Stone–Weierstrass theorem and the density of C in H 1 ).
Fix u X and ε > 0 . We need to find s S such that
d ( u , s ) = u s u < ε .
Recall that
u s u 2 = I | u ( x ) s ( x ) | 2 d μ u ( x ) ,
where
d μ u ( x ) = 1 + | u ( x ) | 2 1 + u L 2 2 d x .
Since the density of μ u is bounded above by 1 + | u | 2 1 + u L 2 2 (because | u | 2 u L 2 2 almost everywhere), we have
u s u 2 1 + u L 2 2 1 + u L 2 2 I | u s | 2 d x = u s L 2 2 .
The density is 1 + | u | 2 1 + u L 2 2 , and since | u | 2 u L 2 2 , the numerator is at most 1 + u L 2 2 , so the density is at most 1. Thus μ u is absolutely continuous with respect to Lebesgue measure with density bounded above by 1. Hence,
u s u u s L 2 .
The discordant norm is actually smaller than the classical L 2 norm. Therefore, if we can find s S such that u s L 2 < ε , then we automatically have u s u < ε .
Since S is dense in H 1 ( I ) with respect to the H 1 norm, it is in particular dense with respect to the L 2 norm (because v L 2 v H 1 ). Thus, for the given u and ε > 0 , there exists s S such that
u s H 1 < ε ,
which implies u s L 2 < ε . Hence u s u u s L 2 < ε .
Thus, for every u X and every ε > 0 , there exists s S with d ( u , s ) < ε . Therefore X is discordantly separable. □
Remark 6.3.
One thing is worth pointing out. The proof we just gave actually shows something a bit stronger than what we needed. It shows that the discordant norm is always smaller than or equal to the classical L 2 norm. This is a direct consequence of how we chose the density for μ u , which is never larger than 1. The same idea works for the L 1 -weighted case as well. In that setting, the density is
1 + | u | 1 + u L 1 .
Because | u | is always less than or equal to u L 1 almost everywhere, the numerator is at most 1 + u L 1 . So the density is also bounded above by 1. Therefore, the same argument goes through without any change. It follows that W 1 , 1 ( I ) , with its weighted L 1 discordant norm, is discordantly separable as well.
Remark 6.4.
It may seem a bit surprising that the discordant norm is always smaller than the classical norm. After all, we introduced a new, adaptive way of measuring distance. One might expect it to be larger or at least different in a complicated way. But here, the weights actually make the distance smaller. The reason is that we normalized the measure to be a probability measure. This spreads the weight around, but it does not add to it. The total mass stays the same. As a result, the distance cannot grow beyond what it would be with the classical norm.
In practical terms, this means that discordant convergence is actually easier to achieve than classical convergence. If a sequence converges in the classical sense, in L 2 or in L 1 , then it also converges discordantly. There is no extra obstacle. But the reverse is not true. As we have already seen in the examples earlier, discordant convergence can happen even when classical convergence fails. The weights adapt to the sequence and make convergence possible where a fixed metric would not.

6.3. Summary and Consequences

We can now bring together the main results of this section and state them clearly.
Theorem 6.3.
Let X be either W 1 , 1 ( I ) with the weighted L 1 discordant norm, or H 1 ( I ) with the weighted L 2 discordant norm. Then:
(i) 
X is discordantly reflexive: every sequence bounded in the classical norm has a subsequence that converges in the discordant sense.
(ii) 
X is discordantly separable: there exists a countable set S such that for every u X and every ε > 0 , we can find s S with d ( u , s ) < ε .
These two properties are not just theoretical. They are exactly what we need to make the discordant framework useful in practice. Discordant reflexivity gives us convergent subsequences from bounded sequences. That is the key step in proving existence of solutions to variational problems and fixed-point equations. Discordant separability means we can approximate any element of the space using a countable family. That is essential for numerical methods, for constructing bases, and for any kind of computational work.
Remark 6.5.
It is useful to compare these discordant notions with their classical counterparts.
In classical Banach spaces, reflexivity is a topological property. It says that the closed unit ball is weakly compact. Discordant reflexivity is different. It is purely sequential and does not involve any topology. In fact, it is a weaker condition. We only need convergent subsequences, not compactness of the whole unit ball in some topology.
Classical separability means there is a countable set that is dense with respect to a fixed metric. Discordant separability asks for density with respect to a whole family of metrics, each one depending on the reference point. In our concrete examples, we were able to prove this because the discordant norm is always smaller than the classical norm. That made the requirement easier to satisfy.
These differences highlight the flexibility of the discordant framework. By relaxing the topological demands, we get a theory that still has the compactness and approximation properties we need for applications. At the same time, it allows for adaptive, state-dependent metrics that would be impossible in a fixed-topology setting.

7. Application: An Evolution Equation with Discordant Feedback

To demonstrate the practical relevance of the discordant framework, we now study a nonlocal parabolic equation where the reaction term depends on the adaptive distance between the current state and a target function. This problem is specifically designed so that classical compactness methods fail, and our discordant compactness theorem is essential to prove existence of a solution.

7.1. Problem Setting

Let Ω = ( 0 , 1 ) and let T > 0 be fixed. Consider the following initial-boundary value problem:
t u ( t , x ) x x u ( t , x ) = f D u ( t , · ) ( u ( t , · ) , φ ) , ( t , x ) ( 0 , T ) × Ω , u ( t , 0 ) = u ( t , 1 ) = 0 , t ( 0 , T ) , u ( 0 , x ) = u 0 ( x ) , x Ω ,
where:
  • φ H 0 1 ( Ω ) is a fixed target function (for instance, φ 0 ),
  • D u ( t , · ) ( u ( t , · ) , φ ) is the discordant distance between the current state u ( t , · ) and the target φ , measured with respect to the reference u ( t , · ) ,
  • f : R + R is a bounded continuous function (e.g., f ( s ) = s 1 + s ).
The discordant distance is taken in the weighted L 2 Hilbertian setting:
D v ( v , φ ) = Ω | v ( x ) φ ( x ) | 2 d μ v ( x ) 1 / 2 ,
with
d μ v ( x ) = 1 + | v ( x ) | 2 1 + v L 2 2 d x .
This equation models, for example, a reaction-diffusion process where the reaction rate depends on how far the current concentration profile u ( t , · ) is from a desired profile φ , but where the notion of "far" is adapted to the local variations of u itself. Such self-adaptive feedback appears in biological morphogenesis, active matter, and control theory.
The main difficulty lies in the nonlocal and self-adaptive nature of the term D u ( t , · ) ( u ( t , · ) , φ ) . For a standard reaction-diffusion equation with a reaction term g ( u ) , one typically proves existence by a fixed point argument in C ( [ 0 , T ] ; L 2 ( Ω ) ) using the compactness of the heat semigroup. Here, however, the reaction term depends on the whole function u ( t , · ) through the adaptive measure μ u ( t , · ) . Even if u n u in L 2 , the measures μ u n may not converge to μ u because the derivatives u n may not converge in L 2 (only weakly, but weak convergence does not guarantee convergence of the densities). Consequently, the map
u f ( D u ( u , φ ) )
may fail to be continuous in the classical L 2 topology. Hence, classical compactness arguments (e.g., Ascoli-Arzelà or the compactness of the heat semigroup in C ( [ 0 , T ] ; L 2 ) ) cannot be directly applied.
This is precisely where discordant compactness comes to the rescue. Although the sequence of derivatives may not converge strongly, the discordant compactness theorem (Theorem 6.1) guarantees that a subsequence converges in the discordant sense. Moreover, the discordant distance D u n ( u n , φ ) is exactly the quantity appearing in the reaction term, and its continuity with respect to discordant convergence follows from the definition. Thus, we can pass to the limit in the nonlinearity.

7.2. Mild Formulation and the Fixed-Point Operator

Let S ( t ) denote the heat semigroup on L 2 ( Ω ) with Dirichlet boundary conditions. A mild solution of the equation is a function u C ( [ 0 , T ] ; L 2 ( Ω ) ) satisfying the integral equation
u ( t ) = S ( t ) u 0 + 0 t S ( t s ) f D u ( s ) ( u ( s ) , φ ) d s , t [ 0 , T ] .
Define the operator T on C ( [ 0 , T ] ; L 2 ( Ω ) ) by
( T u ) ( t ) S ( t ) u 0 + 0 t S ( t s ) f D u ( s ) ( u ( s ) , φ ) d s .
A fixed point of T is a mild solution.
We need to show that T has a fixed point. The usual strategy is to apply Schauder’s fixed point theorem: find a closed, bounded, convex set B C ( [ 0 , T ] ; L 2 ( Ω ) ) invariant under T , and show that T is continuous and compact on B. However, as noted above, T is not continuous in the classical L 2 topology. We will instead work with the discordant convergence structure.

7.3. Discordant Continuity and Compactness

We first establish a continuity property of the map u D u ( u , φ ) .
Lemma 7.1.
If u n D u in H 1 ( Ω ) (i.e., u n u u n 0 ), then
D u n ( u n , φ ) D u ( u , φ ) .
Proof. 
By the triangle inequality,
| D u n ( u n , φ ) D u ( u , φ ) | | D u n ( u n , φ ) D u n ( u , φ ) | + | D u n ( u , φ ) D u ( u , φ ) | .
The first term is bounded by D u n ( u n , u ) = u n u u n 0 . For the second term, we use the fact that u n u in L 2 (from strong convergence in H 1 ) and the weak-* convergence of the measures μ u n to μ u (which follows from the compactness theorem and the boundedness of the derivatives in L 2 ). A standard dominated convergence argument then gives D u n ( u , φ ) D u ( u , φ ) . Hence, the lemma. □
Consequently, the composed map u f ( D u ( u , φ ) ) is continuous with respect to discordant convergence, since f is continuous.
Next, we need compactness of the operator T in the discordant sense. The heat semigroup S ( t ) is compact from L 2 ( Ω ) into H 1 ( Ω ) for t > 0 , and it maps bounded sets in C ( [ 0 , T ] ; L 2 ) into relatively compact sets in C ( ( 0 , T ] ; H 1 ) (by parabolic regularity). However, this compactness is classical, not discordant. The key insight is that discordant compactness (Theorem 6.1) guarantees that any sequence bounded in H 1 has a discordantly convergent subsequence. Since T u belongs to H 1 for t > 0 , we can use the discordant compactness theorem to extract a subsequence from a sequence of approximate solutions.
We can now state the main result.
Theorem 7.1.
Assume u 0 H 0 1 ( Ω ) and f : R + R is bounded and continuous. Then there exists a mild solution u C ( [ 0 , T ] ; L 2 ( Ω ) ) L ( 0 , T ; H 1 ( Ω ) ) of the nonlocal parabolic equation above, in the sense that
u ( t ) = S ( t ) u 0 + 0 t S ( t s ) f D u ( s ) ( u ( s ) , φ ) d s , t [ 0 , T ] .
Proof 
(Sketch of proof). The proof follows a standard Schauder fixed point argument, adapted to the discordant setting.
1.
Construction of an invariant set. Let B R = { v C ( [ 0 , T ] ; L 2 ( Ω ) ) : v ( t ) H 1 R t [ 0 , T ] } , where R is chosen large enough so that S ( t ) u 0 H 1 R / 2 for all t, and the contribution from the integral is bounded by R / 2 using the boundedness of f. Since the heat semigroup maps L 2 into H 1 for t > 0 , T maps B R into itself for a suitable R.
2.
Discordant continuity of T . If u n D u in the discordant sense on [ 0 , T ] (meaning sup t [ 0 , T ] u n ( t ) u ( t ) u n ( t ) 0 ), then by Lemma 7.1, D u n ( t ) ( u n ( t ) , φ ) D u ( t ) ( u ( t ) , φ ) for each t, and the convergence is uniform in t because of the boundedness and the dominated convergence theorem. Hence, f ( D u n ( t ) ( u n ( t ) , φ ) ) f ( D u ( t ) ( u ( t ) , φ ) ) uniformly in t. By the continuity of the heat semigroup in L 2 , we get T u n T u in C ( [ 0 , T ] ; L 2 ( Ω ) ) . Thus T is continuous with respect to discordant convergence.
3.
Discordant compactness of T ( B R ) . Let ( v n ) T ( B R ) . Then v n ( t ) = T u n for some u n B R . By the regularizing property of the heat semigroup, the set { v n ( t ) : n N , t [ ε , T ] } is bounded in H 1 ( Ω ) for every ε > 0 . A diagonal argument gives a subsequence (still denoted v n ) such that v n ( t ) v ( t ) in L 2 for each t, and moreover, for each fixed t, the derivatives v n ( t ) are bounded in L 2 . By the discordant compactness theorem (Theorem 6.1), applied to the sequence v n ( t ) for each t, there exists a subsequence such that v n ( t ) D v ( t ) for each t. By a standard diagonal argument, we can ensure this holds for all t in a dense subset. The equicontinuity in time (from the heat semigroup) allows us to extend to all t, yielding a subsequence v n k converging discordantly in C ( [ 0 , T ] ; L 2 ) . Thus, T ( B R ) is relatively sequentially compact in the discordant sense.
4.
Application of Schauder’s fixed point theorem. We need a fixed point theorem for sequentially compact, discordantly continuous maps. Although discordant spaces are not topological, the sequential Schauder theorem holds: if B R is convex, bounded, and sequentially closed in the discordant sense, and T : B R B R is discordantly continuous and T ( B R ) is relatively discordantly sequentially compact, then T has a fixed point. The proof is identical to the classical Schauder argument: starting with any u 0 B R , define u n + 1 = T u n . The discordant compactness gives a subsequence u n k converging discordantly to some u B R . By discordant continuity, u n k + 1 = T u n k converges discordantly to T u . Since u n k + 1 and u n k are the same sequence shifted, their discordant limits coincide, so u = T u . Thus, u is a fixed point.
This completes the proof. □

7.4. Discussion and Significance

The theorem demonstrates that discordant compactness is not merely an abstract curiosity but a powerful tool for solving nonlinear evolution equations where the nonlinearity involves adaptive, state-dependent metrics. Several features are worth highlighting:
  • Self-adaptive feedback: The reaction term depends on the discordant distance D u ( t , · ) ( u ( t , · ) , φ ) , which adapts to the current state u ( t , · ) . This is a genuine nonlocal, state-dependent effect that cannot be captured by a fixed metric.
  • Overcoming classical non-compactness: Even when the sequence u n converges only weakly in H 1 , the discordant compactness theorem provides a subsequence converging in the discordant sense, which is exactly the right convergence for the nonlinearity.
  • Generality: The proof does not rely on specific properties of the heat semigroup other than its regularizing effect. The same argument applies to any evolution equation governed by a compact semigroup, such as parabolic equations with more general elliptic operators or even some hyperbolic equations with damping.
  • Applications: Such equations arise in models of chemotaxis with adaptive sensing, where cells or organisms adjust their perception of gradients based on their own state; in control theory, where the cost functional depends on an adaptive distance to a target; and in image processing, where the metric for comparing images is adapted to the local structure.
This application shows that the discordant framework opens the door to a new class of nonlinear PDEs that were previously inaccessible due to the lack of appropriate compactness tools.

Conflicts of Interest

The author declares no conflicts of interest.

References

  1. Allaire, G. (1992). Homogenization and two-scale convergence. SIAM Journal on Mathematical Analysis, 23(6), 1482–1518.
  2. Attouch, H., Buttazzo, G., & Michaille, G. (2006). Variational Analysis in Sobolev and BV Spaces. SIAM.
  3. Bao, D., Chern, S.-S., & Shen, Z. (2000). An Introduction to Riemann-Finsler Geometry. Springer.
  4. Bellet, A., Habrard, A., & Sebban, M. (2013). A survey on metric learning for feature vectors and structured data. arXiv preprint arXiv:1306.6709.
  5. Bensoussan, A., Lions, J.-L., & Papanicolaou, G. (1978). Asymptotic Analysis for Periodic Structures. North-Holland.
  6. Brezis, H. (2011). Functional Analysis, Sobolev Spaces and Partial Differential Equations. Universitext. Springer.
  7. Cobzaș, S. (2013). Functional Analysis in Asymmetric Normed Spaces. Birkhäuser.
  8. Dunford, N., & Pettis, B. J. (1940). Linear operations on summable functions. Transactions of the American Mathematical Society, 47, 323–392.
  9. Evans, L. C. (2010). Partial Differential Equations. Second edition. Graduate Studies in Mathematics, 19. American Mathematical Society.
  10. Hairer, E., Nørsett, S. P., & Wanner, G. (1993). Solving Ordinary Differential Equations I: Nonstiff Problems. Second edition. Springer Series in Computational Mathematics, 8. Springer.
  11. Kunzi, H. P. A. (2001). Nonsymmetric distances and their associated topologies. In Handbook of the History of General Topology, Vol. 3, 853–968. Springer.
  12. Lions, P.-L. (1984). The concentration-compactness principle in the calculus of variations. The locally compact case, part 1. Annales de l’Institut Henri Poincaré C, Analyse non linéaire, 1(2), 109–145.
  13. Lions, P.-L. (1984). The concentration-compactness principle in the calculus of variations. The locally compact case, part 2. Annales de l’Institut Henri Poincaré C, Analyse non linéaire, 1(4), 223–283.
  14. Lions, P.-L. (1985). The concentration-compactness principle in the calculus of variations. The limit case, part 1. Revista Matemática Iberoamericana, 1(1), 145–201.
  15. Shen, Z. (2001). Lectures on Finsler Geometry. World Scientific.
  16. Tartar, L. (2009). The General Theory of Homogenization: A Personalized Introduction. Lecture Notes of the Unione Matematica Italiana, 7. Springer.
  17. Xing, E. P., Jordan, M. I., Russell, S. J., & Ng, A. Y. (2003). Distance metric learning with application to clustering with side-information. In Advances in Neural Information Processing Systems (NIPS 2002), 15, 521–528.
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

© 2026 MDPI (Basel, Switzerland) unless otherwise stated

Accessibility

Disclaimer

Terms of Use

Privacy Policy

Privacy Settings