Colorectal cancer (CRC), a cancer of the large intestine and rectum, has one of the highest incidence and mortality rates, with incidences expected to nearly double in the next 25 years. The development of CRC may be caused by a collection of mutations via the chromosomal instability pathway, which results in approximately 70% of sporadic CRC cases, or the microsatellite instability pathway. At the same time, there are various modifiable and non-modifiable risk factors that increase one's chances of developing a CRC causing mutation via these pathways. There are three widely used treatments for CRC: surgical resection, chemotherapy, and immunotherapy. Surgical resection remains the standard for CRC that has not metastasized with various options available such as open surgery, laparoscopy, and robotic surgery. In recent years, there has also been a plethora of new research into chemotherapies and immunotherapies as important treatments for metastatic or complicated CRC cases. In this review, we highlight the pathogenesis, risk factors, and treatments for CRC, while also providing a short summary of the diagnosis. Such a study will be helpful for clinicians to better manage patients with CRC.
Citation: Derek A. Corica, Dylan M. Schaap, Trenton G. Mayberry, Braydon C. Cowan, Mark R. Wakefield, Yujiang Fang. New depths: exploring the current landscape of colorectal cancer[J]. AIMS Medical Science, 2025, 12(1): 105-123. doi: 10.3934/medsci.2025008
[1] | Karl Hajjar, Lénaïc Chizat . On the symmetries in the dynamics of wide two-layer neural networks. Electronic Research Archive, 2023, 31(4): 2175-2212. doi: 10.3934/era.2023112 |
[2] | Eray Önler . Feature fusion based artificial neural network model for disease detection of bean leaves. Electronic Research Archive, 2023, 31(5): 2409-2427. doi: 10.3934/era.2023122 |
[3] | Dong-hyeon Kim, Se-woon Choe, Sung-Uk Zhang . Recognition of adherent polychaetes on oysters and scallops using Microsoft Azure Custom Vision. Electronic Research Archive, 2023, 31(3): 1691-1709. doi: 10.3934/era.2023088 |
[4] | Ziqing Yang, Ruiping Niu, Miaomiao Chen, Hongen Jia, Shengli Li . Adaptive fractional physical information neural network based on PQI scheme for solving time-fractional partial differential equations. Electronic Research Archive, 2024, 32(4): 2699-2727. doi: 10.3934/era.2024122 |
[5] | Ilyоs Abdullaev, Natalia Prodanova, Mohammed Altaf Ahmed, E. Laxmi Lydia, Bhanu Shrestha, Gyanendra Prasad Joshi, Woong Cho . Leveraging metaheuristics with artificial intelligence for customer churn prediction in telecom industries. Electronic Research Archive, 2023, 31(8): 4443-4458. doi: 10.3934/era.2023227 |
[6] | Kai Huang, Chang Jiang, Pei Li, Ali Shan, Jian Wan, Wenhu Qin . A systematic framework for urban smart transportation towards traffic management and parking. Electronic Research Archive, 2022, 30(11): 4191-4208. doi: 10.3934/era.2022212 |
[7] | Alejandro Ballesteros-Coll, Koldo Portal-Porras, Unai Fernandez-Gamiz, Iñigo Aramendia, Daniel Teso-Fz-Betoño . Generative adversarial network for inverse design of airfoils with flow control devices. Electronic Research Archive, 2025, 33(5): 3271-3284. doi: 10.3934/era.2025144 |
[8] | Ruyu Yan, Jiafei Jin, Kun Han . Reinforcement learning for deep portfolio optimization. Electronic Research Archive, 2024, 32(9): 5176-5200. doi: 10.3934/era.2024239 |
[9] | Xin Liu, Yuan Zhang, Kai Zhang, Qixiu Cheng, Jiping Xing, Zhiyuan Liu . A scalable learning approach for user equilibrium traffic assignment problem using graph convolutional networks. Electronic Research Archive, 2025, 33(5): 3246-3270. doi: 10.3934/era.2025143 |
[10] | Mohd. Rehan Ghazi, N. S. Raghava . Securing cloud-enabled smart cities by detecting intrusion using spark-based stacking ensemble of machine learning algorithms. Electronic Research Archive, 2024, 32(2): 1268-1307. doi: 10.3934/era.2024060 |
Colorectal cancer (CRC), a cancer of the large intestine and rectum, has one of the highest incidence and mortality rates, with incidences expected to nearly double in the next 25 years. The development of CRC may be caused by a collection of mutations via the chromosomal instability pathway, which results in approximately 70% of sporadic CRC cases, or the microsatellite instability pathway. At the same time, there are various modifiable and non-modifiable risk factors that increase one's chances of developing a CRC causing mutation via these pathways. There are three widely used treatments for CRC: surgical resection, chemotherapy, and immunotherapy. Surgical resection remains the standard for CRC that has not metastasized with various options available such as open surgery, laparoscopy, and robotic surgery. In recent years, there has also been a plethora of new research into chemotherapies and immunotherapies as important treatments for metastatic or complicated CRC cases. In this review, we highlight the pathogenesis, risk factors, and treatments for CRC, while also providing a short summary of the diagnosis. Such a study will be helpful for clinicians to better manage patients with CRC.
Colorectal cancer;
Chromosomal instability pathway;
Microsatellite instability pathway;
Laparoscopic-assisted surgery;
Robot assisted surgery;
Immunotherapy;
Immune-related adverse events
Chemotaxis is the property of cells to move in an oriented manner in response to an increasing concentration of chemo-attractant or decreasing concentration of chemo-repellent, where the former is referred to as attractive chemotaxis and the later to repulsive chemotaxis. To begin with, it is important to study the quasilinear Keller-Segel system as follows
{ut=∇⋅(D(u)∇u)−χ∇⋅(ϕ(u)∇v),x∈Ω,t>0,τvt=Δv−αv+βu,x∈Ω,t>0, | (1.1) |
subject to homogeneous Neumann boundary conditions, where the functions D(u) and ϕ(u) denote the strength of diffusion and chemoattractant, respectively, and the function u=u(x,t) idealizes the density of cell, v=x(x,t) represents the concentration of the chemoattractant. Here the attractive (repulsive) chemotaxis corresponds to χ>0 (χ<0), and |χ|∈R∖{0} measures the strength of chemotactic response. The parameters τ∈{0,1}, and α,β>0 denote the production and degradation rates of the chemical. The above system describes the chemotactic interaction between cells and one chemical signal (either attractive or repulsive), and it has been investigated quite extensively on the existence of global bounded solutions or the occurrence of blow-up in finite time in the past four decades. In particular, the system (1.1) is the prototypical Keller-Segel model [1] when D(u)=1,ϕ(u)=u. In the case τ=1, there are many works to show that the solution is bounded [2,3,4,5], and blow-up in finite time [6,7,8,9,10,11]. If the cell's movement is much slower than the chemical signal diffusing, the second equation of (1.1) is reduced to 0=Δv−M+u, where M:=1|Ω|∫Ωu(x,t)dx and the simplified system has many significant results [12,13,14,15].
For further information concerning nonlinear signal production, when the chemical signal function is denoted by g(u), authors derived for more general nonlinear diffusive system as follows
{ut=∇⋅(D(u)∇u)−∇⋅(ϕ(u)∇v),x∈Ω,t>0,0=Δv−M+g(u),x∈Ω,t>0, | (1.2) |
where M:=1|Ω|∫Ωg(u(x,t))dx. Recently, when D(u)=u−p,ϕ(u)=u and g(u)=ul, it has been shown that all solutions are global and uniformly bounded if p+l<2n, whereas p+l>2n implies that the solution blows up in finite time [16]. What's more, there are many significant works [17,18,19] associated with this system.
Subsequently, the attraction-repulsion system has been introduced in ([20,21]) as follows
{ut=Δu−χ∇⋅(u∇v)+ξ∇⋅(u∇w),x∈Ω,t>0,τ1vt=Δv+αu−βv,x∈Ω,t>0,τ2wt=Δw+δu−γw,x∈Ω,t>0, | (1.3) |
subject to homogeneous Neumann boundary conditions, where χ,ξ,α,β,δ,γ>0 are constants, and the functions u(x,t),v(x,t) and w(x,t) denote the cell density, the concentration of the chemoattractant and chemorepellent, respectively. The above attraction-repulsion chemotaxis system has been studied actively in recent years, and there are many significant works to be shown as follows.
For example, if τ1=τ2=0, Perthame [22] investigated a hyperbolic Keller-Segel system with attraction and repulsion when n=1. Subsequently, Tao and Wang [23] proved that the solution of (1.3) is globally bounded provided ξγ−χα>0 when n≥2, and the solution would blow up in finite time provided ξγ−χα<0,α=β when n=2. Then, there is a blow-up solution when χα−ξγ>0,δ≥β or χαδ−ξγβ>0,δ<β for n=2 [24]. Moreover, Viglialoro [25] studied the explicit lower bound of blow-up time when n=2. In another hand, if τ1=1,τ2=0, Jin and Wang [26] showed that the solution is bounded when n=2 with ξγ−χα≥0, and Zhong et al. [27] obtained the global existence of weak solution when ξγ−χα≥0 for n=3. Furthermore, if τ1=τ2=1, Liu and Wang [28] obtained the global existence of solutions, and Jin et al. [29,30,31] also showed a uniform-in-time bound for solutions. In addition, there are plenty of available results of the attraction-repulsion system with logistic terms [32,33,34,35,36,37,38,39,40], and for further information concerning (1.3) based on the nonlinear signal production, it was used to model the aggregation patterns formed by some bacterial chemotaxis in [41,42,43].
We turn our eyes into a multi-dimensional attraction-repulsion system
{ut=Δu−χ∇⋅(ϕ(u)∇v)+ξ∇⋅(ψ(u)∇w),x∈Ω,t>0,τ1vt=Δv−μ1(t)+f(u),x∈Ω,t>0,τ2wt=Δw−μ2(t)+g(u),x∈Ω,t>0, | (1.4) |
where Ω∈Rn(n≥2) is a bounded domain with smooth boundary, μ1(t)=1|Ω|∫Ωf(u)dx,μ2(t)=1|Ω|∫Ωg(u)dx and τ1,τ2∈{0,1}. Later on, the system (1.4) has attracted great attention of many mathematicians. In particular, when ϕ(u)=ψ(u)=u,f(u)=uk and g(u)=ul, Liu and Li [44] proved that all solutions are bounded if k<2n, while blow-up occurs for k>l and k>2n in the case τ1=τ2=0.
Inspired by the above literature, we are devoted to deal with the quasilinear attraction-repulsion chemotaxis system
{ut=∇⋅(D(u)∇u)−χ∇⋅(u∇v)+ξ∇⋅(u∇w),x∈Ω,t>0,0=Δv−μ1(t)+f1(u),x∈Ω,t>0,0=Δw−μ2(t)+f2(u),x∈Ω,t>0,∂u∂ν=∂v∂ν=∂w∂ν=0,x∈∂Ω,t>0,u(x,0)=u0(x),x∈Ω, | (1.5) |
in a bounded domain Ω⊂Rn,n≥2 with smooth boundary, where ∂∂ν denotes outward normal derivatives on ∂Ω. The function u(x,t) denotes the cell density, v(x,t) represents the concentration of an attractive signal (chemo-attractant), and w(x,t) is the concentration of a repulsive signal (chemo-repellent). The parameters satisfy χ,ξ≥0, which denote the strength of the attraction and repulsion, respectively. Here μ1(t)=1|Ω|∫Ωf1(u(x,t))dx, μ2(t)=1|Ω|∫Ωf2(u(x,t))dx, and f1,f2 are nonnegative Hölder continuous functions.
In the end, we propose the following assumptions on D,f1,f2 and u0 for the system (1.5).
(I1) The nonlinear diffusivity D is positive function satisfying
D∈C2([0,∞)). | (1.6) |
(I2) The function fi is nonnegative and nondecreasing and satisfies
fi∈⋃θ∈(0,1)Cθloc([0,∞))∩C1((0,∞)) | (1.7) |
with i∈{1,2}.
(I3) The initial datum
u0∈⋃θ∈(0,1)Cθ(¯Ω) is nonnegative and radially decreasing,∂u0∂ν=0 on ∂Ω. | (1.8) |
The goal of the article is twofold. On the one hand, we need to find out the mutual effect of the nonlinear diffusivity D(u) and the nonlinear signal production fi(u)(i=1,2). On the other hand, we need to make a substantial step towards the dynamic of blowing up in finite time. Hence, we draw our main results concerning (1.5) read as follows.
Theorem 1.1. Let n≥2, R>0 and Ω=BR(0)⊂Rn be a ball, and suppose that the function D satisfies (1.6) and f1,f2 are assumed to fulfill (1.7) as well as
D(u)≤d(1+u)m−1, f1(u)≥k1(1+u)γ1, f2(u)≤k2(1+u)γ2 for all u≥0, |
with m∈R, k1,k2,γ1,γ2,d>0 and
γ1>γ2 and 1+γ1−m>2n. | (1.9) |
For any M>0 there exist ε=ε(γ1,M,R)∈(0,M) and r∗=r∗(γ1,M,R)∈(0,R) such that if u0 satisfies (1.8) with
∫Ωu0=M and ∫Br∗(0)u0≥M−ε, |
then the corresponding solution of the system (1.5) blows up in finite time.
Theorem 1.2. Let n≥2, Ω⊂Rn be a smooth bounded domain, and suppose that the function D satisfies (1.6) and f1,f2 are assumed to fulfill (1.7) as well as
D(u)≥d(1+u)m−1, f1(u)≤k1(1+u)γ1, f2(u)=k2(1+u)γ2 for all u≥0, |
with m∈R, k1,k2,γ1,γ2,d>0 and
γ2<1+γ1<2n+m. | (1.10) |
Then for each u0∈⋃θ∈(0,1)Cθ(¯Ω), u0≥0 with ∂u0∂ν=0 on ∂Ω, and the system (1.5) admits a unique global classical solution (u,v,w) with
u,v,w∈C2,1(¯Ω×(0,∞))∩C0(¯Ω×[0,∞)). |
Furthermore, u,v and w are all non-negative and bounded.
The structure of this paper reads as follows: In section 2, we will show the local-in-time existence of a classical solution to the system (1.5) and some lemmas that we will use later. In section 3, we will prove Theorem 1.1 by establishing a superlinear differential inequality. In section 4, we will solve the boundedness of u in L∞ and prove Theorem 1.2.
Firstly, we state one result concerning local-in-time existence of a classical solution to the system (1.5). Then, we denote some new variables to transfer the original equations in (1.5) to a new system according to the ideas in [19,20,21,22,23,24,25]. In addition, in order to prove the main result, we will state some lemmas which will be needed later.
Lemma 2.1. Let Ω⊂Rn with n≥2 be a bounded domain with smooth boundary. Assume that D fulfills (1.6), f1,f2 satisfy (1.7) and u0∈⋃θ∈(0,1)Cθ(¯Ω) with ∂u0∂ν=0 on ∂Ω as well as u0≥0, then there exist Tmax∈(0,∞] and a classical solution (u,v,w) to (1.5) uniquely determined by
{u∈C0(¯Ω×[0,Tmax))∩C2,1(¯Ω×(0,Tmax)),v∈∩q>nL∞((0,Tmax);W1,q(Ω))∩C2,0(¯Ω×(0,Tmax)),w∈∩q>nL∞((0,Tmax);W1,q(Ω))∩C2,0(¯Ω×(0,Tmax)). |
In addition, the function u≥0 in Ω×(0,Tmax) and if Tmax<∞ then
limt↗Tmaxsup‖u(⋅,t)‖L∞(Ω)=∞. | (2.1) |
Moreover,
∫Ωv(⋅,t)=0,∫Ωw(⋅,t)=0 for all t∈(0,Tmax). | (2.2) |
Finally, the solution (u,v,w) is radially symmetric with respect to |x| if u0 satisfies (1.8).
Proof. The proof of this lemma needs to be divided into four steps. Firstly, the method to solve the local time existence of the classical solution to the problem (1.5) is based on a standard fixed point theorem. Next, we will use the standard extension theorem to obtain (2.1). Then, we are going to use integration by parts to deduce (2.2). Finally, we would use the comparison principle to conclude that the solution is radially symmetric. For the details, we refer to [45,46,47,48].
For the convenience of analysis and in order to prove Theorem 1.1, we set h=χv−ξw, then the system (1.5) is rewritten as
{ut=∇⋅(D(u)∇u)−∇⋅(u∇h),x∈Ω,t>0,0=Δh−μ(t)+f(u),x∈Ω,t>0,∂u∂ν=∂h∂ν=0,x∈∂Ω,t>0,u(x,0)=u0(x),x∈Ω, | (2.3) |
where μ(t)=χμ1(t)−ξμ2(t)=1|Ω|∫Ωf(u(x,t))dx and f(u)=χf1(u)−ξf2(u).
For the same reason, we will convert the system (2.3) into a scalar equation. Let us assume Ω=BR(0) with some R>0 is a ball and the initial data u0=u0(r) with r=|x|∈[0,R] satisfies (1.8). In the radial framework, the system (2.3) can be transformed into the following form
{rn−1ut=(rn−1D(u)ur)r−(rn−1uhr)r,r∈(0,R),t>0,0=(rn−1hr)r−rn−1μ(t)+rn−1f(u),r∈(0,R),t>0,ur=hr=0, r=R,t>0,u(r,0)=u0(r),r∈(0,R). | (2.4) |
Lemma 2.2. Let us introduce the function
U(s,t)=n∫s1n0ρn−1u(ρ,t)dρ,s=rn∈[0,Rn], t∈(0,Tmax), |
then
Us(t)=u(s1n,t), Uss(t)=1ns1n−1ur(s1n,t), | (2.5) |
and
Ut(s,t)=n2s2−2nD(Us)Uss−sμ(t)Us+Us⋅∫s0f(Us(σ,t))dσ. | (2.6) |
Proof. Firstly, integrating the second equation of (2.4) over (0,r), we have
rn−1hr(r,t)=rnnμ(t)−∫r0ρn−1f(u(ρ,t))dρ, |
so
s1−1nhr(s1n,t)=snμ(t)−1n∫s0f(u(σ1n,t))dσ,∀s∈(0,Rn), t∈(0,Tmax). |
Then, a direct calculation yields
Us(s,t)=u(s1n,t),∀s∈(0,Rn), t∈(0,Tmax), |
and
Uss(s,t)=1ns1n−1ur(s1n,t),∀s∈(0,Rn), t∈(0,Tmax), |
as well as
Ut(s,t)=n∫s1n0ρn−1ut(ρ,t)dρ=n2s2−2nD(Us)Uss−ns1−1nUshr=n2s2−2nD(Us)Uss−sμ(t)Us+Us⋅∫s0f(Us(σ,t))dσ |
for all s∈(0,Rn) and t∈(0,Tmax).
Furthermore, by a direct calculation and (1.7), we know that the functions U and f satisfy the following results
{Us(s,t)=u(s1n,t)>0,s∈(0,Rn),t∈(0,Tmax),U(0,t)=0,U(Rn,t)=nωn∫Ωu(⋅,t)=nMωn,t∈[0,Tmax),|f(s)|,f1(s),f2(s)≤C0,0≤s≤A,C0=C0(A)>0, | (2.7) |
where ωn=n|B1(0)| and A is a positive constant.
Lemma 2.3. Suppose that (1.7), (1.8) and (2.7) hold, then we have
hr(r,t)=1nμ(t)r−r1−n∫r0ρn−1f(u(ρ,t))dρfor all r∈(0,R),t∈(0,Tmax). |
In particular,
hr(r,t)≤1n(μ(t)+C0)r. | (2.8) |
Proof. By integration the second equation in (2.4), we obtain that
rn−1hr=μ(t)⋅∫r0ρn−1dρ−∫r0ρn−1f(u(ρ,t))dρ for all r∈(0,R),t∈(0,Tmax). |
According to (1.9), we can easily get that f(u)≥0 if u≥C∗=max{0,(k2ξk1χ)1γ1−γ2−1}, and split
∫r0ρn−1f(u(ρ,t))dρ=∫r0χ{u(⋅,t)≥C∗}(ρ)⋅ρn−1f(u(ρ,t))dρ+∫r0χ{u(⋅,t)<C∗}(ρ)⋅ρn−1f(u(ρ,t))dρ. |
Combining these we have
hr=1nμ(t)r−r1−n∫r0χ{u(⋅,t)≥C∗}(ρ)⋅ρn−1f(u(ρ,t))dρ−r1−n∫r0χ{u(⋅,t)<C∗}(ρ)⋅ρn−1f(u(ρ,t))dρ≤1nμ(t)r−r1−n∫r0χ{u(⋅,t)<C∗}(ρ)⋅ρn−1f(u(ρ,t))dρ≤1nμ(t)r+C0r1−n∫r0χ{u(⋅,t)<C∗}(ρ)⋅ρn−1dρ≤1nμ(t)r+C0r1−n∫r0ρn−1dρ≤1n(μ(t)+C0)r, |
so we complete this proof.
To show the existence of a finite-time blow-up solution of (2.4), we need to prove that Uss is nonpositive by the following lemma. The proof follows the strategy in [48].
Lemma 2.4. Suppose that D,f and u0 satisfy (I1),(I2) and (I3) respectively. Then
ur(r,t)≤0 for all r∈(0,R),t∈(0,Tmax). | (2.9) |
Moreover,
Uss(s,t)≤0 for all r∈(0,R),t∈(0,Tmax). | (2.10) |
Proof. Without loss of generality we may assume that u0∈C2 ([0,∞)) and f∈C2([0,∞)). Applying the regularity theory in ([49,50]), we all know that u and ur belong to C0([0,R]×[0,T))∩C2,1((0,R)×(0,T)) and we fixed T∈(0,Tmax). From (2.4), we have for r∈(0,R) and t∈(0,T)
hrr+n−1rhr=μ(t)−f(u), | (2.11) |
and from (2.4) we obtain
urt=((D(u)ur)r+n−1rD(u)ur+uf(u)−uμ(t)−urhr)r=(D(u)ur)rr+a1(D(u)ur)r+a2urr+bur, |
for all r∈(0,R) and t∈(0,T), where
a1(r,t)=n−1r,a2(r,t)=−hr,b(r,t)=−n−1r2D(u)−μ(t)−hrr+f(u)+uf′(u), |
for all r∈(0,R) and t∈(0,T). Moreover, we have hr≤rn(μ(t)+C0) by (2.8) and from (2.11) such that
−hrr=n−1rhr−μ(t)+f(u)≤n−1nμ(t)+n−1nC0−μ(t)+f(u)≤f(u)+C0for all r∈(0,R) and t∈(0,T), |
then setting c1:=sup(r,t)∈(0,R)×(0,T)(2f(u)+uf′(u)+C0), we obtain
b(r,t)≤c1for all r∈(0,R) and t∈(0,T), |
and we introduce
c2:=sup(r,t)∈(0,R)×(0,T)((D(u))rr+a1(D(u))r)<∞, |
and set c3=2(c1+c2+1). Since ur(r,t)=0 for r∈{0,R},t∈(0,T) (because u is radially symmetric) and u0r≤0, the function y:[0,R]×[0,T]→R, (r,t)↦ur(r,t)−εec3t belongs to C0([0,R]×[0,T]) and fulfills
{yt=(D(u)(y+εec3t))rr+a1(D(u)(y+εec3t))r+a2yr+b(y+εec3t)−c3εec3t=(D(u)y)rr+a1(D(u)y)r+a2yr+by+εec3t((D(u))rr+a1(D(u))r+b−c3)≤(D(u)y)rr+a1(D(u)y)r+a2yr+by+εec3t(c1+c2−c3),in (0,R)×(0,T),y<0,on {0,R}×(0,T),y(⋅,0)<0,in (0,R). | (2.12) |
By the estimate for y(⋅,0) in (2.12) and continuity of y, the time t0:=sup{t∈(0,T):y≤0 in [0,R]×(0,T)}∈(0,T] is defined. Suppose that t0<T, then there exists r0∈[0,R] such that y(r0,t0)=0 and y(r,t)≤0 for all r∈[0,R] and t∈[0,t0]; hence, yt(r0,t0)≥0. As D≥0 in [0,∞), not only y(⋅,t0) but also z:(0,R)→R,r⟼D(u(r,t0))y(r,t0) attains its maximum 0 at r0. Since the second equality in (2.12) asserts r0∈(0,R), we conclude zrr(r0)≤0,zr(r0)=0 and yr(r0,t0)=0. Hence, we could obtain the contradiction
0≤yt(r0,t0)≤zrr(r0)+a1(r0,t0)zr(r0)+a2(r0,t0)yr(r0,t0)+b(r0,t0)y(r0,t0)+εec3t0(c1+c2−c3)≤−c32εec3t0<0, |
since we have
c1+c2≤c32. |
So that t0=T, implying y≤0 in [0,R]×[0,T] and hence ur≤εec3t in [0,R]×[0,T]. Letting first ε↘0 and then T↗Tmax, this proves that ur≤0 in [0,R]×[0,Tmax), and we have Uss≤0 because of (2.5).
In this section our aim is to establish a function and to select appropriate parameters such that the function satisfies ODI, which means finiteness of Tmax by counter evidence. Firstly, we introduce a moment-like functional as follows
ϕ(t):=∫s00s−γ(s0−s)U(s,t)ds,t∈[0,Tmax), | (3.1) |
with γ∈(−∞,1) and s0∈(0,Rn). As a preparation of the subsequent analysis of ϕ, we denote
Sϕ:={t∈(0,Tmax)|ϕ(t)≥nM−s0(1−γ)(2−γ)ωn⋅s2−γ0}. | (3.2) |
The following lemma provides a lower bound for U.
Lemma 3.1. Let γ∈(−∞,1) and s0∈(0,Rn), then
U(s02,t)≥1ωn⋅(nM−4s02γ(3−γ)). | (3.3) |
Proof. If (3.3) was false for some t∈Sϕ such that U(s02,t)<1ωn⋅(nM−4s02γ(3−γ)), then necessarily δ:=4s02γ(3−γ)<nM. By the monotonicity of U(⋅,t) we would obtain that U(s,t)<nM−δωn for all s∈(0,s02). Since U(s,t)<nMωn for all s∈(0,Rn), we have
ϕ(t)<nM−δωn⋅∫s020s−γ(s0−s)ds+nMωn⋅∫s0s02s−γ(s0−s)ds=nMωn⋅∫s00s−γ(s0−s)ds−δωn⋅∫s020s−γ(s0−s)ds |
=nMωn⋅s2−γ0(1−γ)(2−γ)−δωn⋅2γ(3−γ)s2−γ04(1−γ)(2−γ). |
In view of the definition of Sϕ, we find that nM−s0<nM−2γ(3−γ)δ4, which contradicts our definition of δ.
An upper bound for μ is established by the following lemma.
Lemma 3.2. Let γ∈(−∞,1) and s0>0 such that s0≤Rn6. Then the function μ(t) has property that
μ(t)≤C1+12s∫s0f(Us(σ,t))dσ for all s∈(0,s0) and any t∈Sϕ, | (3.4) |
where C1=χ2C0+C0+C23+C3=13(χ2C0+C0+χk1(γ1−γ2)2γ2(2ξk2γ2χk1γ1)γ1γ1−γ2)+χf1(2δωns0).
Proof. First for any fixed t∈Sϕ, we may invoke Lemma 3.1 to see that
U(s02,t)≥nM−δωn, |
and thus, as U≤nMωn,
U(s0,t)−U(s02,t)s02≤nMωn−nM−δωns02=2δωns0. |
However, by concavity of U(⋅,t), as asserted by Lemma 2.4,
U(s0,t)−U(s02,t)s02≥Us(s0,t)≥Us(s,t) for all s∈(s0,Rn). |
Then let s0∈(0,Rn), we know that
μ(t)=1Rn∫s00f(Us(σ,t))dσ+1Rn∫Rns0f(Us(σ,t))dσ=1Rn∫s0f(Us(σ,t))dσ+1Rn∫s0sf(Us(σ,t))dσ+1Rn∫Rns0f(Us(σ,t))dσ,∀t∈(0,Tmax). | (3.5) |
Since γ1>γ2 and Young's inequality such that ξf2(u)≤ξk2(1+u)γ2≤χk12(1+u)γ1+C2≤χ2f1(u)+C2 with C2=χk1(γ1−γ2)2γ2(2ξk2γ2χk1γ1)γ1γ1−γ2 for u≥0, then for all s∈(0,Rn) and t∈(0,Tmax) we show that
χ2f1(Us(s,t))−C2≤f(Us(s,t))≤χf1(Us(s,t)). | (3.6) |
Accordingly, by the monotonicity of Us(⋅,t) along with (1.7) and (3.6), we have
∫s0sf(Us(σ,t))dσ≤∫s0sχf1(Us(σ,t))dσ≤∫s0sχf1(Us(s,t))dσ≤s0χf1(Us(s,t)),∀s∈(0,s0), t∈(0,Tmax). |
Since the condition of (2.7) implies that
∫s0f(Us(σ,t))dσ=∫s0χ{Us(⋅,t)≥1}(σ)⋅f(Us(σ,t)dσ+∫s0χ{Us(⋅,t)<1}(σ)⋅f(Us(σ,t)dσ≥∫s0χ{Us(⋅,t)≥1}(σ)⋅(χ2f1(Us(σ,t))−C2)dσ−C0s≥∫s0χ{Us(⋅,t)≥1}(σ)⋅χ2f1(Us(σ,t))dσ−(C0+C2)s=∫s0χ2f1(Us(σ,t))dσ−∫s0χ{Us(⋅,t)<1}(σ)⋅χ2f1(Us(σ,t))dσ−(C0+C2)s≥∫s0χ2f1(Us(s,t))dσ−χ2C0s−(C0+C2)s≥sχ2f1(Us(s,t))−(χ2C0+C0+C2)s. |
Therefore, we obtain
∫s0sf(Us(σ,t))dσ≤2s0s∫s0f(Us(σ,t))dσ+2(χ2C0+C0+C2)s0. |
Since (3.5) we have for all s∈(0,s0)
1Rn∫s0f(Us(σ,t))dσ+1Rn∫s0sf(Us(σ,t))dσ≤1Rn∫s0f(Us(σ,t))dσ+2s0Rns∫s0f(Us(σ,t))dσ+2(χ2C0+C0+C2)s0Rn, | (3.7) |
where s0≤Rn6 such that 1Rn≤16s0≤16s, 2s0Rns≤13s and s0Rn≤16 for all s∈(0,s0). Finally, we estimate the last summand of (3.5)
1Rn∫Rns0f(Us(σ,t))dσ≤1Rn∫Rns0χf1(Us(σ,t))dσ≤χf1(2δωns0)=C3. | (3.8) |
Together with (3.5), (3.7) and (3.8) imply (3.4).
Lemma 3.3. Assume that γ∈(−∞,1) satisfying
γ<2−2n, |
and s0∈(0,Rn6]. Then the function ϕ:[0,Tmax)→R defined by (3.1) belongs to C0([0,Tmax))∩C1((0,Tmax)) and satisfies
ϕ′(t)≥n2∫s00s2−2n−γ(s0−s)UssD(Us)ds+12∫s00s−γ(s0−s)Us⋅{∫s0f(Us(σ,t))dσ}ds−C1∫s00s1−γ(s0−s)Usds=:J1(t)+J2(t)+J3(t), | (3.9) |
for all t∈[0,Tmax), where C1 is defined in Lemma 3.2.
Proof. Combining (2.6) and (3.4) we have
Ut(s,t)=n2s2−2nD(Us)Uss−sμ(t)Us+Us⋅∫s0f(Us(σ,t))dσ≥n2s2−2nUssD(Us)+12Us⋅∫s0f(Us(σ,t))dσ−C1sUs. |
Notice ϕ(t) conforms ϕ(t)=∫s00s−γ(s0−s)U(s,t)ds. So (3.9) is a direct consequence.
Lemma 3.4. Let s0∈(0,Rn6], and γ∈(−∞,1) satisfying γ<2−2n. Then J1(t) in (3.9) satisfies
J1(t)≥−I, | (3.10) |
where
I:={−n2dm(2−2n−γ)∫s00s1−2n−γ(s0−s),m<0,n2d(2−2n−γ)∫s00s1−2n−γ(s0−s)ln(Us+1),m=0,n2dm(2−2n−γ)∫s00s1−2n−γ(s0−s)(Us+1)m,m>0, | (3.11) |
for all t∈Sϕ.
Proof. Since D∈C2([0,∞)), suppose that
G(τ)=∫τ0D(δ)dδ, |
then
0<G(τ)≤d∫τ0(1+δ)m−1dδ≤{−dm,m<0,dln(τ+1),m=0,dm(τ+1)m,m>0. |
Here integrating by parts we obtain
J1(t)=n2∫s00s2−2n−γ(s0−s)dG(Us)=n2s2−2n−γ(s0−s)G(Us)|s00+n2∫s00s2−2n−γG(Us)ds−n2(2−2n−γ)∫s00s1−2n−γ(s0−s)G(Us)ds. |
Hence a direct calculation yields
J1(t)≥{n2dm(2−2n−γ)∫s00s1−2n−γ(s0−s),m<0,−n2d(2−2n−γ)∫s00s1−2n−γ(s0−s)ln(Us+1),m=0,−n2dm(2−2n−γ)∫s00s1−2n−γ(s0−s)(Us+1)m,m>0, |
for all t∈Sϕ. We conclude (3.10).
Lemma 3.5. Assume that γ∈(−∞,1) satisfying γ<2−2n and s0∈(0,Rn6]. Then we have
J2(t)+J3(t)≥k1χ4∫s00s1−γ(s0−s)U1+γ1sds−C4∫s00s1−γ(s0−s)Usds | (3.12) |
for all t∈Sϕ, where C4=C1+(χ2C0+C0+C2)2.
Proof. Since Lemma 3.2 we have
∫s0f(Us(σ,t))dσ≥s2χf1(Us(s,t))−(χ2C0+C0+C2)sfor all s∈(0,s0) and t∈(0,Tmax). |
Therefore,
J2(t)=12∫s00s−γ(s0−s)Us⋅{∫s0f(Us(σ,t))dσ}ds≥χ4∫s00s1−γ(s0−s)Usf1(Us(s,t))ds−(χ2C0+C0+C2)2∫s00s1−γ(s0−s)Usds≥k1χ4∫s00s1−γ(s0−s)U1+γ1sds−(χ2C0+C0+C2)2∫s00s1−γ(s0−s)Usds, |
where f1(Us(s,t))≥k1(1+Us)γ1≥k1(Us)γ1. Combining these inequalities we can deduce (3.12).
Lemma 3.6. Let γ1>max{0,m−1}. For any γ∈(−∞,1) satisfying
γ∈min{2−2n⋅1+γ1γ1, 2−2n⋅1+γ11+γ1−m}, | (3.13) |
and s0∈(0,Rn6], the function ϕ:[0,Tmax)→R defined in (3.1) satisfies
ϕ′(t)≥{Cψ(t)−Cs3−γ−2n⋅1+γ1γ10,m≤1,Cψ(t)−Cs3−γ−2n⋅1+γ11+γ1−m0,m>1, | (3.14) |
with C>0 for all t∈Sϕ, where ψ(t):=∫s00s1−γ(s0−s)U1+γ1sds.
Proof. From (3.10) and (3.12) we have
ϕ′(t)≥k1χ4ψ(t)−I−C4∫s00s1−γ(s0−s)Usds, | (3.15) |
for all t∈Sϕ and I is given by (3.11). In the case m<0,
−n2dm(2−2n−γ)∫s00s1−2n−γ(s0−s)ds≤−n2dm(2−2n−γ)s0∫s00s1−2n−γds=−n2dms3−2n−γ0. |
If m=0, we use the fact that ln(1+x)x<1 for any x>0 and Hölder's inequality to estimate
n2d(2−2n−γ)∫s00s1−2n−γ(s0−s)ln(Us+1)ds=n2d(2−2n−γ)∫s00[s1−γ(s0−s)U1+γ1s]11+γ1⋅s1−2n−γ−1−γ1+γ1(s0−s)1−11+γ1ln(1+Us)Usds≤n2d(2−2n−γ){∫s00s1−γ(s0−s)U1+γ1sds}11+γ1⋅{∫s00(s1−2n−γ−1−γ1+γ1(s0−s)γ11+γ1)1+γ1γ1ds}γ11+γ1≤n2d(2−2n−γ)sγ11+γ10{∫s00s(1−2n−γ)γ1−2nγ1ds}γ11+γ1ψ11+γ1(t)=C5ψ11+γ1(t)s(3−2n−γ)γ1−2n1+γ10, |
for all t∈Sϕ with C5:=n2d(2−2n−γ)⋅(12−γ−2n⋅1+γ1γ1)γ11+γ1>0 by (3.13). In the case m>0, by using the elementary inequality (a+b)α≤2α(aα+bα) for all a,b>0 and every α>0, we obtain
n2dm(2−2n−γ)∫s00s1−2n−γ(s0−s)(Us+1)mds≤2mn2dm(2−2n−γ)∫s00s1−2n−γ(s0−s)Umsds+2mn2dm(2−2n−γ)∫s00s1−2n−γ(s0−s)ds, | (3.16) |
for all t∈Sϕ, and we first estimate the second term on the right of (3.16)
2mn2dm(2−2n−γ)∫s00s1−2n−γ(s0−s)ds≤2mn2dms3−2n−γ0. |
Since γ1>m−1 and by Hölder's inequality we deduce that
2mn2dm(2−2n−γ)∫s00s1−2n−γ(s0−s)Umsds=2mn2dm(2−2n−γ)∫s00s(1−γ)⋅m1+γ1(s0−s)m1+γ1Ums⋅s1−2n−γ−(1−γ)⋅m1+γ1(s0−s)1−m1+γ1ds≤2mn2dm(2−2n−γ){∫s00[s(1−γ)⋅m1+γ1(s0−s)m1+γ1Ums]1+γ1mds}m1+γ1×{∫s00[s1−2n−γ−(1−γ)⋅m1+γ1(s0−s)1−m1+γ1]1+γ11+γ1−mds}1+γ1−m1+γ1≤2mn2dm(2−2n−γ)ψm1+γ1(t)s1+γ1−m1+γ10⋅{∫s00s(1+γ1−m)(1−γ)−2n(1+γ1)1+γ1−mds}1+γ1−m1+γ1≤C6ψm1+γ1(t)s(1+γ1−m)(3−γ)−2n(1+γ1)1+γ10, |
for all t∈Sϕ with C6=2mn2dm(2−2n−γ)(12−γ−2n⋅1+γ11+γ1−m)1+γ1−m1+γ1>0 where γ<2−2n⋅1+γ11+γ1−m from (3.13).
Next, we can estimate the third expression on the right of (3.15) as follows
C4∫s00s1−γ(s0−s)Usds=C4∫s00[s1−γ(s0−s)U1+γ1s]11+γ1⋅s1−γ−1−γ1+γ1(s0−s)1−11+γ1ds≤C4{∫s00s1−γ(s0−s)U1+γ1sds}11+γ1⋅{∫s00[s1−γ−1−γ1+γ1(s0−s)1−11+γ1]1+γ1γ1ds}γ11+γ1≤C4ψ11+γ1(t)sγ11+γ10{∫s00s1−γds}γ11+γ1=C7ψ11+γ1(t)s(3−γ)γ11+γ10, |
where C7=C4(12−γ)γ11+γ1 for all t∈Sϕ. By (3.15) and collecting the estimates above we have
ϕ′(t)≥{k1χ4ψ(t)+n2dms3−2n−γ0−C7ψ11+γ1(t)s(3−γ)γ11+γ10,m<0, t∈Sϕ,k1χ4ψ(t)−C5ψ11+γ1(t)s(3−2n−γ)γ1−2n1+γ10−C7ψ11+γ1(t)s(3−γ)γ11+γ10,m=0, t∈Sϕ,k1χ4ψ(t)−2mn2dms3−2n−γ0−C6ψm1+γ1(t)s(1+γ1−m)(3−γ)−2n(1+γ1)1+γ10−C7ψ11+γ1(t)s(3−γ)γ11+γ10,m>0, t∈Sϕ. |
If m=0, by Young's inequality we can find positive constants C8,C9 such that
C5ψ11+γ1(t)s(3−2n−γ)γ1−2n1+γ10≤k1χ16ψ(t)+C8s3−γ−2n⋅1+γ1γ10,∀t∈Sϕ, |
while as m>0 we have
C6ψm1+γ1(t)s(1+γ1−m)(3−γ)−2n(1+γ1)1+γ10≤k1χ16ψ(t)+C9s3−γ−2n⋅1+γ11+γ1−m0,∀t∈Sϕ. |
On the other hand, we use Young's inequality again
C7ψ11+γ1(t)s(3−γ)γ11+γ10≤k1χ16ψ(t)+C10s3−γ0,∀t∈Sϕ. |
In the case m<0, because of s0∈(0,Rn6], we have
s3−2n−γ0=s3−γ−2n⋅1+γ1γ10⋅s2nγ10≤(Rn6)2nγ1s3−γ−2n⋅1+γ1γ10, |
when m>0 we have
s3−2n−γ0=s3−γ−2n⋅1+γ11+γ1−m0⋅s2mn(1+γ1−m)0≤(Rn6)2mn(1+γ1−m)s3−γ−2n⋅1+γ11+γ1−m0. |
All in all, we have
ϕ′(t)≥{k1χ8ψ(t)−C11s3−γ−2n⋅1+γ1γ10−C10s3−γ0,m≤0,k1χ8ψ(t)−C12s3−γ−2n⋅1+γ11+γ1−m0−C10s3−γ0,m>0, | (3.17) |
for all t∈Sϕ with C11=C8−n2dm(Rn6)2nγ1 and C12=C9+2mn2dm(Rn6)2mn(1+γ1−m). When 0<m≤1, we have 1+γ11+γ1−m≤1+γ1γ1 such that s3−γ−2n⋅1+γ11+γ1−m0=s3−γ−2n⋅1+γ1γ10s2n(1+γ1γ1−1+γ11+γ1−m)0≤(Rn6)2(1−m)(1+γ1)nγ1(1+γ1−m)s3−γ−2n⋅1+γ1γ10. In the case m≤1
s3−γ0=s2n⋅1+γ1γ10⋅s3−γ−2n⋅1+γ1γ10≤(Rn6)2n⋅1+γ1γ1⋅s3−γ−2n⋅1+γ1γ10, |
and if m>1 we have
s3−γ0=s2n⋅1+γ11+γ1−m0⋅s3−γ−2n⋅1+γ11+γ1−m0≤(Rn6)2n⋅1+γ1(1+γ1−m)⋅s3−γ−2n⋅1+γ11+γ1−m0. |
Thus (3.17) turns into (3.14).
Next, we need to build a connection between ϕ(t) and ψ(t). Let us define
Sψ:={t∈(0,Tmax)|ψ(t)≥s3−γ0}. | (3.18) |
Lemma 3.7. Let γ∈(−∞,1) satisfying γ>1−γ1 and (3.13). Then for any choice of s0∈(0,Rn6], the following inequality
ϕ′(t)≥{Cs−γ1(3−γ)0ϕ1+γ1(t)−Cs3−γ−2n⋅1+γ1γ10,m≤1,Cs−γ1(3−γ)0ϕ1+γ1(t)−Cs3−γ−2n⋅1+γ11+γ1−m0,m>1, | (3.19) |
holds for all t∈Sϕ∩Sψ with C>0.
Proof. We first split
U(s,t)=∫s0Us(σ,t)dσ=∫s0χ{Us(⋅,t)<1}(σ)⋅Us(σ,t)dσ+∫s0χ{Us(⋅,t)≥1}(σ)⋅Us(σ,t)dσ≤s+∫s0χ{Us(⋅,t)≥1}(σ)⋅{σ1−γ(s0−σ)U1+γ1s}11+γ1⋅σ−1−γ1+γ1(s0−σ)−11+γ1dσ≤s+(s0−s)−11+γ1ψ11+γ1(t)⋅{∫s0σ−1−γ1+γ1⋅1+γ1γ1dσ}γ11+γ1=s+(γ1γ+γ1−1)γ11+γ1(s0−s)−11+γ1sγ+γ1−11+γ1ψ11+γ1(t), | (3.20) |
for all s∈(0,s0) and t∈(0,Tmax) where γ1γ+γ1−1>0. According to the definition of Sψ, we can find
s(s0−s)−11+γ1sγ+γ1−11+γ1ψ11+γ1(t)=s2−γ1+γ1(s0−s)11+γ1ψ−11+γ1(t)≤s2−γ1+γ10⋅s11+γ10⋅(s3−γ0)−11+γ1=1, | (3.21) |
for all s∈(0,s0) and t∈Sψ. Combining (3.20) and (3.21) we have
U(s,t)≤C1sγ+γ1−11+γ1(s0−s)−11+γ1ψ11+γ1(t), |
where C1=1+(γ1γ+γ1−1)γ11+γ1 for all s∈(0,s0) and t∈Sψ. Invoking Hölder's inequality, we get
ϕ(t)=∫s00s−γ(s0−s)U(s,t)ds≤C1∫s00s−γ+γ+γ1−11+γ1(s0−s)1−11+γ1ds⋅ψ11+γ1(t)≤C1sγ11+γ10∫s00s−γ+γ+γ1−11+γ1ds⋅ψ11+γ1(t)=C2sγ1(3−γ)1+γ10⋅ψ11+γ1(t), | (3.22) |
where C2=C11+γ1γ1(2−γ) for all s∈(0,s0) and t∈Sψ. Employing these conclusion we deduce (3.19).
These preparations above will enable us to establish a superlinear ODI for ϕ as mentioned earlier, and we prove our main result on blow-up based on a contradictory argument.
Proof of Theorem 1.1. Step 1. Assume on the contrary that Tmax=+∞, and we define the function
S:={T∈(0,+∞)|ϕ(t)>nM−s0ωn(1−γ)(2−γ)⋅s2−γ0 for all t∈[0,T]}. | (3.23) |
Let us choose s0>0 such that
s0≤min{Rn6,nM2,nMγ12(1−γ)ωn[(C3+1)(1+γ1)−1]}, | (3.24) |
where M and ωn were defined in (2.7) and C3=(γ1γ+γ1−1)γ11+γ1 has been mentioned in (3.20). Then we pick 0<ε(γ1,M,R)=ε<s0n and s⋆(γ1,M,R)∈(0,s0) wtih r⋆(γ1,M,R)=(s⋆)1n∈(0,R) such that
U(s,0)≥U(s⋆,0)=nωn∫Br⋆(0)u0dx≥nωn(M−ε),∀s∈(s⋆,Rn). |
Therefore it is possible to estimate
ϕ(0)=∫s00s−γ(s0−s)U(s,0)ds≥∫s00s−γ(s0−s)U(s⋆,0)ds>nωn(M−s0n)∫s00s−γ(s0−s)ds=nM−s0ωn(1−γ)(2−γ)⋅s2−γ0. | (3.25) |
Then S is non-empty and denote T=supS∈(0,∞]. Next, we need to prove (0,T)⊂Sϕ∩Sψ≠∅. Note that
ϕ(t)>nM−s0ωn(1−γ)(2−γ)⋅s2−γ0,∀t∈(0,T), | (3.26) |
we obtain (0,T)⊂Sϕ. From (3.20) we have
ϕ(t)≤∫s00s−γ(s0−s)[s+C3sγ+γ1−11+γ1(s0−s)−11+γ1ψ11+γ1(t)]ds≤s0∫s00s1−γds+C3∫s00s−γ+γ+γ1−11+γ1(s0−s)γ11+γ1ψ11+γ1(t)ds=s3−γ02−γ+C3(1+γ1)γ1(2−γ)sγ1(3−γ)1+γ10⋅ψ11+γ1(t). |
It follows from (3.24) and (3.26) that
ϕ(t)≥nM2(1−γ)(2−γ)ωn⋅s2−γ0for all t∈(0,T). | (3.27) |
Then
C3(1+γ1)γ1(2−γ)sγ1(3−γ)1+γ10⋅ψ11+γ1(t)≥nM2(1−γ)(2−γ)ωn⋅s2−γ0−s3−γ02−γ. |
Note that (3.24) implies
nMγ12C3(1−γ)ωn(1+γ1)s0−γ1C3(1+γ1)≥1, |
then we have
ψ(t)≥[(nMs2−γ02(1−γ)(2−γ)ωn−s3−γ02−γ)⋅γ1(2−γ)C3(1+γ1)s−γ1(3−γ)1+γ10]1+γ1≥[nMγ12C3(1−γ)ωn(1+γ1)s0−γ1C3(1+γ1)]1+γ1⋅s3−γ0≥s3−γ0. |
Therefore, (0,T)⊂Sϕ∩Sψ≠∅.
Step 2. Applying Lemma 3.7 we can find γ∈(−∞,1) and C1,C2>0 such that for all s0∈(0,Rn6]
ϕ′(t)≥{C1s−γ1(3−γ)0ϕ1+γ1(t)−C2s3−γ−2n⋅1+γ1γ10,m≤1,C1s−γ1(3−γ)0ϕ1+γ1(t)−C2s3−γ−2n⋅1+γ11+γ1−m0,m>1, |
for all t∈Sϕ∩Sψ and with (3.22) we have
ψ(t)≥C3s−γ1(3−γ)0ϕ1+γ1(t),∀t∈Sψ. |
To specify our choice of s0, for given M>0 we choose s0∈(0,Rn6] small enough such that
s0≤nM2, | (3.28) |
and also
sγ10<TC1γ14(nM2ωn(1−γ)(2−γ))γ1, | (3.29) |
as well as
s1+γ10≤C3(nM2ωn(1−γ)(2−γ))1+γ1. | (3.30) |
From (3.23), (3.28) and (3.30) we have
ψ(t)≥C3s−γ1(3−γ)0ϕ1+γ1(t)>C3(nM−s0ωn(1−γ)(2−γ)⋅1s0)1+γ1⋅s3−γ0≥s3−γ0,∀t∈Sψ, |
which shows that S⊂Sϕ∩Sψ. Since 1+γ1−m>2n, we have (1+γ1)(1−2n(1+γ1−m))>0 if m>1 so that we can choose s0 sufficiently small satisfying (3.28)–(3.30) such that
s(1+γ1)(1−2n(1+γ1−m))0≤C12C2(nM2ωn(1−γ)(2−γ))1+γ1, |
while in the case m≤1, the condition γ1>m−1+2n≥2n which infers that (1+γ1)(1−2nγ1)>0 and we select s0 small enough fulfilling (3.28)–(3.30) such that
s(1+γ1)(1−2nγ1)0≤C12C2(nM2ωn(1−γ)(2−γ))1+γ1. |
It is possible to obtain
C12s−γ1(3−γ)0ϕ1+γ1(0)C2s3−γ−2n⋅1+γ11+γ1−m0≥C12C2(nM2ωn(1−γ)(2−γ))1+γ1⋅s−(1+γ1)+2n⋅1+γ1(1+γ1−m)0≥1,∀m>1, |
and we have
C12s−γ1(3−γ)0ϕ1+γ1(0)C2s3−γ−2n⋅1+γ1γ10≥C12C2(nM2ωn(1−γ)(2−γ))1+γ1⋅s−(1+γ1)+2n⋅1+γ1γ10≥1,∀m≤1. |
All in all, for any m∈R, we apply an ODI comparison argument to obtain that
ϕ′(t)≥C12s−γ1(3−γ)0ϕ1+γ1(t),∀t∈(0,T). |
By a direct calculation we obtain
−1γ1(1ϕγ1(t)−1ϕγ1(0))≥C12s−γ1(3−γ)0t,∀t∈(0,T). |
Hence, according to (3.25) and (3.29) we conclude
t<2C1γ1sγ10(2ωn(1−γ)(2−γ)nM)γ1≤T2, |
for all t∈(0,T). As a consequence, we infer that Tmax must be finite.
In this section, we are preparing to prove Theorem 1.2 by providing the Lp estimate of u and the Moser-type iteration.
Lemma 4.1. Let (u,v,w) be a classical solution of the system (1.5) under the condition of Theorem 1.2. Suppose that
γ2<1+γ1<2n+m. | (4.1) |
Then for any p>max{1,2−m,γ2}, there exists C=C(p)>0 such that
∫Ω(1+u)p(x,t)dx≤Con (0,Tmax). | (4.2) |
Proof. Notice f1(u)≤k1(1+u)γ1, f2(u)=k2(1+u)γ2 for all u≥0. Multiplying the first equation of (1.5) by p(1+u)p−1 and integrating by parts with the boundary conditions for u,v and w, we have
ddt∫Ω(1+u)pdx+p(p−1)∫Ω(1+u)p−2D(u)|∇u|2dx=χp(p−1)∫Ωu(1+u)p−2∇u⋅∇vdx−ξp(p−1)∫Ωu(1+u)p−2∇u⋅∇wdx=−χ(p−1)∫Ω(1+u)pΔvdx+χp∫Ω(1+u)p−1Δvdx+ξ(p−1)∫Ω(1+u)pΔwdx−ξp∫Ω(1+u)p−1Δwdx≤χ(p−1)∫Ω(1+u)pf1(u)dx+χp∫Ω(1+u)p−1μ1(t)dx+ξ(p−1)∫Ω(1+u)pμ2(t)dx−ξ(p−1)∫Ω(1+u)pf2(u)dx+ξp∫Ω(1+u)p−1f2(u)dx≤k1χ(p−1)∫Ω(1+u)p+γ1dx+χp∫Ω(1+u)p−1μ1(t)dx+ξ(p−1)∫Ω(1+u)pμ2(t)dx−k2ξ(p−1)∫Ω(1+u)p+γ2dx+k2ξp∫Ω(1+u)p+γ2−1dx,∀t∈(0,Tmax). | (4.3) |
Firstly,
p(p−1)∫Ω(1+u)p−2D(u)|∇u|2dx≥dp(p−1)∫Ω(1+u)p+m−3|∇u|2dx=4dp(p−1)(p+m−1)2∫Ω|∇(1+u)p+m−12|2dx. |
By Young's inequality and Hölder's inequality, we obtain
χp∫Ω(1+u)p−1μ1(t)dx≤C1∫Ω(1+u)p+γ1dx+C2μp+γ11+γ11(t)=C1∫Ω(1+u)p+γ1dx+C2(1|Ω|∫Ωf1(u)dx)p+γ11+γ1≤C1∫Ω(1+u)p+γ1dx+C3(∫Ω(1+u)1+γ1dx)p+γ11+γ1≤C1∫Ω(1+u)p+γ1dx+C3{(∫Ω(1+u)p+γ1dx)1+γ1p+γ1⋅|Ω|p−1p+γ1}p+γ11+γ1=C1∫Ω(1+u)p+γ1dx+C3|Ω|p−11+γ1∫Ω(1+u)p+γ1dx. |
for all t∈(0,Tmax). Then by Hölder's inequality we obtain
ξ(p−1)∫Ω(1+u)pμ2(t)dx=k2ξ(p−1)|Ω|∫Ω(1+u)γ2dx∫Ω(1+u)pdx≤k2ξ(p−1)|Ω|{∫Ω(1+u)p+γ2dx}γ2p+γ2|Ω|pp+γ2×{∫Ω(1+u)p+γ2dx}pp+γ2|Ω|γ2p+γ2=k2ξ(p−1)∫Ω(1+u)p+γ2dx,∀t∈(0,Tmax). |
Furthermore, by using Young's inequality and (4.1) we have
k2ξp∫Ω(1+u)p+γ2−1dx≤C4∫Ω(1+u)p+γ1dx+C5, |
for all t∈(0,Tmax). Therefore, combining these we conclude
ddt∫Ω(1+u)pdx+4dp(p−1)(p+m−1)2∫Ω|∇(1+u)p+m−12|2dx≤C6∫Ω(1+u)p+γ1dx+C5,∀t∈(0,Tmax), |
where C6=C1+C3|Ω|p−11+γ1+C4+k1χ(p−1). By means of Gagliardo-Nirenberg inequality we can find C7 such that
C6∫Ω(1+u)p+γ1dx=C6‖(1+u)p+m−12‖2(p+γ1)p+m−1L2(p+γ1)p+m−1(Ω)≤C7‖∇(1+u)p+m−12‖2(p+γ1)p+m−1⋅aL2(Ω)⋅‖(1+u)p+m−12‖2(p+γ1)p+m−1⋅(1−a)L2p+m−1(Ω)+C7‖(1+u)p+m−12‖2(p+γ1)p+m−1L2p+m−1(Ω) |
for all t∈(0,Tmax), where
a=p+m−12−p+m−12(p+γ1)p+m−12−(12−1n)∈(0,1). |
Since 1−m+γ1<2n, we have 2(p+γ1)p+m−1⋅a<2, and we use Young's inequality to see that for all t∈(0,Tmax)
C6∫Ω(1+u)p+γ1dx≤2dp(p−1)(p+m−1)2‖∇(1+u)p+m−12‖2L2(Ω)+C8. |
In quite a similar manner, we obtain C9=C9(p)>0 fulfilling
∫Ω(1+u)pdx≤2dp(p−1)(p+m−1)2‖∇(1+u)p+m−12‖2L2(Ω)+C9for all t∈(0,Tmax). |
Finally, combining these to (4.3) we obtain
ddt∫Ω(1+u)pdx+∫Ω(1+u)pdx≤C5+C8+C9for all t∈(0,Tmax). |
Thus,
∫Ω(1+u)pdx≤max{∫Ω(1+u0)pdx,C5+C8+C9}for all t∈(0,Tmax). |
We have done the proof.
Under the condition of Lemma 4.1 we can use the above information to prove Theorem 1.2.
Proof of Theorem 1.2. From Lemma 4.1, we let p>max{γ1n,γ2n,1}. By the elliptic Lp-estimate to the two elliptic equations in (1.5), we get that for all t∈(0,Tmax) there exists some C10(p)>0 such that
‖v(⋅,t)‖w2,pγ1(Ω)≤C10(p),‖w(⋅,t)‖w2,pγ2(Ω)≤C10(p), | (4.4) |
and hence, by the Sobolev embedding theorem, we get
‖v(⋅,t)‖C1(¯Ω)≤C10(p),‖w(⋅,t)‖C1(¯Ω)≤C10(p). | (4.5) |
Now the Moser iteration technique ([3,51]) ensures that ‖u(⋅,t)‖L∞(Ω)≤C for any t∈(0,Tmax).
This concludes by Lemma 2.1 that Tmax=∞.
The paper is supported by the Research and Innovation Team of China West Normal University (CXTD2020–5).
The authors declare that there is no conflict of interest.
[1] | Kochanek KD, Murphy SL, Xu JQ, et al. (2024) Mortality in the United States, 2022. NCHS Data Brief, no 492 . Hyattsville, MD: National Center for Health Statistics. 2024. https://dx.doi.org/10.15620/cdc:135850. |
[2] | Global Cancer Observatory, World Health Organization, Colon and Rectum. Accessed 12 March 2024. Available from: https://gco.iarc.fr/today/en/fact-sheets-cancers |
[3] |
Bray F, Laversanne M, Sung H, et al. (2024) Global cancer statistics 2022: GLOBOCAN estimates of incidence and mortality worldwide for 36 cancers in 185 countries. CA Cancer J Clin 74: 229-263. https://doi.org/10.3322/caac.21834 ![]() |
[4] | Ferlay J, Ervik M, Lam F, et al. (2024) Global Cancer Observatory: Cancer Today (version 1.1). Lyon, France: International Agency for Research on Cancer. Available from: https://gco.iarc.who.int/today. |
[5] |
Morgan E, Arnold M, Gini A, et al. (2023) Global burden of colorectal cancer in 2020 and 2040: incidence and mortality estimates from GLOBOCAN. Gut 72: 338-344. https://doi.org/10.1136/gutjnl-2022-327736 ![]() |
[6] |
Sullivan BA, Noujaim M, Roper J (2022) Cause, epidemiology, and histology of polyps and pathways to colorectal cancer. Gastrointest Endosc Clin N Am 32: 177-194. https://doi.org/10.1016/j.giec.2021.12.001 ![]() |
[7] |
Nguyen LH, Goel A, Chung DC (2020) Pathways of colorectal carcinogenesis. Gastroenterology 158: 291-302. https://doi.org/10.1053/j.gastro.2019.08.059 ![]() |
[8] |
Simon K (2016) Colorectal cancer development and advances in screening. Clin Interv Aging 11: 967-976. https://doi.org/10.2147/CIA.S109285 ![]() |
[9] |
Pickhardt PJ, Kim DH (2009) Colorectal cancer screening with CT colonography: key concepts regarding polyp prevalence, size, histology, morphology, and natural history. AJR Am J Roentgenol 193: 40-46. https://doi.org/10.2214/AJR.08.1709 ![]() |
[10] |
Pino MS, Chung DC (2010) The chromosomal instability pathway in colon cancer. Gastroenterology 138: 2059-2072. https://doi.org/10.1053/j.gastro.2009.12.065 ![]() |
[11] |
Powell SM, Zilz N, Beazer-Barclay Y, et al. (1992) APC mutations occur early during colorectal tumorigenesis. Nature 359: 235-237. https://doi.org/10.1038/359235a0 ![]() |
[12] |
Rim EY, Clevers H, Nusse R (2022) The Wnt pathway: from signaling mechanisms to synthetic modulators. Annu Rev Biochem 91: 571-598. https://doi.org/10.1146/annurev-biochem-040320-103615 ![]() |
[13] |
Dienstmann R, Connor K, Byrne AT (2020) COLOSSUS consortium. Precision therapy in RAS mutant colorectal cancer. Gastroenterology 158: 806-811. https://doi.org/10.1053/j.gastro.2019.12.051 ![]() |
[14] |
Fernández-Medarde A, Santos E (2011) Ras in cancer and developmental diseases. Genes Cancer 2: 344-358. https://doi.org/10.1177/1947601911411084 ![]() |
[15] |
Simanshu DK, Nissley DV, McCormick F (2017) RAS proteins and their regulators in human disease. Cell 170: 17-33. https://doi.org/10.1016/j.cell.2017.06.009 ![]() |
[16] |
Zhu G, Pei L, Xia H, et al. (2021) Role of oncogenic KRAS in the prognosis, diagnosis and treatment of colorectal cancer. Mol Cancer 20: 143. https://doi.org/10.1186/s12943-021-01441-4 ![]() |
[17] |
McLellan EA, Owen RA, Stepniewska KA, et al. (1993) Lemoine NR. High frequency of K-ras mutations in sporadic colorectal adenomas. Gut 34: 392-396. https://doi.org/10.1136/gut.34.3.392 ![]() |
[18] |
Naccarati A, Polakova V, Pardini B, et al. (2012) Mutations and polymorphisms in TP53 gene--an overview on the role in colorectal cancer. Mutagenesis 27: 211-218. https://doi.org/10.1093/mutage/ger067 ![]() |
[19] |
Fischer M (2017) Census and evaluation of p53 target genes. Oncogene 36: 3943-3956. https://doi.org/10.1038/onc.2016.502 ![]() |
[20] |
Lin D, Shields MT, Ullrich SJ, et al. (1992) Growth arrest induced by wild-type p53 protein blocks cells prior to or near the restriction point in late G1 phase. Proc Natl Acad Sci USA 89: 9210-9214. https://doi.org/10.1073/pnas.89.19.9210 ![]() |
[21] |
Engeland K (2022) Cell cycle regulation: p53-p21-RB signaling. Cell Death Differ 29: 946-960. https://doi.org/10.1038/s41418-022-00988-z ![]() |
[22] |
Iacopetta B, Russo A, Bazan V, et al. (2006) Functional categories of TP53 mutation in colorectal cancer: results of an International Collaborative Study. Ann Oncol 217: 842-847. https://doi.org/10.1093/annonc/mdl035 ![]() |
[23] |
Leslie A, Carey FA, Pratt NR (2002) The colorectal adenoma-carcinoma sequence. Br J Surg 89: 845-860. https://doi.org/10.1046/j.1365-2168.2002.02120.x ![]() |
[24] |
Westra JL, Schaapveld M, Hollema H, et al. (2005) Determination of TP53 mutation is more relevant than microsatellite instability status for the prediction of disease-free survival in adjuvant-treated stage III colon cancer patients. J Clin Oncol 23: 5635-5643. https://doi.org/10.1200/JCO.2005.04.096 ![]() |
[25] |
Söreide K, Janssen EA, Söiland H, et al. (2006) Microsatellite instability in colorectal cancer. Br J Surg 93: 395-406. ![]() |
[26] | De' Angelis GL, Bottarelli L, Azzoni C, et al. (2018) Microsatellite instability in colorectal cancer. Acta Biomed 89: 97-101. https://doi.org/10.23750/abm.v89i9-S.7960 |
[27] | Parsons R, Li GM, Longley MJ, et al. (1993) Hypermutability and mismatch repair deficiency in RER+ tumor cells. Cell 75: 1227-1236. https://doi.org/10.1016/0092-8674(93)90331-j |
[28] |
Hendriks YM, de Jong AE, Morreau H, et al. (2006) Diagnostic approach and management of Lynch syndrome (hereditary nonpolyposis colorectal carcinoma): a guide for clinicians. CA Cancer J Clin 56: 213-225. https://doi.org/10.3322/canjclin.56.4.213 ![]() |
[29] |
Iacopetta B, Grieu F, Amanuel B (2010) Microsatellite instability in colorectal cancer. Asia Pac J Clin Oncol 6: 260-269. https://doi.org/10.1111/j.1743-7563.2010.01335.x ![]() |
[30] |
Sninsky JA, Shore BM, Lupu GV (2022) Crockett SD. Risk factors for colorectal polyps and cancer. Gastrointest Endosc Clin N Am 32: 195-213. https://doi.org/10.1016/j.giec.2021.12.008 ![]() |
[31] |
Lewandowska A, Rudzki G, Lewandowski T (2022) Risk factors for the diagnosis of colorectal cancer. Cancer Control 29. https://doi.org/10.1177/10732748211056692 ![]() |
[32] |
Betesh AL, Schnoll-Sussman FH (2021) Colorectal cancer screening in the elderly. Clin Geriatr Med 37: 173-183. https://doi.org/10.1016/j.cger.2020.08.012 ![]() |
[33] | Gupta S (2022) Screening for colorectal cancer. Hematol Oncol Clin North Am 36: 393-414. https://doi.org/10.1016/j.hoc.2022.02.001 |
[34] |
Mehraban Far P, Alshahrani A, Yaghoobi M (2019) Quantitative risk of positive family history in developing colorectal cancer: A meta-analysis. World J Gastroenterol 25: 4278-4291. https://doi.org/10.3748/wjg.v25.i30.4278 ![]() |
[35] | Mármol I, Sánchez-de-Diego C, Pradilla Dieste A, et al. (2017) Colorectal carcinoma: A general overview and future perspectives in colorectal cancer. Int J Mol Sci 18: 197. https://doi.org/10.3390/ijms18010197 |
[36] |
Siegel RL, Torre LA, Soerjomataram I, et al. (2019) Global patterns and trends in colorectal cancer incidence in young adults. Gut 68: 2179-2185. https://doi.org/10.1136/gutjnl-2019-319511 ![]() |
[37] |
Bailey CE, Hu CY, You YN, et al. (2015) Increasing disparities in the age-related incidences of colon and rectal cancers in the United States, 1975–2010. JAMA Surg 150: 17-22. https://doi.org/10.1001/jamasurg.2014.1756 ![]() |
[38] |
O'Sullivan DE, Sutherland RL, Town S, et al. (2022) Risk factors for early-onset colorectal cancer: A systematic review and Meta-analysis. Clin Gastroenterol Hepatol 20: 1229-1240.e5. https://doi.org/10.1016/j.cgh.2021.01.037 ![]() |
[39] |
Ionescu VA, Gheorghe G, Bacalbasa N, et al. (2023) Colorectal cancer: from risk factors to oncogenesis. Medicina 59: 1646. https://doi.org/10.3390/medicina59091646 ![]() |
[40] |
Zhou X, Wang L, Xiao J, et al. (2022) Alcohol consumption, DNA methylation and colorectal cancer risk: Results from pooled cohort studies and Mendelian randomization analysis. Int J Cancer 151: 83-94. https://doi.org/10.1002/ijc.33945 ![]() |
[41] |
Farvid MS, Sidahmed E, Spence ND, et al. (2021) Consumption of red meat and processed meat and cancer incidence: a systematic review and meta-analysis of prospective studies. Eur J Epidemiol 36: 937-951. https://doi.org/10.1007/s10654-021-00741-9 ![]() |
[42] |
Ladabaum U, Dominitz JA, Kahi C, et al. (2020) Strategies for colorectal cancer screening. Gastroenterology 158: 418-432. https://doi.org/10.1053/j.gastro.2019.06.043 ![]() |
[43] |
Wu Z, Li Y, Zhang Y, et al. (2020) Colorectal cancer screening methods and molecular markers for early detection. Technol Cancer Res Treat 19: 1533033820980426. https://doi.org/10.1177/1533033820980426 ![]() |
[44] |
Schreuders EH, Ruco A, Rabeneck L, et al. (2015) Colorectal cancer screening: a global overview of existing programmes. Gut 64: 1637-1649. https://doi.org/10.1136/gutjnl-2014-309086 ![]() |
[45] |
Shaukat A, Levin TR (2022) Current and future colorectal cancer screening strategies. Nat Rev Gastroenterol Hepatol 19: 521-531. https://doi.org/10.1038/s41575-022-00612-y ![]() |
[46] |
Potter NT, Hurban P, White MN, et al. (2014) Validation of a real-time PCR-based qualitative assay for the detection of methylated SEPT9 DNA in human plasma. Clin Chem 60: 1183-1191. https://doi.org/10.1373/clinchem.2013.221044 ![]() |
[47] |
Cohen JD, Li L, Wang Y, et al. (2018) Detection and localization of surgically resectable cancers with a multi-analyte blood test. Science 359: 926-930. https://doi.org/10.1126/science.aar3247 ![]() |
[48] |
Barnell EK, Wurtzler EM, La Rocca J, et al. (2023) Multitarget stool RNA test for colorectal cancer screening. JAMA 330: 1760-1768. https://doi.org/10.1001/jama.2023.22231 ![]() |
[49] |
Mahmoud NN (2022) Colorectal cancer: preoperative evaluation and staging. Surg Oncol Clin N Am 31: 127-141. https://doi.org/10.1016/j.soc.2021.12.001 ![]() |
[50] |
Nagtegaal ID, Quirke P, Schmoll HJ (2011) Has the new TNM classification for colorectal cancer improved care?. Nat Rev Clin Oncol 9: 119-123. https://doi.org/10.1038/nrclinonc.2011.157 ![]() |
[51] |
Chen K, Collins G, Wang H, et al. (2021) Pathological features and prognostication in colorectal cancer. Curr Oncol 28: 5356-5383. https://doi.org/10.3390/curroncol28060447 ![]() |
[52] |
Carlsen L, Huntington KE, El-Deiry WS (2022) Immunotherapy for Colorectal Cancer: Mechanisms and Predictive Biomarkers. Cancers 14: 1028. https://doi.org/10.3390/cancers14041028 ![]() |
[53] |
Zhao W, Jin L, Chen P, et al. (2022) Colorectal cancer immunotherapy-Recent progress and future directions. Cancer Lett 545: 215816. https://doi.org/10.1016/j.canlet.2022.215816 ![]() |
[54] |
Shinji S, Yamada T, Matsuda A, et al. (2022) Recent Advances in the Treatment of Colorectal Cancer: A Review. J Nippon Med Sch 89: 246-254. ![]() |
[55] |
Merchant J, McArthur D, Ferguson H, et al. (2021) Concepts and prospects of minimally invasive colorectal cancer surgery. Clin Radiol 76: 889-895. https://doi.org/10.1016/j.crad.2021.09.013 ![]() |
[56] | Vilsan J, Maddineni SA, Ahsan N, et al. (2023) Open, Laparoscopic, and Robotic Approaches to Treat Colorectal Cancer: A Comprehensive Review of Literature. Cureus 15: e38956. https://doi.org/10.7759/cureus.38956 |
[57] |
Zhang M, Liu Z, Wang X (2022) Is natural orifice specimen extraction surgery the future direction of minimally invasive colorectal surgery?. Surg Open Sci 10: 106-110. https://doi.org/10.1016/j.sopen.2022.08.001 ![]() |
[58] |
Song XJ, Liu ZL, Zeng R, et al. (2019) A meta-analysis of laparoscopic surgery versus conventional open surgery in the treatment of colorectal cancer. Medicine 98: e15347. https://doi.org/10.1097/MD.0000000000015347 ![]() |
[59] |
Luo W, Wu M, Chen Y (2022) Laparoscopic versus open surgery for elderly patients with colorectal cancer: a systematic review and meta-analysis of matched studies. ANZ J Surg 92: 2003-2017. https://doi.org/10.1111/ans.17972 ![]() |
[60] |
Yang L, Fang C, Bi T, et al. (2023) Efficacy of robot-assisted vs. laparoscopy surgery in the treatment of colorectal cancer: A systematic review and meta-analysis. Clin Res Hepatol Gastroenterol 47: 102176. https://doi.org/10.1016/j.clinre.2023.102176 ![]() |
[61] |
Huang Z, Huang S, Huang Y, et al. (2023) Comparison of robotic-assisted versus conventional laparoscopic surgery in colorectal cancer resection: a systemic review and meta-analysis of randomized controlled trials. Front Oncol 13: 1273378. https://doi.org/10.3389/fonc.2023.1273378 ![]() |
[62] |
Zhao Z, Gu J (2022) Open surgery in the era of minimally invasive surgery. Chin J Cancer Res 34: 63-65. https://doi.org/10.21147/j.issn.1000-9604.2022.01.06 ![]() |
[63] |
Biller LH, Schrag D (2021) Diagnosis and treatment of metastatic colorectal cancer: A review. JAMA 325: 669-685. https://doi.org/10.1001/jama.2021.0106 ![]() |
[64] | European Medicines AgencyHomepage. Accessed March 8, 2025. Available from: https://www.ema.europa.eu/en/homepage |
[65] | National Cancer InstituteColorectal cancer treatment drugs. Accessed March 8, 2025. Available from: https://www.cancer.gov/about-cancer/treatment/drugs/colorectal |
[66] |
Kuipers EJ, Grady WM, Lieberman D, et al. (2015) Colorectal cancer. Nat Rev Dis Primers 1: 15065. https://doi.org/10.1038/nrdp.2015.65 ![]() |
[67] |
Glimelius B, Stintzing S, Marshall J, et al. (2021) Metastatic colorectal cancer: Advances in the folate-fluoropyrimidine chemotherapy backbone. Cancer Treat Rev 98: 102218. https://doi.org/10.1016/j.ctrv.2021.102218 ![]() |
[68] |
Shin AE, Giancotti FG, Rustgi AK (2023) Metastatic colorectal cancer: mechanisms and emerging therapeutics. Trends Pharmacol Sci 44: 222-236. https://doi.org/10.1016/j.tips.2023.01.003 ![]() |
[69] |
Colucci G, Gebbia V, Paoletti G, et al. (2005) Phase III randomized trial of FOLFIRI versus FOLFOX4 in the treatment of advanced colorectal cancer: a multicenter study of the Gruppo Oncologico Dell'Italia Meridionale. J Clin Oncol 23: 4866-4875. https://doi.org/10.1200/JCO.2005.07.113 ![]() |
[70] |
Nelson MA, Shetty S, Kulakodlu M, et al. (2011) A comparison of mortality and costs associated with FOLFOX versus FOLFIRI in stage IV colorectal cancer. J Med Econ 14: 179-186. https://doi.org/10.3111/13696998.2011.556693 ![]() |
[71] |
Van Cutsem E, Köhne CH, Hitre E, et al. (2009) Cetuximab and chemotherapy as initial treatment for metastatic colorectal cancer. N Engl J Med 360: 1408-1417. https://doi.org/10.1056/NEJMoa0805019 ![]() |
[72] |
Douillard JY, Siena S, Cassidy J, et al. (2010) Randomized, phase III trial of panitumumab with infusional fluorouracil, leucovorin, and oxaliplatin (FOLFOX4) versus FOLFOX4 alone as first-line treatment in patients with previously untreated metastatic colorectal cancer: the PRIME study. J Clin Oncol 28: 4697-4705. https://doi.org/10.1200/JCO.2009.27.4860 ![]() |
[73] |
Itatani Y, Kawada K, Yamamoto T, et al. (2018) Resistance to anti-angiogenic therapy in Cancer-Alterations to Anti-VEGF Pathway. Int J Mol Sci 19: 1232. https://doi.org/10.3390/ijms19041232 ![]() |
[74] |
Diaz LA, Shiu KK, Kim TW, et al. (2022) Pembrolizumab versus chemotherapy for microsatellite instability-high or mismatch repair-deficient metastatic colorectal cancer (KEYNOTE-177): final analysis of a randomised, open-label, phase 3 study. Lancet Oncol 23: 659-670. https://doi.org/10.1016/S1470-2045(22)00197-8 ![]() |
[75] |
Overman MJ, McDermott R, Leach JL, et al. (2017) Nivolumab in patients with metastatic DNA mismatch repair-deficient or microsatellite instability-high colorectal cancer (CheckMate 142): an open-label, multicentre, phase 2 study. Lancet Oncol 18: 1182-1191. https://doi.org/10.1016/S1470-2045(17)30422-9 ![]() |
[76] |
Overman MJ, Lonardi S, Wong KYM, et al. (2018) Durable clinical benefit with nivolumab plus ipilimumab in DNA mismatch repair-deficient/microsatellite instability-high metastatic colorectal cancer. J Clin Oncol 36: 773-779. https://doi.org/10.1200/JCO.2017.76.9901 ![]() |
[77] |
Xie YH, Chen YX, Fang JY (2020) Comprehensive review of targeted therapy for colorectal cancer. Signal Transduct Target Ther 5: 22. https://doi.org/10.1038/s41392-020-0116-z ![]() |
[78] |
Saltz LB, Clarke S, Díaz-Rubio E, et al. (2008) Bevacizumab in combination with oxaliplatin-based chemotherapy as first-line therapy in metastatic colorectal cancer: a randomized phase III study. J Clin Oncol 26: 2013-2019. https://doi.org/10.1200/JCO.2007.14.9930 ![]() |
[79] |
Van Cutsem E, Tabernero J, Lakomy R, et al. (2012) Addition of aflibercept to fluorouracil, leucovorin, and irinotecan improves survival in a phase III randomized trial in patients with metastatic colorectal cancer previously treated with an oxaliplatin-based regimen. J Clin Oncol 30: 3499-3506. https://doi.org/10.1200/JCO.2012.42.8201 ![]() |
[80] | Siravegna G, Mussolin B, Buscarino M, et al. (2015) Clonal evolution and resistance to EGFR blockade in the blood of colorectal cancer patients. Nat Med 21: 795-801. https://doi.org/10.1038/nm.3870 |
[81] |
Goede V, Coutelle O, Neuneier J, et al. (2010) Identification of serum angiopoietin-2 as a biomarker for clinical outcome of colorectal cancer patients treated with bevacizumab-containing therapy. Br J Cancer 103: 1407-1414. https://doi.org/10.1038/sj.bjc.6605925 ![]() |
[82] |
Derangère V, Fumet JD, Boidot R, et al. (2016) Does bevacizumab impact anti-EGFR therapy efficacy in metastatic colorectal cancer?. Oncotarget 7: 9309-9321. https://doi.org/10.18632/oncotarget.7008 ![]() |
[83] |
André T, Shiu KK, Kim TW, et al. (2025) Pembrolizumab versus chemotherapy in microsatellite instability-high or mismatch repair-deficient metastatic colorectal cancer: 5-year follow-up from the randomized phase III KEYNOTE-177 study. Ann Oncol 36: 277-284. https://doi.org/10.1016/j.annonc.2024.11.012 ![]() |
[84] |
Shan J, Han D, Shen C, et al. (2022) Mechanism and strategies of immunotherapy resistance in colorectal cancer. Front Immunol 13: 1016646. https://doi.org/10.3389/fimmu.2022.1016646 ![]() |
[85] |
Lenz HJ, Van Cutsem E, Luisa Limon M, et al. (2022) First-line nivolumab plus low-dose ipilimumab for microsatellite instability-high/mismatch repair-deficient metastatic colorectal cancer: The phase II CheckMate 142 study. J Clin Oncol 40: 161-170. https://doi.org/10.1200/JCO.21.01015 ![]() |
[86] |
André T, Lonardi S, Wong KYM, et al. (2022) Nivolumab plus low-dose ipilimumab in previously treated patients with microsatellite instability-high/mismatch repair-deficient metastatic colorectal cancer: 4-year follow-up from CheckMate 142. Ann Oncol 33: 1052-1060. https://doi.org/10.1016/j.annonc.2022.06.008 ![]() |
[87] |
Overman MJ, Gelsomino F, Aglietta M, et al. (2024) Nivolumab plus relatlimab in patients with previously treated microsatellite instability-high/mismatch repair-deficient metastatic colorectal cancer: the phase II CheckMate 142 study. J Immunother Cancer 12: e008689. https://doi.org/10.1136/jitc-2023-008689 ![]() |
[88] |
Lentz RW, Friedrich TJ, Blatchford PJ, et al. (2024) A phase II study of potentiation of pembrolizumab with binimetinib and bevacizumab in refractory microsatellite-stable colorectal cancer. Clin Cancer Res 30: 3768-3778. https://doi.org/10.1158/1078-0432.CCR-24-0090 ![]() |
[89] |
Poto R, Troiani T, Criscuolo G, et al. (2022) Holistic approach to immune checkpoint inhibitor-related adverse events. Front Immunol 13: 804597. https://doi.org/10.3389/fimmu.2022.804597 ![]() |
[90] |
Cunningham M, Gupta R, Butler M (2024) Checkpoint inhibitor hepatotoxicity: pathogenesis and management. Hepatology 79: 198-212. https://doi.org/10.1097/HEP.0000000000000045 ![]() |
[91] |
Wang DY, Salem JE, Cohen JV, et al. (2018) Fatal toxic effects associated with immune checkpoint inhibitors: A systematic review and Meta-analysis. JAMA Oncol 4: 1721-1728. https://doi.org/10.1001/jamaoncol.2018.3923 ![]() |
[92] |
Forbes N, Hilsden RJ, Martel M, et al. (2021) Association between time to colonoscopy after positive fecal testing and colorectal cancer outcomes: A systematic review. Clin Gastroenterol Hepatol 19: 1344-1354.e8. https://doi.org/10.1016/j.cgh.2020.09.048 ![]() |
[93] |
Siegel R, DeSantis C, Virgo K, et al. (2012) Cancer treatment and survivorship statistics, 2012. CA Cancer J Clin 62: 220-241. https://doi.org/10.3322/caac.21149 ![]() |
1. | W. Jung, C.A. Morales, Training neural networks from an ergodic perspective, 2023, 0233-1934, 1, 10.1080/02331934.2023.2239852 | |
2. | Steffen Dereich, Arnulf Jentzen, Sebastian Kassing, On the Existence of Minimizers in Shallow Residual ReLU Neural Network Optimization Landscapes, 2024, 62, 0036-1429, 2640, 10.1137/23M1556241 | |
3. | N Karthikeyan, K Madheswari, Hrithik Umesh, N Rajkumar, C Viji, Emotion Recognition with a Hybrid VGG-ResNet Deep Learning Model: A Novel Approach for Robust Emotion Classification, 2024, 3, 2953-4860, 960, 10.56294/sctconf2024960 |