instruction_seed
stringlengths
120
1.22k
source
stringclasses
1 value
embeddings
listlengths
1.02k
1.02k
mean_positive_score
float64
0.78
0.86
mean_negative_score
float64
0.76
0.83
difference_score
float64
0.02
0.04
Given a family of hash functions $\mathscr{H} = \{h_a(x) = \left( \sum_{j=0}^{n-1} a_j x_j \right) \bmod p\}$ where $a$ is an $n$-tuple of integers in $\mathbb{Z}_p$ and $p$ is prime, demonstrate that the family $\mathscr{H}$ is universal but not 2-universal, and explain the theoretical implications of these properties...
automath
[ 0.02757563441991806, 0.039123713970184326, -0.040313247591257095, -0.014208460226655006, 0.035884033888578415, -0.032212961465120316, -0.003961977548897266, 0.04690002277493477, 0.024821948260068893, -0.0358719527721405, 0.02688341774046421, 0.00820460356771946, -0.013463620096445084, -0.0...
0.797734
0.772189
0.025545
Evaluate the following limits and justify your solutions: a) Calculate the limit \( \displaystyle \lim_{x \to \infty, \ y\to \infty} \frac{x+y}{x^2 + y^2} \). b) Determine \( \displaystyle \lim_{x \to 0,\ y\to 2} \frac{\sin(xy)}{x} \) and provide a formal justification for your answer.
automath
[ 0.010813267901539803, 0.04223094508051872, -0.026390451937913895, -0.0304902121424675, 0.036354780197143555, -0.022355180233716965, -0.017480280250310898, 0.06253662705421448, 0.062128741294145584, -0.016955822706222534, 0.006714192684739828, 0.04147689789533615, -0.03511117771267891, -0.0...
0.820802
0.803925
0.016877
Consider the polynomial \( p(x) = x^2 + 1 \). 1. Find the roots of \( p(x) \) in the complex numbers and express them clearly. 2. Describe the geometric interpretation of these roots on the complex plane. Additionally, explain how the geometry of the complex plane differs from that of the real line, specifically in...
automath
[ 0.03349198028445244, 0.04043705388903618, -0.034767329692840576, -0.05385724827647209, 0.018903937190771103, -0.04204293340444565, 0.0023642219603061676, 0.055993035435676575, 0.04184112697839737, 0.009536740370094776, 0.012818984687328339, 0.03201528266072273, -0.041452012956142426, -0.01...
0.808643
0.791336
0.017307
Given a measure on a metric space that satisfies the property that the measure of each ball is controlled by a fixed power of its radius, determine the necessary and sufficient conditions under which the theory built from this measure can encompass classical results derived from the Lebesgue measure in Euclidean spaces...
automath
[ 0.016356240957975388, 0.0365506112575531, -0.03979462757706642, -0.04700635373592377, 0.026113031432032585, -0.0054943920113146305, -0.013442834839224815, 0.0538032203912735, 0.03281756117939949, -0.0059457626193761826, 0.008037594147026539, 0.02544742077589035, -0.021840477362275124, -0.0...
0.816313
0.779308
0.037004
Let \( X \) be a random variable described by a probability density function \( f(x; a, b) \), where \( a \) and \( b \) are parameters. Assume the expected value \( E[X] = EV(a, b) \) and the variance \( \text{Var}(X) = VAR(a, b) \). If we observe a sample from this distribution and compute the sample mean \( \overlin...
automath
[ -0.006846510339528322, 0.019465526565909386, -0.06133356690406799, -0.0358227901160717, 0.03497401624917984, -0.011102470569312572, -0.0052595906890928745, 0.05221768841147423, 0.034283675253391266, -0.00198624306358397, 0.010861730203032494, 0.03743216395378113, -0.015194554813206196, -0....
0.813195
0.792956
0.020239
Given the parametric equations \( x(t) = \sqrt{t} \) and \( y(t) = 3t + 4 \) for \( t \geq 0 \), eliminate the parameter to find the Cartesian equation of the curve and then determine the coordinates of the point where the curve intersects the y-axis. Additionally, find the equations of the tangent and normal lines to ...
automath
[ 0.029693186283111572, 0.04405171051621437, -0.046715036034584045, -0.04214206337928772, 0.039533987641334534, -0.031109850853681564, -0.041612740606069565, 0.0786166563630104, 0.04401947557926178, -0.014475325122475624, 0.02212958224117756, 0.026065295562148094, -0.035223338752985, -0.0050...
0.814471
0.790775
0.023696
Given the predicates \( P(x, y) \) interpreted as \( \{(a, b), (b, c), (b, b)\} \) and \( Q(x, y) \) interpreted as \( \{(a, a), (c, c)\} \) over the domain \( \{a, b, c\} \): 1. Determine the truth value of the following statement and justify your answer: \[ \exists x (Q(x, x) \Rightarrow \forall y (P(c, y) \...
automath
[ 0.023694170638918877, 0.02596823126077652, -0.042881496250629425, -0.023439817130565643, 0.04035481438040733, -0.031336843967437744, -0.000823172798845917, 0.078638955950737, 0.04167471081018448, -0.02693694271147251, 0.00006962615589145571, 0.05626858398318291, -0.0147833451628685, -0.010...
0.831923
0.808004
0.02392
Let \( A_j \) be a countably infinite set for each \( j \in \mathbb{N} \). Define \( N \) as the set of natural numbers. Consider the following array representation of \( N \): \[ \begin{matrix} 1 & 3 & 6 & 10 & \ldots \\ 2 & 5 & 9 & \ldots \\ 4 & 8 & & \\ 7 & & & \\ \vdots & & & \\ \end{matrix} \] If we construct a ...
automath
[ 0.027425847947597504, 0.03607090935111046, -0.024679815396666527, -0.03261420503258705, 0.029281185939908028, -0.027502182871103287, -0.028834862634539604, 0.04657643660902977, 0.030163120478391647, -0.0007965333061292768, 0.010652736760675907, 0.018168970942497253, -0.019855942577123642, ...
0.831915
0.807132
0.024783
Let \( K \) be a division ring, and consider a finitely generated \( K \)-vector space \( G \) with a finite generating set \( F \) consisting of \( n \) elements, and a linearly independent subset \( H \) containing \( m \) elements. If \( m < n \), what is the maximum possible number of elements in a basis of \( G \)...
automath
[ 0.042751383036375046, 0.02123665250837803, -0.03296404704451561, -0.026430215686559677, 0.04048873484134674, -0.03648778423666954, -0.004134854767471552, 0.05901438370347023, 0.03440700098872185, -0.012846588157117367, 0.02509870007634163, 0.03193949908018112, -0.022998318076133728, 0.0023...
0.830805
0.806427
0.024378
Consider a defendant who faces trial under two options: being tried by a single judge, who decides correctly with probability \( p \), or being tried by a three-member jury. In the jury, two judges independently decide correctly with probability \( p \), while the third judge makes a decision based only on the flip of ...
automath
[ 0.008752815425395966, 0.023041993379592896, -0.03982271999120712, -0.007960830815136433, 0.036488424986600876, -0.02917541190981865, -0.02397586964070797, 0.06370662152767181, 0.01594742387533188, 0.00883493572473526, 0.0007161254179663956, 0.023781120777130127, -0.019318481907248497, -0.0...
0.811137
0.793459
0.017677
Let \( \mathbb{F} \) be a field and let \( d \) and \( n \) be positive integers with \( d < n \). Is it true that there exists an injective ring homomorphism from \( M_d(\mathbb{F}) \) to \( M_n(\mathbb{F}) \)? If so, under what conditions on \( d \) and \( n \) can such a homomorphism exist?
automath
[ 0.03654181957244873, 0.020011750981211662, -0.011411305516958237, -0.020308077335357666, 0.03859258070588112, -0.038840558379888535, 0.007733447477221489, 0.048738300800323486, 0.04442738741636276, -0.020054113119840622, -0.010718229226768017, 0.027339890599250793, -0.029807182028889656, -...
0.807754
0.786179
0.021574
Given an \( m \times n \) matrix \( A \) representing the coefficients of \( m \) half-space inequalities defining an \( h \)-polyhedron in \( \mathbb{R}^n \), what is the necessary and sufficient condition for the polytope defined by \( Ax \leq b \) to be bounded? How can this condition be verified efficiently?
automath
[ 0.013751394115388393, 0.022097406908869743, -0.02769247442483902, -0.02780323289334774, 0.02817443385720253, -0.024307403713464737, -0.023936284705996513, 0.07407201826572418, 0.03462037071585655, -0.009956780821084976, -0.009265296161174774, 0.03841675445437431, -0.016766339540481567, -0....
0.830618
0.80238
0.028238
Let \( A = \sum_{n=0}^{\infty} a_n \) and \( B = \sum_{n=0}^{\infty} b_n \) be two convergent series. If \( c_n = \sum_{k=0}^n a_k b_{n-k} \) for each \( n \), what is the series representation of the Cauchy product \( C = \sum_{n=0}^\infty c_n \) in terms of \( A \) and \( B \)? Additionally, under what conditions on ...
automath
[ 0.007485600654035807, 0.04665444418787956, -0.04939766973257065, -0.023680787533521652, 0.030155692249536514, -0.003075466025620699, -0.010907914489507675, 0.07869498431682587, 0.0385313481092453, -0.0036519088316708803, -0.0043131341226398945, 0.01207596343010664, -0.029351573437452316, -...
0.823658
0.80725
0.016408
Is the proposition true that if a sequence of functions \( f_n: X \subset \mathbb{R}^2 \to \mathbb{R}^2 \) satisfies both absolute convergence and uniform convergence for the series \( \sum f_n \), then \( \sum \|f_n\| \) is also uniformly convergent? Provide a counterexample if the proposition is false.
automath
[ -0.0143799539655447, 0.03524686396121979, -0.05680440738797188, -0.04661499336361885, 0.0252755805850029, -0.004822811111807823, -0.018429502844810486, 0.07393590360879898, 0.02089325711131096, 0.00203941878862679, -0.0033542043529450893, 0.008203597739338875, -0.027322951704263687, -0.007...
0.823302
0.797239
0.026063
Given a set \( M \) and two atlases \( \mathcal{A} = \{ (U_{\alpha}, \varphi_{\alpha}) : \alpha \in \Gamma \} \) and \( \mathcal{A}' = \{ (U_{\alpha'}, \varphi_{\alpha'}) : \alpha' \in \Gamma' \} \) on \( M \), if \( \mathcal{A} \) consists of \( n \) charts and \( \mathcal{A}' \) consists of \( m \) charts, what is th...
automath
[ 0.03453352302312851, 0.028267424553632736, -0.04663261026144028, -0.02308904193341732, 0.03142615035176277, -0.020363451912999153, -0.037947963923215866, 0.05157003924250603, 0.03325773403048515, -0.020756900310516357, -0.008378975093364716, 0.03578032925724983, -0.01918747089803219, -0.01...
0.827733
0.806827
0.020906
Given finite groups \(H < K < G\) where \(G\) acts primitively on the cosets \(G/K\) and \(K\) acts primitively on the cosets \(K/H\), and assuming both \(H\) is core-free in \(K\) and \(K\) is core-free in \(G\), find the order of the wreath product \(\mathcal{K}^{\Gamma} \rtimes \mathcal{G}\), where \(\mathcal{K}\) a...
automath
[ 0.018099818378686905, 0.05716264992952347, -0.021459277719259262, -0.04309864714741707, 0.015463986434042454, -0.0326315239071846, -0.01595701463520527, 0.07333758473396301, 0.03557164967060089, -0.00826992280781269, 0.008600613102316856, 0.01643315888941288, -0.03151525557041168, -0.00859...
0.818562
0.800734
0.017828
Given a function \( f(x) \) defined on the interval \([1, 5]\) with the following properties: 1. \( f(x) \) is defined and continuous for all \( x \in [1, 5] \) except at \( x = 3 \), where it has a removable discontinuity. 2. \( \lim_{x \to 3} f(x) = 4 \). If \( f(3) \) is redefined to be \( 4 \), is the function no...
automath
[ 0.03211389482021332, 0.03544294461607933, -0.032369837164878845, -0.023313717916607857, 0.04727063328027725, -0.01291696261614561, -0.030395086854696274, 0.08549093455076218, 0.027643008157610893, 0.007992913015186787, 0.0058082169853150845, 0.02620605379343033, -0.018387824296951294, -0.0...
0.810856
0.794581
0.016275
Consider a vector space \( \mathbb{R}^n \) with the standard Euclidean norm defined as \( \| \mathbf{v} \|_2 = \sqrt{v_1^2 + v_2^2 + \cdots + v_n^2} \) for a vector \( \mathbf{v} = (v_1, v_2, \ldots, v_n) \). 1. Calculate the Euclidean norm of the vector \( \mathbf{v} = (3, 4, 5) \). 2. Verify whether the Euclidean d...
automath
[ -0.0011368440464138985, 0.033540550619363785, -0.017622563987970352, -0.026043005287647247, 0.03308834135532379, -0.01729745976626873, -0.011855567805469036, 0.0717725157737732, 0.013262543827295303, -0.00019353725656401366, -0.0013171975733712316, 0.034545302391052246, -0.022143954411149025...
0.81299
0.791576
0.021414
Let \( f: \mathbb{R} \to \mathbb{R} \) be a continuous function satisfying the functional equation \( f(a+b) = f(a) + f(b) \) for all \( a, b \in \mathbb{R} \). Given that \( f(x) = Cx \) for all rational numbers \( x \) (where \( C = f(1) \)), determine the exact value of \( f(2) \).
automath
[ 0.040256526321172714, 0.046259794384241104, -0.048129402101039886, -0.029962118715047836, 0.03600917384028435, -0.011724484153091908, 0.0042085060849785805, 0.07266510277986526, 0.04657851532101631, -0.006353569217026234, 0.005459923297166824, 0.02659120038151741, -0.03306710347533226, -0....
0.829798
0.809706
0.020091
Consider the following scenario: Let \( r, e, f \) be given positive integers. Given primes \( p \) and \( q \) such that \( p \) splits into \( r \) distinct primes in the \( q \)-th cyclotomic field \( K \), and let \( L \) be the \( pq \)-th cyclotomic field. If we can construct a subfield \( L_G \) of \( L \) such ...
automath
[ 0.015296085737645626, 0.01639670319855213, -0.04331385716795921, -0.029383962973952293, 0.01457261387258768, -0.01677594892680645, -0.014795985072851181, 0.05101437121629715, 0.02424316667020321, -0.01163887046277523, 0.020349813625216484, 0.019875716418027878, -0.05586523562669754, -0.003...
0.825222
0.807605
0.017617
Let \( D \) be a countable subset of \( \mathbb{R}^2 \). If \( X = \mathbb{R}^2 \setminus D \), what is the minimum number of straight line segments needed to connect any two distinct points \( p, q \) in \( X \) such that the segment lies entirely within \( X \)?
automath
[ -0.0010638050734996796, 0.018224801868200302, -0.05193198099732399, -0.033984117209911346, 0.023300712928175926, -0.002355855191126466, -0.003813153598457575, 0.03967279940843582, 0.05986447259783745, 0.002291715471073985, 0.003120724344626069, 0.040173593908548355, -0.0035307181533426046, ...
0.843742
0.817029
0.026714
Given a normed vector space \( \struct{X, \norm{ \cdot }} \), suppose the sequence \( \sequence{x_n} \) is defined as \( x_n = \frac{n}{n+1} e_1 + \frac{1}{n} e_2 \) where \( e_1 \) and \( e_2 \) are unit vectors in \( X \). What is the smallest value of \( K \) such that the sequence \( \sequence{x_n} \) is bounded?
automath
[ -0.003109655575826764, 0.03474518284201622, -0.03364340588450432, -0.03252817690372467, 0.03712490573525429, -0.0008029474411159754, -0.016473673284053802, 0.09209923446178436, 0.03443488851189613, -0.011267255991697311, -0.00008423442341154441, 0.01415642723441124, -0.0333249568939209, 0....
0.826074
0.80892
0.017154
Given the vertices of triangle \( ABC \) at the points \( A(p_1, q_1) \), \( B(p_2, q_2) \), and \( C(p_3, q_3) \): 1. Calculate the coordinates of the centroid (barycenter) of triangle \( ABC \). 2. Verify that the centroid can be determined by the intersection of the medians \( AM \), \( BE \), and \( CZ \), where \...
automath
[ 0.06580235809087753, 0.02442261390388012, -0.0315963551402092, -0.025407688692212105, 0.006116576958447695, -0.011740085668861866, -0.0008270292892120779, 0.04019070789217949, 0.03583398461341858, -0.005975344683974981, 0.01813581958413124, 0.026762930676341057, -0.03215370699763298, -0.00...
0.809782
0.787137
0.022645
Let \( y^2 - 4(x + y) = 3 \sin \theta + 4 \cos \theta - 15 \) define a family of parabolas indexed by \( \theta \in \mathbb{R} \). If two tangents are drawn to this curve from the origin, and the slopes of these tangents are \( m_1 \) and \( m_2 \), under what condition would the absolute value of the product of the re...
automath
[ 0.016299095004796982, 0.04444591701030731, -0.03685382381081581, -0.04301406815648079, 0.04946276172995567, -0.008364995010197163, -0.03042818233370781, 0.08241279423236847, 0.031130516901612282, -0.0015113932313397527, -0.014634535647928715, 0.03415374457836151, -0.03406134992837906, -0.0...
0.831426
0.808734
0.022692
Let \( n \) be a natural number. Define the number of divisors function \( d(n) \) as the total count of natural number divisors of \( n \), and the set of divisors function \( S(n) \) as the set of all distinct natural number factors of \( n \). 1. Determine how many natural numbers \( n \) exist such that \( |S(n)|...
automath
[ 0.03354892134666443, 0.03161453455686569, -0.048437755554914474, -0.027770433574914932, 0.022826960310339928, -0.020650461316108704, -0.014031287282705307, 0.046539757400751114, 0.022608140483498573, 0.013496341183781624, 0.012958168052136898, 0.014702368527650833, -0.03301050141453743, -0...
0.831863
0.805295
0.026568
Let \( x_n = \frac{1}{n} \) and \( y_n = \frac{2}{n} \) for \( n \in \mathbb{N} \). What is the value of \( \lim_{n \to \infty} \max\{x_n, y_n\} \)?
automath
[ 0.001058426802046597, 0.02999412640929222, -0.05960746854543686, -0.03381819278001785, 0.030420923605561256, 0.002192669315263629, -0.02445046417415142, 0.048828624188899994, 0.0398247167468071, -0.034924134612083435, 0.001666647382080555, 0.032116252928972244, -0.03076520748436451, -0.003...
0.83601
0.818091
0.01792
Let \( F_1(x_1, x_2) = \frac{-x_2}{x_1^2 + x_2^2} \) and \( F_2(x_1, x_2) = \frac{x_1}{x_1^2 + x_2^2} \). Determine the correctness of the following statements: 1. \( \frac{\partial F_1}{\partial x_2} = \frac{\partial F_2}{\partial x_1} \) 2. There exists a function \( f: \mathbb{R}^2 - \{(0,0)\} \to \mathbb{R} \) su...
automath
[ 0.008972368203103542, 0.04222019016742706, -0.038200777024030685, -0.04446090757846832, 0.04060756415128708, -0.006856720428913832, -0.005607598926872015, 0.08204065263271332, 0.03926708549261093, 0.0001590212486917153, -0.0011648060753941536, 0.013316040858626366, -0.03628084808588028, -0...
0.816086
0.794942
0.021144
Let \( S \) be a finite set with \( n \) elements. If there exists a choice function for the power set \( \powerset S \), what can you conclude about the existence of a choice function for \( S \)? How many distinct choices can be made if \( S \) has elements \( s_1, s_2, \ldots, s_n \)? Provide a verification of the c...
automath
[ 0.04112807661294937, 0.032353032380342484, -0.042547572404146194, -0.02751605026423931, 0.03271055966615677, -0.0478515699505806, -0.01864205114543438, 0.06199995055794716, 0.03766092285513878, -0.006892983336001635, 0.043615762144327164, 0.03344186767935753, -0.029929663985967636, -0.0132...
0.817649
0.801227
0.016423
Given two functions \( f(x,y) \) and \( g(x,y) \) defined on \( \mathbb{R}^2 \), under what conditions on the Hessian of the function \( h(x,y) = f(x,y) - g(x,y) \) can we ensure that the region defined by the inequality \( h(x,y) \leq 0 \) is a convex set? Provide a specific example of \( f \) and \( g \) where \( h(x...
automath
[ 0.006732956040650606, 0.037753183394670486, -0.04830382764339447, -0.034135475754737854, 0.03396826609969139, 0.001013884786516428, -0.033085897564888, 0.08112616837024689, 0.027790047228336334, -0.015788715332746506, 0.011655310168862343, 0.02512451447546482, -0.024437520653009415, -0.018...
0.80782
0.782799
0.025021
Given four complex numbers \( z_1, z_2, z_3, z_4 \) located in different quadrants of the complex plane, consider their conjugates and the following pairwise sums: \[ S_1 = \overline{z}_1 + \overline{z}_2, \quad S_2 = \overline{z}_1 + \overline{z}_3, \quad S_3 = \overline{z}_1 + \overline{z}_4, \quad S_4 = \overline{...
automath
[ 0.025582630187273026, 0.05390460789203644, -0.0357675664126873, -0.041824571788311005, 0.03156294301152229, 0.0013171806931495667, 0.0032931470777839422, 0.03897116333246231, 0.036787617951631546, 0.00015960176824592054, 0.009172730147838593, 0.03404553234577179, -0.04530021548271179, -0.0...
0.829877
0.812634
0.017243
Given a first-order language $\mathcal{L}$ with a binary relation symbol $R$, construct a set of sentences whose models precisely characterize partially ordered sets. Additionally, provide a formal sentence that specifies the existence of exactly $n$ distinct elements in a model, ensuring that every element in the mode...
automath
[ 0.02576453797519207, 0.018855463713407516, -0.028302382677793503, -0.0335051454603672, 0.033869002014398575, -0.037464674562215805, -0.018814481794834137, 0.04894412308931351, 0.04061224311590195, -0.02153805084526539, 0.009981352835893631, 0.03128005191683769, -0.023808112367987633, 0.008...
0.825763
0.793516
0.032247
In a commutative ring \( R \), let \( f_1, f_2, \ldots, f_n \) be non-zero elements of \( R \). If we consider a finitely generated \( R \)-module \( M \), is it true that the map \[ M \longrightarrow \bigoplus_{i=1}^n M_{f_i}, \quad m \longmapsto (f_1 m, f_2 m, \ldots, f_n m) \] is injective if and only if for all ...
automath
[ 0.05490422993898392, 0.03068019635975361, -0.026896823197603226, -0.03640882670879364, 0.027211064472794533, -0.05031129717826843, -0.008880163542926311, 0.058404743671417236, 0.028079379349946976, -0.024561770260334015, 0.006678763777017593, 0.021063992753624916, -0.0228700153529644, -0.0...
0.809489
0.790008
0.019481
Given the double indexed sequence of positive numbers \( \{ a_{k,m} \} \) satisfying the conditions \( a_{1,n} \leq \frac{1}{n+1} \) and \[ a_{k,m} \leq \frac{1}{m+1}(a_{k-1,m+1}+L a_{k-1,m+2}), \] where \( L \) is a positive constant, what is the upper bound for \( a_{n,0} \) in terms of \( n \)? Provide a formula ...
automath
[ 0.008519589900970459, 0.020563270896673203, -0.018237367272377014, -0.016762984916567802, 0.016687894240021706, -0.008265916258096695, -0.05531730502843857, 0.06798195093870163, 0.02568104863166809, -0.019766267389059067, 0.011509118601679802, 0.02034936286509037, -0.03809450566768646, 0.0...
0.824813
0.807528
0.017285
Consider the set \( A = \{1\} \) and the relation \( R \) defined on \( A \) such that for all \( x, y \in A \), \( x R y \) if and only if \( x \neq y \). Determine whether the relation \( R \) is reflexive, symmetric, and transitive. Provide a justification for each property.
automath
[ 0.06375587731599808, 0.033057767897844315, -0.0344977006316185, -0.02621050737798214, 0.03762523829936981, -0.020712140947580338, -0.0045378790237009525, 0.061400290578603745, 0.0400860458612442, -0.021713269874453545, 0.018491998314857483, 0.013687550090253353, -0.03868741914629936, -0.01...
0.814569
0.793412
0.021157
Let \( G \) be a group and let \( H \subset G \) be a subset such that for all \( g \in G \), \( gHg^{-1} \subset H \). If \( H \) is not a subgroup of \( G \), can you provide a specific example of such a subset \( H \) and a group \( G \) where this holds, demonstrating that normality does not imply subgroups in gene...
automath
[ 0.0158613882958889, 0.020169373601675034, -0.026075515896081924, -0.050810348242521286, 0.044505972415208817, -0.035607658326625824, -0.016229771077632904, 0.03410886600613594, 0.017161207273602486, -0.013161550275981426, 0.01765947788953781, 0.000025007988369907252, -0.024940602481365204, ...
0.806944
0.786936
0.020009
Given a matrix \( Z \in \mathbb{R}^{n \times r} \) and a positive definite matrix \( H \in \mathbb{R}^{r \times r} \), consider the optimization problem \[ \min_{Y \geq 0} \quad \operatorname{Tr} \left( (Y - Z) H (Y - Z)^T \right). \] If \( H \) has a Cholesky decomposition \( H = R^T R \), how can we efficiently so...
automath
[ 0.019652115181088448, 0.0260272528976202, -0.05722321569919586, -0.028537176549434662, 0.048722848296165466, -0.005808062385767698, -0.009376040659844875, 0.056615788489580154, 0.029335083439946175, -0.021059997379779816, -0.004504954442381859, -0.0005245912470854819, -0.02002030424773693, ...
0.818635
0.795541
0.023094
Given the definitions and properties of affine subspaces, consider an affine subspace \( A \subset \mathbb{R}^n \) described by the set of points that satisfy the system of affine equations \[ \begin{aligned} u_1^Tx &= c_1 \\ u_2^Tx &= c_2 \\ & \vdots \\ u_k^Tx &= c_k \end{aligned} \] where \( u_i \in \mathbb{R}^n \...
automath
[ 0.011799676343798637, 0.02997843734920025, -0.03397634997963905, -0.04842473566532135, 0.0457441471517086, -0.008385846391320229, -0.00045647018123418093, 0.06079038605093956, 0.034687984734773636, 0.017397794872522354, 0.023583317175507545, 0.025532947853207588, -0.038459666073322296, -0....
0.809992
0.787239
0.022753
Consider a convex set \( C \) and the stochastic process defined by \( X_t = \xi g(t) \), where \( g: C \to \mathbb{R} \) is a convex function and \( \xi \) is a nonnegative random variable. If \( Y_t = \sum_{k=1}^n \xi_k g_k(t) \) for convex functions \( g_k \), under what conditions on the random variables \( \xi_k \...
automath
[ -0.006786929909139872, 0.04243709146976471, -0.060867007821798325, -0.007103173062205315, 0.0410209596157074, -0.014120636507868767, -0.03432927653193474, 0.07160643488168716, 0.013524970971047878, -0.014152870513498783, 0.02470334619283676, 0.02255091443657875, -0.02825535647571087, 0.006...
0.809605
0.784796
0.024809
Given a signature `𝑆` and a class of `𝑆`-algebras `𝒦`, let `ℰ` be the set of identities `(p, q)` such that `𝒦 ⊫ p ≈ q`. If `𝒦` consists of `n` distinct `𝑆`-algebras and the number of identities in `ℰ` is `m`, how many distinct algebras can be formed from the set `ℰ` that satisfy the identities in `ℰ`?
automath
[ 0.039902251213788986, 0.017339756712317467, -0.045061081647872925, -0.018104951828718185, 0.023006916046142578, -0.020575199276208878, -0.021787263453006744, 0.051315322518348694, 0.04857408255338669, -0.007841904647648335, 0.016505418345332146, 0.022814005613327026, -0.03389940410852432, ...
0.825074
0.80583
0.019244
Consider the vector space \( \mathcal{P}_2 \) of polynomials of degree at most 2. Determine the dimension of \( \mathcal{P}_2 \) and provide a basis for this space. Additionally, find the dimensions of the following spaces: 1. The space of cubic polynomials \( p(x) \) such that \( p(7) = 0 \). 2. The space of cubic po...
automath
[ 0.036500342190265656, 0.03710784763097763, -0.04421839863061905, -0.05056675523519516, 0.030174335464835167, -0.020846858620643616, -0.018654104322195053, 0.053371548652648926, 0.0221770778298378, -0.009009446017444134, -0.010402270592749119, 0.030731339007616043, -0.016199437901377678, -0...
0.819942
0.800141
0.019801
Let \( S^n \) be the unit sphere in \( \mathbb{R}^n \). If \( K \subset S^n \) is an \( (n-1) \)-dimensional subset, what can be said about the Lebesgue measure of \( K \)? Specifically, does \( K \) have measure zero, and what is the reasoning behind this result?
automath
[ 0.003986706957221031, 0.0399937704205513, -0.03750211372971535, -0.04707406461238861, 0.036662351340055466, -0.0003860096912831068, -0.021638933569192886, 0.044449564069509506, 0.03515441715717316, 0.013442538678646088, 0.0226979348808527, 0.023221805691719055, -0.034359559416770935, -0.01...
0.816614
0.799863
0.016751
Let \( f: \mathbb{R} \to [0, \infty) \) be a non-negative measurable function which is bounded almost everywhere. If the measure of the set where \( f \) is unbounded is zero, what conclusion can we draw about the integrability of \( f \) over a finite measure space? Specifically, compute \( \int_{\mathbb{R}} f \, d\mu...
automath
[ 0.016217797994613647, 0.03563974052667618, -0.028261175379157066, -0.029319213703274727, 0.025719523429870605, 0.010837359353899956, -0.022842058911919594, 0.04214377701282501, 0.04645806923508644, 0.0064672138541936874, 0.004218486603349447, 0.007993311621248722, -0.02314544841647148, -0....
0.797162
0.775465
0.021697
Consider a bijection \(\phi: M \to N\) between \(n\)-manifolds that is locally Lipschitz. If we assume the Jacobian \(D\phi\) is non-singular almost everywhere, what properties must the inverse \(\phi^{-1}\) satisfy in order for the change of variables formula \[ \int_U \omega = \int_{\phi^{-1}(U)} \phi^* \omega \] ...
automath
[ -0.0029259512666612864, 0.026589056476950645, -0.0332576148211956, -0.03193894028663635, 0.02057386003434658, -0.0019023538334295154, -0.013337199576199055, 0.05615001916885376, 0.03443540260195732, -0.002813188126310706, 0.006444442085921764, 0.01948731206357479, -0.03871004655957222, -0....
0.804315
0.778274
0.026041
Given the Möbius transformation \( f(z) = \frac{1+z}{1-z} \), determine the image of the unit circle \( |z| = 1 \) under this transformation, and confirm that it maps to the entire imaginary axis. Specifically, find the exact output values if \( z = e^{i\theta} \) where \( \theta \) varies from \( 0 \) to \( 2\pi \), a...
automath
[ 0.013698372058570385, 0.05242384597659111, -0.013502421788871288, -0.051740262657403946, 0.02921721711754799, -0.013929920271039009, -0.014221652410924435, 0.06758382171392441, 0.03110053949058056, 0.0003317269147373736, 0.01633499190211296, 0.00900451559573412, -0.005070357583463192, -0.0...
0.799216
0.782753
0.016464
Given a unital ring \( R \) with a finite doubly-indexed set \( T = \{ e_{ij} \mid 1 \leq i,j \leq n \} \) that satisfies the following conditions: 1. \( e_{ij} e_{k\ell} = \delta_{jk} e_{i\ell} \) 2. \( \sum e_{ij} = 1 \) where \( \delta_{jk} \) denotes the Kronecker delta, what is the algebraic structure of \( R \...
automath
[ 0.0392606183886528, 0.03743818774819374, -0.04017563909292221, -0.01600218564271927, 0.03234477713704109, -0.02599106729030609, -0.019482871517539024, 0.06507301330566406, 0.030365752056241035, 0.01512937992811203, 0.01520475372672081, 0.028301289305090904, -0.04185948893427849, -0.0010100...
0.825083
0.799725
0.025357
Given the sequences defined as follows: \[ a_n = \sqrt{n+1000} - \sqrt{n}, \quad b_n = \sqrt{n+\sqrt{n}} - \sqrt{n}, \quad c_n = \sqrt{n+\frac{n}{1000}} - \sqrt{n} \] 1. Calculate \( \lim_{n \to \infty} a_n \), \( \lim_{n \to \infty} b_n \), and \( \lim_{n \to \infty} c_n \). 2. For \( n < 10^6 \), verify and compare...
automath
[ 0.01974189095199108, 0.044473662972450256, -0.03694312274456024, -0.01695161871612072, 0.025013400241732597, -0.012572081759572029, -0.03648099675774574, 0.0731152668595314, 0.03731634095311165, -0.011933578178286552, 0.009200351312756538, 0.016417287290096283, -0.04756149277091026, -0.005...
0.837861
0.814179
0.023682
In an undirected graph \( G = (V,E) \), let \( A \) be a set of edges such that \( A \subseteq E \) contains edges that connect vertices in the subset \( S \) of \( V \). If \( (S, V \setminus S) \) is a cut of graph \( G \) that respects \( A \), what can we conclude about the set \( A \) in relation to the edges pres...
automath
[ 0.013206185773015022, 0.04197874665260315, -0.029391512274742126, 0.004517838358879089, 0.03393632173538208, -0.004729198757559061, -0.0023947523441165686, 0.054362233728170395, 0.04003879055380821, -0.0016936336178332567, 0.021682145074009895, 0.028653670102357864, -0.022900613024830818, ...
0.817878
0.790882
0.026996
Let \( N = pq \) be the product of two large primes \( p \) and \( q \). In a given cryptosystem, Alice computes \( g_1 \equiv g^{r_1 \cdot (p-1)} \mod N \) and \( g_2 \equiv g^{r_2 \cdot (q-1)} \mod N \). 1. Explain how one can derive \( p \) and \( q \) from the values \( g_1 \) and \( g_2 \), and specifically, cal...
automath
[ 0.0420333668589592, 0.051449451595544815, -0.019319018349051476, -0.03189675509929657, 0.0235137976706028, -0.032236527651548386, -0.005762727931141853, 0.07099929451942444, 0.01683925651013851, -0.003213196527212858, 0.004617395810782909, 0.01877976767718792, -0.04125838726758957, -0.0287...
0.824143
0.805525
0.018618
Given an optimization problem defined as follows: $OPT$ = Given a set of feasible solutions $F$ and an objective function $f$, find $x\in F$ maximizing $f(x)$. And its corresponding decision problem: $L_{OPT}$ = Given $F$, $f$, and a target value $u \in \mathbb{Q$, decide if there exists $x \in F$ such that $f(x) \g...
automath
[ 0.0006483143079094589, 0.028723983094096184, -0.04993301257491112, -0.014582633972167969, 0.021837426349520683, -0.006914246827363968, -0.034962691366672516, 0.07215046137571335, 0.018113162368535995, -0.01625831052660942, 0.027331814169883728, 0.014266540296375751, -0.020272215828299522, ...
0.822666
0.793129
0.029537
Let \( K \) be the compact set defined by the unit circle in the complex plane, specifically \( K = \{ z \in \mathbb{C} : |z| = 1 \} \). What is the polynomially convex hull \( \hat{K} \) of this set, and how would you verify the analyticity of a function \( f \) that can be approximated by polynomials uniformly on com...
automath
[ 0.01725459285080433, 0.062321871519088745, -0.04224809631705284, -0.03025129623711109, 0.03172532096505165, -0.015207501128315926, -0.008720728568732738, 0.030802413821220398, 0.046452902257442474, 0.0025136680342257023, 0.039376676082611084, 0.021423300728201866, -0.03649607300758362, -0....
0.827646
0.800631
0.027015
Let \( X_i \) be a sequence of independent and identically distributed random variables where each \( X_i \) takes values -1 and +1 with probability \( \frac{1}{2} \). Define the partial sum \( S_n = \sum_{i=1}^{n} X_i \). What is the probability that the limit \( \lim_{n \to \infty} S_n = \infty \) does not hold almos...
automath
[ -0.0191207118332386, 0.03539174795150757, -0.04458170756697655, -0.018612390384078026, 0.023695126175880432, 0.0063599348068237305, -0.017406394705176353, 0.06215502694249153, 0.019803589209914207, -0.013824000023305416, 0.005176023114472628, 0.027957957237958908, -0.03740864619612694, -0....
0.822333
0.799117
0.023216
Given a finite group \( G \) of order \( n \) and a ring \( R \), let \( RG \) denote the group ring of \( G \) over \( R \). If \( G \) is a cyclic group generated by an element \( g \) of order \( n \), can you find a specific example of such a group ring \( RG \) when \( R = \mathbb{Z} \) and describe its structure ...
automath
[ 0.04446515440940857, 0.032772209495306015, -0.03934381902217865, -0.0482933484017849, 0.012480122968554497, -0.058451008051633835, -0.0005721685010939837, 0.0438016876578331, 0.015359380282461643, -0.013187684118747711, 0.022471122443675995, 0.023101579397916794, -0.04985884577035904, -0.0...
0.811083
0.794853
0.01623
Given two integer partitions of \( n \), \( A \) and \( B \), can you determine whether there exists a partition \( C \) such that \( C \leq A \) and \( C \leq B \), where \( |C| \) is minimized? More specifically, what is the maximum possible size of \( |C| \) in terms of \( n \), and under what conditions can \( C \)...
automath
[ 0.034864380955696106, 0.017221475020051003, -0.048392798751592636, -0.0025400586891919374, 0.02024494670331478, -0.013911009766161442, -0.014105841517448425, 0.05572991818189621, 0.030241886153817177, -0.013973609544336796, 0.02216413803398609, 0.024995077401399612, -0.02890210971236229, -...
0.843731
0.820412
0.023319
Given a constant vector \( c \in \mathbb{R}^n \) and \( n+1 \) constant vectors \( u_0, \ldots, u_n \in \mathbb{R}^n \) such that \( u_1 - u_0, \ldots, u_n - u_0 \) form a basis of \( \mathbb{R}^n \), let \[ \Phi_{i,c}(\lambda_0, \ldots, \lambda_n) = \| c - \lambda_0 u_0 - \ldots - \lambda_{i-1} u_{i-1} - \lambda_{i+...
automath
[ 0.01581430435180664, 0.04568224772810936, -0.04074082523584366, -0.026662679389119148, 0.048374563455581665, -0.021012723445892334, -0.0032416521571576595, 0.0787467509508133, 0.029422754421830177, 0.003877910552546382, -0.000900990329682827, 0.025080181658267975, -0.03480597212910652, -0....
0.826682
0.805277
0.021405
Evaluate the integral \[ I_n = \int_{C(0,1)} \left(z + \frac{1}{z}\right)^{2n} \frac{1}{z} \, dz \] for \( n \in \mathbb{Z} \), where \( C(0,1) \) is the positively oriented unit circle centered at the origin. What is the result of \( I_n \) in terms of \( n \)?
automath
[ 0.021845920011401176, 0.036234915256500244, -0.05534352362155914, -0.035062745213508606, 0.03568597510457039, 0.007362322881817818, -0.013720550574362278, 0.026179226115345955, 0.030719416216015816, 0.004099035169929266, 0.008063413202762604, 0.021731061860919, -0.03227672353386879, -0.018...
0.81934
0.800875
0.018465
Given two lines represented by the equations \( L_1: a_1x + b_1y + c_1 = 0 \) and \( L_2: a_2x + b_2y + c_2 = 0 \), where \( a_1, b_1, c_1, a_2, b_2, c_2 \) are real constants and the lines are not parallel, find the area of the triangle formed by the intersection point of the two lines and the points where each line i...
automath
[ 0.003761927830055356, 0.02483418397605419, -0.04833512753248215, -0.050398774445056915, 0.03052302449941635, -0.01342140231281519, -0.013483945280313492, 0.073064886033535, 0.04651694744825363, -0.006764199119061232, 0.015724649652838707, 0.03683285415172577, -0.012541800737380981, -0.0216...
0.827256
0.806091
0.021165
Given groups \( A \), \( B \), and \( C \) where \( A \) is the infinite cyclic group generated by \( t \), \( B \) is a free group on infinitely many generators indexed by \( \mathbb{Z} \), and \( C \) is the additive group of rational numbers, with \( g_n \) acting on \( C \) by multiplication by \( n \) (for \( n \n...
automath
[ 0.03438814356923103, 0.048269521445035934, -0.030749591067433357, -0.02295093424618244, 0.038930587470531464, -0.04398885369300842, -0.018933702260255814, 0.0509137287735939, 0.014531873166561127, -0.01684604585170746, 0.011095120571553707, 0.007445419207215309, -0.03570548817515373, -0.02...
0.829008
0.80525
0.023758
Given six points in a two-dimensional space represented by their coordinates \((x_1, y_1), (x_2, y_2), \ldots, (x_6, y_6)\), under what conditions can the matrix \[ \mathbf{A} = \begin{pmatrix} 1 & x_1 & y_1 & x_1^2 & x_1 y_1 & y_1^2 \\ 1 & x_2 & y_2 & x_2^2 & x_2 y_2 & y_2^2 \\ 1 & x_3 & y_3 & x_3^2 & x_3 y_3 & y...
automath
[ 0.02895462140440941, 0.04672274738550186, -0.03151290863752365, -0.03810178115963936, 0.0454045906662941, -0.013980226591229439, -0.025119740515947342, 0.058685239404439926, 0.02827393263578415, -0.014630751684308052, 0.00335302809253335, 0.019148951396346092, -0.039232462644577026, -0.015...
0.831858
0.808457
0.023401
Let \( G \) be a group and consider the equation \( (ab)^n = a^n b^n \) for all \( a, b \in G \) and \( n \in \mathbb{Z} \). How many distinct values of \( n \) can be chosen such that this equation holds if and only if \( G \) is an Abelian group? Specifically, demonstrate that for which particular values or condition...
automath
[ 0.03497695550322533, 0.023941176012158394, -0.04015744850039482, -0.031529657542705536, 0.024594128131866455, -0.057768240571022034, 0.0011894525960087776, 0.0471499040722847, 0.029763005673885345, -0.00336123607121408, -0.008168082684278488, 0.024840936064720154, -0.03299576789140701, -0....
0.835995
0.810386
0.025609
Let $\mathcal{A}$ be an abelian category in which the following conditions are satisfied: 1. $\mathcal{A}$ has direct sums, 2. $\mathcal{A}$ has AB3 and direct sums are exact, 3. $\mathcal{A}$ has AB3 and filtered colimits are exact. If $U$ is a generator object of $\mathcal{A}$, how many distinct morphisms can be fo...
automath
[ 0.025802545249462128, 0.02541130967438221, -0.023689882829785347, -0.00875601265579462, 0.018982216715812683, -0.04072641581296921, -0.027587568387389183, 0.05782199278473854, 0.02745099738240242, -0.0170856062322855, 0.004030427895486355, 0.03355059772729874, -0.017733292654156685, 0.0003...
0.821613
0.803099
0.018514
Let \( A = \begin{pmatrix} a & b \\ c & d \end{pmatrix} \) where \( a, b, c, \) and \( d \) are real numbers. Calculate the characteristic polynomial of the matrix \( A \) and confirm whether it can be expressed in the form \( \lambda^2 - \text{tr}(A)\lambda + \det(A) = 0 \), where \( \text{tr}(A) = a + d \) and \( \de...
automath
[ 0.028487414121627808, 0.035030610859394073, -0.02833900786936283, -0.04849330708384514, 0.04185732826590538, -0.023706484586000443, 0.0030722548253834248, 0.06875656545162201, 0.01895183138549328, -0.014522077515721321, -0.006189330946654081, 0.03880510851740837, -0.0430806502699852, -0.02...
0.814954
0.797889
0.017065
Let \( f:(0,1] \to \mathbb{R} \) be defined by \( f(x) = \frac{1}{x} \). Consider the function \[ F(c) = \int_c^1 f(x) \, dx. \] Determine whether \( F(c) \) is continuous on the interval \( (0,1) \) and what happens as \( c \) approaches \( 0 \). Specifically, evaluate \[ \lim_{c \to 0^+} F(c). \] What does this...
automath
[ 0.012500959448516369, 0.04846520349383354, -0.02317868359386921, -0.019322944805026054, 0.04199622571468353, -0.007313255220651627, -0.018378663808107376, 0.08693401515483856, 0.04073675721883774, -0.0013837555889040232, -0.0010287630138918757, 0.019417008385062218, -0.011400150135159492, ...
0.805361
0.787469
0.017891
Let \( S \) be a set with \( n \) elements and consider the automorphism group \( \Aut S \) of a structure \( \struct{S, *} \) where \( * \) is a binary operation that defines an algebraic structure. If the automorphism group \( \Aut S \) contains \( m \) automorphisms, what is the maximum possible value of \( m \) in ...
automath
[ 0.05024976655840874, 0.006308142561465502, -0.05349348112940788, -0.008501269854605198, 0.03151949495077133, -0.037450164556503296, -0.032909516245126724, 0.07089585065841675, 0.04505719617009163, -0.005697473883628845, 0.008875973522663116, 0.02656140923500061, -0.03480779007077217, -0.01...
0.807477
0.786642
0.020835
Given two infinitesimals \( ds \) and \( ds' \) that approach zero simultaneously as a parameter \( x \) approaches zero, demonstrate that if \( ds \) and \( ds' \) are infinitesimals of the same order, then there exists a constant \( a \) such that \( ds^2 = a \, ds'^2 \), and determine the value of \( a \) in terms o...
automath
[ 0.01262783631682396, 0.05083705484867096, -0.044791996479034424, -0.032962869852781296, 0.01931585930287838, -0.005918034818023443, -0.005180634092539549, 0.0672367587685585, 0.03186361491680145, -0.009710649959743023, 0.004621075000613928, 0.02779390476644039, -0.03323935344815254, -0.001...
0.827138
0.809497
0.017641
Given the linear programming problem defined by the objective function \( Ax + By \) subject to the constraints \( Cz + Dw = 1 \) and \( A'x + B'y \leq C'z + D'w \), with \( x, y, z, w \ge 0 \) and where \( A, B, C, D, A', B', C', D' \) are constant positive \( 1 \times n \) matrices, determine under what conditions th...
automath
[ -0.010980809107422829, 0.02637660503387451, -0.031167086213827133, -0.03236088156700134, 0.025667890906333923, 0.017581237480044365, -0.008987926878035069, 0.0685950517654419, 0.03211313113570213, 0.0002613520191516727, 0.00193391356151551, 0.00207318551838398, -0.019689755514264107, 0.002...
0.814374
0.788919
0.025455
Can you provide a bijection \( f: (0, 1) \to (0, \infty) \) and another bijection \( g: (0, 1) \to [0, \infty) \) where \( g(x) \) has the following definition: \[ g(x) = \begin{cases} 0 & \text{if } x = \frac{1}{2} \\ \frac{1}{n-1} & \text{if } x = \frac{1}{n}, \, n \in \mathbb{Z}, \, n \geq 3 \\ x & \text{otherw...
automath
[ 0.016415564343333244, 0.031809911131858826, -0.03281435742974281, -0.029541995376348495, 0.03526732325553894, -0.034077201038599014, -0.0316568948328495, 0.06501185894012451, 0.03145461156964302, 0.0038524139672517776, 0.01536951120942831, 0.016116652637720108, -0.01839265041053295, -0.031...
0.827658
0.8079
0.019757
Given a large binary matrix \( M \) where \( M[i,j] = 1 \) indicates a connection between vertex \( i \) and vertex \( j \) of a polyhedron, and all vertices are listed with varying degrees of connectivity, how can you efficiently generate a binary adjacency matrix representing these connections, ensuring the matrix is...
automath
[ 0.02791735902428627, 0.01891777478158474, -0.043622348457574844, -0.021941883489489555, 0.021660203114151955, -0.029049614444375038, -0.04088883474469185, 0.06304772943258286, 0.03643488511443138, -0.018330343067646027, 0.005106532946228981, 0.039633363485336304, -0.009443358518183231, 0.0...
0.807501
0.791137
0.016364
Are there any even polynomials \( P \in \mathbb{R}[x] \) of degree greater than 2 such that \[ P(\sin x) + P(\cos x) = 1 \] holds for all real \( x \)? If such polynomials exist, provide a general form for them.
automath
[ 0.01741364598274231, 0.03194457292556763, -0.03920095041394234, -0.04099227115511894, 0.013456110842525959, -0.013213676400482655, -0.0017996842507272959, 0.04754552245140076, 0.02820620872080326, -0.01012713834643364, 0.018811479210853577, 0.034666724503040314, -0.03940928354859352, -0.02...
0.822223
0.80473
0.017493
Let \( p \) be a strictly positive integer. Determine whether \( p \) is prime if and only if the ideal \( \langle p \rangle \) is a maximal ideal in \( \mathbb{Z} \). Specifically, if \( p \) is chosen as 15, what can be concluded about the primality of \( p \) and the maximality of \( \langle p \rangle \)?
automath
[ 0.04330461844801903, 0.031915463507175446, -0.01617056503891945, -0.018436212092638016, 0.04537767171859741, -0.032555293291807175, 0.020640643313527107, 0.04302167147397995, 0.02570349909365177, -0.02015814371407032, 0.008449341170489788, 0.002791750244796276, -0.03092006780207157, -0.028...
0.825577
0.802104
0.023473
Consider the functional \( I(y) = \int_1^2 x (y')^2 \, dx \) with the endpoint conditions \( y(1) = 1 \) and \( y(2) = 2 \). Using the Euler-Lagrange equations, derive the necessary conditions for the function \( y(x) \) that minimizes \( I(y) \) and identify the type of solution that satisfies the boundary conditions....
automath
[ 0.013959679752588272, 0.04668321833014488, -0.04571966454386711, -0.030884863808751106, 0.045264653861522675, 0.0016055649612098932, -0.027543310075998306, 0.08348878473043442, 0.03297027200460434, 0.009379860945045948, 0.00514091644436121, 0.028271682560443878, -0.01990332081913948, -0.00...
0.820563
0.80138
0.019184
Given a discrete random variable \( X \) with probabilities \( \mathbb{P}(X = x) \), for \( x \in \mathbb{N} \), evaluate the following equality: \[ \sum_{r=0}^\infty \sum_{x=r+1}^\infty \mathbb{P}(X=x) \quad \text{and} \quad \sum_{x=1}^\infty \sum_{r=0}^{x-1} \mathbb{P}(X=x). \] Demonstrate whether this equality hol...
automath
[ -0.005071545485407114, 0.03532865270972252, -0.02837902307510376, -0.039850130677223206, 0.013771114870905876, 0.004741245880723, -0.012728627771139145, 0.057071950286626816, 0.027279537171125412, -0.010846869088709354, -0.006000899244099855, 0.008509056642651558, -0.051693227142095566, -0...
0.829931
0.804525
0.025405
Given two functions defined on the same domain, \( f(x) = x^2 \) and \( g(x) = x^3 \), determine if they are equal functions when their domain is restricted to \( x \in \{0, 1\} \). Consider also the functions \( f(x) = x \) and \( g(x) = x \) for \( x^2 \geq 0 \), and \( g(x) = -x \) for \( x^2 < 0 \). Are these pairs...
automath
[ 0.006654286757111549, 0.032335493713617325, -0.03738494589924812, -0.046661823987960815, 0.053987596184015274, -0.01805482804775238, 0.004028476309031248, 0.07039179652929306, 0.03403439372777939, -0.009259466081857681, -0.0026604551821947098, 0.01650918833911419, -0.03462447598576546, -0....
0.814401
0.793645
0.020757
Let \( f_1, f_2, \ldots, f_n \) be strictly convex functions defined on the non-negative reals. Given that \( x_1 + x_2 + \cdots + x_n = X \) for some fixed \( X > 0 \), determine the condition under which the maximum value of the sum \( S = f_1(x_1) + f_2(x_2) + \cdots + f_n(x_n) \) occurs. Specifically, explore for w...
automath
[ 0.018549734726548195, 0.040090952068567276, -0.05896619334816933, -0.02250458113849163, 0.035620834678411484, 0.0004530430305749178, -0.014154951088130474, 0.06009148433804512, 0.026645274832844734, -0.020864225924015045, -0.0025943450164049864, 0.01912461780011654, -0.02136761136353016, -...
0.826292
0.794796
0.031496
For a polynomial \( v(t) \) over the set of coefficients \(\{-1, 0, 1\}\), consider the implications of having a root that is a \(2^j\)-th root of unity. Given that this corresponds to \(v(t)\) being divisible by either \(1 - t\) or \(1 + t^{2^{j-1}}\), determine the largest integer \(j\) such that \(v(t)\) can have th...
automath
[ 0.039062339812517166, 0.0564705915749073, -0.03435273841023445, -0.0309378020465374, 0.018534675240516663, -0.0272617656737566, -0.014859979040920734, 0.062171339988708496, 0.022810455411672592, -0.013631314039230347, 0.015615861862897873, 0.02992604300379753, -0.009999040514230728, -0.012...
0.837442
0.819305
0.018137
Given a differentiable manifold \( M \) embedded in \( \mathbb{R}^n \), let \( p \in M \) be a point where the tangent space \( T_pM \) is defined. Suppose \( M \) is 2-dimensional and at point \( p \), the tangent vectors correspond to the curves parameterized by \( \gamma(t) = (x(t), y(t)) \) where \( x(t) \) and \( ...
automath
[ 0.00196179561316967, 0.028937971219420433, -0.04004576429724693, -0.04570286348462105, 0.04965505748987198, -0.014323806390166283, -0.027164500206708908, 0.08497825264930725, 0.05342109501361847, 0.018754545599222183, -0.01805705390870571, 0.04379234462976456, -0.046119168400764465, -0.006...
0.815735
0.797587
0.018148
Let \( S = \{1, 2, 3, 4, 5\} \). Consider the relation \( \mathcal{R} \) defined on \( S \) by \( \mathcal{R} = \{(1, 1), (2, 2), (3, 3)\} \). Is the relation \( \mathcal{R} \) coreflexive? If so, list all the elements of the diagonal relation \( \Delta_S \) and verify if \( \mathcal{R} \subseteq \Delta_S \). If not,...
automath
[ 0.03308906406164169, 0.03373454883694649, -0.05075056850910187, -0.0414389967918396, 0.031264305114746094, -0.003191352356225252, -0.004839340224862099, 0.07676132023334503, 0.03170502930879593, -0.008159106597304344, 0.0208940040320158, 0.020869936794042587, -0.029451828449964523, -0.0182...
0.827128
0.807441
0.019687
Let \( V = \mathbb{C}^3 \) be the vector space associated with the standard permutation representation of the symmetric group \( S_3 \). If \( I: V \rightarrow V \) is a linear map that serves as an intertwiner for this representation, express \( I \) in terms of two complex numbers \( \lambda \) and \( \mu \) such tha...
automath
[ 0.013944900594651699, 0.033061444759368896, -0.03504309803247452, -0.03438388928771019, 0.04527011886239052, -0.013867960311472416, -0.026842646300792694, 0.06031110882759094, 0.021265117451548576, -0.0031987580005079508, 0.017182378098368645, 0.019204916432499886, -0.027025625109672546, -...
0.818934
0.793912
0.025022
Let $R$ be a division ring of characteristic $p > 0$. Given a non-Archimedean norm $\norm{\,\cdot\,}$ on $R$, determine the number of distinct values in the set $\{\norm{n \cdot 1_R} : n \in \{0, 1, 2, \ldots, p-1\}\}$.
automath
[ 0.007325205020606518, 0.021961914375424385, -0.03735226392745972, -0.019735537469387054, 0.017409320920705795, -0.013950308784842491, 0.000034334960218984634, 0.0563640221953392, 0.03914462402462959, -0.011375229805707932, 0.006499028764665127, 0.019811369478702545, -0.039812006056308746, ...
0.844433
0.822303
0.022131
Given two distinct primes \( p \) and \( q \), determine the conditions under which the average of the divisors of the number \( n = p^a q^b \) is an integer. Specifically, find the values of \( a \) and \( b \) such that the arithmetic mean of the divisors of \( n \) is guaranteed to be an integer, and justify your re...
automath
[ 0.05056246742606163, 0.03274542838335037, -0.03523021563887596, -0.038751862943172455, 0.03369515389204025, -0.027185382321476936, -0.006221378222107887, 0.05327903851866722, 0.03198924660682678, -0.010386338457465172, 0.0033038535621017218, 0.009365180507302284, -0.02977639250457287, -0.0...
0.836436
0.818201
0.018235
Let \( C \) be a convex disk in the plane, and let \( C_1 \) and \( C_2 \) be two translates of \( C \). Under what conditions can we guarantee that the sets \( C_1 - C_2 \) and \( C_2 - C_1 \) are both connected, and can you provide an example of translates where the two sets are disconnected?
automath
[ 0.011248964816331863, 0.03464113175868988, -0.04423866048455238, -0.015596163459122181, 0.040605321526527405, 0.013918683864176273, -0.014548186212778091, 0.06096963956952095, 0.03656298294663429, -0.005258147604763508, 0.027376247569918633, 0.03600179776549339, -0.03212318196892738, 0.000...
0.822615
0.798759
0.023856
Let \((E, \mathcal{B}, \mu)\) be a measure space where \(E\) is a set, \(\mathcal{B}\) is a \(\sigma\)-algebra of subsets of \(E\), and \(\mu\) is a measure. Suppose that two measurable sets \(A\) and \(B\) satisfy \(A \subset B\) and \(\mu(A) = 5\). If \(\mu(B) = 10\), what is the value of \(\mu(B \setminus A)\)?
automath
[ 0.03372272104024887, 0.01664932817220688, -0.04972933232784271, -0.02712218277156353, 0.04558509960770607, -0.015323651023209095, -0.03458160534501076, 0.06337163597345352, 0.05539865791797638, -0.007973510771989822, 0.0019661402329802513, 0.029451867565512657, -0.05893662944436073, -0.012...
0.827513
0.807662
0.019851
Let \( S \) and \( T \) be finite sets such that \( |S| = 5 \) and \( |T| = 7 \). If a relation \( \mathcal{R} \subseteq S \times T \) is right-total, which of the following statements must be true? A) Every element of \( S \) is related to exactly one element in \( T \). B) The set \( T \) has at least one pre-imag...
automath
[ 0.052241574972867966, 0.04630817100405693, -0.041838765144348145, -0.038609057664871216, 0.047392625361680984, -0.029138896614313126, -0.009266557171940804, 0.07287384569644928, 0.03493174538016319, -0.005589751526713371, 0.009720937348902225, 0.027119502425193787, -0.028735898435115814, -...
0.823187
0.80441
0.018777
Let \( A \) be a finitely generated abelian group. If \( A \) has a torsion subgroup \( A_{\text{tors}} \) of order \( p^n \) where \( p \) is a prime and \( n \) is a non-negative integer, what is the structure of \( A \) in terms of its free part and the torsion part? Specifically, express \( A \) as a direct sum of ...
automath
[ 0.04423033818602562, 0.01620599441230297, -0.027797169983386993, -0.028384175151586533, 0.01112755760550499, -0.03309404477477074, -0.006120254285633564, 0.04402133822441101, 0.027114883065223694, 0.009777861647307873, 0.00714099919423461, 0.018048102036118507, -0.048338305205106735, 0.001...
0.822909
0.804773
0.018136
In a rectangular grid corridor of dimensions \(m \times n\) with specific broken tiles, if the number of unique shortest paths from the top-left corner to the bottom-right corner is given by the formula \(k = p - s - 2r - tu - q + 3u + 3t - 2\) where \(p\), \(q\), \(r\), \(s\), \(t\), and \(u\) derive from combinations...
automath
[ 0.006772870197892189, 0.043368056416511536, -0.04050341248512268, -0.018267272040247917, 0.03059345670044422, -0.012486043386161327, -0.038061950355768204, 0.0560712069272995, 0.024971826002001762, 0.0028812922537326813, 0.018788043409585953, 0.03218070790171623, -0.020768994465470314, -0....
0.824949
0.808467
0.016482
Let \( f \) be an entire function such that \( f(\mathbb{C}) \) does not intersect the ball \( B_R(z_0) \) for some point \( z_0 \) in the complex plane and some radius \( R > 0 \). What can be concluded about the function \( f \)?
automath
[ 0.033537205308675766, 0.05295705422759056, -0.05093161389231682, -0.028489701449871063, 0.03540024533867836, -0.005527709610760212, -0.012244515120983124, 0.044915903359651566, 0.04908159375190735, -0.008776219561696053, 0.01728212833404541, 0.03270523250102997, -0.04404347389936447, -0.00...
0.820012
0.79793
0.022082
Let \( f(x) = \frac{1}{\sqrt{x}} \) for \( 0 < c < 1 \). For what values of \( \epsilon > 0 \) can you determine a corresponding \( \delta > 0 \) such that if \( |x - c| < \delta \) for \( x \in (0,1) \), then \( |f(x) - f(c)| < \epsilon \)? Additionally, find an explicit formula for \( \delta \) in terms of \( \epsilo...
automath
[ -0.003346621058881283, 0.04081403836607933, -0.037917785346508026, -0.031795937567949295, 0.02976675145328045, -0.02029428258538246, -0.029986921697854996, 0.08115486800670624, 0.038132209330797195, -0.008132977411150932, -0.0029829551931470633, 0.0169979315251112, -0.041057102382183075, -...
0.827853
0.809018
0.018835
Let \( X = y \frac{\partial}{\partial x} \) and \( Y = \frac{\partial}{\partial y} \) be vector fields in the \( xy \)-plane. Compute the Lie bracket \([X, Y]\) and explain the geometric interpretation of this result in terms of the behavior of the integral curves of \( X \) and \( Y \).
automath
[ 0.03102179616689682, 0.034998323768377304, -0.03701779618859291, -0.04354359954595566, 0.03418046981096268, -0.005240056663751602, -0.020971037447452545, 0.07017529010772705, 0.05792301893234253, -0.015603466890752316, 0.008338727056980133, 0.03721192106604576, -0.0453537181019783, -0.0161...
0.813695
0.796797
0.016898
Given the following simplex tableau for a maximization problem: \[ \begin{array}{|c|c|c|c|c|c|c|} \hline \text{Basic} & x_1 & x_2 & x_3 & s_1 & a_1 & \text{RHS} \\ \hline s_1 & 0 & 0 & 1 & 1 & 0 & 10 \\ a_1 & 1 & 0 & 0 & 0 & 1 & 15 \\ z & 0 & 0 & -5 & -M & 0 & 0 \\ \hline \end{array} \] where \( M \) is a large posit...
automath
[ 0.022536061704158783, 0.037612173706293106, -0.04070545732975006, -0.021196266636252403, 0.05067383497953415, -0.019833410158753395, -0.022406654432415962, 0.08970697224140167, 0.04538658261299133, -0.008206036873161793, 0.025800909847021103, 0.013583176769316196, -0.02284720540046692, -0....
0.824113
0.804379
0.019734
Given a set of experimental data points \((x_1, y_1), (x_2, y_2), \ldots, (x_n, y_n)\), how can you determine the locations of two knots \(kn1\) and \(kn2\) such that the piecewise linear approximation of the data using three segments minimizes the total error in the least squares sense, while ensuring that \(kn1\) and...
automath
[ -0.006207694299519062, 0.019838383421301842, -0.05263042077422142, -0.058091145008802414, 0.020013263449072838, -0.02187817357480526, -0.0241972915828228, 0.05534699186682701, 0.030144957825541496, -0.005261299666017294, 0.008752210065722466, 0.027887236326932907, -0.02147199772298336, -0....
0.826601
0.809419
0.017181
Let \( f(z) \) be a meromorphic function analytic on a compact set \( E \) with exactly \( \mu \) poles (counting multiplicity) in its interior. If \( \nu \) is the degree of the denominators of rational approximants \( r_{n,\nu}(z) \), under what conditions on \( \nu \) and \( \mu \) does the sequence \( \{ r_{n,\nu}(...
automath
[ 0.021818125620484352, 0.05040932819247246, -0.03772876039147377, -0.020438585430383682, 0.022041169926524162, 0.00413908576592803, -0.022111495956778526, 0.03363919258117676, 0.03152626007795334, -0.0030309325084090233, 0.014795077033340931, 0.014685832895338535, -0.026918765157461166, -0....
0.818589
0.793737
0.024852
Given a graph with \( n \) vertices and \( e \) edges, what is the minimum size of a maximum independent set according to Turán's theorem? Also, can you provide an example of a graph that demonstrates this theorem, specifically one that has a linear number of edges but still guarantees a large independent set?
automath
[ 0.023323124274611473, 0.028386550024151802, -0.04168367385864258, -0.031692855060100555, 0.02588966302573681, -0.01845509558916092, -0.020027119666337967, 0.037867095321416855, 0.007441625464707613, -0.021377891302108765, 0.029332945123314857, 0.015158827416598797, -0.0419137105345726, -0....
0.824599
0.807371
0.017228
Consider a sequence of measurable functions \( \{f_n\} \) defined on a set \( E \) of finite measure. If for every \( \epsilon > 0 \), the measure \( \mu\left(\left\{x \in E \mid |f_n(x) - f(x)| \geq \epsilon \right\}\right) \) approaches 0 as \( n \to \infty \), can we conclude that \( \{f_n\} \) converges to \( f \) ...
automath
[ 0.02054695226252079, 0.04007938876748085, -0.030183495953679085, -0.02619924768805504, 0.02834126725792885, -0.005996337626129389, -0.04117152839899063, 0.04880877584218979, 0.023261040449142456, 0.005630952306091785, -0.004610822070389986, 0.014684316702187061, -0.03021775186061859, 0.000...
0.811461
0.779931
0.03153
Consider a complex-valued function \( f : \mathbb{C} \to \mathbb{C} \) that is continuous on a closed contour \( \gamma \) and differentiable in the interior of \( \gamma \). If \( f(z) \) is integrated along \( \gamma \) using the path integral, and the area integral of \( f \) over the region enclosed by \( \gamma \)...
automath
[ 0.019972890615463257, 0.045823875814676285, -0.04241622984409332, -0.03806581348180771, 0.03597181290388107, -0.0045381588861346245, -0.00661443592980504, 0.06698085367679596, 0.04381612688302994, 0.011751674115657806, 0.01881171017885208, 0.014058160595595837, -0.04302949830889702, -0.005...
0.807716
0.787703
0.020013
Given a circular arc defined by two endpoints \( A \) and \( B \) on a unit circle centered at the origin, with a direction vector \( d = (d_x, d_y) \) that is normalized, determine the parameter value \( s \) that maximizes the dot product \( P(s) = \left[p(s) - 0\right] \cdot d \), where \( p(s) \) represents the par...
automath
[ 0.020151816308498383, 0.032911986112594604, -0.05001002550125122, -0.017341837286949158, 0.034370116889476776, -0.023794781416654587, -0.03631310537457466, 0.05490265414118767, 0.027494708076119423, 0.01771467737853527, 0.014942620880901814, 0.032578516751527786, -0.021302014589309692, -0....
0.824458
0.800315
0.024142
Let \( S_1 = \{1, 2\} \), \( S_2 = \{2, 3\} \), \( T_1 = \{a, b\} \), and \( T_2 = \{b, c\} \). Determine the sizes of the sets \( \paren{S_1 \cap S_2} \times \paren{T_1 \cap T_2} \) and \( \paren{S_1 \times T_1} \cap \paren{S_2 \times T_2} \) and verify if they are equal. What is the size of each set?
automath
[ 0.0374329574406147, 0.04003280773758888, -0.056140292435884476, -0.036396678537130356, 0.037569548934698105, -0.0015837179962545633, -0.015363327227532864, 0.06185874715447426, 0.03513908386230469, -0.018543044105172157, 0.009239600040018559, 0.020034879446029663, -0.03389018401503563, -0....
0.832352
0.806354
0.025998
Given a continuous function \( f: \mathbb{R} \to \mathbb{R} \) that satisfies the following conditions: 1. \( f \) is quasiconvex. 2. \( f \) is unbounded above. 3. If \( f \) is not monotone, then \( \lim_{x \to \pm \infty} f(x) = +\infty \). 4. \( f \) is either strictly monotone or attains its minimum on some clos...
automath
[ 0.009400932118296623, 0.04802289232611656, -0.046879447996616364, -0.023952798917889595, 0.03235982730984688, -0.0112899886444211, -0.027770064771175385, 0.07120198756456375, 0.014085331931710243, 0.0013097983319312334, 0.013768144883215427, 0.024189848452806473, -0.017501823604106903, -0....
0.818439
0.800622
0.017818
Let \( X = \sum_{k=1}^\infty 2^{-k} u_k \), where \( u_k \) are independent and identically distributed uniform random variables on the interval \([0, 1]\). Given that \( f_X(x) = \frac{1}{\pi} \int_0^\infty \left( \prod_{k=1}^\infty \operatorname{sinc}\left( \frac{t}{2^{k+1}} \right) \right) \cos \left( t \left( x - \...
automath
[ -0.005698246881365776, 0.044331539422273636, -0.038966432213783264, -0.015442156232893467, 0.031580690294504166, 0.015444730408489704, -0.025916606187820435, 0.06883300095796585, 0.02189038135111332, 0.00942579098045826, 0.009464338421821594, 0.02990127168595791, 0.005316382274031639, -0.0...
0.830463
0.805781
0.024682
Let \( F \) be a presheaf of abelian groups on a topological space \( X \) and let \( p \in X \) be a point. If \( F_{p} \) is the stalk of \( F \) at the point \( p \), describe the conditions under which the morphism \( \phi: F \longrightarrow G \) of presheaves induces an isomorphism on stalks \( \phi_{p}: F_{p} \lo...
automath
[ 0.027780773118138313, 0.010828150436282158, -0.027415405958890915, -0.04064539819955826, 0.03717467933893204, -0.024961017072200775, -0.008039962500333786, 0.0780644491314888, 0.0302593894302845, 0.006711275782436132, 0.015444546937942505, 0.02593824826180935, -0.042350124567747116, -0.006...
0.811095
0.789859
0.021236
Consider a triangulation of triangle \( ABC \) where each vertex is colored according to the mapping \( f \) that follows Sperner's conditions. Given a specific configuration where there are \( M \) simplexes colored red-green-blue and \( N \) simplexes colored blue-green-red, with \( M \) being defined as the number o...
automath
[ 0.019322702661156654, 0.008450530469417572, -0.0468863919377327, -0.035234447568655014, 0.008308482356369495, 0.0014187728520482779, -0.027492405846714973, 0.05979078635573387, 0.03901513293385506, 0.004867826122790575, 0.010601554997265339, 0.028163902461528778, -0.0007549037109129131, -0...
0.826685
0.808328
0.018357
Let \( X_1, X_2, \ldots \) be a sequence of independent random variables with common distribution characterized by a characteristic function \( \varphi(t) \). Define the normalized partial sums \( S_n = \frac{1}{\sqrt{n}} \sum_{i=1}^n (X_i - \mathbb{E}[X_i]) \). If it is given that \( \varphi(t) \) converges to some ...
automath
[ -0.012280692346394062, 0.03962103649973869, -0.030288295820355415, -0.029499070718884468, 0.023266449570655823, 0.0031497825402766466, -0.02417394332587719, 0.048701852560043335, 0.036693599075078964, -0.0063169593922793865, 0.005640365183353424, 0.021522989496588707, -0.03026263229548931, ...
0.819739
0.793245
0.026494