Differentiability with respect to delays for a Lotka-Volterra system

Abstract

Authors

D.Otrocol

Tiberiu Popoviciu In stitute of Numerical Analysis Romanian Academy

Diana Otrocol

Keywords

?

Paper coordinates

D. Otrocol, Differentiability with respect to delays for a Lotka-Volterra system, Creative Math. and Inf., 2007, Vol. 16, pp. 36-41

PDF

About this paper

Print ISSN

1584 – 286X

Online ISSN

1843 – 441X

google scholar link

??

Paper (preprint) in HTML form

creative_2007_16_036_041 html,body { width: 100%; height: 100%; } *, *::before,*::after { box-sizing: border-box; } body { margin: 0; color: #1E2029; font-size: 14px; line-height: normal; } hr { box-sizing: content-box; height: 0; overflow: visible; } h1, h2, h3, h4, h5, h6 { margin-top: 0; margin-bottom: 0.5em; color: rgba(0, 0, 0, 0.85); font-weight: 500; } p { margin-top: 0; margin-bottom: 1em; } ol, ul, dl { margin-top: 0; margin-bottom: 1em; } ol ol, ul ul, ol ul, ul ol { margin-bottom: 0; } dt { font-weight: 500; } dd { margin-bottom: 0.5em; margin-left: 0; } blockquote { margin: 0 0 1em; } dfn { font-style: italic; } b, strong { font-weight: bolder; } small { font-size: 80%; } sub, sup { position: relative; font-size: 75%; line-height: 0; vertical-align: baseline; } sub { bottom: -0.25em; } sup { top: -0.5em; } a { color: #0B93ff; text-decoration: none; background-color: transparent; outline: none; cursor: pointer; transition: color 0.3s; } a:hover { color: #33aaff; } a:active { color: #0070d9; } a:active, a:hover { text-decoration: none; outline: 0; } a[disabled] { color: rgba(0, 0, 0, 0.25); cursor: not-allowed; pointer-events: none; } pre, code, kbd, samp { font-size: 1em; } pre { margin-top: 0; margin-bottom: 1em; overflow: auto; } figure { margin: 0 0 1em; } img { vertical-align: middle; border-style: none; } svg:not(:root) { overflow: hidden; } table { border-collapse: collapse; } caption { padding-top: 0.75em; padding-bottom: 0.3em; color: rgba(0, 0, 0, 0.45); text-align: left; caption-side: bottom; } th { text-align: inherit; } mjx-container[jax="SVG"] { direction: ltr; } mjx-container[jax="SVG"] > svg { overflow: visible; min-height: 1px; min-width: 1px; } mjx-container[jax="SVG"] > svg a { fill: blue; stroke: blue; } mjx-assistive-mml { position: absolute !important; top: 0px; left: 0px; clip: rect(1px, 1px, 1px, 1px); padding: 1px 0px 0px 0px !important; border: 0px !important; display: block !important; width: auto !important; overflow: hidden !important; -webkit-touch-callout: none; -webkit-user-select: none; -khtml-user-select: none; -moz-user-select: none; -ms-user-select: none; user-select: none; } mjx-assistive-mml[display="block"] { width: 100% !important; } mjx-container[jax="SVG"][display="true"] { display: block; text-align: center; margin: 1em 0; } mjx-container[jax="SVG"][display="true"][width="full"] { display: flex; } mjx-container[jax="SVG"][justify="left"] { text-align: left; } mjx-container[jax="SVG"][justify="right"] { text-align: right; } g[data-mml-node="merror"] > g { fill: red; stroke: red; } g[data-mml-node="merror"] > rect[data-background] { fill: yellow; stroke: none; } g[data-mml-node="mtable"] > line[data-line], svg[data-table] > g > line[data-line] { stroke-width: 70px; fill: none; } g[data-mml-node="mtable"] > rect[data-frame], svg[data-table] > g > rect[data-frame] { stroke-width: 70px; fill: none; } g[data-mml-node="mtable"] > .mjx-dashed, svg[data-table] > g > .mjx-dashed { stroke-dasharray: 140; } g[data-mml-node="mtable"] > .mjx-dotted, svg[data-table] > g > .mjx-dotted { stroke-linecap: round; stroke-dasharray: 0,140; } g[data-mml-node="mtable"] > g > svg { overflow: visible; } [jax="SVG"] mjx-tool { display: inline-block; position: relative; width: 0; height: 0; } [jax="SVG"] mjx-tool > mjx-tip { position: absolute; top: 0; left: 0; } mjx-tool > mjx-tip { display: inline-block; padding: .2em; border: 1px solid #888; font-size: 70%; background-color: #F8F8F8; color: black; box-shadow: 2px 2px 5px #AAAAAA; } g[data-mml-node="maction"][data-toggle] { cursor: pointer; } mjx-status { display: block; position: fixed; left: 1em; bottom: 1em; min-width: 25%; padding: .2em .4em; border: 1px solid #888; font-size: 90%; background-color: #F8F8F8; color: black; } foreignObject[data-mjx-xml] { font-family: initial; line-height: normal; overflow: visible; } mjx-container[jax="SVG"] path[data-c], mjx-container[jax="SVG"] use[data-c] { stroke-width: 3; } #setText > div { justify-content: inherit; margin-top: 0; margin-bottom: 1em; } #setText div:last-child { margin-bottom: 0 !important; } #setText > br, #preview-content br { line-height: 1.2; } #preview-content > div { margin-top: 0; margin-bottom: 1em; } .proof > div, .theorem > div { margin-top: 1rem; } #preview-content table { margin-bottom: 1em; } #setText table { margin-bottom: 1em; } #preview-content .sub-table table, #setText .sub-table table { margin-bottom: 0; } mjx-container { text-indent: 0; overflow-y: hidden; overflow-x: auto; padding-top: 1px; padding-bottom: 1px; } .math-inline mjx-container { display: inline-block !important; page-break-inside: avoid; max-width: 100%; padding: 0; line-height: 0; } .math-inline[data-overflow="visible"] mjx-container { overflow: visible; } .math-inline mjx-container mjx-assistive-mml { max-width: 100%; } .math-block { align-items: center; page-break-after: auto; page-break-inside: avoid; margin: 0; display: block; /* mjx-container has block */ } .math-inline { display: inline-flex; /* mjx-container has inline-block. To prevent displacement during use overflow-x: auto;*/ max-width: 100%; } .math-block[data-width="full"] { overflow-x: auto; display: flex; /* mjx-container has flex */ } svg .math-inline { display: initial; max-width: initial; } svg .math-inline mjx-container { max-width: initial; } svg mjx-container { overflow: visible; padding: 0; } svg math-block[data-width="full"] { overflow: visible; } .math-block,.math-inline { --mmd-highlight-color: rgba(0, 147, 255, 0.25); --mmd-highlight-text-color: #1e2029; } .math-block[data-highlight-color] mjx-container[jax="SVG"] > svg { background-color: var(--mmd-highlight-color); } .math-block[data-highlight-text-color] mjx-container[jax="SVG"] > svg { color: var(--mmd-highlight-text-color); } .math-inline[data-highlight-color] mjx-container[jax="SVG"] { background-color: var(--mmd-highlight-color); } .math-inline[data-highlight-text-color] mjx-container[jax="SVG"] { color: var(--mmd-highlight-text-color); } .math-block p { flex-shrink: 1; } .math-block mjx-container { margin: 0 !important; } .math-error { background-color: yellow; color: red; } #preview-content img, #setText img { max-width: 100%; } #preview-content blockquote, #setText blockquote { page-break-inside: avoid; color: #666; margin: 0 0 1em 0; padding-left: 3em; border-left: .5em solid #eee; } #preview-content pre, #setText pre { border: none; padding: 0; overflow: auto; font-size: 85%; line-height: 1.45; border-radius: 6px; box-sizing: border-box; background: #f8f8fa; } #preview-content pre code, #setText pre code{ padding: 1rem; display: block; overflow-x: auto; line-height: 24px; } .empty { text-align: center; font-size: 18px; padding: 50px 0 !important; } #setText table, #preview-content table { display: table; overflow: auto; max-width: 100%; border-collapse: collapse; page-break-inside: avoid; } #setText table th, #preview-content table th { text-align: center; font-weight: bold; } #setText table td, #preview-content table td, #setText table th, #preview-content table th { border: 1px solid #dfe2e5; padding: 6px 13px; } #setText table tr, #preview-content table tr { background-color: #fff; border-top: 1px solid #c6cbd1; } #setText table tr:nth-child(2n), #preview-content table tr:nth-child(2n) { background-color: #f6f8fa; } #preview-content .main-title, #setText .main-title { text-align: center; line-height: 1.2; margin: 0 auto 1em auto; } #preview-content .author, #setText .author { text-align: center; margin: 0 auto; display: flex; justify-content: center; flex-wrap: wrap; } #preview-content .author p, #setText .author p { min-width: 30%; max-width: 50%; padding: 0 7px; } #preview-content .author > p > span, #setText .author > p > span { display: block; text-align: center; } #preview-content .section-title, #setText .section-title { margin-top: 1.5em; } #preview-content .abstract, #setText .abstract { text-align: justify; margin-bottom: 1em; } #preview-content .abstract p, #setText .abstract p { margin-bottom: 0; } @media print { #preview { font-size: 10pt!important; } svg { shape-rendering: crispEdges; } .math-block svg, math-inline svg { margin-top: 1px; } #preview-content img, #setText img { display: block; } #preview-content .figure_img img, #setText .figure_img img { display: inline; } .preview-right { word-break: break-word; } #preview-content h1, #setText h1 { page-break-inside: avoid; position: relative; border: 2px solid transparent; } #preview-content h1::after, #setText h1::after { content: ""; display: block; height: 100px; margin-bottom: -100px; position: relative; } #preview-content h2, #setText h2 { page-break-inside: avoid; position: relative; border: 2px solid transparent; } #preview-content h2::after, #setText h2::after { content: ""; display: block; height: 100px; margin-bottom: -100px; position: relative; } #preview-content h3, #setText h3 { page-break-inside: avoid; position: relative; border: 2px solid transparent; } #preview-content h3::after, #setText h3::after { content: ""; display: block; height: 100px; margin-bottom: -100px; position: relative; } #preview-content h4, #setText h4 { page-break-inside: avoid; position: relative; border: 2px solid transparent; } #preview-content h4::after, #setText h4::after { content: ""; display: block; height: 100px; margin-bottom: -100px; position: relative; } #preview-content h5, #setText h5 { page-break-inside: avoid; position: relative; border: 2px solid transparent; } #preview-content h5::after, #setText h5::after { content: ""; display: block; height: 100px; margin-bottom: -100px; position: relative; } #preview-content h6, #setText h6 { page-break-inside: avoid; position: relative; border: 2px solid transparent; } #preview-content h6::after, #setText h6::after { content: ""; display: block; height: 100px; margin-bottom: -100px; position: relative; } } #preview-content sup, #setText sup { top: -.5em; position: relative; font-size: 75%; line-height: 0; vertical-align: baseline; } #preview-content .text-url, #setText .text-url { color: #0B93ff; cursor: text; pointer-events: none; } #preview-content .text-url a:hover, #setText .text-url a:hover { color: #0B93ff; } mark { background-color: #feffe6; } span[data-underline-type] mark { background: inherit; background-color: #feffe6; padding-top: 0; padding-bottom: 0; } *[data-has-dotfill] { position: relative; overflow: hidden; } *[data-has-dotfill] .dotfill::after { position: absolute; padding-left: .25ch; content: " . . . . . . . . . . . . . . . . . . . " ". . . . . . . . . . . . . . . . . . . . . . . " ". . . . . . . . . . . . . . . . . . . . . . . " ". . . . . . . . . . . . . . . . . . . . . . . " ". . . . . . . . . . . . . . . . . . . . . . . " ". . . . . . . . . . . . . . . . . . . . . . . " ". . . . . . . . . . . . . . . . . . . . . . . "; text-align: right; } .smiles { text-align: center; } div.svg-container, #setText > div.svg-container { display: flex; justify-content: center; } #preview-content code, #setText code { font-family: Inconsolata; font-size: inherit; display: initial; background: #f8f8fa; } #preview-content .mmd-highlight code, #setText .mmd-highlight code, #preview-content pre.mmd-highlight code, #setText pre.mmd-highlight code { background-color: transparent; } #preview-content pre code, #setText pre code { font-family: 'DM Mono', Inconsolata, monospace; color: #333; font-size: 15px; } .hljs-comment, .hljs-quote { color: #998; font-style: italic; } .hljs-command { color: #005cc5; } .hljs-keyword, .hljs-selector-tag, .hljs-subst { color: #d73a49; font-weight: bold; } .hljs-number, .hljs-literal, .hljs-variable, .hljs-template-variable, .hljs-tag .hljs-attr { color: #005cc5; } .hljs-string, .hljs-doctag { color: #24292e; } .hljs-title, .hljs-section, .hljs-selector-id { color: #6f42c1; font-weight: bold; } .hljs-subst { font-weight: normal; } .hljs-type, .hljs-class .hljs-title { color: #458; font-weight: bold; } .hljs-tag, .hljs-name, .hljs-attribute { color: #000080; font-weight: normal; } .hljs-regexp, .hljs-link { color: #009926; } .hljs-symbol, .hljs-bullet { color: #990073; } .hljs-built_in, .hljs-builtin-name { color: #24292e; } .hljs-meta { color: #999; font-weight: bold; } .hljs-meta-keyword { color: #d73a49; } .hljs-meta-string { color: #032f62; } .hljs-deletion { background: #fdd; } .hljs-addition { background: #dfd; } .hljs-emphasis { font-style: italic; } .hljs-strong { font-weight: bold; } .table_tabular table th, .table_tabular table th { border: none !important; padding: 6px 13px; } .tabular tr, .tabular tr { border-top: none !important; border-bottom: none !important; } .tabular td, .tabular td { border-style: none !important; background-color: #fff; border-color: #000 !important; word-break: keep-all; padding: 0.1em 0.5em !important; } .tabular { display: inline-table !important; height: fit-content; } .tabular td > p { margin-bottom: 0; margin-top: 0; } .tabular td._empty { height: 1.3em; } .tabular td .f { opacity: 0; } html[data-theme="dark"] .tabular tr, html[data-theme="dark"] .tabular td { background-color: #202226; border-color: #fff !important; } .table_tabular { overflow-x: auto; padding: 0 2px 0.5em 2px; } .figure_img { margin-bottom: 0.5em; overflow-x: auto; } ol.enumerate, ul.itemize { padding-inline-start: 40px; } /* It's commented because counter not supporting to change value ol.enumerate.lower-alpha { counter-reset: item ; list-style-type: none !important; } .enumerate.lower-alpha > li { position: relative; } .enumerate.lower-alpha > li:before { content: "("counter(item, lower-alpha)")"; counter-increment: item; position: absolute; left: -47px; width: 47px; display: flex; justify-content: flex-end; padding-right: 7px; flex-wrap: nowrap; word-break: keep-all; } */ .itemize > li { position: relative; min-height: 1.4em; } .itemize > li > span.li_level, .li_enumerate.not_number > span.li_level { position: absolute; right: 100%; white-space: nowrap; width: max-content;; display: flex; justify-content: flex-end; padding-right: 10px; box-sizing: border-box; } .li_enumerate.not_number { position: relative; display: inline-block; list-style-type: none; min-height: 1.4em; } .itemize > li > span.li_level .math-inline, .enumerate > li > span.li_level .math-inline { display: inline-block; } #preview { font-family: 'CMU Serif', 'Georgia', Helvetica, Arial, sans-serif; font-size: 17px; visibility: visible; word-break: break-word; padding: 2.5em; max-width: 800px; margin: auto; box-sizing: content-box; } #preview h1, #preview h2, #preview h3, #preview h4, #preview h5, #preview strong { font-family: 'CMU Serif Bold', 'Georgia', Helvetica, Arial, sans-serif; } #preview i, #preview em { font-family: 'CMU Serif Italic', 'Georgia', Helvetica, Arial, sans-serif; } .mmd-menu { max-width: 320px; position: absolute; background-color: white; color: black; width: auto; padding: 5px 0px; border: 1px solid #E5E6EB; margin: 0; cursor: default; font: menu; text-align: left; text-indent: 0; text-transform: none; line-height: normal; letter-spacing: normal; word-spacing: normal; word-wrap: normal; white-space: nowrap; float: none; z-index: 201; border-radius: 5px; -webkit-border-radius: 5px; -moz-border-radius: 5px; -khtml-border-radius: 5px; box-shadow: 0px 10px 20px #808080; -webkit-box-shadow: 0px 10px 20px #808080; -moz-box-shadow: 0px 10px 20px #808080; -khtml-box-shadow: 0px 10px 20px #808080; } .mmd-menu:focus { outline: none; } .mmd-menu.mmd-menu-sm { max-width: 100vw; padding-bottom: 34px; border-radius: 0; -webkit-border-radius: 0; -moz-border-radius: 0; -khtml-border-radius: 0; } .mmd-menu-item-icon { color: #1e2029; margin-left: auto; align-items: center; display: flex; flex-shrink: 0; display: none; } .mmd-menu-item { padding-bottom: 8px; padding-top: 8px; padding-left: 1.25rem; padding-right: 1.25rem; display: flex; background: transparent; height: 52px; max-height: 52px; } .mmd-menu-item:focus { outline: none; } .mmd-menu-item.active { background-color: #e1e0e5; } .mmd-menu-item.active .mmd-menu-item-icon { display: flex; } .mmd-menu-item-container { overflow: hidden; } .mmd-menu-item-title { color: #1e2029; white-space: nowrap; text-overflow: ellipsis; overflow: hidden; font-size: 14px; line-height: 20px; } .mmd-menu-item-value { color: #7d829c; white-space: nowrap; text-overflow: ellipsis; overflow: hidden; font-size: 12px; line-height: 16px; } html[data-theme="dark"] .mmd-menu-item-title { color: #ebefe7; } html[data-theme="dark"] .mmd-menu-item.active .mmd-menu-item-title { color: #1e2029; } html[data-theme="dark"] .mmd-menu { background-color: #33363a; } .mmd-context-menu-overlay{ background: rgba(0, 0, 0, 0.56); } .ClipboardButton { padding: 0; margin: 0.5rem; display: inline-block; cursor: pointer; color: rgb(36, 41, 47); background: rgb(246, 248, 250); border-radius: 6px; border: 1px solid rgba(31, 35, 40, 0.15); box-shadow: rgba(31, 35, 40, 0.04) 0 1px 0 0, rgba(255, 255, 255, 0.25) 0 1px 0 0 inset; position: relative; } .ClipboardButton:hover { background-color: rgb(243, 244, 246); border-color: rgba(31, 35, 40, 0.15); transition-duration: .1s; } td .mmd-clipboard-copy-container { line-height: 0; } td .ClipboardButton { margin: 1px; line-height: 0; } td .ClipboardButton .mmd-clipboard-icon { margin: 1px !important; transform: scale(0.6); } .mmd-clipboard-icon { fill: currentColor; vertical-align: text-bottom; } .mmd-clipboard-copy-icon { color: rgb(101, 109, 118); } .mmd-clipboard-check-icon { color: rgb(26, 127, 55); } .mmd-tooltipped-no-delay:hover::before, .mmd-tooltipped-no-delay:hover::after { animation-delay: 0s; } .mmd-tooltipped:hover::before, .mmd-tooltipped:hover::after { display: inline-block; text-decoration: none; animation-name: tooltip-appear; animation-duration: .1s; animation-fill-mode: forwards; animation-timing-function: ease-in; animation-delay: .4s; } .mmd-tooltipped-w::before { top: 50%; bottom: 50%; left: -7px; margin-top: -6px; border-left-color: rgb(36, 41, 47); } .mmd-tooltipped::before { position: absolute; z-index: 1000001; display: none; width: 0; height: 0; color: rgb(36, 41, 47); pointer-events: none; content: ""; border: 6px solid transparent; opacity: 0; } .mmd-tooltipped-w::after { right: 100%; bottom: 50%; margin-right: 6px; transform: translateY(50%); } .mmd-tooltipped::after { position: absolute; z-index: 1000000; display: none; padding: 0.5em 0.75em; font: normal normal 11px/1.5 'CMU Serif', 'Georgia', Helvetica, Arial, sans-serif; -webkit-font-smoothing: subpixel-antialiased; color: rgb(255, 255, 255); text-align: center; text-decoration: none; text-shadow: none; text-transform: none; letter-spacing: normal; word-wrap: break-word; white-space: pre; pointer-events: none; content: attr(aria-label); background: rgb(36, 41, 47); border-radius: 6px; opacity: 0; }

Differentiability with respect to delays for a Lotka-Volterra system*

Diana Otrocol

ABSTRACT. We study the differentiability with respect to delays using the weakly Picard operators technique.

1. Introduction

Consider the following Lotka-Volterra differential system with delays
(1.1) x i ′ ( t ) = f i ( t , x 1 ( t ) , x 2 ( t ) , x 1 ( t − τ 1 ) , x 2 ( t − τ 2 ) ) , i = 1 , 2 , t ∈ [ t 0 , b ] (1.2) { x 1 ( t ) = φ ( t ) , t ∈ [ t 0 − τ 1 , t 0 ] x 2 ( t ) = ψ ( t ) , t ∈ [ t 0 − τ 2 , t 0 ] (1.1) x i ′ ( t ) = f i t , x 1 ( t ) , x 2 ( t ) , x 1 t − τ 1 , x 2 t − τ 2 , i = 1 , 2 , t ∈ t 0 , b (1.2) x 1 ( t ) = φ ( t ) , t ∈ t 0 − τ 1 , t 0 x 2 ( t ) = ψ ( t ) , t ∈ t 0 − τ 2 , t 0 {:[(1.1)x_(i)^(')(t)=f_(i)(t,x_(1)(t),x_(2)(t),x_(1)(t-tau_(1)),x_(2)(t-tau_(2)))","i=1","2","t in[t_(0),b]],[(1.2){[x_(1)(t)=varphi(t)","t in[t_(0)-tau_(1),t_(0)]],[x_(2)(t)=psi(t)","t in[t_(0)-tau_(2),t_(0)]]:}]:}\begin{gather*} x_{i}^{\prime}(t)=f_{i}\left(t, x_{1}(t), x_{2}(t), x_{1}\left(t-\tau_{1}\right), x_{2}\left(t-\tau_{2}\right)\right), i=1,2, t \in\left[t_{0}, b\right] \tag{1.1}\\ \left\{\begin{array}{l} x_{1}(t)=\varphi(t), t \in\left[t_{0}-\tau_{1}, t_{0}\right] \\ x_{2}(t)=\psi(t), t \in\left[t_{0}-\tau_{2}, t_{0}\right] \end{array}\right. \tag{1.2} \end{gather*}(1.1)xi′(t)=fi(t,x1(t),x2(t),x1(t−τ1),x2(t−τ2)),i=1,2,t∈[t0,b](1.2){x1(t)=φ(t),t∈[t0−τ1,t0]x2(t)=ψ(t),t∈[t0−τ2,t0]
Suppose that we have satisfied the following conditions:
( H 1 ) t 0 < b , τ , τ 1 , τ 2 > 0 , τ 1 < τ 2 < τ , τ 1 , τ 2 ∈ J , J = [ t 0 , τ ] H 1 t 0 < b , τ , τ 1 , τ 2 > 0 , τ 1 < τ 2 < τ , τ 1 , τ 2 ∈ J , J = t 0 , τ (H_(1))t_(0) < b,tau,tau_(1),tau_(2) > 0,tau_(1) < tau_(2) < tau,tau_(1),tau_(2)in J,J=[t_(0),tau]\left(\mathrm{H}_{1}\right) t_{0}<b, \tau, \tau_{1}, \tau_{2}>0, \tau_{1}<\tau_{2}<\tau, \tau_{1}, \tau_{2} \in J, J=\left[t_{0}, \tau\right](H1)t0<b,τ,τ1,τ2>0,τ1<τ2<τ,τ1,τ2∈J,J=[t0,τ] a compact interval;
( H 2 ) f i ∈ C 1 ( [ t 0 , b ] × R 4 , R ) , i = 1 , 2 H 2 f i ∈ C 1 t 0 , b × R 4 , R , i = 1 , 2 (H_(2))f_(i)inC^(1)([t_(0),b]xxR^(4),R),i=1,2\left(\mathrm{H}_{2}\right) f_{i} \in C^{1}\left(\left[t_{0}, b\right] \times \mathbb{R}^{4}, \mathbb{R}\right), i=1,2(H2)fi∈C1([t0,b]×R4,R),i=1,2;
( H 3 ) H 3 (H_(3))\left(\mathrm{H}_{3}\right)(H3) there exists L f > 0 L f > 0 L_(f) > 0L_{f}>0Lf>0 such that
‖ ∂ f i ∂ u j ( t , u 1 , u 2 , u 3 , u 4 ) ‖ R ≤ L f ∂ f i ∂ u j t , u 1 , u 2 , u 3 , u 4 R ≤ L f ||(delf_(i))/(delu_(j))(t,u_(1),u_(2),u_(3),u_(4))||_(R) <= L_(f)\left\|\frac{\partial f_{i}}{\partial u_{j}}\left(t, u_{1}, u_{2}, u_{3}, u_{4}\right)\right\|_{\mathbb{R}} \leq L_{f}‖∂fi∂uj(t,u1,u2,u3,u4)‖R≤Lf
for all t ∈ [ t 0 , b ] , u j ∈ R , j = 1 , 4 ― , i = 1 , 2 t ∈ t 0 , b , u j ∈ R , j = 1 , 4 ¯ , i = 1 , 2 t in[t_(0),b],u_(j)in R,j= bar(1,4),i=1,2t \in\left[t_{0}, b\right], u_{j} \in R, j=\overline{1,4}, i=1,2t∈[t0,b],uj∈R,j=1,4―,i=1,2;
( H 4 ) φ ∈ C ( [ t 0 − τ , t 0 ] , R ) , ψ ∈ C ( [ t 0 − τ , t 0 ] , R ) ; H 4 φ ∈ C t 0 − τ , t 0 , R , ψ ∈ C t 0 − τ , t 0 , R ; (H_(4))varphi in C([t_(0)-tau,t_(0)],R),psi in C([t_(0)-tau,t_(0)],R);\left(\mathrm{H}_{4}\right) \varphi \in C\left(\left[t_{0}-\tau, t_{0}\right], \mathbb{R}\right), \psi \in C\left(\left[t_{0}-\tau, t_{0}\right], \mathbb{R}\right) ;(H4)φ∈C([t0−τ,t0],R),ψ∈C([t0−τ,t0],R);
In the above conditions, from the Theorem 1, in [4], we have that the problem (1.1)-(1.2) has a unique solution, ( x 1 ( t ) , x 2 ( t ) ) x 1 ( t ) , x 2 ( t ) (x_(1)(t),x_(2)(t))\left(x_{1}(t), x_{2}(t)\right)(x1(t),x2(t)).

2. Weakly Picard operators

In this paper we need some notions and results from the weakly Picard operator theory (for more details see I. A. Rus [9], [8], M. Şerban [14]).
Let ( X , d X , d X,dX, dX,d ) be a metric space and A : X → X A : X → X A:X rarr XA: X \rightarrow XA:X→X an operator. We shall use the following notations:
F A := { x ∈ X ∣ A ( x ) = x } F A := { x ∈ X ∣ A ( x ) = x } F_(A):={x in X∣A(x)=x}F_{A}:=\{x \in X \mid A(x)=x\}FA:={x∈X∣A(x)=x} - the fixed point set of A A AAA;
I ( A ) := { Y ∈ P ( X ) ∣ A ( Y ) ⊂ Y } I ( A ) := { Y ∈ P ( X ) ∣ A ( Y ) ⊂ Y } I(A):={Y in P(X)∣A(Y)sub Y}I(A):=\{Y \in P(X) \mid A(Y) \subset Y\}I(A):={Y∈P(X)∣A(Y)⊂Y} - the family of the nonempty invariant subset of A A AAA;
A n + 1 := A ∘ A n , A 0 = 1 X , A 1 = A , n ∈ N A n + 1 := A ∘ A n , A 0 = 1 X , A 1 = A , n ∈ N A^(n+1):=A@A^(n),A^(0)=1_(X),A^(1)=A,n inNA^{n+1}:=A \circ A^{n}, A^{0}=1_{X}, A^{1}=A, n \in \mathbb{N}An+1:=A∘An,A0=1X,A1=A,n∈N - the iterant operators of A A AAA, where 1 X 1 X 1_(X)1_{X}1X is the identity operator;
P ( X ) := { Y ⊂ X ∣ Y ≠ ∅ } P ( X ) := { Y ⊂ X ∣ Y ≠ ∅ } P(X):={Y sub X∣Y!=O/}P(X):=\{Y \subset X \mid Y \neq \emptyset\}P(X):={Y⊂X∣Y≠∅} - the set of the parts of X X XXX.
Definition 2.1. Let ( X , d X , d X,dX, dX,d ) be a metric space. An operator A : X → X A : X → X A:X rarr XA: X \rightarrow XA:X→X is a Picard operator (PO) if there exists x ∗ ∈ X x ∗ ∈ X x^(**)in Xx^{*} \in Xx∗∈X such that:
(i) F A = { x ∗ } F A = x ∗ F_(A)={x^(**)}F_{A}=\left\{x^{*}\right\}FA={x∗};
(ii) the sequence ( A n ( x 0 ) ) n ∈ N A n x 0 n ∈ N (A^(n)(x_(0)))_(n inN)\left(A^{n}\left(x_{0}\right)\right)_{n \in \mathbb{N}}(An(x0))n∈N converges to x ∗ x ∗ x^(**)x^{*}x∗ for all x 0 ∈ X x 0 ∈ X x_(0)in Xx_{0} \in Xx0∈X.
Definition 2.2. Let ( X , d X , d X,dX, dX,d ) be a metric space. An operator A : X → X A : X → X A:X rarr XA: X \rightarrow XA:X→X is a weakly Picard operator (WPO) if the sequence ( A n ( x ) ) n ∈ N A n ( x ) n ∈ N (A^(n)(x))_(n inN)\left(A^{n}(x)\right)_{n \in \mathbb{N}}(An(x))n∈N converges for all x ∈ X x ∈ X x in Xx \in Xx∈X, and its limit ( which may depend on x x xxx ) is a fixed point of A A AAA.
Theorem 2.1. Let ( X , d X , d X,dX, dX,d ) be a metric space and A : X → X A : X → X A:X rarr XA: X \rightarrow XA:X→X an operator. The operator A A AAA is WPO ( c c ccc-WPO) if and only if there exists a partition of X X XXX,
X = ∪ λ ∈ Λ X λ X = ∪ λ ∈ Λ X λ X=uu_(lambda in Lambda)X_(lambda)X=\cup_{\lambda \in \Lambda} X_{\lambda}X=∪λ∈ΛXλ
such that:
(a) X λ ∈ I ( A ) , λ ∈ Λ , I ( A ) X λ ∈ I ( A ) , λ ∈ Λ , I ( A ) X_(lambda)in I(A),lambda in Lambda,I(A)X_{\lambda} \in I(A), \lambda \in \Lambda, I(A)Xλ∈I(A),λ∈Λ,I(A)-the family of nonempty invariant subsets of A A AAA;
(b) A | X λ : X λ → X λ A X λ : X λ → X λ A|_(X_(lambda)):X_(lambda)rarrX_(lambda)\left.A\right|_{X_{\lambda}}: X_{\lambda} \rightarrow X_{\lambda}A|Xλ:Xλ→Xλ is a Picard (c-Picard) operator for all λ ∈ Λ λ ∈ Λ lambda in Lambda\lambda \in \Lambdaλ∈Λ.
Theorem 2.2. (Fibre contraction principle). Let ( X , d X , d X,dX, dX,d ) and ( Y , ρ Y , ρ Y,rhoY, \rhoY,ρ ) be two metric spaces and A : X × X → X × X , A = ( B , C ) , ( B : X → X , C : X × Y → Y ) A : X × X → X × X , A = ( B , C ) , ( B : X → X , C : X × Y → Y ) A:X xx X rarr X xx X,A=(B,C),(B:X rarr X,C:X xx Y rarr Y)A: X \times X \rightarrow X \times X, A=(B, C),(B: X \rightarrow X, C: X \times Y \rightarrow Y)A:X×X→X×X,A=(B,C),(B:X→X,C:X×Y→Y) a triangular operator. We suppose that
(i) ( Y , ρ ) ( Y , ρ ) (Y,rho)(Y, \rho)(Y,ρ) is a complete metric space;
(ii) the operator B B BBB is P O P O POP OPO;
(iii) there exists L ∈ [ 0 , 1 ) L ∈ [ 0 , 1 ) L in[0,1)L \in[0,1)L∈[0,1) such that C ( x , ⋅ ) : Y → Y C ( x , ⋅ ) : Y → Y C(x,*):Y rarr YC(x, \cdot): Y \rightarrow YC(x,⋅):Y→Y is a L L LLL-contraction, for all x ∈ X x ∈ X x in Xx \in Xx∈X;
(iv) if ( x ∗ , y ∗ ) ∈ F A x ∗ , y ∗ ∈ F A (x^(**),y^(**))inF_(A)\left(x^{*}, y^{*}\right) \in F_{A}(x∗,y∗)∈FA, then C ( ⋅ , y ∗ ) C ⋅ , y ∗ C(*,y^(**))C\left(\cdot, y^{*}\right)C(⋅,y∗) is continuous in x ∗ x ∗ x^(**)x^{*}x∗.
Then the operator A A AAA is P O P O POP OPO.

3. Main Result

Now we prove that
x i ( t , ⋅ ) ∈ C 1 ( J ) , for all t ∈ [ t 0 − τ , b ] , i = 1 , 2 . x i ( t , ⋅ ) ∈ C 1 ( J ) ,  for all  t ∈ t 0 − τ , b , i = 1 , 2 . x_(i)(t,*)inC^(1)(J)," for all "t in[t_(0)-tau,b],i=1,2.x_{i}(t, \cdot) \in C^{1}(J), \text { for all } t \in\left[t_{0}-\tau, b\right], i=1,2 .xi(t,⋅)∈C1(J), for all t∈[t0−τ,b],i=1,2.
For this we consider the system
(3.3) x i ′ ( t ) = f i ( t , x 1 ( t ) , x 2 ( t ) , x 1 ( t − τ 1 ) , x 2 ( t − τ 2 ) ) , i = 1 , 2 (3.3) x i ′ ( t ) = f i t , x 1 ( t ) , x 2 ( t ) , x 1 t − τ 1 , x 2 t − τ 2 , i = 1 , 2 {:(3.3)x_(i)^(')(t)=f_(i)(t,x_(1)(t),x_(2)(t),x_(1)(t-tau_(1)),x_(2)(t-tau_(2)))","i=1","2:}\begin{equation*} x_{i}^{\prime}(t)=f_{i}\left(t, x_{1}(t), x_{2}(t), x_{1}\left(t-\tau_{1}\right), x_{2}\left(t-\tau_{2}\right)\right), i=1,2 \tag{3.3} \end{equation*}(3.3)xi′(t)=fi(t,x1(t),x2(t),x1(t−τ1),x2(t−τ2)),i=1,2
where t ∈ [ t 0 , b ] , x 1 ∈ C [ t 0 − τ 1 , b ] ∩ C 1 [ t 0 , b ] , x 2 ∈ C [ t 0 − τ 2 , b ] ∩ C 1 [ t 0 , b ] t ∈ t 0 , b , x 1 ∈ C t 0 − τ 1 , b ∩ C 1 t 0 , b , x 2 ∈ C t 0 − τ 2 , b ∩ C 1 t 0 , b t in[t_(0),b],x_(1)in C[t_(0)-tau_(1),b]nnC^(1)[t_(0),b],x_(2)in C[t_(0)-tau_(2),b]nnC^(1)[t_(0),b]t \in\left[t_{0}, b\right], x_{1} \in C\left[t_{0}-\tau_{1}, b\right] \cap C^{1}\left[t_{0}, b\right], x_{2} \in C\left[t_{0}-\tau_{2}, b\right] \cap C^{1}\left[t_{0}, b\right]t∈[t0,b],x1∈C[t0−τ1,b]∩C1[t0,b],x2∈C[t0−τ2,b]∩C1[t0,b].
From the above considerations, we can formulate the following theorem
Theorem 3.3. Consider the problem (3.3)-(1.2), in the conditions ( H 1 ) − ( H 4 ) H 1 − H 4 (H_(1))-(H_(4))\left(H_{1}\right)-\left(H_{4}\right)(H1)−(H4). Then the problem (3.3)-(1.2) has a unique solution ( x 1 ∗ , x 2 ∗ ) , x 1 ∗ ∈ C [ t 0 − τ 1 , b ] ∩ C 1 [ t 0 , b ] , x 2 ∗ ∈ C [ t 0 − τ 2 , b ] ∩ C 1 [ t 0 , b ] x 1 ∗ , x 2 ∗ , x 1 ∗ ∈ C t 0 − τ 1 , b ∩ C 1 t 0 , b , x 2 ∗ ∈ C t 0 − τ 2 , b ∩ C 1 t 0 , b (x_(1)^(**),x_(2)^(**)),x_(1)^(**)in C[t_(0)-tau_(1),b]nnC^(1)[t_(0),b],x_(2)^(**)in C[t_(0)-tau_(2),b]nnC^(1)[t_(0),b]\left(x_{1}^{*}, x_{2}^{*}\right), x_{1}^{*} \in C\left[t_{0}-\tau_{1}, b\right] \cap C^{1}\left[t_{0}, b\right], x_{2}^{*} \in C\left[t_{0}-\tau_{2}, b\right] \cap C^{1}\left[t_{0}, b\right](x1∗,x2∗),x1∗∈C[t0−τ1,b]∩C1[t0,b],x2∗∈C[t0−τ2,b]∩C1[t0,b] and the solution is differentiable on τ 1 τ 1 tau_(1)\tau_{1}τ1 and τ 2 τ 2 tau_(2)\tau_{2}τ2.
Proof. In what follows we consider the following integral equations:
x 1 ( t , τ 1 , τ 2 ) = = { φ ( t ) , t ∈ [ t 0 − τ 1 , t 0 ] φ ( t 0 ) + ∫ t 0 t f 1 ( s , x 1 ( s , τ 1 , τ 2 ) , x 2 ( s , τ 1 , τ 2 ) , x 1 ( s − τ 1 , τ 1 , τ 2 ) , x 2 ( s − τ 2 , τ 1 , τ 2 ) ) d s , t ∈ [ t 0 , b ] x 2 ( t , τ 1 , τ 2 ) = (3.4) = { ψ ( t ) , t ∈ [ t 0 − τ 2 , t 0 ] ψ ( t 0 ) + ∫ t 0 t f 2 ( s , x 1 ( s , τ 1 , τ 2 ) , x 2 ( s , τ 1 , τ 2 ) , x 1 ( s − τ 1 , τ 1 , τ 2 ) , x 2 ( s − τ 2 , τ 1 , τ 2 ) ) d s , t ∈ [ t 0 , b ] x 1 t , τ 1 , τ 2 = = φ ( t ) , t ∈ t 0 − τ 1 , t 0 φ t 0 + ∫ t 0 t &hairsp; f 1 s , x 1 s , τ 1 , τ 2 , x 2 s , τ 1 , τ 2 , x 1 s − τ 1 , τ 1 , τ 2 , x 2 s − τ 2 , τ 1 , τ 2 d s , t ∈ t 0 , b x 2 t , τ 1 , τ 2 = (3.4) = ψ ( t ) , t ∈ t 0 − τ 2 , t 0 ψ t 0 + ∫ t 0 t &hairsp; f 2 s , x 1 s , τ 1 , τ 2 , x 2 s , τ 1 , τ 2 , x 1 s − τ 1 , τ 1 , τ 2 , x 2 s − τ 2 , τ 1 , τ 2 d s , t ∈ t 0 , b {:[x_(1)(t,tau_(1),tau_(2))=],[={[varphi(t)","t in[t_(0)-tau_(1),t_(0)]],[varphi(t_(0))+int_(t_(0))^(t)f_(1)(s,x_(1)(s,tau_(1),tau_(2)),x_(2)(s,tau_(1),tau_(2)),x_(1)(s-tau_(1),tau_(1),tau_(2)),x_(2)(s-tau_(2),tau_(1),tau_(2)))ds","t in[t_(0),b]]:}],[x_(2)(t,tau_(1),tau_(2))=],[(3.4)={[psi(t)","t in[t_(0)-tau_(2),t_(0)]],[psi(t_(0))+int_(t_(0))^(t)f_(2)(s,x_(1)(s,tau_(1),tau_(2)),x_(2)(s,tau_(1),tau_(2)),x_(1)(s-tau_(1),tau_(1),tau_(2)),x_(2)(s-tau_(2),tau_(1),tau_(2)))ds","t in[t_(0),b]]:}]:}\begin{align*} & x_{1}\left(t, \tau_{1}, \tau_{2}\right)= \\ & =\left\{\begin{array}{l} \varphi(t), t \in\left[t_{0}-\tau_{1}, t_{0}\right] \\ \varphi\left(t_{0}\right)+\int_{t_{0}}^{t} f_{1}\left(s, x_{1}\left(s, \tau_{1}, \tau_{2}\right), x_{2}\left(s, \tau_{1}, \tau_{2}\right), x_{1}\left(s-\tau_{1}, \tau_{1}, \tau_{2}\right), x_{2}\left(s-\tau_{2}, \tau_{1}, \tau_{2}\right)\right) d s, t \in\left[t_{0}, b\right] \end{array}\right. \\ & x_{2}\left(t, \tau_{1}, \tau_{2}\right)= \\ & =\left\{\begin{array}{l} \psi(t), t \in\left[t_{0}-\tau_{2}, t_{0}\right] \\ \psi\left(t_{0}\right)+\int_{t_{0}}^{t} f_{2}\left(s, x_{1}\left(s, \tau_{1}, \tau_{2}\right), x_{2}\left(s, \tau_{1}, \tau_{2}\right), x_{1}\left(s-\tau_{1}, \tau_{1}, \tau_{2}\right), x_{2}\left(s-\tau_{2}, \tau_{1}, \tau_{2}\right)\right) d s, t \in\left[t_{0}, b\right] \end{array}\right. \tag{3.4} \end{align*}x1(t,τ1,τ2)=={φ(t),t∈[t0−τ1,t0]φ(t0)+∫t0tf1(s,x1(s,τ1,τ2),x2(s,τ1,τ2),x1(s−τ1,τ1,τ2),x2(s−τ2,τ1,τ2))ds,t∈[t0,b]x2(t,τ1,τ2)=(3.4)={ψ(t),t∈[t0−τ2,t0]ψ(t0)+∫t0tf2(s,x1(s,τ1,τ2),x2(s,τ1,τ2),x1(s−τ1,τ1,τ2),x2(s−τ2,τ1,τ2))ds,t∈[t0,b]
Now, let take the operator
A f : C [ t 0 − τ 1 , b ] × C [ t 0 − τ 2 , b ] → C [ t 0 − τ 1 , b ] × C [ t 0 − τ 2 , b ] A f : C t 0 − τ 1 , b × C t 0 − τ 2 , b → C t 0 − τ 1 , b × C t 0 − τ 2 , b A_(f):C[t_(0)-tau_(1),b]xx C[t_(0)-tau_(2),b]rarr C[t_(0)-tau_(1),b]xx C[t_(0)-tau_(2),b]A_{f}: C\left[t_{0}-\tau_{1}, b\right] \times C\left[t_{0}-\tau_{2}, b\right] \rightarrow C\left[t_{0}-\tau_{1}, b\right] \times C\left[t_{0}-\tau_{2}, b\right]Af:C[t0−τ1,b]×C[t0−τ2,b]→C[t0−τ1,b]×C[t0−τ2,b]
given by the relation
A f ( x 1 , x 2 ) = ( A f 1 ( x 1 , x 2 ) , A f 2 ( x 1 , x 2 ) ) A f x 1 , x 2 = A f 1 x 1 , x 2 , A f 2 x 1 , x 2 A_(f)(x_(1),x_(2))=(A_(f_(1))(x_(1),x_(2)),A_(f_(2))(x_(1),x_(2)))A_{f}\left(x_{1}, x_{2}\right)=\left(A_{f_{1}}\left(x_{1}, x_{2}\right), A_{f_{2}}\left(x_{1}, x_{2}\right)\right)Af(x1,x2)=(Af1(x1,x2),Af2(x1,x2))
where
A f 1 ( x 1 , x 2 ) ( t , τ 1 , τ 2 ) = { φ ( t ) , t ∈ [ t 0 − τ 1 , t 0 ] φ ( t 0 ) + ∫ t 0 t f 1 ( s , x 1 ( s , τ 1 , τ 2 ) , x 2 ( s , τ 1 , τ 2 ) x 1 ( s − τ 1 , τ 1 , τ 2 ) , x 2 ( s − τ 2 , τ 1 , τ 2 ) ) d s , t ∈ [ t 0 , b ] A f 2 ( x 1 , x 2 ) ( t , τ 1 , τ 2 ) = { ψ ( t ) , t ∈ [ t 0 − τ 2 , t 0 ] ψ ( t 0 ) + ∫ t 0 t f 2 ( s , x 1 ( s , τ 1 , τ 2 ) , x 2 ( s , τ 1 , τ 2 ) x 1 ( s − τ 1 , τ 1 , τ 2 ) , x 2 ( s − τ 2 , τ 1 , τ 2 ) ) d s , t ∈ [ t 0 , b ] A f 1 x 1 , x 2 t , τ 1 , τ 2 = φ ( t ) , t ∈ t 0 − τ 1 , t 0 φ t 0 + ∫ t 0 t &hairsp; f 1 s , x 1 s , τ 1 , τ 2 , x 2 s , τ 1 , τ 2 x 1 s − τ 1 , τ 1 , τ 2 , x 2 s − τ 2 , τ 1 , τ 2 d s , t ∈ t 0 , b A f 2 x 1 , x 2 t , τ 1 , τ 2 = ψ ( t ) , t ∈ t 0 − τ 2 , t 0 ψ t 0 + ∫ t 0 t &hairsp; f 2 s , x 1 s , τ 1 , τ 2 , x 2 s , τ 1 , τ 2 x 1 s − τ 1 , τ 1 , τ 2 , x 2 s − τ 2 , τ 1 , τ 2 d s , t ∈ t 0 , b {:[A_(f_(1))(x_(1),x_(2))(t,tau_(1),tau_(2))={[varphi(t)","t in[t_(0)-tau_(1),t_(0)]],[varphi(t_(0))+int_(t_(0))^(t)f_(1)(s,x_(1)(s,tau_(1),tau_(2)),x_(2)(s,tau_(1),tau_(2)):}],[{:x_(1)(s-tau_(1),tau_(1),tau_(2)),x_(2)(s-tau_(2),tau_(1),tau_(2)))ds","t in[t_(0),b]]:}],[A_(f_(2))(x_(1),x_(2))(t,tau_(1),tau_(2))={[psi(t)","t in[t_(0)-tau_(2),t_(0)]],[psi(t_(0))+int_(t_(0))^(t)f_(2)(s,x_(1)(s,tau_(1),tau_(2)),x_(2)(s,tau_(1),tau_(2)):}],[{:x_(1)(s-tau_(1),tau_(1),tau_(2)),x_(2)(s-tau_(2),tau_(1),tau_(2)))ds","t in[t_(0),b]]:}]:}\begin{aligned} & A_{f_{1}}\left(x_{1}, x_{2}\right)\left(t, \tau_{1}, \tau_{2}\right)=\left\{\begin{array}{l} \varphi(t), t \in\left[t_{0}-\tau_{1}, t_{0}\right] \\ \varphi\left(t_{0}\right)+\int_{t_{0}}^{t} f_{1}\left(s, x_{1}\left(s, \tau_{1}, \tau_{2}\right), x_{2}\left(s, \tau_{1}, \tau_{2}\right)\right. \\ \left.x_{1}\left(s-\tau_{1}, \tau_{1}, \tau_{2}\right), x_{2}\left(s-\tau_{2}, \tau_{1}, \tau_{2}\right)\right) d s, t \in\left[t_{0}, b\right] \end{array}\right. \\ & A_{f_{2}}\left(x_{1}, x_{2}\right)\left(t, \tau_{1}, \tau_{2}\right)=\left\{\begin{array}{l} \psi(t), t \in\left[t_{0}-\tau_{2}, t_{0}\right] \\ \psi\left(t_{0}\right)+\int_{t_{0}}^{t} f_{2}\left(s, x_{1}\left(s, \tau_{1}, \tau_{2}\right), x_{2}\left(s, \tau_{1}, \tau_{2}\right)\right. \\ \left.x_{1}\left(s-\tau_{1}, \tau_{1}, \tau_{2}\right), x_{2}\left(s-\tau_{2}, \tau_{1}, \tau_{2}\right)\right) d s, t \in\left[t_{0}, b\right] \end{array}\right. \end{aligned}Af1(x1,x2)(t,τ1,τ2)={φ(t),t∈[t0−τ1,t0]φ(t0)+∫t0tf1(s,x1(s,τ1,τ2),x2(s,τ1,τ2)x1(s−τ1,τ1,τ2),x2(s−τ2,τ1,τ2))ds,t∈[t0,b]Af2(x1,x2)(t,τ1,τ2)={ψ(t),t∈[t0−τ2,t0]ψ(t0)+∫t0tf2(s,x1(s,τ1,τ2),x2(s,τ1,τ2)x1(s−τ1,τ1,τ2),x2(s−τ2,τ1,τ2))ds,t∈[t0,b]
Let X := C [ t 0 − τ 1 , b ] × C [ t 0 − τ 2 , b ] X := C t 0 − τ 1 , b × C t 0 − τ 2 , b X:=C[t_(0)-tau_(1),b]xx C[t_(0)-tau_(2),b]X:=C\left[t_{0}-\tau_{1}, b\right] \times C\left[t_{0}-\tau_{2}, b\right]X:=C[t0−τ1,b]×C[t0−τ2,b] and ‖ ⋅ ‖ C ‖ ⋅ ‖ C ||*||_(C)\|\cdot\|_{C}‖⋅‖C, the Chebyshev norm on X X XXX. It is clear, from the proof of the Theorem 1 ([4]), that in the conditions ( H 1 ) − ( H 4 ) H 1 − H 4 (H_(1))-(H_(4))\left(\mathrm{H}_{1}\right)-\left(\mathrm{H}_{4}\right)(H1)−(H4), the operator A f A f A_(f)A_{f}Af is a Picard operator.
Let ( x 1 ∗ , x 2 ∗ x 1 ∗ , x 2 ∗ x_(1)^(**),x_(2)^(**)x_{1}^{*}, x_{2}^{*}x1∗,x2∗ ) the only fixed point of A f A f A_(f)A_{f}Af.
We consider the subset X 1 ⊂ X X 1 ⊂ X X_(1)sub XX_{1} \subset XX1⊂X,
X 1 = { ( x 1 , x 2 ) ∈ X | ∂ x i ∂ t ∈ C [ t 0 − τ , b ] , i = 1 , 2 } X 1 = x 1 , x 2 ∈ X ∂ x i ∂ t ∈ C t 0 − τ , b , i = 1 , 2 X_(1)={(x_(1),x_(2))in X|(delx_(i))/(del t)in C[t_(0)-tau,b],i=1,2}X_{1}=\left\{\left(x_{1}, x_{2}\right) \in X \left\lvert\, \frac{\partial x_{i}}{\partial t} \in C\left[t_{0}-\tau, b\right]\right., i=1,2\right\}X1={(x1,x2)∈X|∂xi∂t∈C[t0−τ,b],i=1,2}
We remark that ( x 1 ∗ , x 2 ∗ ) ∈ X 1 , A ( X 1 ) ⊂ X 1 , A : ( X 1 , ‖ ⋅ ‖ C ) → ( X 1 , ‖ ⋅ ‖ C ) x 1 ∗ , x 2 ∗ ∈ X 1 , A X 1 ⊂ X 1 , A : X 1 , ‖ ⋅ ‖ C → X 1 , ‖ ⋅ ‖ C (x_(1)^(**),x_(2)^(**))inX_(1),A(X_(1))subX_(1),A:(X_(1),||*||_(C))rarr(X_(1),||*||_(C))\left(x_{1}^{*}, x_{2}^{*}\right) \in X_{1}, A\left(X_{1}\right) \subset X_{1}, A:\left(X_{1},\|\cdot\|_{C}\right) \rightarrow\left(X_{1},\|\cdot\|_{C}\right)(x1∗,x2∗)∈X1,A(X1)⊂X1,A:(X1,‖⋅‖C)→(X1,‖⋅‖C) is PO.
We suppose that there exists ∂ x i ∗ ∂ τ 1 , ∂ x i ∗ ∂ τ 2 , i = 1 , 2 ∂ x i ∗ ∂ τ 1 , ∂ x i ∗ ∂ τ 2 , i = 1 , 2 (delx_(i)^(**))/(deltau_(1)),(delx_(i)^(**))/(deltau_(2)),i=1,2\frac{\partial x_{i}^{*}}{\partial \tau_{1}}, \frac{\partial x_{i}^{*}}{\partial \tau_{2}}, i=1,2∂xi∗∂τ1,∂xi∗∂τ2,i=1,2.
Then, from (3.4) we have that:
∂ x i ∗ ( t , τ 1 ) ∂ τ 1 = = ∫ t 0 t ∂ f i ( s , x 1 ∗ ( s , τ 1 ) , x 2 ∗ ( s , τ 1 ) , x 1 ∗ ( s − τ 1 , τ 1 ) , x 2 ∗ ( s − τ 2 , τ 1 ) ) ∂ u 1 ⋅ ∂ x 1 ∗ ( s , τ 1 ) ∂ τ 1 d s + + ∫ t 0 t ∂ f i ( s , x 1 ∗ ( s , τ 1 ) , x 2 ∗ ( s , τ 1 ) , x 1 ∗ ( s − τ 1 , τ 1 ) , x 2 ∗ ( s − τ 2 , τ 1 ) ) ∂ u 2 ⋅ ∂ x 2 ∗ ( s , τ 1 ) ∂ τ 1 d s + + ∫ t 0 t ∂ f i ( s , x 1 ∗ ( s , τ 1 ) , x 2 ∗ ( s , τ 1 ) , x 1 ∗ ( s − τ 1 , τ 1 ) , x 2 ∗ ( s − τ 2 , τ 1 ) ) ∂ u 3 + [ ∂ x 1 ∗ ( s − τ 1 , τ 1 ) ∂ t ( − 1 ) + ∂ x 1 ∗ ( s − τ 1 , τ 1 ) ∂ τ 1 ] d s + + ∫ t 0 t ∂ f i ( s , x 1 ∗ ( s , τ 1 ) , x 2 ∗ ( s , τ 1 ) , x 1 ∗ ( s − τ 1 , τ 1 ) , x 2 ∗ ( s − τ 2 , τ 1 ) ) ∂ u 4 ⋅ ∂ x 2 ∗ ( s − τ 2 , τ 1 ) ∂ τ 1 d s ∂ x i ∗ t , τ 1 ∂ τ 1 = = ∫ t 0 t &hairsp; ∂ f i s , x 1 ∗ s , τ 1 , x 2 ∗ s , τ 1 , x 1 ∗ s − τ 1 , τ 1 , x 2 ∗ s − τ 2 , τ 1 ∂ u 1 ⋅ ∂ x 1 ∗ s , τ 1 ∂ τ 1 d s + + ∫ t 0 t &hairsp; ∂ f i s , x 1 ∗ s , τ 1 , x 2 ∗ s , τ 1 , x 1 ∗ s − τ 1 , τ 1 , x 2 ∗ s − τ 2 , τ 1 ∂ u 2 ⋅ ∂ x 2 ∗ s , τ 1 ∂ τ 1 d s + + ∫ t 0 t &hairsp; ∂ f i s , x 1 ∗ s , τ 1 , x 2 ∗ s , τ 1 , x 1 ∗ s − τ 1 , τ 1 , x 2 ∗ s − τ 2 , τ 1 ∂ u 3 + ∂ x 1 ∗ s − τ 1 , τ 1 ∂ t ( − 1 ) + ∂ x 1 ∗ s − τ 1 , τ 1 ∂ τ 1 d s + + ∫ t 0 t &hairsp; ∂ f i s , x 1 ∗ s , τ 1 , x 2 ∗ s , τ 1 , x 1 ∗ s − τ 1 , τ 1 , x 2 ∗ s − τ 2 , τ 1 ∂ u 4 ⋅ ∂ x 2 ∗ s − τ 2 , τ 1 ∂ τ 1 d s {:[(delx_(i)^(**)(t,tau_(1)))/(deltau_(1))=],[=int_(t_(0))^(t)(delf_(i)(s,x_(1)^(**)(s,tau_(1)),x_(2)^(**)(s,tau_(1)),x_(1)^(**)(s-tau_(1),tau_(1)),x_(2)^(**)(s-tau_(2),tau_(1))))/(delu_(1))*(delx_(1)^(**)(s,tau_(1)))/(deltau_(1))ds+],[+int_(t_(0))^(t)(delf_(i)(s,x_(1)^(**)(s,tau_(1)),x_(2)^(**)(s,tau_(1)),x_(1)^(**)(s-tau_(1),tau_(1)),x_(2)^(**)(s-tau_(2),tau_(1))))/(delu_(2))*(delx_(2)^(**)(s,tau_(1)))/(deltau_(1))ds+],[+int_(t_(0))^(t)(delf_(i)(s,x_(1)^(**)(s,tau_(1)),x_(2)^(**)(s,tau_(1)),x_(1)^(**)(s-tau_(1),tau_(1)),x_(2)^(**)(s-tau_(2),tau_(1))))/(delu_(3))],[+[(delx_(1)^(**)(s-tau_(1),tau_(1)))/(del t)(-1)+(delx_(1)^(**)(s-tau_(1),tau_(1)))/(deltau_(1))]ds+],[+int_(t_(0))^(t)(delf_(i)(s,x_(1)^(**)(s,tau_(1)),x_(2)^(**)(s,tau_(1)),x_(1)^(**)(s-tau_(1),tau_(1)),x_(2)^(**)(s-tau_(2),tau_(1))))/(delu_(4))*(delx_(2)^(**)(s-tau_(2),tau_(1)))/(deltau_(1))ds]:}\begin{aligned} & \frac{\partial x_{i}^{*}\left(t, \tau_{1}\right)}{\partial \tau_{1}}= \\ & =\int_{t_{0}}^{t} \frac{\partial f_{i}\left(s, x_{1}^{*}\left(s, \tau_{1}\right), x_{2}^{*}\left(s, \tau_{1}\right), x_{1}^{*}\left(s-\tau_{1}, \tau_{1}\right), x_{2}^{*}\left(s-\tau_{2}, \tau_{1}\right)\right)}{\partial u_{1}} \cdot \frac{\partial x_{1}^{*}\left(s, \tau_{1}\right)}{\partial \tau_{1}} d s+ \\ & +\int_{t_{0}}^{t} \frac{\partial f_{i}\left(s, x_{1}^{*}\left(s, \tau_{1}\right), x_{2}^{*}\left(s, \tau_{1}\right), x_{1}^{*}\left(s-\tau_{1}, \tau_{1}\right), x_{2}^{*}\left(s-\tau_{2}, \tau_{1}\right)\right)}{\partial u_{2}} \cdot \frac{\partial x_{2}^{*}\left(s, \tau_{1}\right)}{\partial \tau_{1}} d s+ \\ & +\int_{t_{0}}^{t} \frac{\partial f_{i}\left(s, x_{1}^{*}\left(s, \tau_{1}\right), x_{2}^{*}\left(s, \tau_{1}\right), x_{1}^{*}\left(s-\tau_{1}, \tau_{1}\right), x_{2}^{*}\left(s-\tau_{2}, \tau_{1}\right)\right)}{\partial u_{3}} \\ & +\left[\frac{\partial x_{1}^{*}\left(s-\tau_{1}, \tau_{1}\right)}{\partial t}(-1)+\frac{\partial x_{1}^{*}\left(s-\tau_{1}, \tau_{1}\right)}{\partial \tau_{1}}\right] d s+ \\ & +\int_{t_{0}}^{t} \frac{\partial f_{i}\left(s, x_{1}^{*}\left(s, \tau_{1}\right), x_{2}^{*}\left(s, \tau_{1}\right), x_{1}^{*}\left(s-\tau_{1}, \tau_{1}\right), x_{2}^{*}\left(s-\tau_{2}, \tau_{1}\right)\right)}{\partial u_{4}} \cdot \frac{\partial x_{2}^{*}\left(s-\tau_{2}, \tau_{1}\right)}{\partial \tau_{1}} d s \end{aligned}∂xi∗(t,τ1)∂τ1==∫t0t∂fi(s,x1∗(s,τ1),x2∗(s,τ1),x1∗(s−τ1,τ1),x2∗(s−τ2,τ1))∂u1⋅∂x1∗(s,τ1)∂τ1ds++∫t0t∂fi(s,x1∗(s,τ1),x2∗(s,τ1),x1∗(s−τ1,τ1),x2∗(s−τ2,τ1))∂u2⋅∂x2∗(s,τ1)∂τ1ds++∫t0t∂fi(s,x1∗(s,τ1),x2∗(s,τ1),x1∗(s−τ1,τ1),x2∗(s−τ2,τ1))∂u3+[∂x1∗(s−τ1,τ1)∂t(−1)+∂x1∗(s−τ1,τ1)∂τ1]ds++∫t0t∂fi(s,x1∗(s,τ1),x2∗(s,τ1),x1∗(s−τ1,τ1),x2∗(s−τ2,τ1))∂u4⋅∂x2∗(s−τ2,τ1)∂τ1ds
where t ∈ [ t 0 , b ] , i = 1 , 2 t ∈ t 0 , b , i = 1 , 2 t in[t_(0),b],i=1,2t \in\left[t_{0}, b\right], i=1,2t∈[t0,b],i=1,2.
This relation suggests us to consider the following operator
C f : X × X → X C f : X × X → X C_(f):X xx X rarr XC_{f}: X \times X \rightarrow XCf:X×X→X
where
C f ( x 1 , x 2 , u , v ) ( t , τ 1 ) = 0 , for all t ∈ [ t 0 − τ 2 , t 0 ] C f ( x 1 , x 2 , u , v ) ( t , τ 1 ) = 0 , for all t ∈ [ t 0 − τ 1 , t 0 ] C f x 1 , x 2 , u , v t , τ 1 = 0 ,  for all  t ∈ t 0 − τ 2 , t 0 C f x 1 , x 2 , u , v t , τ 1 = 0 ,  for all  t ∈ t 0 − τ 1 , t 0 {:[C_(f)(x_(1),x_(2),u,v)(t,tau_(1))=0","" for all "t in[t_(0)-tau_(2),t_(0)]],[C_(f)(x_(1),x_(2),u,v)(t,tau_(1))=0","" for all "t in[t_(0)-tau_(1),t_(0)]]:}\begin{aligned} & C_{f}\left(x_{1}, x_{2}, u, v\right)\left(t, \tau_{1}\right)=0, \text { for all } t \in\left[t_{0}-\tau_{2}, t_{0}\right] \\ & C_{f}\left(x_{1}, x_{2}, u, v\right)\left(t, \tau_{1}\right)=0, \text { for all } t \in\left[t_{0}-\tau_{1}, t_{0}\right] \end{aligned}Cf(x1,x2,u,v)(t,τ1)=0, for all t∈[t0−τ2,t0]Cf(x1,x2,u,v)(t,τ1)=0, for all t∈[t0−τ1,t0]
and
C f ( x 1 , x 2 , u , v ) ( t , τ 1 ) := = ∫ t 0 t ∂ f i ( s , x 1 ( s , τ 1 ) , x 2 ( s , τ 1 ) , x 1 ( s − τ 1 , τ 1 ) , x 2 ( s − τ 2 , τ 1 ) ) ∂ u 1 u ( s , τ 1 ) d s + + ∫ t 0 t ∂ f i ( s , x 1 ( s , τ 1 ) , x 2 ( s , τ 1 ) , x 1 ( s − τ 1 , τ 1 ) , x 2 ( s − τ 2 , τ 1 ) ) ∂ u 2 v ( s , τ 1 ) d s + + ∫ t 0 t ∂ f i ( s , x 1 ( s , τ 1 ) , x 2 ( s , τ 1 ) , x 1 ( s − τ 1 , τ 1 ) , x 2 ( s − τ 2 , τ 1 ) ) ∂ u 3 ⋅ [ u ¯ ( s − τ 1 , τ 1 ) ⋅ ( − 1 ) − u ( s − τ 1 , τ 1 ) ] d s + + ∫ t 0 t ∂ f i ( s , x 1 ( s , τ 1 ) , x 2 ( s , τ 1 ) , x 1 ( s − τ 1 , τ 1 ) , x 2 ( s − τ 2 , τ 1 ) ) ∂ u 4 v ( s − τ 2 , τ 1 ) d s C f x 1 , x 2 , u , v t , τ 1 := = ∫ t 0 t &hairsp; ∂ f i s , x 1 s , τ 1 , x 2 s , τ 1 , x 1 s − τ 1 , τ 1 , x 2 s − τ 2 , τ 1 ∂ u 1 u s , τ 1 d s + + ∫ t 0 t &hairsp; ∂ f i s , x 1 s , τ 1 , x 2 s , τ 1 , x 1 s − τ 1 , τ 1 , x 2 s − τ 2 , τ 1 ∂ u 2 v s , τ 1 d s + + ∫ t 0 t &hairsp; ∂ f i s , x 1 s , τ 1 , x 2 s , τ 1 , x 1 s − τ 1 , τ 1 , x 2 s − τ 2 , τ 1 ∂ u 3 ⋅ u ¯ s − τ 1 , τ 1 ⋅ ( − 1 ) − u s − τ 1 , τ 1 d s + + ∫ t 0 t &hairsp; ∂ f i s , x 1 s , τ 1 , x 2 s , τ 1 , x 1 s − τ 1 , τ 1 , x 2 s − τ 2 , τ 1 ∂ u 4 v s − τ 2 , τ 1 d s {:[C_(f)(x_(1),x_(2),u,v)(t,tau_(1)):=],[=int_(t_(0))^(t)(delf_(i)(s,x_(1)(s,tau_(1)),x_(2)(s,tau_(1)),x_(1)(s-tau_(1),tau_(1)),x_(2)(s-tau_(2),tau_(1))))/(delu_(1))u(s,tau_(1))ds+],[+int_(t_(0))^(t)(delf_(i)(s,x_(1)(s,tau_(1)),x_(2)(s,tau_(1)),x_(1)(s-tau_(1),tau_(1)),x_(2)(s-tau_(2),tau_(1))))/(delu_(2))v(s,tau_(1))ds+],[+int_(t_(0))^(t)(delf_(i)(s,x_(1)(s,tau_(1)),x_(2)(s,tau_(1)),x_(1)(s-tau_(1),tau_(1)),x_(2)(s-tau_(2),tau_(1))))/(delu_(3))],[*[( bar(u))(s-tau_(1),tau_(1))*(-1)-u(s-tau_(1),tau_(1))]ds+],[+int_(t_(0))^(t)(delf_(i)(s,x_(1)(s,tau_(1)),x_(2)(s,tau_(1)),x_(1)(s-tau_(1),tau_(1)),x_(2)(s-tau_(2),tau_(1))))/(delu_(4))v(s-tau_(2),tau_(1))ds]:}\begin{aligned} & C_{f}\left(x_{1}, x_{2}, u, v\right)\left(t, \tau_{1}\right):= \\ & =\int_{t_{0}}^{t} \frac{\partial f_{i}\left(s, x_{1}\left(s, \tau_{1}\right), x_{2}\left(s, \tau_{1}\right), x_{1}\left(s-\tau_{1}, \tau_{1}\right), x_{2}\left(s-\tau_{2}, \tau_{1}\right)\right)}{\partial u_{1}} u\left(s, \tau_{1}\right) d s+ \\ & +\int_{t_{0}}^{t} \frac{\partial f_{i}\left(s, x_{1}\left(s, \tau_{1}\right), x_{2}\left(s, \tau_{1}\right), x_{1}\left(s-\tau_{1}, \tau_{1}\right), x_{2}\left(s-\tau_{2}, \tau_{1}\right)\right)}{\partial u_{2}} v\left(s, \tau_{1}\right) d s+ \\ & +\int_{t_{0}}^{t} \frac{\partial f_{i}\left(s, x_{1}\left(s, \tau_{1}\right), x_{2}\left(s, \tau_{1}\right), x_{1}\left(s-\tau_{1}, \tau_{1}\right), x_{2}\left(s-\tau_{2}, \tau_{1}\right)\right)}{\partial u_{3}} \\ & \cdot\left[\bar{u}\left(s-\tau_{1}, \tau_{1}\right) \cdot(-1)-u\left(s-\tau_{1}, \tau_{1}\right)\right] d s+ \\ & +\int_{t_{0}}^{t} \frac{\partial f_{i}\left(s, x_{1}\left(s, \tau_{1}\right), x_{2}\left(s, \tau_{1}\right), x_{1}\left(s-\tau_{1}, \tau_{1}\right), x_{2}\left(s-\tau_{2}, \tau_{1}\right)\right)}{\partial u_{4}} v\left(s-\tau_{2}, \tau_{1}\right) d s \end{aligned}Cf(x1,x2,u,v)(t,τ1):==∫t0t∂fi(s,x1(s,τ1),x2(s,τ1),x1(s−τ1,τ1),x2(s−τ2,τ1))∂u1u(s,τ1)ds++∫t0t∂fi(s,x1(s,τ1),x2(s,τ1),x1(s−τ1,τ1),x2(s−τ2,τ1))∂u2v(s,τ1)ds++∫t0t∂fi(s,x1(s,τ1),x2(s,τ1),x1(s−τ1,τ1),x2(s−τ2,τ1))∂u3⋅[u¯(s−τ1,τ1)⋅(−1)−u(s−τ1,τ1)]ds++∫t0t∂fi(s,x1(s,τ1),x2(s,τ1),x1(s−τ1,τ1),x2(s−τ2,τ1))∂u4v(s−τ2,τ1)ds
for all t ∈ [ t 0 , b ] t ∈ t 0 , b t in[t_(0),b]t \in\left[t_{0}, b\right]t∈[t0,b].
We denoted here
u ( t ) = ∂ x 1 ( t ) ∂ τ 1 , v ( t ) = ∂ x 2 ( t ) ∂ τ 1 , u ¯ ( t − τ 1 ) = ∂ x 1 ( t − τ 1 ) ∂ t , u ( t − τ 1 ) = ∂ x 1 ( t − τ 1 ) ∂ τ 1 , v ( t − τ 2 ) = ∂ x 2 ( t − τ 2 ) ∂ τ 1 . u ( t ) = ∂ x 1 ( t ) ∂ τ 1 , v ( t ) = ∂ x 2 ( t ) ∂ τ 1 , u ¯ t − τ 1 = ∂ x 1 t − τ 1 ∂ t , u t − τ 1 = ∂ x 1 t − τ 1 ∂ τ 1 , v t − τ 2 = ∂ x 2 t − τ 2 ∂ τ 1 . {:[u(t)=(delx_(1)(t))/(deltau_(1))","v(t)=(delx_(2)(t))/(deltau_(1))"," bar(u)(t-tau_(1))=(delx_(1)(t-tau_(1)))/(del t)","],[u(t-tau_(1))=(delx_(1)(t-tau_(1)))/(deltau_(1))","v(t-tau_(2))=(delx_(2)(t-tau_(2)))/(deltau_(1)).]:}\begin{aligned} u(t) & =\frac{\partial x_{1}(t)}{\partial \tau_{1}}, v(t)=\frac{\partial x_{2}(t)}{\partial \tau_{1}}, \bar{u}\left(t-\tau_{1}\right)=\frac{\partial x_{1}\left(t-\tau_{1}\right)}{\partial t}, \\ u\left(t-\tau_{1}\right) & =\frac{\partial x_{1}\left(t-\tau_{1}\right)}{\partial \tau_{1}}, v\left(t-\tau_{2}\right)=\frac{\partial x_{2}\left(t-\tau_{2}\right)}{\partial \tau_{1}} . \end{aligned}u(t)=∂x1(t)∂τ1,v(t)=∂x2(t)∂τ1,u¯(t−τ1)=∂x1(t−τ1)∂t,u(t−τ1)=∂x1(t−τ1)∂τ1,v(t−τ2)=∂x2(t−τ2)∂τ1.
In this way we have the triangular operator
D : X × X → X × X ( x 1 , x 2 , u , v ) → ( A f ( x 1 , x 2 ) , C f ( x 1 , x 2 , u , v ) ) D : X × X → X × X x 1 , x 2 , u , v → A f x 1 , x 2 , C f x 1 , x 2 , u , v {:[D:X xx X rarr X xx X],[(x_(1),x_(2),u,v) rarr(A_(f)(x_(1),x_(2)),C_(f)(x_(1),x_(2),u,v))]:}\begin{aligned} D & : X \times X \rightarrow X \times X \\ \left(x_{1}, x_{2}, u, v\right) & \rightarrow\left(A_{f}\left(x_{1}, x_{2}\right), C_{f}\left(x_{1}, x_{2}, u, v\right)\right) \end{aligned}D:X×X→X×X(x1,x2,u,v)→(Af(x1,x2),Cf(x1,x2,u,v))
where A f A f A_(f)A_{f}Af is a Picard operator and C f ( x 1 , x 2 , ⋅ , ⋅ ) : X → X C f x 1 , x 2 , ⋅ , ⋅ : X → X C_(f)(x_(1),x_(2),*,*):X rarr XC_{f}\left(x_{1}, x_{2}, \cdot, \cdot\right): X \rightarrow XCf(x1,x2,⋅,⋅):X→X is an L L LLL-contraction, with L = 4 L f ρ L = 4 L f ρ L=(4L_(f))/(rho)L=\frac{4 L_{f}}{\rho}L=4Lfρ, where ρ ρ rho\rhoρ is the Bielecki constant we use in [4].
From the fibre contraction theorem we have that the operator D D DDD is Picard operator and F D = ( x 1 ∗ , x 2 ∗ , u ∗ , v ∗ ) F D = x 1 ∗ , x 2 ∗ , u ∗ , v ∗ F_(D)=(x_(1)^(**),x_(2)^(**),u^(**),v^(**))F_{D}=\left(x_{1}^{*}, x_{2}^{*}, u^{*}, v^{*}\right)FD=(x1∗,x2∗,u∗,v∗).
Let ( x 1 ∗ , x 2 ∗ , u ∗ , v ∗ ) x 1 ∗ , x 2 ∗ , u ∗ , v ∗ (x_(1)^(**),x_(2)^(**),u^(**),v^(**))\left(x_{1}^{*}, x_{2}^{*}, u^{*}, v^{*}\right)(x1∗,x2∗,u∗,v∗) the only fixed point of the operator D D DDD. Then the sequences
( x 1 , n + 1 , x 2 , n + 1 ) := A ( x 1 , n , x 2 , n ) , n ∈ N , ( u n + 1 , v n + 1 ) := C ( x 1 , n , x 2 , n , u n , v n ) , n ∈ N , x 1 , n + 1 , x 2 , n + 1 := A x 1 , n , x 2 , n , n ∈ N , u n + 1 , v n + 1 := C x 1 , n , x 2 , n , u n , v n , n ∈ N , {:[(x_(1,n+1),x_(2,n+1)):=A(x_(1,n),x_(2,n))","n inN","],[(u_(n+1),v_(n+1)):=C(x_(1,n),x_(2,n),u_(n),v_(n))","n inN","]:}\begin{aligned} & \left(x_{1, n+1}, x_{2, n+1}\right):=A\left(x_{1, n}, x_{2, n}\right), n \in \mathbb{N}, \\ & \left(u_{n+1}, v_{n+1}\right):=C\left(x_{1, n}, x_{2, n}, u_{n}, v_{n}\right), n \in \mathbb{N}, \end{aligned}(x1,n+1,x2,n+1):=A(x1,n,x2,n),n∈N,(un+1,vn+1):=C(x1,n,x2,n,un,vn),n∈N,
converge uniformly (with respect to t ∈ X t ∈ X t in Xt \in Xt∈X ) to ( x 1 ∗ , x 2 ∗ , u ∗ , v ∗ ) ∈ F D x 1 ∗ , x 2 ∗ , u ∗ , v ∗ ∈ F D (x_(1)^(**),x_(2)^(**),u^(**),v^(**))inF_(D)\left(x_{1}^{*}, x_{2}^{*}, u^{*}, v^{*}\right) \in F_{D}(x1∗,x2∗,u∗,v∗)∈FD, for all x 1 , 0 , x 2 , 0 , u 0 , v 0 ∈ X x 1 , 0 , x 2 , 0 , u 0 , v 0 ∈ X x_(1,0),x_(2,0),u_(0),v_(0)in Xx_{1,0}, x_{2,0}, u_{0}, v_{0} \in Xx1,0,x2,0,u0,v0∈X.
If we take
x 1 , 0 = 0 , x 2 , 0 = 0 u 0 = ∂ x 1 , 0 ∂ τ 1 = 0 , v 0 = ∂ x 2 , 0 ∂ τ 1 = 0 , x 1 , 0 = 0 , x 2 , 0 = 0 u 0 = ∂ x 1 , 0 ∂ τ 1 = 0 , v 0 = ∂ x 2 , 0 ∂ τ 1 = 0 , {:[x_(1,0)=0","x_(2,0)=0],[u_(0)=(delx_(1,0))/(deltau_(1))=0","v_(0)=(delx_(2,0))/(deltau_(1))=0","]:}\begin{aligned} x_{1,0} & =0, x_{2,0}=0 \\ u_{0} & =\frac{\partial x_{1,0}}{\partial \tau_{1}}=0, v_{0}=\frac{\partial x_{2,0}}{\partial \tau_{1}}=0, \end{aligned}x1,0=0,x2,0=0u0=∂x1,0∂τ1=0,v0=∂x2,0∂τ1=0,
then
u 1 = ∂ x 1 , 1 ∂ τ 1 v 1 = ∂ x 2 , 1 ∂ τ 1 u 1 = ∂ x 1 , 1 ∂ τ 1 v 1 = ∂ x 2 , 1 ∂ τ 1 {:[u_(1)=(delx_(1,1))/(deltau_(1))],[v_(1)=(delx_(2,1))/(deltau_(1))]:}\begin{aligned} u_{1} & =\frac{\partial x_{1,1}}{\partial \tau_{1}} \\ v_{1} & =\frac{\partial x_{2,1}}{\partial \tau_{1}} \end{aligned}u1=∂x1,1∂τ1v1=∂x2,1∂τ1
By induction, we obtain that
u n = ∂ x 1 , n ∂ τ 1 , ∀ n ∈ N , v n = ∂ x 2 , n ∂ τ 1 , ∀ n ∈ N . u n = ∂ x 1 , n ∂ τ 1 , ∀ n ∈ N , v n = ∂ x 2 , n ∂ τ 1 , ∀ n ∈ N . {:[u_(n)=(delx_(1,n))/(deltau_(1))","AA n inN","],[v_(n)=(delx_(2,n))/(deltau_(1))","AA n inN.]:}\begin{aligned} u_{n} & =\frac{\partial x_{1, n}}{\partial \tau_{1}}, \forall n \in \mathbb{N}, \\ v_{n} & =\frac{\partial x_{2, n}}{\partial \tau_{1}}, \forall n \in \mathbb{N} . \end{aligned}un=∂x1,n∂τ1,∀n∈N,vn=∂x2,n∂τ1,∀n∈N.
So
x 1 , n → unif x 1 ∗ as n → ∞ , x 2 , n → unif x 2 ∗ as n → ∞ , ∂ x 1 , n ∂ τ 1 → unif u ∗ as n → ∞ , ∂ x 2 , n ∂ τ 1 → unif v ∗ as n → ∞ . x 1 , n →  unif  x 1 ∗  as  n → ∞ , x 2 , n →  unif  x 2 ∗  as  n → ∞ , ∂ x 1 , n ∂ τ 1 →  unif  u ∗  as  n → ∞ , ∂ x 2 , n ∂ τ 1 →  unif  v ∗  as  n → ∞ . {:[x_(1,n)rarr"" unif ""x_(1)^(**)" as "n rarr oo","],[x_(2,n)rarr"" unif ""x_(2)^(**)" as "n rarr oo","],[(delx_(1,n))/(deltau_(1))rarr"" unif ""u^(**)" as "n rarr oo","],[(delx_(2,n))/(deltau_(1))rarr"" unif ""v^(**)" as "n rarr oo.]:}\begin{gathered} x_{1, n} \xrightarrow{\text { unif }} x_{1}^{*} \text { as } n \rightarrow \infty, \\ x_{2, n} \xrightarrow{\text { unif }} x_{2}^{*} \text { as } n \rightarrow \infty, \\ \frac{\partial x_{1, n}}{\partial \tau_{1}} \xrightarrow{\text { unif }} u^{*} \text { as } n \rightarrow \infty, \\ \frac{\partial x_{2, n}}{\partial \tau_{1}} \xrightarrow{\text { unif }} v^{*} \text { as } n \rightarrow \infty . \end{gathered}x1,n→ unif x1∗ as n→∞,x2,n→ unif x2∗ as n→∞,∂x1,n∂τ1→ unif u∗ as n→∞,∂x2,n∂τ1→ unif v∗ as n→∞.
From the above consideration we have that there exist ∂ x i ∗ ∂ τ 1 , i = 1 , 2 ∂ x i ∗ ∂ τ 1 , i = 1 , 2 (delx_(i)^(**))/(deltau_(1)),i=1,2\frac{\partial x_{i}^{*}}{\partial \tau_{1}}, i=1,2∂xi∗∂τ1,i=1,2 and
∂ x 1 ∗ ∂ τ 1 = u ∗ , ∂ x 2 ∗ ∂ τ 1 = v ∗ ∂ x 1 ∗ ∂ τ 1 = u ∗ , ∂ x 2 ∗ ∂ τ 1 = v ∗ (delx_(1)^(**))/(deltau_(1))=u^(**),quad(delx_(2)^(**))/(deltau_(1))=v^(**)\frac{\partial x_{1}^{*}}{\partial \tau_{1}}=u^{*}, \quad \frac{\partial x_{2}^{*}}{\partial \tau_{1}}=v^{*}∂x1∗∂τ1=u∗,∂x2∗∂τ1=v∗
Analogously we can prove the differentiability with respect to τ 2 τ 2 tau_(2)\tau_{2}τ2.

References

[1] Berinde V., Generalized Contractions and Applications (in Romanian), Ph. D. Thesis, Univ. "BabeşBolyai" Cluj-Napoca, 1993.
[2] Buică A., Existence and continuous dependence of solutions of some functional-differential equations, Seminar on Fixed Point Theory, Cluj-Napoca, 1995, 1-14.
[3] Mureşan V., Functional-Integral Equations, Editura Mediamira, Cluj-Napoca, 2003.
[4] Otrocol D., Data dependence for the solution of a Lotka-Volterra system with two delays, Mathematica, Tome 48 (71), No. 1 (2006), 61-68.
[5] Otrocol D., Lotka-Volterra system with two delays via weakly Picard operators, Nonlinear Analysis Forum, 10 (2) (2005), 193-199.
[6] Rus I. A., Principles and applications of the fixed point theory (in Romanian), Editura Dacia, ClujNapoca, 1979.
[7] Rus I. A., Generalized contractions, Seminar on Fixed Point Theory, "Babeş-Bolyai" University, 1983, pp. 1-130.
[8] Rus I. A., Weakly Picard mappings, Comment. Math. Univ. Caroline, 34 (1993), 769-773.
[9] Rus I. A., Functional-differential equations of mixed type, via weakly Picard operators, Seminar of Fixed Point Theory, Cluj-Napoca, Vol. 3, 2002, 335-346.
[10] Rus I. A., Generalized Contractions and Applications, Cluj University Press, 2001.
[11] Rus I. A., Weakly Picard operators and applications, Seminar on Fixed Point Theory, Cluj-Napoca, Vol. 2 (2001), 41-58.
[12] Rus I. A. and Egri E., Boundary value problems for iterative functional-differential equations, Studia Univ. "Babeş-Bolyai", Matematica, Vol. LI, No. 2, 2006, pp. 109-126.
[13] Saito Y., Hara T. and Ma W., Necessary and sufficient conditions for permanence and global stability of a Lotka-Volterra system with two delays, J. Math. Anal. Appl., 236 (1999), 534-556.
[14] Şerban M. A., Fiber φ φ varphi\varphiφ-contractions, Studia Univ. "Babeş-Bolyai", Mathematica, 44 (1999), No. 3, 99-108.
"Tiberiu Popoviciu" Institute of Numerical Analysis
P.O. Box 68-1
400110 Cluj-Napoca, Romania
E-mail address: dotrocol@ictp.acad.ro
E-mail address: diana.otrocol@gmail.com

  1. Received: 20.09.2006. In revised form: 20.02.2007.
    2000 Mathematics Subject Classification. 34L05, 47H10.
    Key words and phrases. Lotka-Volterra system, weakly Picard operator, delay, differentiability.
    • This work has been supported by MEdc under Grant 2-CEx06-11-96.
2007

Related Posts