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
If \( N^{n+1} \) is a simply connected smooth manifold, is every smoothly embedded closed hypersurface \( M^n \) of \( N \) always orientable?
automath
[ 0.0206124410033226, 0.021769117563962936, -0.02193398028612137, -0.04293149337172508, 0.028147978708148003, -0.016067128628492355, -0.02319907210767269, 0.047007761895656586, 0.03755701705813408, -0.005543713457882404, 0.008848464116454124, 0.02345351129770279, -0.02998672053217888, -0.021...
0.811147
0.792274
0.018873
Given a polynomial function class defined as $$\F^n = \left\{ f\in\Y^\X \ :\ f(x) = w_0 + w_1 x + \dots + w_n x^n,\ (w_0,\dots,w_n)\in\R^{n+1} \right\},$$ if we select different values for the hyperparameter $n$, how many distinct polynomial functions can be formed from this class for a given input space $\X$? Addition...
automath
[ 0.013091331347823143, 0.01600043848156929, -0.038950249552726746, -0.023938028141856194, 0.025981470942497253, -0.03637039661407471, -0.03249296173453331, 0.05866088718175888, 0.04129861667752266, -0.008569919504225254, 0.003027263330295682, 0.038311753422021866, -0.035167064517736435, -0....
0.83546
0.819087
0.016373
What is the condition required for the coefficients \( a_n \) in the formal series \( \sum_{n=-\infty}^{\infty} a_n t^n \) such that the product series \( \left(\sum_{n=-\infty}^{\infty} a_n t^n\right)\left(\sum_{n=-\infty}^{\infty} a_n t^{-n}\right) \) converges absolutely? How does this relate to the structure of the...
automath
[ 0.008405933156609535, 0.03821879252791405, -0.045389652252197266, -0.026702752336859703, 0.03680349513888359, -0.004459150601178408, -0.037408534437417984, 0.05936869978904724, 0.026509078219532967, -0.00602513225749135, -0.005353361368179321, 0.016097769141197205, -0.0269368477165699, -0....
0.820012
0.801931
0.01808
Let \( n \) be a positive integer. Consider the number \( A_n \), which represents the number of ways to select a non-empty subset from the set \( S = \{1, 2, \ldots, n\} \) such that no two elements in the subset differ by 1. Define \( F_k \) as the \( k \)-th Fibonacci number. 1. Express \( A_n \) in terms of Fibon...
automath
[ 0.04814421385526657, 0.01551417913287878, -0.046308256685733795, -0.014036574400961399, 0.03386455029249191, -0.028339995071291924, -0.029854118824005127, 0.05209796130657196, 0.02156495489180088, 0.005151753313839436, 0.02678988315165043, 0.04154891148209572, -0.04872165620326996, -0.0014...
0.8411
0.814804
0.026296
Consider a field \( F \) with two binary operations (addition and multiplication), one unary operation (taking the additive inverse), and two constant elements (0 and 1). 1. If \( F \) is finite and consists of \( p^n \) elements for a prime \( p \) and integer \( n \geq 1 \), what is the maximum number of distinct g...
automath
[ 0.03241601213812828, 0.037505630403757095, -0.03596155717968941, -0.02070881798863411, 0.03368830308318138, -0.028099745512008667, -0.0192695502191782, 0.05788693577051163, 0.034992314875125885, 0.0002688830136321485, 0.003134125843644142, 0.018728885799646378, -0.022861026227474213, -0.02...
0.832279
0.813195
0.019085
Given two sets \( A \) and \( B \) such that there are injective functions \( f: A \to B \) and \( g: B \to A \), what are the different types of chains that can be formed by these injective functions, and how do these chains contribute to proving the existence of a bijection between \( A \) and \( B \)? Specifically, ...
automath
[ 0.04323197901248932, 0.019283857196569443, -0.013333769515156746, -0.027026375755667686, 0.02525320276618004, -0.042722538113594055, -0.021890517324209213, 0.058011919260025024, 0.02520686760544777, -0.011623485945165157, 0.025577355176210403, 0.022436074912548065, -0.013309885747730732, -...
0.799456
0.782708
0.016749
Given a $C^\infty$ function \( f: \mathbb{R} \to \mathbb{R}^n \) such that \( \lim_{t \to \pm \infty} f^{(k)}(t) \) exists for all derivatives \( k \geq 0 \), and knowing that \( \lim_{t \to \pm \infty} f^{(k)}(t) = 0 \) for \( k \geq 1 \), determine whether there exists a constant \( \delta > 0 \) such that \[ \lim_...
automath
[ 0.005576883442699909, 0.039647191762924194, -0.03277810290455818, -0.019563689827919006, 0.03576768562197685, -0.008472750894725323, -0.025397466495633125, 0.0937618613243103, 0.026576999574899673, -0.008515443652868271, 0.0032697769347578287, 0.009680242277681828, -0.023557225242257118, 0...
0.815284
0.792889
0.022395
Let \( n \geq 1 \) be a positive integer, and consider a continuous function \( f: S^n \to Y \) that is nullhomotopic. If we denote the property of \( f \) being nullhomotopic by stating that it can be continuously extended to a function \( g: D^{n+1} \to Y \), what is the dimension of the space \( X \) formed by the q...
automath
[ 0.026512810960412025, 0.013396868482232094, -0.044156040996313095, -0.05275260657072067, 0.03037365712225437, -0.01687275618314743, -0.01297378446906805, 0.05833623185753822, 0.04976002126932144, -0.015486067160964012, 0.011077863164246082, 0.035920578986406326, -0.03141665831208229, -0.01...
0.833084
0.812796
0.020288
In the context of relative cohomology, let \( X \) be a topological space and \( A \) and \( B \) be subsets of \( X \). Provide an example where \( A \) and \( B \) are not open in \( X \) and demonstrate why the inclusion map \( i_*: C^*(X, A \cup B; R) \hookrightarrow C^*(X, A + B; R) \) fails to be a cochain homoto...
automath
[ 0.023423314094543457, 0.03618726506829262, -0.012133819982409477, -0.02438058890402317, 0.007297917269170284, 0.025435160845518112, -0.00862287636846304, 0.09630817174911499, 0.03165143355727196, -0.004751263651996851, 0.002431016881018877, 0.016996176913380623, -0.026697995141148567, -0.0...
0.799559
0.776578
0.022981
Let \( X_1 \) and \( X_2 \) be two random variables with a variance-covariance matrix given by \[ \Sigma = \begin{bmatrix} \sigma_1^2 & \sigma_{12} \\ \sigma_{21} & \sigma_2^2 \end{bmatrix}. \] If it is known that \( \det(\Sigma) = 0 \), what is the necessary condition involving constants \( c_1 \) and \( c_2 \) suc...
automath
[ -0.013441473245620728, 0.0181078240275383, -0.05605829507112503, -0.02663317695260048, 0.05230729281902313, 0.001353248953819275, -0.014465834945440292, 0.08481349050998688, 0.0273361187428236, -0.0017092006746679544, -0.0009648379636928439, 0.014180938713252544, -0.02165907993912697, -0.0...
0.814693
0.796288
0.018404
Under what conditions can we ensure that uniform convergence of a sequence of functions \( x_m \to x \) implies convergence in quadratic variation \( [x_m - x] \to 0 \), and conversely, what additional requirements are needed to guarantee that convergence in quadratic variation \( [x_m - x] \to 0 \) leads to pointwise ...
automath
[ -0.012036087922751904, 0.0363771878182888, -0.04025275632739067, -0.03862105682492256, 0.02889394573867321, -0.010683395899832249, -0.02881302870810032, 0.07285551726818085, 0.011515110731124878, -0.007171700242906809, -0.009722497314214706, 0.00611869478598237, -0.020139778032898903, -0.0...
0.820682
0.804296
0.016386
Consider a preordered set \( \mathbf{P} = \langle P, \preceq \rangle \) where \( P = \{1, 2, 3, 4, 5, 6, 7\} \). Suppose the relation \( \preceq \) is defined by the following pairs: \( 1 \preceq 2 \), \( 2 \preceq 3 \), \( 1 \preceq 3 \), and \( 4 \preceq 5 \). What is the largest number of elements in \( P \) that ...
automath
[ 0.05951952934265137, 0.03368218615651131, -0.038570016622543335, -0.039054907858371735, 0.03396940976381302, -0.006992572918534279, -0.011880926787853241, 0.050232160836458206, 0.024908561259508133, -0.009071851149201393, 0.002852765377610922, 0.02627270296216011, -0.033423181623220444, -0...
0.828435
0.808855
0.01958
Let a chain with uniform mass per unit length be placed inside a frictionless tube shaped like a smooth curve \( f(x) \), with endpoints at the same height. Given that the chain does not move, find the relationship that must hold for the derivative \( f'(x) \) at every point along the curve. Specifically, determine if ...
automath
[ 0.03586914390325546, 0.03459423780441284, -0.03725551441311836, -0.04653109610080719, 0.04659736901521683, -0.016224607825279236, -0.0245831198990345, 0.0642668753862381, 0.00923852063715458, -0.01316946092993021, -0.00411536730825901, 0.02319273352622986, -0.016583500429987907, -0.0221117...
0.817517
0.795893
0.021625
Suppose you have a one-dimensional dataset where $X$ is uniformly distributed on [0, 1]. If you use a neighborhood of size $0.1$ around a point $x$ (i.e., the interval $[x-0.05, x+0.05]$), calculate the proportion of observations from this dataset that fall within this neighborhood when $p = 1$. Now consider the case w...
automath
[ -0.019456500187516212, 0.028655584901571274, -0.03648084029555321, -0.0513298474252224, 0.033497896045446396, -0.0009666481637395918, -0.02232803776860237, 0.05630095303058624, 0.03097544051706791, 0.0005184068577364087, 0.011088135652244091, 0.03544364869594574, -0.0273313969373703, 0.005...
0.834244
0.812761
0.021483
Given integers \( q \ge 1 \) and \( 1 \le z_1, z_2 \le q \), what is the probability that two randomly chosen positive integers \( x_1 \) and \( x_2 \) satisfying \( x_1 \equiv z_1 \pmod{q} \) and \( x_2 \equiv z_2 \pmod{q} \) are coprime? Provide your answer as a function of \( q \), \( z_1 \), and \( z_2 \).
automath
[ 0.01769121177494526, 0.020162608474493027, -0.04613597318530083, -0.030771534889936447, 0.019343962892889977, -0.0021273414604365826, -0.0022790441289544106, 0.05181712284684181, 0.019073214381933212, -0.01501566730439663, 0.007569842506200075, -0.00507955951616168, -0.03227855637669563, -...
0.835783
0.818954
0.016828
Let \( f \) be a non-negative integrable function on \( \mathbb{R} \). Define \( g(t) = \int_{\mathbb{R}} \cos(tx) f(x) \, dx \) for \( t \geq 0 \). What condition must be satisfied for \( g(t) \) to be twice differentiable at \( t = 0 \)? Specifically, express this condition in terms of the integral \( \int_{\mathbb{R...
automath
[ 0.02573675476014614, 0.02389858476817608, -0.037308286875486374, -0.03350990638136864, 0.02931823767721653, 0.00471577700227499, -0.0404452420771122, 0.06730937212705612, 0.02479105070233345, 0.017082860693335533, 0.006255559157580137, -0.00023730336397420615, -0.027606600895524025, -0.009...
0.813643
0.792888
0.020755
For a regular \( N \)-gon with a given perimeter \( P \) and circles of radius \( R \), determine the maximum number of non-overlapping circles that can fit along the perimeter of the \( N \)-gon. Provide your answer in terms of \( N \), \( P \), and \( R \). If necessary, state any assumptions or conditions that affec...
automath
[ 0.022018996998667717, 0.02676382102072239, -0.03292633593082428, -0.017930442467331886, 0.030981440097093582, -0.006129262503236532, -0.03236857056617737, 0.029780877754092216, 0.005993062164634466, -0.0032103448174893856, 0.008621866814792156, 0.0444001629948616, -0.0382772795855999, -0.0...
0.82411
0.80423
0.01988
For positive integers \( n \geq 2 \), let \( \operatorname{rad}(n) \) denote the radical of \( n \). Define the integral \[ I(\alpha) = \int_2^\infty \frac{dx}{(\operatorname{rad}(\lfloor x \rfloor))^{\alpha} \log^2 x} \] for a fixed real number \( \alpha \geq 1 \). Is the integral \( I(\alpha) \) convergent or di...
automath
[ 0.036608241498470306, 0.04486565664410591, -0.03137945756316185, 0.001718033803626895, 0.017255263403058052, -0.01296234130859375, -0.010744072496891022, 0.03453725948929787, 0.04245401918888092, 0.0046698651276528835, 0.008101616986095905, 0.00754294078797102, -0.04011111706495285, -0.024...
0.834229
0.81162
0.02261
Given the process of updating the positions of \( n \) points uniformly at random on the interval \([0, 1]\), where at each step one point's position is replaced by a random point chosen uniformly between its position and the position of another randomly selected point, what is the expected time until all \( n \) point...
automath
[ 0.01673426479101181, 0.016440799459815025, -0.0400259755551815, -0.021923217922449112, 0.015985853970050812, -0.020780736580491066, -0.05010978505015373, 0.0488986112177372, 0.02769046649336815, -0.009119543246924877, 0.02498810365796089, 0.024848539382219315, -0.021383266896009445, -0.004...
0.81925
0.802577
0.016673
Given the inequality $$n \ge C \log^k n \times (A \log(n^r \log^l n) + B),$$ determine a constant \( F(A,B,C,k,l,r) \) such that the inequality $$ n > F(A,B,C,k,l,r) $$ holds true for sufficiently large \( n \). What is the tightest possible form for \( F \) in terms of the constants \( A, B, C, k, l, \) and \(...
automath
[ 0.030131706967949867, 0.0429941862821579, -0.03853309899568558, -0.02383412793278694, 0.0369352325797081, -0.006693309638649225, -0.0137693015858531, 0.07333983480930328, 0.03842100873589516, -0.028810156509280205, -0.001965535804629326, 0.039827145636081696, -0.03389418125152588, -0.00590...
0.84035
0.817612
0.022738
Consider the solution \( u(x,y) \) of the Laplace equation \( u_{xx} + u_{yy} = 0 \) in the half-strip defined by \( x > 0 \) and \( 0 < y < \pi \), with boundary conditions given as \( u_x(0,y) = 1 \) and the requirement that \( \max |u| < \infty \). If the full solution can be expressed as a series of the form: \...
automath
[ -0.02865465357899666, 0.04122133553028107, -0.0475643053650856, -0.0410570353269577, 0.03707091510295868, 0.003894832683727145, -0.037190910428762436, 0.07801514118909836, 0.04093953222036362, 0.006310779135674238, 0.02312270924448967, 0.03927449882030487, -0.04115080088376999, -0.01036811...
0.823297
0.806126
0.017171
Let \( f: \mathbb{R}^2 \to \mathbb{R}^2 \) be a continuous function whose Jacobian determinant \( J_f \) is given by \[ J_f(x, y) = 2x + 3y - 5. \] If \( f(x, y) = (g(x, y), h(x, y)) \), where \( g \) and \( h \) are continuous functions, under what conditions on \( g \) and \( h \) can we guarantee that there exists...
automath
[ 0.003274190705269575, 0.021716851741075516, -0.057598549872636795, -0.033552415668964386, 0.0255049467086792, -0.005985453259199858, -0.015879079699516296, 0.07669945806264877, 0.01869819313287735, -0.009293043054640293, 0.004647090565413237, 0.023031756281852722, -0.019461654126644135, -0...
0.828708
0.802598
0.02611
Consider two random vectors \( X, Y \in \mathbb{R}^2 \) with the variance matrices given by \( \mathrm{Var}(X) = \begin{pmatrix} 250 & 150 \\ 150 & 100 \end{pmatrix} \) and \( \mathrm{Var}(Y) = \begin{pmatrix} 133 & 87 \\ 150 & 100 \end{pmatrix} \). If the variance matrices for \( X \) and \( Y \) are diagonal and the ...
automath
[ -0.006714347749948502, 0.0331403985619545, -0.04098298028111458, -0.023366250097751617, 0.035624995827674866, 0.02466951310634613, -0.03307952359318733, 0.09200578927993774, 0.037064507603645325, -0.012238109484314919, -0.009231597185134888, 0.037363287061452866, -0.03994905948638916, -0.0...
0.819465
0.797026
0.022439
Determine the largest power of the polynomial \( a^2 - ab + b^2 \) that divides the expression \( a^{6k + 1} - b^{6k + 1} - (a - b)^{6k + 1} \) for any \( k \in \mathbb{N} \). Additionally, find the largest power of \( a^2 - ab + b^2 \) that divides \( a^{6k + 5} - b^{6k + 5} - (a - b)^{6k + 5} \) and \( a^{6k + 3} - b...
automath
[ 0.060218241065740585, 0.05326250195503235, -0.0217348150908947, -0.05315772071480751, 0.02994868904352188, -0.03581902012228966, -0.02070300467312336, 0.05903542786836624, 0.0332268625497818, -0.019404226914048195, 0.019016874954104424, 0.032341815531253815, -0.02691088430583477, -0.023627...
0.822511
0.80582
0.016691
Given two line segments in a 2D plane, where one segment is known to be parallel to either the x-axis or the y-axis, and the other segment may or may not be parallel to either axis, how can you determine if these two segments intersect? If they do intersect, how can you calculate the coordinates of the intersection poi...
automath
[ 0.007997257634997368, 0.01824755035340786, -0.02564029023051262, -0.035122066736221313, 0.018621258437633514, 0.012175913900136948, -0.011198228225111961, 0.06687621772289276, 0.05419352650642395, 0.00282516167499125, 0.025909001007676125, 0.024019673466682434, -0.0054440912790596485, 0.00...
0.803215
0.784208
0.019007
Let \( A \) be an \( m \times m \) matrix where each entry satisfies \( 0 < A_{i,j} < 1 \). Suppose \( X \) is an unknown diagonal matrix of the same dimensions. Is it possible to find algorithms that can determine the entries of matrix \( X \) given the constraint \( 0 < c < 1 \)? If such algorithms exist, describe on...
automath
[ 0.013804447837173939, 0.026470473036170006, -0.03827716037631035, -0.009339418262243271, 0.03623788803815842, -0.013238114304840565, -0.006898281164467335, 0.07125350832939148, 0.02209140732884407, -0.014722068794071674, -0.0013466828968375921, 0.016906362026929855, -0.03206712752580643, -...
0.812541
0.79161
0.02093
Consider the series defined by \[ S = \sum_{n=1}^\infty a_n \] where \[ a_n = \begin{cases} 1 & \text{if } 2^n - 1 \text{ is prime} \\ 0 & \text{otherwise.} \end{cases} \] Is the series \(S\) convergent or divergent, and if its convergence is not known, what implications does this have in the context of prime ...
automath
[ 0.01622798666357994, 0.03377079963684082, -0.052658919245004654, -0.017148856073617935, 0.023074116557836533, -0.013530596159398556, -0.0035497352946549654, 0.08113104850053787, 0.026749756187200546, 0.004922956693917513, 0.00708490377292037, -0.005244043190032244, -0.04156449809670448, -0...
0.820913
0.803972
0.016941
Let \( k \) be a field and consider the polynomial map \( f : \mathbb{A}^n_k \to \mathbb{A}^r_k \) given by polynomials \( f_1, \ldots, f_r \in k[T_1, \ldots, T_n] \). If \( x \in \mathbb{A}^n_k(k) \) is a rational point, under what conditions can we ensure that the differential \( df_x \) is represented by the Jacobia...
automath
[ 0.022841600701212883, 0.028457650914788246, -0.035382501780986786, -0.04798052832484245, 0.034122902899980545, -0.0422360897064209, 0.006065442226827145, 0.04114135354757309, 0.042741090059280396, -0.0038366501685231924, -0.006997418124228716, 0.03417941927909851, -0.021739305928349495, -0...
0.816353
0.795098
0.021255
Let \( A \) be a positive semi-definite matrix of dimension \( n \), and let \( B \) be a positive definite diagonal matrix of the same dimension. What can we conclude about the eigenvalues of the product \( AB \)? Specifically, do all the eigenvalues of \( AB \) have non-negative real parts? If so, provide a justifica...
automath
[ 0.019866088405251503, 0.014879295602440834, -0.04051309823989868, -0.03314099833369255, 0.03899574279785156, -0.013822167180478573, 0.004414331633597612, 0.054033637046813965, 0.049262143671512604, -0.0065944017842411995, -0.0065904660150408745, 0.03883736580610275, -0.046202316880226135, ...
0.818393
0.801152
0.017241
Consider a complete ordered field \( F \). Let \( b \) be an upper bound for the natural numbers \( \mathbb{N} \) in \( F \). By the theorem mentioned in the text, \( F \) should be archimedean. Calculate the minimum value of \( b \) given that for every \( x \in F \), there exists an \( n \in \mathbb{N} \) such that \...
automath
[ 0.03276298567652702, 0.021182049065828323, -0.03702893480658531, -0.028520431369543076, 0.037227705121040344, -0.03285637125372887, -0.012035143561661243, 0.04498911276459694, 0.022324616089463234, 0.0006429771310649812, 0.0050447918474674225, 0.02745201624929905, -0.0454862043261528, -0.0...
0.835316
0.817833
0.017482
For a given matrix \( m \) of size \( n \times n \) containing complex entries, consider the eigenvalues \( \{\lambda_1, \lambda_2, \ldots, \lambda_n\} \). Define a function that draws a disk for each eigenvalue on a coordinate plane. The disks should be centered on the x-axis at positions that correspond to the absolu...
automath
[ 0.010728813707828522, 0.036266740411520004, -0.042576052248477936, -0.03934213146567345, 0.02106175199151039, -0.002416835632175207, -0.033762428909540176, 0.05434401333332062, 0.042692121118307114, -0.0006508847582153976, -0.0009273351752199233, 0.04482201114296913, -0.02905203402042389, ...
0.828355
0.807866
0.020489
Let \( I_1, I_2, \ldots, I_n \) be pairwise coprime ideals in the ring of integers of a number field. If the product \( I_1 I_2 \cdots I_n \) is equal to \( (p_1^{e_1})(p_2^{e_2}) \cdots (p_k^{e_k}) \) for distinct prime ideals \( p_1, p_2, \ldots, p_k \), what is the maximum number of distinct prime ideals \( p_i \) t...
automath
[ 0.043180711567401886, 0.029932526871562004, -0.02957003563642502, -0.01744566299021244, 0.02970294840633869, -0.019545644521713257, -0.021507196128368378, 0.06411439925432205, 0.025689100846648216, -0.01754726469516754, -0.00006690106238238513, 0.005383392330259085, -0.023266281932592392, ...
0.826217
0.806407
0.01981
Let \( f : \mathbb{R} \to \mathbb{R} \) be defined as follows: \[ f(x) = \begin{cases} 0 & \text{if } x < 0 \\ x^3 & \text{if } x \geq 0 \end{cases} \] Determine the highest differentiability class \( C^n \) for which \( f \) lies in \( C^n \) but not in \( C^{n+1} \). What is the value of \( n \)?
automath
[ 0.021388495340943336, 0.043056171387434006, -0.04492321237921715, -0.026734936982393265, 0.036448922008275986, -0.0038808900862932205, -0.028474191203713417, 0.07992279529571533, 0.03263320401310921, 0.003527787746861577, 0.006931181997060776, 0.024676091969013214, -0.04445783793926239, -0...
0.825928
0.806361
0.019567
Is the product space \( E^n \) compact when \( E \) is a finite set and the metric on \( E^n \) is given by \[ d(\omega, \omega') = \begin{cases} 2^{-\inf \{ n \in \mathbf{N} : \omega_n \neq \omega'_n \}} & \text{if } \omega \neq \omega' \\ 0 & \text{if } \omega = \omega' \end{cases} \] for \( n \in \mathbb{N} \)?
automath
[ 0.031026745215058327, 0.023615553975105286, -0.037088725715875626, -0.028436163440346718, 0.029169367626309395, -0.024970080703496933, -0.03749088570475578, 0.07157134264707565, 0.02978811226785183, 0.0025567999109625816, 0.007315488066524267, 0.026824526488780975, -0.035241395235061646, -...
0.810291
0.792233
0.018058
Let \( f: X \to Y \) be a one-to-one continuous function, and let \( S \subset X \). Is it true that \( f(S') \subset f(S)' \) for any subset \( S \), where \( S' \) denotes the derived set of \( S \) (the set of limit points of \( S \))? If this statement is false, provide a counterexample.
automath
[ 0.02307792939245701, 0.04129573330283165, -0.03746899962425232, -0.030574293807148933, 0.027481963858008385, -0.031074047088623047, -0.021343447268009186, 0.06601239740848541, 0.035314880311489105, -0.006971960887312889, 0.01291227899491787, 0.03749453276395798, -0.03560599312186241, 0.002...
0.813388
0.795065
0.018323
Let \( v_i : \mathbb{R}^n \rightarrow \mathbb{R} \) be convex functions for \( i = 1, \ldots, s \) and \( p_i \) be probabilities such that \( \sum_{i=1}^{s} p_i = 1 \). Define the expectation and variance functions as: \[ E[v(x)] = \sum_{i=1}^{s} p_i v_i(x) \] \[ Var[v(x)] = \sum_{i=1}^{s} p_i (v_i(x) - E[v(x)])^2 \...
automath
[ -0.012519348412752151, 0.04621267691254616, -0.03993383049964905, -0.02655697986483574, 0.04505306854844093, 0.0055692316964268684, -0.013722245581448078, 0.0555444099009037, 0.03258145600557327, 0.0016201128019019961, 0.005642763338983059, 0.027777109295129776, -0.03105677105486393, -0.02...
0.811721
0.790348
0.021373
Let \( S \) be a graded ring, and \( M \) be a graded \( S \)-module. If \( f \) is any homogeneous element of \( S \) of positive degree, define the structures \( \Gamma(D_+(f), \mathcal{O}_{\text{Proj}(S)}) \) and \( \Gamma(D_+(f), \widetilde M) \). Can you compute the dimensions of the vector spaces \( \Gamma(D_+(f)...
automath
[ 0.014745312742888927, 0.02365928143262863, -0.02886040322482586, -0.04661787301301956, 0.028413861989974976, -0.04931006208062172, -0.018883025273680687, 0.06051544472575188, 0.03251763433218002, 0.00988476350903511, 0.010627655312418938, 0.03778580576181412, -0.04697300121188164, -0.02425...
0.824486
0.808201
0.016285
Let \( \Sigma \) be a consistent set of well-formed formulas (wffs) from propositional logic, and consider a deduction \( <\alpha_{0}, \ldots, \alpha_{n}> \) derived from \( \Sigma \). If \( n = 5 \) and \( \Sigma \) contains exactly 10 wffs, what is the minimum number of premises required in \( \Sigma \) such that \( ...
automath
[ 0.01797877624630928, 0.014170118607580662, -0.036561064422130585, -0.031264420598745346, 0.03955153003334999, -0.03517913073301315, -0.024006832391023636, 0.07269798219203949, 0.02348579280078411, -0.027182718738913536, -0.007693246938288212, 0.028620420023798943, -0.018946612253785133, -0...
0.822743
0.805686
0.017058
Let \( a_{p,\beta}(t,x) \) be a function defined on a neighborhood of the origin in \( \mathbb{R} \times \mathbb{R}^n \), which is of class \( C^m \) in \( t \) and is valued in the space of analytic functions in \( x \). If we fix a real number \( t_0 \) near the origin, does the function \( F(x) = a_{p,\beta}(t_0, x)...
automath
[ 0.02447829768061638, 0.03649093955755234, -0.044668395072221756, -0.018919948488473892, 0.03226134553551674, -0.009188340976834297, -0.01741526648402214, 0.06491164118051529, 0.05001246556639671, -0.0002770650899037719, 0.008447840809822083, 0.021804802119731903, -0.053108274936676025, -0....
0.82058
0.798473
0.022107
Let \( f \), \( g \), and \( h \) be three invertible functions such that the composition \( h \circ (g \circ f) \) is well defined. If the inverses of these functions are known to satisfy \( f^{-1}(x) = 2x \), \( g^{-1}(x) = x + 3 \), and \( h^{-1}(x) = x - 1 \), find the expression for \( (h \circ (g \circ f))^{-1}(x...
automath
[ 0.03240690007805824, 0.03957042098045349, -0.047392360866069794, -0.02440938912332058, 0.058890100568532944, -0.035728007555007935, -0.018600627779960632, 0.0697207972407341, 0.03920520097017288, 0.01277288980782032, 0.019230887293815613, 0.02676239423453808, -0.035444069653749466, -0.0397...
0.828406
0.8084
0.020006
Given three circles in a plane with radii \( r_1, r_2, r_3 \) (where \( r_1 < r_2 < r_3 \)) and centers \( A, B, C \) such that no circle is inside another, determine the necessary condition for the intersection points of the common external tangents of each pair of circles to be collinear. Specifically, express the co...
automath
[ 0.009625253267586231, 0.046938296407461166, -0.04389255493879318, -0.033120352774858475, 0.034912243485450745, 0.015735788270831108, -0.015179821290075779, 0.04155096411705017, 0.0278975497931242, -0.008916670456528664, 0.003001881530508399, 0.015184725634753704, -0.033430323004722595, -0....
0.821919
0.787677
0.034242
Given two positive semi-definite matrices \( Q_1 \) of size \( n \times n \) and \( Q_2 \) of size \( m \times m \), describe a method to sample directly from a matrix-normal distribution \( X \sim \mathcal{N}(0, Q_1 \otimes Q_2) \) without explicitly calculating the Kronecker product \( Q_1 \otimes Q_2 \). What are th...
automath
[ 0.0006682398379780352, 0.01499105989933014, -0.052525606006383896, -0.030105315148830414, 0.04574501886963844, -0.0011427081190049648, -0.007473445031791925, 0.05928751826286316, 0.034470800310373306, -0.010484172962605953, 0.005074113607406616, 0.03217674791812897, -0.023301297798752785, ...
0.803357
0.785472
0.017884
Given a tennis racquet modeled as a perfect ring with an outer radius \( R \) and thickness \( t \), and covered with vertical and horizontal strings each of radius \( r \) separated by gaps of length \( g \), if a fly of radius \( f \) is located anywhere uniformly within the outer radius of the ring, what is the prob...
automath
[ -0.006714829709380865, 0.02734784036874771, -0.04487214237451553, -0.027843724936246872, 0.05494953691959381, -0.016123628243803978, -0.026948368176817894, 0.045463114976882935, 0.02292129583656788, -0.0028856422286480665, -0.00029799333424307406, 0.04759054630994797, -0.015763476490974426, ...
0.822047
0.804722
0.017325
Consider a directed set $I$. Let $a_i$ be a sequence of elements indexed by $I$ such that for any pair $i_1, i_2 \in I$, there exists an index $i \in I$ satisfying $i_1 \leq i$ and $i_2 \leq i$. If the elements satisfy the condition that $a_i \leq a_j$ whenever $i \leq j$ in $I$, what can you say about the set of limit...
automath
[ 0.007656511850655079, 0.01476847194135189, -0.03061787597835064, -0.01741003431379795, 0.01658703200519085, -0.01839216612279415, -0.024518145248293877, 0.05348503589630127, 0.0393078587949276, -0.01536343339830637, 0.012601346708834171, 0.03676809370517731, -0.045187219977378845, -0.00748...
0.841904
0.810188
0.031715
Given a positive integer \( n \), identify the integers in the intervals \(\left[\frac{n}{2}+1,n-2\right]\), \(\left[\frac{n}{3}+2,\frac{n}{2}-2\right]\), and \(\left[\frac{n}{4}+3,\frac{n}{3}-2\right]\) that are not attainable exponents of \( n \)-by-\( n \) boolean primitive circulant matrices. For a specific case wh...
automath
[ 0.03355645015835762, 0.04164298251271248, -0.026092994958162308, -0.04662373661994934, 0.021934229880571365, -0.028904294595122337, -0.01779075339436531, 0.05632641911506653, 0.03173833712935448, -0.007968612015247345, 0.02814779058098793, 0.02978859655559063, -0.028585169464349747, -0.022...
0.835977
0.812381
0.023596
Given independent and identically distributed random variables $X_1, X_2, \ldots, X_n$ that follow a Bernoulli distribution with parameter $\theta$, where $0 < \theta < 1$, determine the form of the best unbiased estimator for $\theta^2$ based on the observed data. Specifically, express this estimator in terms of the s...
automath
[ -0.0016592233441770077, 0.03515496850013733, -0.052531637251377106, -0.054386381059885025, 0.0443071573972702, -0.027844246476888657, -0.014673635363578796, 0.05164672061800957, 0.05482669547200203, -0.029155297204852104, 0.016862889751791954, 0.02161887101829052, -0.020434612408280373, 0....
0.809771
0.793088
0.016683
Let \( n \) be a positive integer, and consider the sheaf \( \mathcal{F} \) on \( \mathbb{C}^* \) defined as the constant sheaf with fibers isomorphic to \( \mathbb{C} \). If we take \( U \) to be a connected open subset of \( \mathbb{C}^* \), determine the dimension of \( \mathcal{F}(U) \) in terms of the fundamental ...
automath
[ 0.024804003536701202, 0.04089731350541115, -0.024344855919480324, -0.04460246488451958, 0.031780220568180084, -0.015104378573596478, -0.018713917583227158, 0.049967750906944275, 0.040811359882354736, 0.015052812173962593, 0.009150289930403233, 0.037791501730680466, -0.029026566073298454, -...
0.819246
0.793888
0.025358
Let \( C \) be an \( n \times n \) diagonal matrix with positive diagonal entries, and let \( G \) be an \( n \times n \) symmetric positive definite matrix. Under what conditions on \( C \) and/or \( G \) can we guarantee that the matrix \( CG + GC \) is positive definite?
automath
[ 0.004628648981451988, 0.007389234844595194, -0.055173110216856, -0.03607096150517464, 0.04084564372897148, -0.0364045687019825, -0.016456499695777893, 0.06712813675403595, 0.025053512305021286, -0.013019385747611523, -0.0010477834148332477, 0.012465174309909344, -0.038724929094314575, -0.0...
0.816582
0.796004
0.020578
Given two non-parallel planes with normal vectors \( \mathbf{n_1} = (a_1, b_1, c_1) \) and \( \mathbf{n_2} = (a_2, b_2, c_2) \), find the formula for the volume of the tetrahedron formed by the intersection of the planes and the origin point \( O = (0, 0, 0) \). Express your answer in terms of \( a_1, b_1, c_1, a_2, b_...
automath
[ 0.027232591062784195, 0.030021190643310547, -0.05511024594306946, -0.03807035833597183, 0.04255908727645874, 0.006182813551276922, -0.039794668555259705, 0.06296893209218979, 0.041232626885175705, 0.004550544545054436, 0.017601868137717247, 0.01841779425740242, -0.02350432053208351, -0.020...
0.823064
0.805908
0.017156
Let \( A \) and \( B \) be two finite subsets of \( \mathbb{R} \) with \( |A| = m \) and \( |B| = n \). If \( \mathbb{R} \setminus A \) and \( \mathbb{R} \setminus B \) are homeomorphic, what must be true about the sizes of the sets \( A \) and \( B \)? Provide a detailed explanation for your answer, including any nece...
automath
[ 0.03440455347299576, 0.03418993204832077, -0.04568519443273544, -0.04541097208857536, 0.03300164267420769, -0.0030092629604041576, -0.016203513368964195, 0.05473189428448677, 0.04932030662894249, -0.008393803611397743, -0.003663821844384074, 0.04170462116599083, -0.03405971825122833, -0.02...
0.818309
0.797224
0.021085
Given the region \( R = \{(x, y) \in \mathbb{R} \times \mathbb{R} : x \geq 0 \text{ and } y^2 \leq 4 - x\} \), consider the family of all circles \( F \) that are contained in \( R \) and have centers on the x-axis. Determine the coordinates \( (\alpha, \beta) \) of the point where the largest circle in \( F \) meets t...
automath
[ 0.017857911065220833, 0.04327849671244621, -0.04048680141568184, -0.03467373922467232, 0.03983539342880249, -0.0004204371361993253, -0.011220321990549564, 0.053397662937641144, 0.05216076970100403, -0.0051410021260380745, 0.0015236899489536881, 0.04084515571594238, -0.035870540887117386, -...
0.829599
0.801542
0.028057
Suppose \( f \in L^1([0,1]) \) and it is known that \( \int_0^1 f(x)p(x) \, dx = 0 \) for all polynomials \( p \). Can we conclude that \( f \) is zero almost everywhere on the interval \([0, 1]\)? If so, provide a justification for your answer.
automath
[ 0.021481700241565704, 0.03321648761630058, -0.02888255938887596, -0.029732968658208847, 0.030976194888353348, -0.019174979999661446, -0.022238360717892647, 0.04766684025526047, 0.032770778983831406, 0.003980233799666166, 0.009508244693279266, 0.026960302144289017, -0.020264510065317154, -0...
0.821972
0.804871
0.017101
Given the conditions for a complex number \( z = x + iy \): 1. Graph the locus of points in the complex plane that satisfy the equation \( |z + i| = |z - 1| \). 2. Describe the region defined by the inequality \( |z + 1| \geq |z| \). What are the geometric interpretations of these conditions, and how do they relate t...
automath
[ 0.028696462512016296, 0.03129103034734726, -0.042923565953969955, -0.05690329149365425, 0.038885630667209625, -0.0014310888946056366, -0.015461597591638565, 0.05710117146372795, 0.042024821043014526, -0.0003948839148506522, 0.015600461512804031, 0.03029933199286461, -0.04321138188242912, 0...
0.831146
0.801971
0.029174
Given an \( n \times n \) complex matrix \( A \) with singular values \( s_1 \ge s_2 \ge \cdots \ge s_n \) and eigenvalues \( |\lambda_1| \ge |\lambda_2| \ge \cdots \ge |\lambda_n| \), under what conditions does the inequality \( s_k \ge |\lambda_k| \) hold for each \( k \) from \( 1 \) to \( n \)? Can you provide spec...
automath
[ -0.001385455601848662, 0.03648028150200844, -0.03463064134120941, -0.04745369032025337, 0.029580065980553627, -0.0013077011099085212, -0.022890686988830566, 0.07916688174009323, 0.025446400046348572, -0.009268149733543396, 0.00554454093798995, 0.020353306084871292, -0.051233306527137756, 0...
0.820635
0.798532
0.022103
Consider the Lagrange multiplier theorem which asserts that if \( x^* \) is a local minimum of a function \( f \) subject to the constraints \( h_1(x) = 0, \ldots, h_m(x) = 0 \), and if the gradients \( \nabla h_1(x^*), \ldots, \nabla h_m(x^*) \) are linearly independent, then there exists a unique vector of Lagrange m...
automath
[ -0.004396877717226744, 0.04885759949684143, -0.024730470031499863, -0.039690762758255005, 0.057917285710573196, -0.0026181847788393497, -0.01837584190070629, 0.06811700016260147, 0.016031775623559952, -0.02576523646712303, -0.02820620872080326, 0.01902621239423752, -0.030579911544919014, -...
0.820421
0.794718
0.025703
Given a sequence of measurable functions \( (f_n)_{n\geq1} \) that converges to a function \( f \) in \( L^1(\mu) \) with respect to a \(\sigma\)-finite measure \( \mu \), under what conditions can we conclude that the sequence \( (f_n) \) is uniformly tight? Specifically, can you derive the necessary conditions that m...
automath
[ 0.005601434502750635, 0.04091208800673485, -0.02468145824968815, -0.043705977499485016, 0.034312229603528976, -0.008764202706515789, -0.04458361864089966, 0.06208835542201996, 0.017113951966166496, 0.0009883997263386846, 0.008590717799961567, 0.0061852168291807175, -0.015919871628284454, 0...
0.807243
0.786771
0.020472
Given the ideals \( \mathfrak{a} = (xy^3, x(x-y)) \) and \( \mathfrak{b} = (xy^3, x^2(y-3)) \) in the polynomial ring \( k[x,y] \) over an algebraically closed field \( k \), determine the radicals \( \sqrt{\mathfrak{a}} \) and \( \sqrt{\mathfrak{b}} \). What are the generators of these radical ideals?
automath
[ 0.051765721291303635, 0.04344693943858147, -0.03472841903567314, -0.04199683666229248, 0.032404836267232895, -0.044556304812431335, 0.004611856769770384, 0.06623911112546921, 0.06181430071592331, -0.029196707531809807, 0.012469950132071972, 0.02314417064189911, -0.04516305401921272, -0.019...
0.816942
0.796604
0.020338
Under what conditions is the Banach indicatrix \( N(y, f) = \#\{ x \in X \mid f(x) = y \} \) measurable, given that \( f: X \to Y \) is a measurable function where \( X \) and \( Y \) are subsets of Lebesgue measurable spaces? Additionally, can you provide a counterexample where \( N(y, f) \) fails to be measurable?
automath
[ 0.018757091835141182, 0.02756354957818985, -0.035404857248067856, -0.03572595864534378, 0.026829103007912636, 0.005988915450870991, -0.026242569088935852, 0.07534856349229813, 0.040956899523735046, 0.01431793812662363, 0.01998624950647354, 0.01175116840749979, -0.028159502893686295, 0.0016...
0.803412
0.785164
0.018249
In a strongly connected directed graph \( G = (V, E) \), let \( r \in V \) be a designated root. Is it possible for there to exist a directed edge \( e \in E \) such that \( e \) belongs to every spanning tree of \( G \) rooted at \( r \), with all edges directed towards \( r \)? If so, provide a specific example; if n...
automath
[ 0.015299450606107712, 0.02813548408448696, -0.018006999045610428, -0.037171050906181335, 0.014033114537596703, -0.04767175018787384, -0.0009731024038046598, 0.054607950150966644, 0.01792534440755844, -0.0019194780616089702, 0.03863094374537468, 0.02189064398407936, -0.03668415546417236, 0....
0.811166
0.788825
0.022341
Consider the unit radial vector \(\hat{e}_{r}\) in spherical coordinates, defined as \[ \hat{e}_{r} = \frac{\vec{r}}{r} = \sin(\theta)\cos(\varphi)\, \hat{\mathbf{x}} + \sin(\theta)\sin(\varphi) \, \hat{\mathbf{y}} + \cos(\theta) \,\hat{\mathbf{z}}, \] where \((r, \theta, \varphi)\) are the spherical coordinates. De...
automath
[ 0.008994664065539837, 0.051249273121356964, -0.02405538037419319, -0.0187053382396698, 0.024344533681869507, -0.0010410796385258436, -0.02890295535326004, 0.06293164938688278, 0.039665255695581436, -0.021496161818504333, -0.0026537668891251087, 0.026786785572767258, -0.029838398098945618, ...
0.816946
0.793007
0.023939
Let $R$ be a ring, $I \subset R$ be an ideal, and $S \subset R$ be a multiplicative subset. Define $R' = S^{-1}(R/I)$. If we take a finite $R'$-module $M'$ that is isomorphic to $S^{-1}(M/IM)$ for some finite $R$-module $M$, what can we say about the relationship between the ranks of $M'$ and $M$? Specifically, if the ...
automath
[ 0.05135493353009224, 0.043679386377334595, -0.04371383413672447, -0.028218401595950127, 0.01595269702374935, -0.02963729202747345, -0.0009952873224392533, 0.039602167904376984, 0.03614797070622444, -0.015659188851714134, 0.01086208876222372, 0.016020065173506737, -0.0431852713227272, -0.01...
0.827571
0.811205
0.016366
Given a nonconvex nonlinear optimization problem defined as follows: \[ \begin{align*} \max & \quad q_1 + q_2 \\ \text{s.t.} & \quad \sum_{i=1}^{n}p_{i}x_{i}=\sum_{t=0}^{T}\frac{F_{t}}{(1+q_{1})^{t}} \quad (1) \\ & \quad \sum_{i=1}^{n}p_{i}x_{i}=\sum_{t=0}^{T}\sum_{i=1}^{n}\frac{b_{t,i}x_{i}}{(1+q_{2})^{t}} \quad (2) ...
automath
[ 0.006049434654414654, 0.019598407670855522, -0.048431605100631714, -0.008175544440746307, 0.04139765352010727, -0.004463603720068932, -0.03644528239965439, 0.07279286533594131, 0.021527841687202454, -0.0040983171202242374, 0.006929884664714336, 0.02835596352815628, -0.047351643443107605, -...
0.81789
0.80024
0.01765
Let \( S \) be the set of complex numbers defined as \( S = \{ z \in \mathbb{C} \mid |z| = 1 \} \). If \( z = e^{i\theta} \) for some \( \theta \in [0, 2\pi) \), determine the number of distinct equivalence classes under the relation \( z_1 \sim z_2 \) if \( z_1 \) and \( z_2 \) lie on the unit circle and \( e^{i\theta...
automath
[ 0.01490407157689333, 0.022524558007717133, -0.03854850307106972, -0.0345810204744339, 0.037933606654405594, -0.011890816502273083, -0.02001665160059929, 0.053038809448480606, 0.04355712980031967, 0.0010742872254922986, 0.02361311763525009, 0.006357436999678612, -0.03249814733862877, -0.022...
0.825369
0.795536
0.029832
Given a continuously differentiable function \( F : [0,1]^n \to [0,1]^n \) satisfying the conditions \( 0 < \frac{\partial F_1}{\partial x_i} \leq \dots \leq \frac{\partial F_n}{\partial x_i} < \beta < 1 \) for all \( i =1,\dots,n \), can you demonstrate that there exists a unique fixed point \( x^* = F(x^*) \) such th...
automath
[ 0.014893407933413982, 0.02836262807250023, -0.03749030828475952, -0.03794199973344803, 0.026308707892894745, -0.02176186628639698, -0.007494715042412281, 0.06770788878202438, 0.0408160574734211, 0.0056118108332157135, -0.006425564177334309, 0.028183387592434883, -0.05172642692923546, -0.00...
0.827204
0.803661
0.023543
Let \( n \) be a positive integer, and let \( I_1, I_2, \ldots, I_n \) be \( n \) disjoint intervals on the real number line. Given \( n \) real numbers \( a_1, a_2, \ldots, a_n \), determine if there exists a polynomial function \( p(x) \) of degree at most \( n - 1 \) such that \[ \int_{I_j} p(x) \, dx = a_j \] f...
automath
[ 0.03587968274950981, 0.028074344620108604, -0.026562198996543884, -0.01531605701893568, 0.019032616168260574, -0.006072926800698042, -0.030263535678386688, 0.05170218646526337, 0.02845562994480133, 0.01049063354730606, 0.015233735553920269, 0.03120858035981655, -0.03562541306018829, -0.008...
0.840412
0.806087
0.034324
Given real numbers \( a, b, c \ge 2 \), determine the largest constant \( k \) such that the inequality \[ \log_{a+b+c}(a) + \log_{a+b+c}(b) + \log_{a+b+c}(c) \ge k \] holds true for all \( a, b, c \) in the specified range. What is the value of \( k \)?
automath
[ 0.03065565600991249, 0.047923438251018524, -0.04570675268769264, -0.03551669791340828, 0.027948809787631035, -0.0024734879843890667, -0.019100887700915337, 0.07464740425348282, 0.03575097769498825, -0.02082039788365364, 0.004467909689992666, 0.04336892440915108, -0.039393242448568344, 0.00...
0.840403
0.823409
0.016995
In a random walk on \(\mathbb{Z}^2\) where a particle either stays at its vertex or moves to a neighboring vertex with a probability of \( \frac{1}{5} \), let \( C_n \) be defined as the supremum of \( C > 0 \) such that for all \( x, y \in \mathbb{Z}^2 \) with \( |x|, |y| \leq C \) and \( |x| \leq |y| \), it holds tha...
automath
[ 0.0008587097399868071, 0.04645128175616264, -0.039385270327329636, -0.0046086967922747135, 0.013371994718909264, -0.0061873397789895535, -0.04302575811743736, 0.04062801972031593, 0.007007279433310032, -0.013090910390019417, 0.02154899761080742, 0.018788043409585953, -0.01812605932354927, ...
0.822242
0.794898
0.027344
Given a weighted projective space \(\Bbb P^n_q = \Bbb P(q_0, \dotsc, q_n)\), let \(f_1, \dotsc, f_k\) be \(q\)-homogeneous polynomials of degrees \(d_1, \dotsc, d_k\). What is a specific criterion or condition that can be used to determine whether the intersection of the hypersurfaces defined by these polynomials is sm...
automath
[ 0.015378623269498348, 0.01845044642686844, -0.02503136545419693, -0.050407011061906815, 0.03663371130824089, -0.0018177581951022148, -0.019412921741604805, 0.05575251951813698, 0.026193782687187195, -0.015803739428520203, 0.01999174803495407, 0.02595055289566517, -0.02290491759777069, -0.0...
0.815949
0.794085
0.021864
Consider a set \( E \) with finite outer measure \( m^*(E) \) and a collection \( G \) of intervals that cover \( E \) in the sense of Vitali's Lemma. If we take \( \varepsilon = 1 \) and apply Vitali's Lemma, what is the maximum possible number of disjoint intervals \( I_n \) that can be selected from \( G \) so that ...
automath
[ 0.024180002510547638, 0.01281364168971777, -0.025949649512767792, -0.02174798771739006, 0.03730816766619682, -0.0250583216547966, -0.03630030155181885, 0.052385661751031876, 0.03180168569087982, -0.001018670154735446, 0.01462080329656601, 0.03366561979055405, -0.04190143942832947, 0.014429...
0.829319
0.807672
0.021647
Consider a random walk on a one-dimensional line where you make a total of \( n \) moves, with \( a \) moves to the left and \( b \) moves to the right, such that \( n = a + b \). If you want to find the number of distinct paths that result in ending up \( m \) units to the right of the origin, express this number in t...
automath
[ 0.02111849933862686, 0.03199872747063637, -0.05384009703993797, -0.023527473211288452, 0.041355352848768234, 0.0030524148605763912, -0.02138974517583847, 0.06251391768455505, 0.019901713356375694, -0.0012189828557893634, -0.0020140567794442177, 0.021515926346182823, -0.027507267892360687, ...
0.828851
0.810724
0.018127
Let \( E \) and \( A \) be two functions defined on a random variable \( \boldsymbol{x} \) sampled from a distribution \( P(\boldsymbol{x}) \). Given that \( P(E=E(x)|x) \) can be represented as the Kronecker delta or Dirac delta functions, derive the expression for the conditional expectation \( \mathbb{E}[A|E] \) in ...
automath
[ -0.00396944722160697, 0.021392565220594406, -0.04881298914551735, -0.04071597754955292, 0.05107513815164566, 0.00765067245811224, -0.017435450106859207, 0.05701994150876999, 0.03462639078497887, -0.0025059813633561134, 0.016954811289906502, 0.02088703215122223, -0.026080742478370667, 0.004...
0.796207
0.774052
0.022155
Given positive integers \( n \), \( k \), and \( t \) such that \( 1 \leq t < n \), determine the values of positive integers \( n_1, n_2, \ldots, n_t \) that maximize the expression \[ S = \sum_{i=1}^t (n_i)^k \] subject to the constraint \[ \sum_{i=1}^t n_i = n. \] What is the configuration of \( n_1, n_2, \ld...
automath
[ 0.04548882693052292, 0.0367877371609211, -0.0506167933344841, -0.017071621492505074, 0.03221965953707695, -0.02440839633345604, -0.03160857781767845, 0.044682424515485764, 0.03289731964468956, -0.005282832775264978, 0.016970843076705933, 0.028399085626006126, -0.03742029517889023, -0.00247...
0.837582
0.816089
0.021493
Consider the sets \( W_1 = \{(a_1,a_2,a_3) \in \mathbb{R}^3 : a_1^2 + a_2^2 = 0\} \) and \( W_2 = \text{Span}(\{(a_1,a_2,a_3) : a_1^2 + a_2^2 = 0\}) \). Are both sets subspaces of \( \mathbb{R}^3 \)? If so, what is the dimension of each subspace? If not, explain why.
automath
[ 0.0030514607205986977, 0.030307689681649208, -0.03982536122202873, -0.048275213688611984, 0.047436270862817764, -0.003323577344417572, -0.0007576855714432895, 0.0631660670042038, 0.03738553822040558, -0.0018570341635495424, 0.013074018992483616, 0.03455839678645134, -0.055861108005046844, ...
0.817977
0.800051
0.017926
Given a multi-objective optimization problem with two objectives: maximizing the expected return \( R \) of a financial portfolio and minimizing the risk \( \sigma \) measured by standard deviation, if the set of Pareto optimal solutions forms a convex hull in the \( R-\sigma \) plane and the ideal point \( (R^{ideal},...
automath
[ 0.008430973626673222, 0.013328582048416138, -0.05541687086224556, -0.01932988315820694, 0.01708979159593582, 0.018677422776818275, -0.05014800280332565, 0.06917757540941238, 0.02000538259744644, -0.0038816265296190977, 0.003775572869926691, 0.029036499559879303, -0.04019350931048393, -0.01...
0.815843
0.798892
0.01695
Given a linear system represented by a matrix \( A \) and known convergence rates for the Jacobi and Gauss-Seidel iterative methods, determine the conditions under which both methods exhibit the same convergence behavior as stated in the Stein-Rosenberg Theorem. If \( A \) is a diagonally dominant matrix with eigenvalu...
automath
[ 0.01526525616645813, 0.013021030463278294, -0.032625000923871994, -0.04058866947889328, 0.03751349821686745, -0.010533260181546211, -0.009601552970707417, 0.08867425471544266, 0.022054169327020645, 0.0048289550468325615, 0.012369908392429352, -0.0014738963218405843, -0.019194480031728745, ...
0.816801
0.791456
0.025345
Given the sets \( A = (0, 1) \) and \( B = \{ 2, 3, 4, 5 \} \), determine if the cardinalities \( |A| \) and \( |A \cup B| \) are equal. Use the Schroder-Bernstein Theorem to justify your answer by providing the appropriate injections. What is the cardinality of the union \( |(0,1) \cup \{ 2, 3, 4, 5 \} | \)?
automath
[ 0.020710859447717667, 0.02831687219440937, -0.027670811861753464, -0.016199134290218353, 0.04053022712469101, -0.003707103431224823, -0.010728691704571247, 0.07625773549079895, 0.03891407698392868, 0.0009083445183932781, 0.0008658537408336997, 0.017497537657618523, -0.00607937341555953, -0...
0.834178
0.813576
0.020602
Consider the partially ordered set \( P = \{1, 2, 3\} \) with the relation \( \leq \) defined as follows: \( 1 \leq 2 \), \( 1 \leq 3 \), \( 2 \leq 3 \), and no other relations. 1. Identify all the elements of the subset \( S = \{1, 2\} \) and determine if it has a greatest element. 2. Explain whether \( S \) can hav...
automath
[ 0.04882826656103134, 0.02626408450305462, -0.04133307933807373, -0.027349529787898064, 0.015813864767551422, -0.01944028027355671, -0.0033502348233014345, 0.04472322016954422, 0.01876642182469368, 0.0051032016053795815, 0.027314992621541023, 0.03637457638978958, -0.03740771487355232, -0.01...
0.823302
0.79473
0.028571
Find the maximum value of the expression \( \cos{x} \cdot (2\sin{x} + 4\cos{x}) \). If this maximum value can be expressed in the form \( a + \sqrt{b} \) where \( a \) and \( b \) are positive square-free integers, determine \( ab \). Next, let \( a \) and \( b \) be the integers defined above. What is the smallest re...
automath
[ 0.03921584412455559, 0.04754452407360077, -0.04889913275837898, -0.0299855787307024, 0.03808874264359474, -0.020414892584085464, -0.019371774047613144, 0.056216828525066376, 0.04666954651474953, 0.0028473734855651855, 0.015896659344434738, 0.03302638977766037, -0.00917312316596508, -0.0365...
0.839527
0.822675
0.016851
Given two distinct primes \( p \) and \( q \), let \( G \) be an elementary Abelian \( p \)-group, specifically \( G = G_1 \oplus \cdots \oplus G_\ell \) for cyclic groups \( G_i \) of order \( p \). Investigate the structure of the group ring \( \mathbb{F}_q[G] \). What is the maximum possible size of the finite fie...
automath
[ 0.024578621610999107, 0.03491438552737236, -0.026576539501547813, -0.033836714923381805, 0.007574094925075769, -0.04457729682326317, -0.016736550256609917, 0.038150351494550705, 0.020816365256905556, -0.007305806037038565, 0.00206336029805243, 0.018925948068499565, -0.03054029680788517, -0...
0.814931
0.796336
0.018595
Let \( f: K \to \mathbb{R} \) be a function defined on a compact subset \( K \) of \( \mathbb{R}^n \), such that \( f \) is continuous and \( f^{-1}(f(x)) \) is a singleton for every \( x \in K \). If \( (x_n) \) is a sequence in \( K \) such that \( f(x_n) \to f(x) \) for some \( x \in K \), what can be concluded abou...
automath
[ 0.010219963267445564, 0.05215928703546524, -0.03894158452749252, -0.030483154579997063, 0.028106100857257843, -0.00885128416121006, -0.013884399086236954, 0.07324206084012985, 0.019397065043449402, -0.004247278440743685, -0.00037012528628110886, 0.01634627766907215, -0.02913816086947918, 0...
0.824611
0.795942
0.028669
Let \( A \) be an \( n \times n \) real matrix such that \( A^2 = I \), where \( I \) is the identity matrix. If \( Y \) is an \( n \)-dimensional vector, determine the nature of the solutions for the linear system of equations \( AX = Y \). Which of the following statements is true? A) No solution B) Unique solution...
automath
[ 0.031969789415597916, 0.03009854257106781, -0.037162601947784424, -0.04246451333165169, 0.03953633829951286, -0.04199300333857536, -0.0019009149400517344, 0.09538795053958893, 0.044236231595277786, -0.021656891331076622, 0.00743214413523674, 0.020815834403038025, -0.021334555000066757, -0....
0.815732
0.799081
0.016651
Consider a collection of topological spaces \( (X_\alpha, T_\alpha) \) for \( \alpha \in J \), where \( J \) is an infinite index set, and each \( X_\alpha \) is a Hausdorff space. 1. If \( J = \mathbb{N} \), what is the basic open set in the product topology \( T_{prod} \) of \( \Pi_{\alpha \in J} X_\alpha \) for th...
automath
[ 0.027086522430181503, 0.03568955883383751, -0.04710034653544426, -0.01435861550271511, 0.0415327213704586, 0.004157164599746466, -0.020541464909911156, 0.07686803489923477, 0.03678552433848381, -0.003880184842273593, 0.0046591064892709255, 0.014192433096468449, -0.03729072958230972, -0.051...
0.814024
0.790228
0.023796
Given the expression $$\sum_{x=0}^{m(1-s)} (m-1-x)! (m \cdot s) \frac{(m(1-s))!}{(m(1-s)-x)!}(x+1) = \frac{(m+1)!}{1+m \cdot s},$$ where \(s = \frac{j}{m}\), derive the boolean relationship between \(m\) and \(j\) that would hold true for simplification, particularly focusing on cases where \(m\) is a positive inte...
automath
[ 0.0189465694129467, 0.034979287534952164, -0.05666670948266983, -0.04308949038386345, 0.050025057047605515, -0.017905184999108315, -0.012365736067295074, 0.06548391282558441, 0.042619675397872925, -0.011273341253399849, 0.0035489057190716267, 0.03942308574914932, -0.030968667939305305, -0....
0.83642
0.818581
0.017839
Given two functions \( A(x, y) \) and \( B(x, y) \) defined over the region \( 0 < x < 10 \) and \( 0 < y < 10 \), and their contour plots corresponding to specific levels, how can one create a combined contour plot that visually represents regions from both functions using distinct colors for each region, ensuring tha...
automath
[ 0.009714700281620026, 0.025282353162765503, -0.039726369082927704, -0.035746317356824875, 0.01756851002573967, -0.002328132512047887, -0.019710659980773926, 0.07496532797813416, 0.04714202880859375, 0.010401577688753605, 0.013303715735673904, 0.027702458202838898, -0.011383780278265476, 0....
0.798786
0.776941
0.021845
Let \( S \) be an uncountable index set, and let \( (X_s, \mathcal{U}_s) \) be a collection of totally bounded uniform spaces indexed by \( S \). If the product space \( P = \prod_{s \in S} X_s \) is totally bounded, what can be concluded about the properties of each component space \( X_s \)? Additionally, provide an ...
automath
[ 0.011310799047350883, 0.05736590921878815, -0.041140131652355194, -0.017711864784359932, 0.03150095418095589, -0.02188245579600334, -0.017280032858252525, 0.07947599142789841, 0.04290273040533066, -0.002094635274261236, 0.01871197484433651, 0.029036596417427063, -0.03454786539077759, -0.01...
0.807362
0.777358
0.030003
Let \( A \) be a square \( n \times n \) matrix. Define \( A \) as nonsingular if its determinant is non-zero. Consider the following statements: 1. If \( A \) is nonsingular, then the row-reduced echelon form of \( A \) has \( n \) pivot positions. 2. If \( A \) is nonsingular, then for any \( n \times 1 \) column ve...
automath
[ 0.009235535748302937, 0.03932292386889458, -0.02817598357796669, -0.041489772498607635, 0.04763749614357948, -0.009394400753080845, -0.010442405939102173, 0.07410994917154312, 0.037983089685440063, -0.00026316201547160745, -0.0038233769591897726, 0.003705367911607027, -0.029158225283026695, ...
0.821075
0.796867
0.024208
Given an array \( a_1, a_2, \ldots, a_n \) and the array \( b_i = a_{i+1} - a_i \) for \( 1 \leq i \leq n-1 \), explain why the equation \( a_j - a_i = b_i + b_{i+1} + \cdots + b_{j-1} \) holds for \( 1 \leq i < j \leq n \). Additionally, how would you approach finding the maximum value of \( |a_j - a_i| \) for \( 1 \l...
automath
[ 0.029868843033909798, 0.047913383692502975, -0.04553929716348648, -0.03447003290057182, 0.04837246984243393, -0.037581317126750946, -0.043000295758247375, 0.07402140647172928, 0.04272160306572914, -0.02289290726184845, 0.015676341950893402, 0.02622944861650467, -0.048968832939863205, -0.00...
0.8245
0.803655
0.020845
Let $R$ be a Noetherian ring and let $I$ be a finite set. Consider the Cartesian diagram $$ \xymatrix{ \prod B_i & \prod A_i \ar[l]^{\prod \varphi_i} \\ Q \ar[u]^{\prod \psi_i} & P \ar[u] \ar[l] } $$ with $\psi_i$ and $\varphi_i$ being surjective, where $Q$, $A_i$, and $B_i$ are of finite type over $R$. Given that ...
automath
[ 0.02992929331958294, 0.037100061774253845, -0.03449690341949463, -0.030132664367556572, 0.006459055934101343, -0.03828980773687363, -0.028331637382507324, 0.062447965145111084, 0.03884250298142433, -0.030237190425395966, 0.010051846504211426, 0.030474133789539337, -0.03305632621049881, -0....
0.833214
0.814232
0.018982
What conditions must be satisfied for a circle in the coordinate plane, defined by the equation \( x^2 + y^2 = r^2 \), to contain a dense set of rational points? Specifically, under what circumstances is the set of rational points on such a circle non-empty?
automath
[ 0.011966314166784286, 0.03798988088965416, -0.03239072114229202, -0.03781808912754059, 0.037541378289461136, -0.03079267404973507, -0.010318913497030735, 0.027917467057704926, 0.034791845828294754, -0.029729537665843964, 0.010817182250320911, 0.02127745933830738, -0.025168122723698616, -0....
0.823169
0.805628
0.017541
Let vectors \(\mathbf{a}\) and \(\mathbf{b}\) be two orthonormal vectors in \(\mathbb{R}^2\) such that \(\mathbf{a} = (1, 0)\) and \(\mathbf{b} = (0, 1)\). Define the map \[ \mathbf{z}(\theta) = \cos \theta \, \mathbf{a} + \sin \theta \, \mathbf{b} \] for \(0 \leq \theta < 2\pi\). What is the set of all points \(\...
automath
[ 0.04411095753312111, 0.045639876276254654, -0.045293789356946945, -0.03276051580905914, 0.03754541277885437, -0.004122409038245678, -0.014352991245687008, 0.05593640357255936, 0.04360027238726616, 0.0005615625996142626, 0.00028283242136240005, 0.013260112144052982, -0.025868507102131844, -...
0.831177
0.805673
0.025504
Given a polynomial \( p(x) = ax^3 + bx^2 + cx + d \) with integer coefficients \( a, b, c, d \) such that \( p(0) \) and \( p(1) \) are both odd, demonstrate that \( p(x) \) does not have any integer roots. What is the reasoning behind this conclusion?
automath
[ 0.029548801481723785, 0.04018614441156387, -0.046483609825372696, -0.04558906331658363, 0.004796796478331089, -0.028256403282284737, 0.010173379443585873, 0.049788787961006165, 0.03475721552968025, -0.013365444727241993, 0.0019174802582710981, 0.02777044288814068, -0.03366272151470184, -0....
0.830049
0.812911
0.017138
Let \( G \) be a finite group of order \( n = 60 \). If the set \( D \) consists of the natural numbers that divide \( n \), determine the value of \( f(3, 4) \), where \( f(d_1, d_2) \) is defined as the number of elements \( g \in G \) such that \( g^3 \) is the identity element and there exists \( h \in G \) such th...
automath
[ 0.041838936507701874, 0.014237889088690281, -0.04787230119109154, -0.03635305538773537, 0.0284886434674263, -0.03958476334810257, -0.007103844080120325, 0.04854482784867287, 0.02763284370303154, 0.008794691413640976, 0.02719278074800968, 0.021009601652622223, -0.04670660197734833, -0.01130...
0.835298
0.815406
0.019892
Determine whether the following sets form subspaces of \(\mathbb{R}^2\): A) \(\{(x_1, x_2)^T \mid x_1 x_2 = 0\}\) B) \(\{(x_1, x_2)^T \mid x_1 = 3x_2\}\) For each set, provide a thorough justification of whether it is a subspace by confirming the presence of the zero vector and checking closure under addition and sc...
automath
[ 0.019024478271603584, 0.04509294405579567, -0.027986327186226845, -0.029515361413359642, 0.04889259487390518, -0.008018708787858486, 0.011475603096187115, 0.07407043874263763, 0.046664170920848846, 0.0031268892344087362, 0.004006518516689539, 0.01587570086121559, -0.03232488036155701, -0.0...
0.81514
0.794546
0.020594
Given the function \( f(s,t) = \frac{1}{(1+s^{2})(1+t^{2})} \), which belongs to the space of real analytic functions \( RA(\mathbb{R}^{2}) \) but not to \( RE(\mathbb{R}^{2}) \), determine the largest integer \( n \) such that the function \[ g(s, t) = \frac{1}{(1+s^{2})^{n}(1+t^{2})^{n}} \] is real analytic on \( ...
automath
[ 0.037304364144802094, 0.05538533255457878, -0.05918695405125618, -0.022912001237273216, 0.03629375249147415, -0.012636571191251278, -0.018099788576364517, 0.057525429874658585, 0.028070705011487007, 0.003511682851240039, 0.018249589949846268, 0.02880154922604561, -0.030437331646680832, -0....
0.838122
0.816921
0.021201
Given a 0-1 matrix \( M \) of size \( m \times n \) that represents the incidence relationships between \( m \) points and \( n \) curves, what are the necessary and sufficient conditions for \( M \) to be the incidence matrix of a configuration where each pair of curves intersects in at most one point? Additionally, c...
automath
[ 0.02118407003581524, 0.02355375699698925, -0.028997717425227165, -0.034762192517519, 0.050639208406209946, -0.00484379380941391, -0.03923501819372177, 0.0758049339056015, 0.011180147528648376, -0.013785703107714653, 0.0043758549727499485, 0.006539888214319944, -0.02136155776679516, -0.0386...
0.824372
0.80718
0.017192
Determine all continuous functions \( f: \mathbb{R}^+ \to \mathbb{R} \) such that the following conditions hold for all \( x, y \in \mathbb{R}^+ \): 1. \( f(x+y) = f(x)f(y) \) 2. \( f(x+y) = f(x) + f(y) \) For both cases, specify the general form of such functions \( f \) if they exist.
automath
[ 0.026886334642767906, 0.04340187460184097, -0.05034131556749344, -0.04630989581346512, 0.044847454875707626, -0.007225224282592535, -0.005194362252950668, 0.08539364486932755, 0.04138392210006714, -0.01296023465692997, 0.01706785336136818, 0.014898560009896755, -0.037948910146951675, -0.01...
0.826598
0.799257
0.027341
If \( R \) is a Noetherian ring, what can be concluded about the existence of a maximal ideal when considering a non-empty set of ideals \( \mathcal{S} \) under the inclusion relation? Specifically, how does the property of \( R \) being Noetherian guarantee that any increasing chain of ideals \( I_1 \subseteq I_2 \sub...
automath
[ 0.03416619449853897, 0.026492726057767868, -0.017823083326220512, -0.01720302738249302, 0.027577150613069534, -0.010161804035305977, -0.006440326105803251, 0.07755748182535172, 0.031144047155976295, -0.030989734455943108, 0.010414437390863895, 0.012667983770370483, -0.028220387175679207, -...
0.801572
0.774312
0.027259
Given two functors \( F: C \to D \) and \( U: D \to C \) such that \( F \dashv U \), which satisfies the adjunction conditions characterized by natural transformations \( \eta: I_C \to U F \) and \( \epsilon: F U \to I_D \), consider the morphism \( f: F(Y) \to X \) in \( D \). If \( \hat{f}: Y \to U(X) \) is such that...
automath
[ 0.03542381525039673, 0.02173089049756527, -0.02038460597395897, -0.018855039030313492, 0.03276633471250534, -0.00960446521639824, -0.013625177554786205, 0.07326728850603104, 0.033610645681619644, -0.00158880150411278, 0.007253729738295078, 0.026197362691164017, -0.022828368470072746, 0.007...
0.810772
0.785741
0.025031
Consider a family of continuous functions \( f: [a,b] \to \mathbb{R} \) contained within an open ball \( B_r(f^*) \) of radius \( r \) centered at a function \( f^* \). If \( f^* \) is Lipschitz continuous, can you find a function \( g \) within the same open ball such that \( g \) is not equicontinuous on the interval...
automath
[ 0.003977037500590086, 0.04367128387093544, -0.050150301307439804, -0.029289698228240013, 0.0340065062046051, 0.012799170799553394, -0.011985900811851025, 0.0798378735780716, 0.019528130069375038, -0.006566544529050589, 0.018130434677004814, 0.019678259268403053, -0.03724036365747452, 0.000...
0.822982
0.798623
0.024358
Let \( S = \{ 1, 2, 3, 4, 5 \} \) be a set equipped with a binary operation \( \ast \) defined as follows: \[ \begin{array}{c|ccccc} \ast & 1 & 2 & 3 & 4 & 5 \\ \hline 1 & 1 & 2 & 3 & 4 & 5 \\ 2 & 2 & 1 & 4 & 5 & 3 \\ 3 & 3 & 5 & 1 & 2 & 4 \\ 4 & 4 & 3 & 5 & 1 & 2 \\ 5 & 5 & 4 & 2 & 3 & 1 \\ \end{array} \] Assume thi...
automath
[ 0.04506310448050499, 0.027984201908111572, -0.041891712695360184, -0.00878246407955885, 0.02898452989757061, -0.01583019830286503, 0.003670332720503211, 0.09850768744945526, 0.03914903476834297, -0.0009980479953810573, 0.008372455835342407, 0.006626458838582039, -0.01912696287035942, -0.01...
0.831654
0.805992
0.025662