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
Let \( A \) and \( B \) be two \( n \times n \) Hermitian matrices. Given that \( \text{tr}(e^{A+B}) \leq \text{tr}(e^A e^B) \) holds for all Hermitian matrices \( A \) and \( B \), can you calculate the maximum possible value of \( \text{tr}(e^{A}) \) and \( \text{tr}(e^{B}) \) when both \( A \) and \( B \) are \( 1 \...
automath
[ 0.03807719796895981, 0.0290279109030962, -0.020172497257590294, -0.03479361534118652, 0.03954772278666496, -0.015713678672909737, -0.012629431672394276, 0.055122584104537964, 0.03486102819442749, -0.011316834017634392, 0.003938654903322458, 0.03568929806351662, -0.034890610724687576, -0.00...
0.821842
0.802571
0.019272
Consider a simplicial set \( X \) with \( n \) vertices. If \( f: X \rightarrow S \) is a covering map, how many distinct \( n \)-simplices can \( f \) map to a single \( m \)-simplex in \( S \) under the restriction that the total number of \( m \)-simplices in \( S \) is \( k \) and that every vertex in \( S \) corre...
automath
[ 0.017656004056334496, 0.04316304251551628, -0.04584137350320816, -0.03701086342334747, 0.02119717188179493, -0.020650191232562065, -0.016019755974411964, 0.058134775608778, 0.0345776230096817, -0.011272965930402279, 0.016531987115740776, 0.033737730234861374, -0.004093607421964407, -0.0136...
0.832254
0.810897
0.021357
Let \( A \) be a Noetherian ring and \( f \in A \) such that \( A[f^c] = A[f^{c + 1}] = A[f^{c + 2}] = \ldots \) for some integer \( c \geq 1 \). For a given integer \( n \geq 1 \), how many distinct isomorphism classes of pro-objects arise from the objects \( A/(f^n) \) and \( (f^n : A \to A) \) in the derived categor...
automath
[ 0.027705246582627296, 0.022441694512963295, -0.03278497979044914, -0.01340116560459137, 0.01564929448068142, -0.025925802066922188, -0.02093149907886982, 0.06895151734352112, 0.03736964985728264, -0.009467434138059616, -0.009954708628356457, 0.0063959029503166676, -0.032598745077848434, -0...
0.815858
0.794478
0.02138
Let \( A \), \( B \), \( C \), and \( D \) be four finite sets. Consider a proposition \( P(x, y, z) \) where \( x \in D \), \( y \in D \), and \( z \in D \). If there exist functions \( f: A \times B \to D \), \( g: B \times C \to D \), and \( h: C \times A \to D \), such that for all \( a \in A \), \( b \in B \), and...
automath
[ 0.0332304947078228, 0.03070652112364769, -0.054563362151384354, -0.008649860508739948, 0.05027450993657112, -0.011085394769906998, -0.014972358010709286, 0.04589435085654259, 0.04235875979065895, 0.013487555086612701, 0.017774153500795364, 0.03404171019792557, -0.011253667995333672, -0.011...
0.833088
0.802315
0.030773
Given the equations of the asymptotes of a hyperbola \( H \): \( \sqrt{3}x - y + 5 = 0 \) and \( \sqrt{3}x + y - 1 = 0 \), find the eccentricity of the hyperbola. Also, determine whether tangents can be drawn from the point \( P(1,2) \) to the hyperbola and explain the implications of this point on the relationship bet...
automath
[ 0.01700865849852562, 0.012017290107905865, -0.03702506422996521, -0.028839509934186935, 0.04058394208550453, -0.02196734957396984, -0.02036842703819275, 0.07143878936767578, 0.03244704380631447, -0.016817381605505943, -0.006671304814517498, 0.019559180364012718, -0.04804595187306404, -0.03...
0.81624
0.798464
0.017776
Let \( X = [0, 1] \) and consider the continuous function \( f(x) = x \) defined on \( X \). If we let \( \nu \) be the probability measure given by \( \nu(A) = \text{length}(A) \) for any measurable set \( A \subseteq [0, 1] \), what is the value of the integral \( \int_X f(x) \nu(\mathrm{d}x) \)? Is it true that fo...
automath
[ -0.0035486039705574512, 0.021082691848278046, -0.04578901454806328, -0.015726802870631218, 0.03876523673534393, 0.001488127396441996, -0.020489618182182312, 0.06868242472410202, 0.04667670279741287, 0.0021639452315866947, -0.0012196166208013892, 0.015413292683660984, -0.02556486986577511, ...
0.815923
0.793031
0.022891
Let \( A \) be a positive definite matrix in \( \mathbb{R}^{n \times n} \). If \( B \) is another matrix such that \( \|B - A\|_1 < \epsilon \) for a small positive number \( \epsilon \), what condition on \( \epsilon \) must hold true to ensure that \( B \) remains positive definite?
automath
[ 0.013881164602935314, 0.009869083762168884, -0.046343959867954254, -0.035876549780368805, 0.04721838980913162, -0.029548855498433113, -0.021489078179001808, 0.07099676877260208, 0.040266718715429306, -0.01628529652953148, -0.018720852211117744, 0.014116663485765457, -0.036465443670749664, ...
0.824632
0.805763
0.01887
Given the conditions that \( 2^{\aleph_0} > \aleph_1 \), construct two dense linear orders \( \mathbb{A}_1 \) and \( \mathbb{A}_2 \) of size \( 2^{\aleph_0} \) that are both \( \aleph_1 \)-saturated and do not have endpoints. Can you demonstrate that these two orders are non-isomorphic? Please provide a rigorous argume...
automath
[ 0.026281412690877914, 0.04033084958791733, -0.03727388754487038, -0.037315331399440765, 0.00832665991038084, -0.017978113144636154, -0.021190911531448364, 0.07624509930610657, 0.024624090641736984, -0.02266146056354046, 0.010235410183668137, -0.007103477139025927, -0.034701086580753326, -0...
0.831213
0.803497
0.027716
Let \( y(t) \) be the general solution of a second-order homogeneous linear ordinary differential equation with constant coefficients, represented by \( y'' + ay' + by = 0 \), where \( a \) and \( b \) are constants. If the characteristic polynomial associated with this equation is \( \lambda^2 + a\lambda + b = 0 \), d...
automath
[ 0.010122707113623619, 0.021532893180847168, -0.04751593619585037, -0.05227281153202057, 0.035545844584703445, -0.028949959203600883, -0.022877028211951256, 0.0913105383515358, 0.024665916338562965, -0.015839222818613052, -0.00006183794903336093, 0.011139514856040478, -0.03696524724364281, ...
0.810095
0.792322
0.017773
Let \( S = \prod_{i \in I} S_i \) be the product of an indexed family of topological spaces \( \{ \struct{S_i, \tau_i} \}_{i \in I} \). If each \( S_i \) has a finite number of points, how many points are there in the product space \( S \)?
automath
[ 0.02228744514286518, 0.025548720732331276, -0.054126035422086716, -0.010696985758841038, 0.031055161729454994, -0.01697256974875927, -0.036115650087594986, 0.0630597248673439, 0.040761593729257584, 0.010005894117057323, 0.0004564493428915739, 0.03723764792084694, -0.0338757261633873, -0.04...
0.820713
0.802076
0.018637
Let $\{x_n\}$ be a sequence of real numbers defined as follows: - $x_n = \frac{1}{n}$ for $n \in \mathbb{N}$. Is the sequence $\{x_n\}$ a Cauchy sequence? If it is, find the smallest positive integer $N$ such that for all $n, m \geq N$, the condition $$|x_n - x_m| < \epsilon$$ holds for a given $\epsilon > 0$. ...
automath
[ 0.010419458150863647, 0.021951746195554733, -0.03207392618060112, -0.027965134009718895, 0.03533248230814934, -0.0059684575535357, -0.007385559380054474, 0.07726066559553146, 0.03638189285993576, -0.01336064375936985, 0.0008919975953176618, 0.008785450831055641, -0.031406059861183167, -0.0...
0.844672
0.820972
0.0237
Calculate the supremum of the quantity \( S = \sum_{1 \leq i < j \leq n} |z_i - z_j| \) for complex numbers \( z_1, z_2, \ldots, z_n \) that lie on the unit circle, i.e., \( |z_i| = 1 \) for \( 1 \leq i \leq n \). What is the supremum value of \( S \), and under what conditions does this supremum occur?
automath
[ 0.009209577925503254, 0.04097377881407738, -0.05074615776538849, -0.026874203234910965, 0.037742096930742264, -0.007763090077787638, -0.030806193128228188, 0.03497099503874779, 0.020016411319375038, -0.004621932748705149, 0.02780214138329029, 0.036372195929288864, -0.03265587240457535, -0....
0.827612
0.810707
0.016905
Consider a system of \( n \) particles with masses \( M_1, M_2, \ldots, M_n \) located at coordinates \( (x_1, y_1), (x_2, y_2), \ldots, (x_n, y_n) \) in a two-dimensional space. If the total mass \( M \) is defined as \( M = M_1 + M_2 + \ldots + M_n \) and the coordinates of the center of mass (COM) are given by \[ ...
automath
[ 0.01968546397984028, 0.02126261405646801, -0.06410706788301468, -0.03686550632119179, 0.05140063539147377, -0.02115003764629364, -0.049950748682022095, 0.06439190357923508, 0.032876018434762955, -0.007273283787071705, 0.0002596929552964866, 0.02731691114604473, -0.04852401092648506, -0.017...
0.816555
0.797532
0.019022
Given the nonlinear PDE $$u_x u_y + \ln(x^2) = 0$$ with the initial condition $$u(x_0, y) = y,$$ where $$x_0$$ is a constant, find the correct parameterization of the initial condition in the form of a curve $$\Gamma(s)$$ suitable for applying Charpit's method, and verify if the parameterization $$u = s, \; y = s, \; x...
automath
[ -0.015126359649002552, 0.030652109533548355, -0.01951347105205059, -0.024039525538682938, 0.04062463715672493, -0.003760518040508032, 0.004400711506605148, 0.073539137840271, 0.03693841025233269, -0.022204065695405006, 0.013099020346999168, 0.02982705645263195, -0.033282194286584854, -0.02...
0.820455
0.80244
0.018015
Given a positive integer \( n \), the game-master chooses an \( n \)-bit integer \( x \) (where \( 0 \leq x < 2^n \)). The player can ask questions of the form "Is \( x \) strictly less than \( k \)?" to which the game-master answers truthfully but can lie at most once. Determine the minimum number of queries \( Q \) r...
automath
[ 0.006408609449863434, 0.027012713253498077, -0.054399557411670685, -0.018458837643265724, 0.01747518591582775, -0.012042617425322533, -0.013878846541047096, 0.04627329483628273, 0.0365338996052742, -0.027452681213617325, 0.014274150133132935, 0.03077881783246994, -0.034023985266685486, -0....
0.825738
0.806588
0.01915
Given two quantified statements involving propositional functions \(P(x)\) and \(Q(x)\): 1. \( (\forall x)[P(x) \lor Q(x)] \) 2. \( (\forall x)P(x) \lor (\forall x)Q(x) \) Determine whether these two statements are equivalent. If they are not equivalent, provide a specific example of functions \(P(x)\) and \(Q(x)\) ...
automath
[ 0.015503721311688423, 0.02259123884141445, -0.028500089421868324, -0.04147607088088989, 0.03310094773769379, -0.03775219991803169, 0.000012850009625253733, 0.08571655303239822, 0.037381432950496674, -0.003640461713075638, 0.020013507455587387, 0.013135610148310661, -0.03686987981200218, -0...
0.806142
0.788321
0.017821
Given a smooth optimization problem where \( f: \mathbb{R}^n \to \mathbb{R} \) is a twice continuously differentiable function and \( C \subseteq \mathbb{R}^n \) is a nonempty closed set, state the necessary conditions for \( x^* \in C \) to be a local minimum of the problem using Fritz John optimality conditions. Wh...
automath
[ -0.006799445021897554, 0.03402521833777428, -0.04845540598034859, -0.04657278209924698, 0.03648075833916664, -0.005406061187386513, -0.02375468797981739, 0.06547485291957855, 0.030998695641756058, 0.00011604459723457694, -0.008814380504190922, 0.02560516819357872, -0.04074549302458763, -0....
0.811043
0.789766
0.021277
Given a symmetric $n \times n$ integer matrix $A = (a_{ij})$ with $a_{ij} \geq 0$ for $i \neq j$, and a positive integer vector $m = (m_1, \ldots, m_n)$ such that $Am = 0$ and there is no proper nonempty subset $I \subset \{1, \ldots, n\}$ for which $a_{ij} = 0$ when $i \in I$ and $j \notin I$, let $e$ denote the numbe...
automath
[ 0.02731301449239254, 0.01715810038149357, -0.034309204667806625, -0.03634858503937721, 0.02259545773267746, 0.005552592221647501, -0.02829648368060589, 0.07267368584871292, 0.032755687832832336, -0.01483060885220766, 0.013854699209332466, 0.0368913896381855, -0.04877409711480141, -0.019541...
0.838216
0.814572
0.023644
Let \( L \) be a solvable Lie algebra of dimension \( n \). According to Engel's theorem, the derived algebra \( [L, L] \) is nilpotent. If \( L \) has a basis \( \{e_1, e_2, \ldots, e_n\} \), express the \( k \)-th derived algebra \( [L^{(k)}, L^{(k)}] \) in terms of the original Lie algebra \( L \) and determine for ...
automath
[ 0.03828831762075424, 0.04669366776943207, -0.026696406304836273, -0.05597364157438278, 0.028508959338068962, -0.030527794733643532, 0.0034066454973071814, 0.07077833265066147, 0.0377856008708477, 0.00121217779815197, -0.004515441134572029, 0.021503591910004616, -0.055602796375751495, -0.01...
0.816765
0.795163
0.021602
What are the best known sufficient and necessary regularity conditions for a Riemannian metric \( g \) that ensure both the existence and uniqueness of geodesics, particularly in the case of \( g \) belonging to classes such as \( C^{1,\alpha} \) for \( \alpha > 0 \)? Are there specific counterexamples for \( C^{1,\alp...
automath
[ -0.005178055725991726, 0.03309246897697449, -0.03574313968420029, -0.031218403950333595, 0.030881430953741074, -0.005384161602705717, -0.02546015940606594, 0.05969466641545296, 0.041128698736429214, -0.02787669189274311, -0.005286447238177061, 0.011904440820217133, -0.012988434173166752, -...
0.804853
0.783236
0.021618
Given a proper scheme $X$ over a field $k$ and an ample invertible $\mathcal{O}_X$-module $\mathcal{L}$, if $s \in \Gamma(X, \mathcal{L})$ and $Y = Z(s)$ is its zero scheme, under the assumption that for all points $x \in X \setminus Y$, the condition $\text{depth}(\mathcal{F}_x) + \dim(\overline{\{x\}}) > 1$ holds, ca...
automath
[ 0.012650246731936932, 0.01539122685790062, -0.04717520996928215, -0.02461206540465355, 0.031017132103443146, -0.0259272288531065, -0.010535120032727718, 0.04872122034430504, 0.020032791420817375, -0.0061560445465147495, -0.007078635971993208, 0.044616393744945526, -0.03506847843527794, -0....
0.825673
0.806034
0.019638
Consider a metric space \( X \) that is both complete and totally bounded. According to the Heine-Borel Theorem, what can you conclude about the compactness of \( X \)? If \( X \) has a diameter of 10, what is the maximum number of points in \( X \) that can be chosen such that the distance between any two chosen point...
automath
[ 0.027236588299274445, 0.04285559430718422, -0.04120262339711189, -0.016060858964920044, 0.03101283498108387, -0.028853395953774452, -0.036026593297719955, 0.04519375413656235, 0.02919468842446804, -0.015037968754768372, 0.015195345506072044, 0.030426187440752983, -0.02747446857392788, -0.0...
0.817052
0.799404
0.017648
Given a sequence of random variables $\{X_n\}_{n\geq 1}$ such that $X_n \to a$ in probability, where $a > 0$ is a fixed constant, what are the necessary and sufficient conditions for the following limits to hold in probability: 1. $\sqrt{X_n} \to \sqrt{a}$ as $n \to \infty$? 2. $\frac{a}{X_n} \to 1$ as $n \to \infty$...
automath
[ -0.008407005108892918, 0.03988977149128914, -0.018441753461956978, -0.027757780626416206, 0.01815789006650448, -0.010279688984155655, -0.013168816454708576, 0.05854153633117676, 0.03516990318894386, -0.013131795451045036, -0.007257646881043911, 0.025263763964176178, -0.01738063618540764, -...
0.829385
0.801247
0.028139
Can you demonstrate that for any positive integer \( n \), the statement \( n > x \) for every \( x \) in the empty set is true, and explain why this holds?
automath
[ 0.03752686828374863, 0.022175602614879608, -0.024442000314593315, -0.02993919886648655, 0.03019757568836212, -0.046016402542591095, -0.004624207969754934, 0.037472933530807495, 0.04343372955918312, -0.02406548522412777, 0.021284321323037148, 0.03740337863564491, -0.05541181191802025, -0.00...
0.83047
0.811499
0.018971
Can you provide a specific example of a recursively enumerable set \( A \) and describe a total recursive function \( f \) such that \( A \leq_m K \), where \( K = \{ x \in \mathbb{N} \ | \ x \in W_x \} \)?
automath
[ 0.047831226140260696, 0.04539385810494423, -0.02606232650578022, -0.04782506078481674, 0.03092680498957634, -0.0357566699385643, -0.01565266214311123, 0.07362072914838791, 0.02695322595536709, -0.00828089751303196, 0.0465264730155468, 0.021258650347590446, -0.038496360182762146, 0.02041237...
0.821056
0.803573
0.017483
In triangle \( ABC \), points \( D, E, F \) lie on segments \( BC, CA, \) and \( AB \) respectively, such that lines \( AD, BE, \) and \( CF \) are concurrent. If \(\dfrac{CE}{EA} = \dfrac{3}{5}\), \(\dfrac{BD}{DC} = \dfrac{5}{7}\), and the length of side \( AB \) is 14 cm, what are the lengths of segments \( AF \) and...
automath
[ 0.03112603724002838, 0.02335594967007637, -0.04368022084236145, -0.05089615285396576, 0.042475804686546326, -0.006872236728668213, -0.008069323375821114, 0.05113412067294121, 0.03441910445690155, 0.00522688589990139, 0.0151075953617692, 0.03189946338534355, -0.017334582284092903, -0.008922...
0.832454
0.814997
0.017457
Let \( X_1, X_2, \ldots, X_N \) be independent and identically distributed observations from a uniform distribution over the interval \([-5, \theta]\). Define the maximum of these observations as \( M_N = \max(X_1, X_2, \ldots, X_N) \). Determine the expected value \( E(M_N) \) and use this to find the unbiased estimat...
automath
[ 0.02432713285088539, 0.019456451758742332, -0.051549140363931656, -0.049632392823696136, 0.050171542912721634, -0.021556124091148376, -0.027364768087863922, 0.041328899562358856, 0.033087555319070816, -0.012572914361953735, 0.030528999865055084, 0.03679940849542618, -0.0289992056787014, 0....
0.802644
0.785705
0.016938
Let \( S = [0, 1] \) with the standard metric and let \( T = \mathbb{R} \) with the standard metric. Define the function \( f: S \to T \) by \( f(x) = x^2 \) for all \( x \in S \). 1. Is the function \( f \) continuous on all of \( S \)? 2. Justify your answer using the definition of continuity at a point in terms o...
automath
[ 0.02154415473341942, 0.04066366329789162, -0.04706203192472458, -0.04189038276672363, 0.049545757472515106, -0.03756553679704666, -0.025974905118346214, 0.06333677470684052, 0.03945969417691231, -0.002067451598122716, 0.005276820622384548, 0.02279813028872013, -0.010385880246758461, -0.016...
0.817867
0.794605
0.023262
Given an ellipse defined by the equation \( \frac{(x - h)^2}{a^2} + \frac{(y - k)^2}{b^2} = 1 \) with center \((h, k)\), semi-major axis \(a\), and semi-minor axis \(b\), and a line defined by the points \((x_1, y_1)\) and \((x_2, y_2)\), calculate the following: 1. The length of the line segment that lies within the ...
automath
[ -0.004261244088411331, 0.044190265238285065, -0.047893453389406204, -0.03592508286237717, 0.041344791650772095, -0.026225164532661438, -0.01759609766304493, 0.0628163069486618, 0.05805370584130287, -0.0015681692166253924, 0.015171118080615997, 0.03630422055721283, -0.014278172515332699, -0...
0.815133
0.798791
0.016342
For which positive integers \( n \) can the edges and diagonals of a regular \( n \)-sided polygon be colored with \( \frac{\binom{n}{2}}{3} \) different colors, such that each color is used exactly three times and the segments of the same color form the sides of a triangle?
automath
[ 0.023891188204288483, 0.00756807578727603, -0.03765173256397247, -0.030493803322315216, -0.002722735283896327, -0.015433675609529018, -0.02670687437057495, 0.03432160243391991, 0.024507252499461174, -0.007686177734285593, 0.02410755679011345, 0.05484810471534729, -0.025721730664372444, -0....
0.838248
0.816905
0.021343
Consider a spin 1/2 particle prepared using three different procedures represented by the vectors $$\begin{pmatrix} 1 \\ 0 \end{pmatrix}$$ and $$\frac{1}{2} \begin{pmatrix} -1\\ \pm \sqrt{3} \end{pmatrix}$$. If all states are equally likely, the von Neumann entropy is shown to be lower than the Shannon entropy. As the ...
automath
[ 0.02573239617049694, 0.02953985333442688, -0.0312519371509552, -0.023002928122878075, 0.01594497449696064, -0.005328034516423941, -0.02365167811512947, 0.07778242230415344, 0.03095310553908348, -0.015882128849625587, 0.008201091550290585, 0.014498533681035042, -0.03140486404299736, -0.0228...
0.814831
0.798434
0.016397
Let \( A \) be a well-ordered set of real numbers, and let \( B \) be a non-empty subset of \( A \). If \( B \) is defined as \( B = \{x_1, x_2, \ldots, x_n\} \) for some finite \( n \), is it true that \( B \) is also well-ordered? Justify your answer.
automath
[ 0.044418446719646454, 0.01161441020667553, -0.04460492357611656, -0.03380441293120384, 0.02613762579858303, -0.03774097189307213, -0.010899095796048641, 0.03412087261676788, 0.0322238989174366, -0.0186809953302145, 0.0097331078723073, 0.03377634286880493, -0.035053152590990067, -0.01043661...
0.824736
0.804321
0.020415
Given an array \( A \) consisting of \( n \) integers, where each integer \( A[i] \) (for \( 1 \leq i \leq n \)) is initially not guaranteed to be unique, describe an algorithm to increment the duplicate values so that all the elements of the array become unique. Calculate the minimum number of increments required to a...
automath
[ 0.015598759055137634, 0.033451516181230545, -0.019719120115041733, -0.02614285610616207, 0.01806657575070858, -0.02856452390551567, -0.013420219533145428, 0.08825653791427612, 0.016956420615315437, -0.03421909362077713, 0.015018581412732601, -0.0010794686386361718, -0.023884063586592674, -...
0.805858
0.785359
0.020499
Given a semicategory \( C \) and a semicategory \( D \), if a semifunctor \( F: C \to D \) maps each identity morphism \( id_X \) in \( C \) to a nontrivial idempotent endomorphism of \( F(X) \) in \( D \), can it be shown that \( F \) is not a functor? Provide a counterexample illustrating this distinction.
automath
[ 0.022236458957195282, 0.018725890666246414, -0.02994558960199356, -0.01312241517007351, 0.01786518655717373, -0.01050759106874466, -0.005195957608520985, 0.0955750122666359, 0.035355277359485626, -0.021075520664453506, 0.003115450032055378, 0.02331908978521824, -0.03485212102532387, -0.015...
0.807526
0.789912
0.017614
Given a bounded domain \(\Omega \subset \mathbb{R}^n\) and a function \(f \in L^p(\Omega)\) for \(p \in (1, \infty)\), if a sequence of functions \((u_n)_{n=1}^{\infty}\) in \(L^p(\Omega)\) converges weakly to a function \(u\) and the norms satisfy \(\|\sqrt{f^2 + u_n^2}\|_p \to \|\sqrt{f^2 + u^2}\|_p\), can we conclud...
automath
[ -0.01551760733127594, 0.059773609042167664, -0.027998920530080795, -0.026736825704574585, 0.031859397888183594, -0.008380016312003136, 0.0030296549666672945, 0.04756883159279823, 0.03626608848571777, 0.011907774955034256, 0.0021689441055059433, 0.031973741948604584, -0.02161010168492794, 0...
0.816341
0.792773
0.023568
Let \( \X \in \mathbb{R}^{N \times p} \) be a design matrix that satisfies the Restricted Isometry Property (RIP) such that \( \mathrm{RIP}(2k, \delta) \) holds for some \( \delta < \frac{1}{3} \). If \( \beta^* \in \mathbb{R}^p \) is the unique solution to the \( \ell_0 \) minimization problem corresponding to a set \...
automath
[ 0.004009486176073551, 0.018338389694690704, -0.038514915853738785, -0.02902688831090927, 0.04050794243812561, -0.011711815372109413, -0.029872344806790352, 0.07625281810760498, 0.03566523268818855, -0.012563345022499561, 0.00029362787608988583, 0.018219327554106712, -0.018170075491070747, ...
0.822342
0.803908
0.018434
Given an infinite cardinal \(\kappa\), is it possible to construct explicitly \(2^\kappa\) non-isomorphic groups of cardinality \(\kappa\) without relying on advanced set theoretic concepts? If so, describe a method or provide an example of such a construction.
automath
[ 0.02580275945365429, 0.03916211426258087, -0.02668808586895466, -0.01644791290163994, 0.017939727753400803, -0.023281440138816833, -0.019090130925178528, 0.05938081443309784, 0.010176075622439384, -0.007803541608154774, 0.016342204064130783, -0.0013445800868794322, -0.03407011926174164, -0...
0.808926
0.789168
0.019759
Consider a continuous function \( f: \mathbb{R}^2 \to \mathbb{R} \) defined on a circular region of radius \( R \) centered at the origin. Suppose we use radial basis function interpolation with \( m \) distinct centers uniformly distributed along the circumference of the circle. If the interpolation method uses the mu...
automath
[ 0.010952351614832878, 0.04960110783576965, -0.05018910393118858, -0.035853445529937744, 0.03924691677093506, -0.000019686061932588927, -0.014312989078462124, 0.04795907810330391, 0.01258835569024086, -0.0007856483571231365, 0.006627554073929787, 0.016253294423222542, -0.037672121077775955, ...
0.826861
0.804107
0.022753
Let \( f: \mathbb{R}^n \to \mathbb{R} \) be a continuously differentiable function, and consider the constrained optimization problem \[ \min_{x \in X \subseteq \mathbb{R}^n} f(x) \] subject to \( g(x) \leq 0 \) for \( g: \mathbb{R}^n \to \mathbb{R}^m \) and \( h(x) = 0 \) for \( h: \mathbb{R}^n \to \mathbb{R}^k \). ...
automath
[ -0.017946431413292885, 0.036734968423843384, -0.0389542318880558, -0.036795951426029205, 0.030476974323391914, 0.004325448535382748, -0.009787731803953648, 0.076582171022892, 0.027743302285671234, 0.011961727403104305, 0.0008914938662201166, 0.009674197062849998, -0.03057871013879776, 0.00...
0.819774
0.792217
0.027558
Let \( a_0 = 1 \) and \( b_0 = 2 \). Consider the strictly increasing bijection \( f(x) = 2x \) defined on the interval \( [0, 1] \). For what values of \( a \) and \( b \) in the intervals \( [0, 1] \) and \( [0, 2] \), respectively, does equality hold in Young's Inequality? Specifically, find the pair \( (a, b) \) su...
automath
[ 0.04195765033364296, 0.03472992405295372, -0.043655525892972946, -0.03283390775322914, 0.030719716101884842, -0.025440305471420288, -0.020810216665267944, 0.0937071293592453, 0.04320663586258888, -0.01583867520093918, 0.004775181412696838, 0.012221770361065865, -0.030569199472665787, -0.00...
0.832552
0.812069
0.020484
Let \(\Omega\) be a bounded domain and consider a sequence \((u_n) \subset H^1(\Omega)\) that satisfies \(\|u_n\|_{L^2} \leq C\) for all \(n\) and \(\|\nabla u_n\|_{L^2} \leq C\) for some constant \(C > 0\). If \(u_n \rightharpoonup u\) in \(L^2(\Omega)\), does it follow that \(u_n \rightharpoonup u\) in \(H^1(\Omega)\...
automath
[ -0.011785577982664108, 0.049915216863155365, -0.024888446554541588, -0.031156325712800026, 0.029988504946231842, 0.009048801846802235, -0.020217064768075943, 0.0689350962638855, 0.03216597065329552, -0.0023224453907459974, 0.0007637059316039085, 0.011420669965445995, -0.018879877403378487, ...
0.805685
0.782023
0.023662
Consider the sphere defined by the equation \( K: (x-1)^2 + (y-9)^2 + (z-4)^2 - 85 = 0 \) and the plane defined by \( P: 6x - 2y + 3z - 49 = 0 \). What is the geometric shape of the intersection of this sphere and plane, and how can it be expressed mathematically? Specifically, can you describe the process to determine...
automath
[ 0.026227885857224464, 0.027779676020145416, -0.039902303367853165, -0.04872911423444748, 0.021667836233973503, -0.012018753215670586, -0.006406296975910664, 0.04671499505639076, 0.05043075978755951, -0.013973260298371315, 0.03966888040304184, 0.027706017717719078, -0.02741851843893528, -0....
0.817308
0.800487
0.016821
Let \( E_k = \begin{pmatrix} 2 \\ 1 \\ k \\ -1 \end{pmatrix} + \text{Span} \left( \begin{pmatrix} 2+k \\ 3 \\ 2k \\ 2 \end{pmatrix}, \begin{pmatrix} -2 \\ k-5 \\ 4 \\ k-3 \end{pmatrix} \right) \). Determine the values of \( n_1, n_2 \in \mathbb{N} \) and \( k_0 \in \mathbb{R} \) such that: (a) \( \dim(E_k) = n_1 \) f...
automath
[ 0.029234610497951508, 0.03103468008339405, -0.04652310162782669, -0.0528804250061512, 0.041045740246772766, -0.012081664986908436, -0.0030594447162002325, 0.05814381316304207, 0.024928493425250053, -0.004474750719964504, 0.007056782953441143, 0.03268921747803688, -0.04851401969790459, -0.0...
0.829092
0.812699
0.016392
Consider the function \( f : \mathbb{C} \to \mathbb{C} \) defined by \( f(z) = \overline{z} \). Determine whether this function is an isometry in the context of complex normed vector spaces. Specifically, does it satisfy the condition \( \| f(z_1) - f(z_2) \| = \| z_1 - z_2 \| \) for all \( z_1, z_2 \in \mathbb{C} \)? ...
automath
[ 0.023137789219617844, 0.028224777430295944, -0.05095250904560089, -0.0297628752887249, 0.02944064326584339, -0.00134926603641361, -0.014104412868618965, 0.07820172607898712, 0.019393596798181534, 0.0007358160801231861, 0.007996777072548866, 0.0044457875192165375, -0.03260450437664986, -0.0...
0.817055
0.793131
0.023923
Can the closed interval $[0,1]$ be expressed as a countable intersection of open intervals, and if so, provide a specific example of open intervals $(a_n, b_n)$ that satisfy $[0,1] = \bigcap_{n=1}^{\infty} (a_n, b_n)$? Additionally, is it possible to represent $[0,1]$ as a countable union of open intervals? Explain you...
automath
[ 0.034291915595531464, 0.024440152570605278, -0.026937810704112053, -0.019352130591869354, 0.025372345000505447, -0.009890466928482056, -0.035398826003074646, 0.051785796880722046, 0.041239116340875626, -0.006076922174543142, 0.023708965629339218, 0.008200012147426605, -0.026640435680747032, ...
0.824107
0.805307
0.0188
Let \( N \) be the number of identical rectangles that can be arranged tangentially on a circular path, each rectangular section having a width of \( w = 0.4 \) cm and a height of \( h = 0.2 \) cm. If the rectangles are arranged to fit around a circle with radius \( R \) such that they are evenly spaced, what is the ma...
automath
[ 0.010271362029016018, 0.037553586065769196, -0.0350530706346035, -0.01732313260436058, 0.03255399316549301, -0.011150212958455086, -0.037356697022914886, 0.04685155302286148, 0.016651399433612823, 0.0022670074831694365, 0.014641372486948967, 0.036753907799720764, -0.0261975210160017, -0.02...
0.830907
0.811605
0.019302
Given four points A, B, C, and D in three-dimensional space with position vectors \(\overrightarrow{a}\), \(\overrightarrow{b}\), \(\overrightarrow{c}\), and \(\overrightarrow{d}\) satisfying the equation \(3\overrightarrow{a} - 2\overrightarrow{b} + \overrightarrow{c} - 2\overrightarrow{d} = 0\), determine whether the...
automath
[ 0.027887433767318726, 0.04197705164551735, -0.05183904618024826, -0.04679420217871666, 0.05989667773246765, -0.01592181622982025, 0.003972850274294615, 0.07162700593471527, 0.048598598688840866, -0.003211932023987174, 0.013575159944593906, 0.025109171867370605, -0.0166083425283432, -0.0124...
0.817992
0.799228
0.018764
Given two commuting matrices \( A \) and \( B \) of size \( n \times n \) over the real numbers, can you construct sequences of diagonalizable matrices \( A_n \) and \( B_n \) that converge to \( A \) and \( B \) respectively, while ensuring that \( A_n \) commutes with \( B_n \) for all \( n \)? If yes, describe the p...
automath
[ 0.01845521666109562, 0.03277632221579552, -0.02910720743238926, -0.01997232437133789, 0.0139784449711442, -0.0011871953029185534, -0.008536416105926037, 0.06981665641069412, 0.02781260944902897, -0.014560860581696033, 0.004316973965615034, 0.01851632259786129, -0.03399892896413803, -0.0023...
0.826014
0.79947
0.026544
Given the set of rational numbers \( \mathbb{Q} \) with the standard metric defined by the absolute value of the difference, demonstrate that the sequence defined by \( x_n = \frac{1}{n} \) is a Cauchy sequence and explain why it does not converge to any rational limit.
automath
[ 0.017287448048591614, 0.03394622728228569, -0.02209903672337532, -0.03700624406337738, 0.016839023679494858, -0.018561668694019318, -0.010264930315315723, 0.053100768476724625, 0.04102618619799614, -0.022082317620515823, 0.01716936193406582, 0.014714373275637627, -0.039098262786865234, -0....
0.822768
0.803317
0.019451
Let \( (X,d) \) be a complete metric space and let \( \varphi: X \to X \) be a mapping that is supercontractive. If the set \( \varphi(X) \) is totally bounded in \( X \), what can be concluded about the compactness of the composition operator \( C_{\varphi} \) defined by \( C_{\varphi} f = f \circ \varphi \) when acti...
automath
[ 0.002861714456230402, 0.04289316385984421, -0.02726776897907257, -0.024523068219423294, 0.02545488253235817, -0.006424012128263712, -0.014687051996588707, 0.061341188848018646, 0.047360438853502274, 0.005595617927610874, 0.01508548017591238, 0.028259234502911568, -0.025849612429738045, -0....
0.809963
0.790805
0.019158
For a given positive number \( r \), determine the range of values for \( r \) such that the set \[ M = \{ z \in \mathbb{C} : |z^2 - 1| < r \} \] forms a bounded region in the complex plane. What shape does this region take for different values of \( r \), specifically when \( r < 1 \), \( r = 1 \), and \( r > 1 \)?...
automath
[ 0.033585768193006516, 0.03774077072739601, -0.04460454359650612, -0.0414152666926384, 0.04090748727321625, -0.01695386692881584, -0.012991776689887047, 0.04919532686471939, 0.04201572388410568, -0.01439475454390049, 0.0014592951629310846, 0.036090608686208725, -0.051033347845077515, -0.017...
0.835942
0.814671
0.021272
Given that \( U \) is a random vector with \( \mathbb{E}[U] = \mu \) and \( \mathrm{var}(\|U\|_2) \le V \), where \( V \ll \|\mu\|_2^2 \), find a non-trivial upper bound on \( \mathbb{E}[\bar U^\intercal \bar \mu] \) in terms of \( \|\mu\|_2 \) and \( V \).
automath
[ 0.019847692921757698, 0.03291163966059685, 0.001269434578716755, -0.011921379715204239, 0.030099229887127876, 0.008823251351714134, -0.035044144839048386, 0.061238911002874374, 0.023225488141179085, -0.012886928394436836, 0.01844046078622341, 0.03675070032477379, -0.01140139065682888, -0.0...
0.81422
0.792622
0.021598
Given the conic section defined by the equation \(C = \{(x,y) \mid \frac{x^2}{a^2} + \frac{y^2}{b^2} = 1\}\), where \(a\) and \(b\) are the semi-major and semi-minor axes respectively. If the ellipse intersects the line \(y = mx + c\) in two points, what conditions must hold for \(m\) and \(c\) so that the distance bet...
automath
[ 0.005748429801315069, 0.03904955834150314, -0.04820919781923294, -0.02812201902270317, 0.04324774444103241, -0.01836627721786499, -0.020305057987570763, 0.05656800791621208, 0.041283007711172104, -0.012789582833647728, 0.021078582853078842, 0.02386181615293026, -0.008694053627550602, -0.01...
0.826276
0.804042
0.022234
Consider a set of 8 points evenly spaced on the unit circle \( S^1 \). If these points divide the circle into 8 equal arcs, can you determine the number of distinct medians according to the optimization definition where the median \( n^* \) minimizes the sum of shortest distances to all other points? If the configurati...
automath
[ 0.0036365578416734934, 0.019383033737540245, -0.04598594084382057, -0.019974883645772934, 0.0233811866492033, -0.023060280829668045, -0.025101076811552048, 0.04686148464679718, 0.03835891932249069, -0.018789568915963173, 0.004663355182856321, 0.0023575827945023775, -0.029056722298264503, -...
0.842653
0.824194
0.018459
Let \( M \) be a subspace of \( \mathbb{R}^n \) such that \( M \cap P = \{0\} \), where \( P = \{ x \in \mathbb{R}^n : x_i \geq 0 \text{ for all } i \} \). Suppose \( M^\perp \cap \mathrm{Int}(P) = \emptyset \). Calculate the maximum number of linearly independent vectors in \( M \) if \( \dim(M) = k \) and determine i...
automath
[ 0.023262478411197662, 0.026090538129210472, -0.04020275920629501, -0.022328423336148262, 0.03816193342208862, 0.0027239040937274694, -0.014542059041559696, 0.057118985801935196, 0.037542667239904404, -0.012128349393606186, -0.0017888329457491636, 0.016102200374007225, -0.026093749329447746, ...
0.827094
0.794127
0.032967
Let \( A \) and \( B \) be \( n \times n \) complex matrices with singular values \( \sigma_i(A) \) and \( \sigma_i(B) \) for \( i = 1, 2, \ldots, n \). Given that the Frobenius norm \( \| A \|_F \) is defined as \( \sqrt{\sum_{i=1}^{n} \sigma_i^2(A)} \), determine the maximum value of the inequality \[ \| A + B \|_F...
automath
[ 0.010876587592065334, 0.02667674608528614, -0.04714539647102356, -0.03142779320478439, 0.040027838200330734, 0.004084558691829443, -0.02280276082456112, 0.07252547889947891, 0.043344855308532715, -0.01965375430881977, 0.0031599164940416813, 0.02764439396560192, -0.03632224351167679, 0.0055...
0.824558
0.796561
0.027997
Let \( f: \mathbb{R} \to \mathbb{R} \) be a measurable function such that the graph of \( f \) is dense in \( \mathbb{R}^2 \). What conditions must \( f \) satisfy for its graph to be dense in \( \mathbb{R}^2 \)? Specifically, provide an example of such a function and verify that its graph is indeed dense in \( \mathbb...
automath
[ 0.011130781844258308, 0.045799221843481064, -0.04973369836807251, -0.053759265691041946, 0.02605327218770981, -0.015609883703291416, -0.03205033019185066, 0.05143044888973236, 0.023878922685980797, -0.010416699573397636, 0.004858261439949274, 0.013719230890274048, -0.00858323648571968, -0....
0.815982
0.792996
0.022986
Let \( (A_n)_{n=1}^\infty \) be a decreasing sequence of Borel subsets of \( [0, 1] \) such that \( \bigcap_{n=1}^\infty A_n = \emptyset \) and assume \( \lambda(A_n) < \epsilon \) for some \( \epsilon > 0 \). Is it possible to find an open set \( U \subseteq [0, 1] \) such that 1. \( \lambda(A_n \setminus U) = 0 \) ...
automath
[ 0.010997449047863483, 0.048721328377723694, -0.021903404965996742, -0.015368266962468624, 0.041959065943956375, 0.000605144421570003, -0.04211534187197685, 0.06300033628940582, 0.042511261999607086, -0.010745028033852577, 0.005263600032776594, 0.007364428602159023, -0.05863550677895546, 0....
0.823794
0.798062
0.025733
Consider the following situation: Let \( A \), \( B \), and \( C \) be rings such that there exist ring maps \( f: A \to B \) and \( g: B \to C \). Suppose that the map \( g \circ f: A \to C \) is integral and that the ring map \( g \) is finite. Using the results of Lemma 10.35.15, what can be concluded about the ma...
automath
[ 0.03966248407959938, 0.06456823647022247, -0.010597879067063332, -0.019031736999750137, 0.04157508537173271, -0.02880755253136158, -0.01877402700483799, 0.052291929721832275, 0.018075015395879745, -0.014107508584856987, 0.013317589648067951, 0.018935326486825943, -0.023547867313027382, -0....
0.820314
0.799926
0.020388
Consider a continuous curve defined by the function \( f(x) \) at the point \( P = (a, f(a)) \). A mirror is placed at point \( P \), and the left side of the curve, represented by the points \( (x, f(x)) \) for \( x < a \), is reflected across the mirror to intersect the tangent at point \( P \) smoothly. If the cur...
automath
[ 0.02800755389034748, 0.04925530031323433, -0.05138375237584114, -0.03642851486802101, 0.03164294734597206, 0.0018354002386331558, -0.030323194339871407, 0.08405978977680206, 0.03559579700231552, -0.0037683756090700626, 0.014037280343472958, 0.014222254045307636, -0.014861716888844967, -0.0...
0.819497
0.79317
0.026327
Given an infinite-dimensional vector space \( V \), construct an explicit sequence \( (v_n) \) of vectors in \( V \) such that \( (v_1, v_2, \ldots, v_n) \) is linearly independent for every positive integer \( n \). What is the dimension of the span of the first \( n \) vectors \( (v_1, v_2, \ldots, v_n) \)?
automath
[ 0.025653837248682976, 0.04136508330702782, -0.025785274803638458, -0.04307815060019493, 0.03664708137512207, -0.014586417935788631, -0.02477363869547844, 0.06049554422497749, 0.03400658071041107, -0.02639775723218918, 0.004666750319302082, 0.020130440592765808, -0.01864546164870262, -0.012...
0.839182
0.817714
0.021468
Suppose \( S = \text{span}(v_1, \ldots, v_k) \) is a subspace of \( \mathbb{R}^n \), where \( v_i \) are unit vectors with \( ||v_i||_2 = 1 \) for all \( i = 1, \ldots, k \). Let \( x \) be a unit vector in \( \mathbb{R}^n \) such that \( |x^T v_i| \leq \epsilon \) for all \( i = 1, \ldots, k \). Define \( P_S \) as ...
automath
[ 0.005226713139563799, 0.04848223924636841, -0.04147733375430107, -0.017378222197294235, 0.03590025380253792, -0.015637576580047607, -0.02532060816884041, 0.07358260452747345, 0.027153123170137405, 0.008505254052579403, -0.003962477203458548, 0.017591217532753944, -0.024647528305649757, -0....
0.834979
0.810376
0.024603
Given four distinct points \( p, q, r, s \) arranged linearly, demonstrate that the Vapnik-Chervonenkis dimension of the hypothesis class of rectangles in the plane is at most 3 by proving that there is no rectangle that can contain points \( p \) and \( r \) while excluding points \( q \) and \( s \). What implication...
automath
[ 0.013579347170889378, 0.028566554188728333, -0.02539856918156147, -0.04598943516612053, 0.03677527606487274, -0.011788218282163143, -0.012482558377087116, 0.04491739347577095, 0.0328742153942585, -0.008519889786839485, 0.0009767725132405758, 0.04703551158308983, -0.008417429402470589, -0.0...
0.829724
0.808526
0.021198
Consider the sequence of closed sets \( C_n = [n, \infty) \) for \( n \in \mathbb{N} \). What is the intersection \( \bigcap_{n=1}^{\infty} C_n \)? Provide a detailed explanation of your answer.
automath
[ 0.046414535492658615, 0.038593992590904236, -0.03160008043050766, -0.010408841073513031, 0.022145839408040047, -0.0026536991354078054, -0.030646391212940216, 0.04721735045313835, 0.0438862107694149, -0.009371343068778515, 0.025617096573114395, 0.008463356643915176, -0.034284558147192, 0.00...
0.830296
0.810712
0.019584
Let \( A \) and \( B \) be abelian groups, and let \( i: A \to B \) be an injection and \( r: B \to A \) be a retraction such that \( ri = 1_A \). If we form the idempotent \( p = ir \) and its complementary idempotent \( q = 1 - p \), under what conditions will we have the isomorphism \( \ker(r) \cong \operatorname{co...
automath
[ 0.04308134317398071, 0.032518159598112106, -0.016581833362579346, -0.018961645662784576, 0.01496819593012333, -0.028384920209646225, 0.004074302967637777, 0.07729484140872955, 0.04065118357539177, -0.004137022420763969, 0.00965250562876463, 0.018634531646966934, -0.04056672751903534, -0.01...
0.81776
0.794831
0.022929
Let $\mathcal{A}$ be a collection of subsets of a set $X$ that forms a ring of sets. If the cardinality of $X$ is $n$, what is the maximum possible number of subsets in $\mathcal{A}$, given that $\mathcal{A}$ must include the empty set and is closed under set difference and finite unions?
automath
[ 0.03837742656469345, 0.014353521168231964, -0.03202839568257332, -0.016174888238310814, 0.03334533050656319, -0.016088305041193962, -0.022749651223421097, 0.03648236021399498, 0.03188744932413101, -0.02620077319443226, 0.01557993981987238, 0.028452757745981216, -0.030666636303067207, 0.001...
0.836943
0.819963
0.01698
Let \( f \) be a nonconstant meromorphic function defined on the Riemann sphere \( \mathbb{C} \cup \{\infty\} \). If \( P \) is the set of all poles of \( f \), how many poles can \( f \) have in total, and what is the relationship between the number of poles and the compactness of \( \mathbb{C} \cup \{\infty\} \)?
automath
[ -0.006619016639888287, 0.039110928773880005, -0.04941410571336746, -0.010787908919155598, 0.01818935014307499, -0.006234772969037294, -0.02379422076046467, 0.033788468688726425, 0.0424390472471714, 0.006714301649481058, 0.012776927091181278, 0.02509339526295662, -0.03875603526830673, -0.04...
0.820609
0.797871
0.022738
Consider the set of integers \(\{1, 11, 9, w, 9, 1, 9, 2, 2\}\) where \(3 \leq w \leq 9\). Let \(\overline{x}\), \(m\), and \(d\) be the mean, median, and mode of these integers, respectively. Given that the mode \(d = 9\), what is the range of possible values for the mean \(\overline{x}\)? Additionally, under what con...
automath
[ 0.03563335910439491, 0.010912599973380566, -0.05701153352856636, -0.032474059611558914, 0.040349025279283524, -0.02014237828552723, -0.03534069284796715, 0.05858353152871132, 0.026811357587575912, -0.012554192915558815, 0.010760690085589886, 0.030521385371685028, -0.045682478696107864, -0....
0.827922
0.811502
0.01642
Let \( S \subseteq \mathbb{C} \) be the open set consisting of all complex numbers \( z \) such that \( |z| < 1 \). If \( z_0 \) is a point in \( S \), what is the maximum radius \( \epsilon \) of the neighborhood \( N_{\epsilon}(z_0) \) that remains entirely within \( S \)?
automath
[ 0.0337391123175621, 0.028437817469239235, -0.03842568397521973, -0.022000752389431, 0.046043891459703445, -0.018509747460484505, -0.0178220234811306, 0.025714963674545288, 0.05104862526059151, 0.0008564353338442743, 0.011421551927924156, 0.03167751058936119, -0.03612322360277176, -0.024880...
0.832582
0.806939
0.025643
Let \( U = \{1, 2, 3, 4, 5, 6, 7, 8, 9\} \), \( A = \{2, 4, 6, 8\} \), and \( B = \{2, 3, 5, 7\} \). 1. Verify whether the following relation holds true: \[ (A \cup B)' = A' \cap B' \] 2. Calculate \( |(A \cap B)'| \) and \( |A' \cup B'| \) and verify if they are equal. What are the values for \( |(A \c...
automath
[ 0.03758571669459343, 0.047256916761398315, -0.02488011121749878, -0.01646585203707218, 0.027326766401529312, -0.012126801535487175, -0.015239191241562366, 0.05525021627545357, 0.04378797113895416, -0.007834435440599918, -0.0002234623534604907, 0.02922365441918373, -0.008057673461735249, -0...
0.834695
0.813844
0.02085
Let \( R \) be a commutative ring with unity and let \( P \) be a prime ideal in \( R \). Given that the ideal \( P \) contains a non-zero positive integer \( n \), what can be concluded about the existence of a prime element in \( R \) that generates \( P \)? If such a prime element exists, what can you say about the ...
automath
[ 0.048207394778728485, 0.02731466293334961, -0.023186512291431427, -0.029288986697793007, 0.02917684242129326, -0.025080403313040733, -0.0031884945929050446, 0.07181166857481003, 0.036638159304857254, -0.014533774927258492, 0.013714257627725601, 0.007614036090672016, -0.02915215864777565, -...
0.822019
0.801249
0.020769
In a metric space \((X,d)\), let \(G \subset X\) be an open set that is not closed, and let \(x \in G\). Define \(R = \sup\{r > 0 \mid B(x,r) \subset G\}\) and let \(D = \operatorname{dist}(\{x\}, \partial G)\). Under what conditions on \(X\) and \(G\) can we guarantee that \(D = R\)? Provide a counterexample if necess...
automath
[ 0.006711501162499189, 0.02840995602309704, -0.041382621973752975, -0.03435499966144562, 0.021568220108747482, -0.007352318149060011, -0.01997535675764084, 0.06128735840320587, 0.04587380588054657, -0.01773419789969921, 0.015402963384985924, 0.03180837631225586, -0.03942093998193741, -0.004...
0.821384
0.797857
0.023528
Given a set of vectors \( S = \{ \mathbf{u_1}, \mathbf{u_2}, \mathbf{u_3} \} \) in \( \mathbb{R}^3 \) defined as follows: \[ \mathbf{u_1} = (1, 0, 0), \quad \mathbf{u_2} = (0, 1, 0), \quad \mathbf{u_3} = (0, 0, 1) \] Determine if the set \( S \) is an orthogonal set. If it is, find the orthogonal complement of \( S \...
automath
[ 0.006698158569633961, 0.05338826775550842, -0.04009651392698288, -0.03964430093765259, 0.041932668536901474, -0.008409547619521618, 0.006294845603406429, 0.08526625484228134, 0.03947017714381218, -0.006551169324666262, 0.013876947574317455, 0.02601766400039196, -0.04170568287372589, -0.033...
0.818395
0.799913
0.018482
Given a closed set \( A \) in \( \mathbb{R}^2 \) defined as \( A = \{ (x, y) \in \mathbb{R}^2 : x^2 + y^2 \leq 1 \} \), what is the boundary of \( A \), and what can be said about its interior and closure?
automath
[ 0.02246658131480217, 0.03660798445343971, -0.038405317813158035, -0.026985706761479378, 0.03296961635351181, -0.017492735758423805, -0.0351046621799469, 0.0546964593231678, 0.04517682269215584, -0.011027690954506397, 0.007401472423225641, 0.03422613441944122, -0.041971355676651, -0.0084645...
0.815798
0.797649
0.018149
Let \( D \) be a positive integer such that \( D \equiv 1 \mod 4 \). Determine whether the subring \( \{ a + b \sqrt{D} \mid a, b \in \mathbb{Z} \} \) is properly contained in the subring \( \{ a + b \frac{1 + \sqrt{D}}{2} \mid a, b \in \mathbb{Z} \} \). If true, find an explicit example of an element from the larger r...
automath
[ 0.026382967829704285, 0.04602106288075447, -0.02588766999542713, -0.03467743471264839, 0.032285645604133606, -0.0070104822516441345, 0.005677064415067434, 0.048821624368429184, 0.05129389837384224, -0.001724555273540318, 0.007226696703583002, 0.019226599484682083, -0.019530318677425385, -0...
0.841839
0.811483
0.030356
Let \( A \) and \( B \) be \( n \times n \) real-valued symmetric positive semi-definite matrices where \( A = A_0 + tI \) for some small \( t > 0 \) and \( B = B_0 + \lambda I \) for some small \( \lambda > 0 \). If \( A_0 = \begin{pmatrix} 1 & 0 \\ 0 & 0 \end{pmatrix} \) and \( B_0 = \begin{pmatrix} 1 & 1 \\ 1 & 1 \e...
automath
[ 0.014906601049005985, 0.04299607127904892, -0.04235563054680824, -0.019741233438253403, 0.03159021586179733, -0.0028592045418918133, -0.02699703723192215, 0.06999565660953522, 0.03645188733935356, -0.01286381110548973, 0.0016231631161645055, 0.028007807210087776, -0.040285784751176834, -0....
0.811223
0.788875
0.022348
Given the utility function \( u(x_1, x_2) = x_1 + x_2 \) and the budget constraint \( 2\sqrt{x_1} + x_2 \leq y \) for some income \( y > 2 \), demonstrate whether the first-order conditions derived from the Lagrangian are sufficient for an interior solution in the consumer's utility maximization problem. Specifically, ...
automath
[ -0.005773168057203293, 0.03880475088953972, -0.035353899002075195, -0.03422879800200462, 0.019073747098445892, 0.012709857895970345, -0.024462584406137466, 0.07453258335590363, 0.011582672595977783, -0.009832566604018211, 0.004852882120758295, 0.008412245661020279, -0.021433917805552483, -...
0.814356
0.787376
0.026979
Given two \( n \times n \) matrices \( A \) and \( B \), under what conditions can we ensure that \( AB = BA \)? Specifically, if \( A \) is a nonsingular matrix, is it sufficient for \( B \) to be expressible as a polynomial in \( A \) (i.e., \( B = p(A) \) for some polynomial \( p(x) \)) to guarantee that \( A \) and...
automath
[ 0.02698950655758381, 0.02216603048145771, -0.04401203617453575, -0.021940605714917183, 0.024107538163661957, -0.022785045206546783, -0.006549539510160685, 0.05756399407982826, 0.021754734218120575, -0.011595571413636208, 0.004016455262899399, 0.02550206519663334, -0.011700786650180817, -0....
0.820564
0.797162
0.023401
Given the function \( h(x) = \sqrt{\sin(x^2) + 1} \), define functions \( f(x) \) and \( g(x) \) such that \( h(x) = f(g(x)) \), with the conditions that \( f(x) \neq x \) and \( g(x) \neq x \). Find another valid pair of functions \( f(x) \) and \( g(x) \) that satisfy these conditions. Additionally, for the functi...
automath
[ 0.0044776820577681065, 0.04103753715753555, -0.039430201053619385, -0.03659281134605408, 0.053714312613010406, -0.01588171161711216, -0.02267763391137123, 0.07226034998893738, 0.024685900658369064, -0.0014021041570231318, 0.007441145367920399, 0.0018879335839301348, -0.026913687586784363, ...
0.821185
0.794184
0.027001
In the construction involving a triangle, square, and pentagon with equal side length \( X \), if the line segment from point \( H \) to point \( A \) is such that the side of the square divides it in a golden ratio, what is the exact mathematical expression for the ratio of the segment lengths \( a \) to \( t \) in te...
automath
[ 0.005409773904830217, 0.020122280344367027, -0.05139755457639694, -0.052334096282720566, 0.02183256857097149, -0.01068656612187624, -0.02611290104687214, 0.07878315448760986, 0.03430783748626709, -0.015019796788692474, 0.010792434215545654, 0.03187940642237663, -0.021064147353172302, -0.00...
0.830743
0.813632
0.017111
Consider the labeling of the boolean lattice \( B_3 \) defined as follows: let \( f(\{1,2,3\})=x_1 \), \( f(\{1,2\})=x_2 \), \( f(\{1,3\})=x_3 \), \( f(\{2,3\})=x_4 \), \( f(\{1\})=x_5 \), \( f(\{2\})=x_6 \), \( f(\{3\})=x_7 \), and \( f(\emptyset)=1 \). Assuming that \( x_1, x_2, x_3, x_4, x_5, x_6, x_7 \) can take a...
automath
[ 0.025208493694663048, 0.026161206886172295, -0.035807784646749496, -0.0326496846973896, 0.02939661405980587, -0.014644719660282135, -0.01743793487548828, 0.07533837109804153, 0.03172512352466583, 0.004323725588619709, -0.0063704196363687515, 0.03623656928539276, -0.026547929272055626, -0.0...
0.833552
0.811716
0.021836
Let \( R_1 \) and \( R_2 \) be rings, and let \( \phi: R_1 \to R_2 \) be a ring homomorphism. If the kernel of \( \phi \) contains exactly 10 elements, what can be concluded about the ideal structure of \( R_1 \)? Specifically, what is the maximum possible number of distinct cosets of this ideal in \( R_1 \)?
automath
[ 0.03964158520102501, 0.033718835562467575, -0.0157359279692173, -0.011384660378098488, 0.017873935401439667, -0.02382238768041134, -0.008866277523338795, 0.06564965844154358, 0.03457258269190788, -0.04085899889469147, 0.007086239755153656, 0.014540135860443115, -0.044691987335681915, -0.01...
0.823494
0.802319
0.021175
Let \( m_1, m_2, \ldots, m_n \) be pairwise coprime positive integers. If \( k_1, k_2, \ldots, k_n \) are any integers, what is the smallest positive integer \( x \) that satisfies the system of congruences \( x \equiv k_i \pmod{m_i} \) for \( 1 \leq i \leq n \)? Express your answer in terms of \( m_1, m_2, \ldots, m_n...
automath
[ 0.023977363482117653, 0.025452731177210808, -0.03909330442547798, -0.04281693324446678, 0.0352347269654274, -0.02162611484527588, -0.008317496627569199, 0.05017711967229843, 0.04781932011246681, -0.011732343584299088, 0.0036015179939568043, 0.009444422088563442, -0.0214169230312109, -0.021...
0.838839
0.821472
0.017367
Consider a lacunary trigonometric series given by \[ S_N(x) = \sum_{k=1}^{N} \left( a_k \cos(2\pi n_k x) + b_k \sin(2\pi n_k x) \right), \] where the frequencies \( n_k \) satisfy the lacunarity condition \(\frac{n_{k+1}}{n_k} \geq \lambda > 1\) for all \( k \). If the coefficients \( a_k \) and \( b_k \) are such...
automath
[ -0.007496633566915989, 0.041333235800266266, -0.036923132836818695, -0.026665203273296356, 0.03598614037036896, 0.021220430731773376, -0.02819850668311119, 0.05392753332853317, 0.01703062653541565, 0.008173298090696335, 0.009089511819183826, 0.017440302297472954, -0.03601062670350075, 0.00...
0.828694
0.793721
0.034973
Consider the matrices \( A = \begin{bmatrix} 1 & 2 \\ 0 & 1 \end{bmatrix} \) and \( B = \begin{bmatrix} 1 & 0 \\ 0 & 1 \end{bmatrix} \). Both matrices have the same eigenvalue (which is 1) with algebraic multiplicity 2, but they differ in their eigenvector structures. 1. Can you determine whether these two matrices h...
automath
[ 0.027835505083203316, 0.02335515432059765, -0.02980317920446396, -0.03595071658492088, 0.04586852714419365, -0.006071706302464008, 0.0038813387509435415, 0.07144764065742493, 0.030598048120737076, -0.006689597852528095, 0.002925739623606205, -0.0011757711181417108, -0.050573352724313736, -...
0.794054
0.771437
0.022618
Is there a complete local analogue of the Artin-Tate lemma in which, given a complete Noetherian local ring \( (C, \mathfrak{m}) \), a ring \( A \) as a coefficient ring, and a ring \( B \) such that \( C \) is finite as a \( B \)-module, does it follow that \( B \) is \( (\mathfrak{m} \cap B) \)-adically complete?
automath
[ 0.05418884754180908, 0.033314190804958344, -0.04493829980492592, -0.032010793685913086, 0.03169730678200722, -0.032371800392866135, -0.0023203110322356224, 0.059773143380880356, 0.03514011204242706, -0.028800509870052338, 0.012386882677674294, 0.021502409130334854, -0.04633814096450806, -0...
0.810439
0.785159
0.025279
Let \( X \sim \text{Gamma}(k, \theta) \) with probability density function \( f_X(x) = \frac{1}{\theta^k \Gamma(k)} x^{k-1} e^{-x/\theta} I_{(0,\infty)}(x) \), where \( k > 0 \) and \( \theta > 0 \). If we define \( Y = \log(X) \), derive the probability density function \( f_Y(y) \) of the random variable \( Y \). Add...
automath
[ -0.0033877540845423937, 0.0386507622897625, -0.0355900377035141, -0.02726937271654606, 0.03573007881641388, -0.0033460066188126802, -0.01723916456103325, 0.05056891590356827, 0.027167679741978645, -0.004253716673702002, -0.008938836865127087, 0.025294609367847443, -0.010413974523544312, 0....
0.803076
0.78394
0.019136
Let \( \Sigma \) be a homotopy sphere and \( f: S^n \to \Sigma \) be a homotopy equivalence. Under what conditions does the statement \( f^{\ast} T \Sigma \cong T S^n \) imply that the exotic spheres cannot be distinguished by examining their tangent bundles? Also, how many different exotic smooth structures can exist ...
automath
[ 0.008161231875419617, 0.017463544383645058, -0.019613176584243774, -0.03482917323708534, 0.026142163202166557, -0.012281127274036407, -0.02587001770734787, 0.05847274139523506, 0.04625788703560829, 0.0015833600191399455, 0.0024495020043104887, 0.02796495147049427, -0.04081044718623161, -0....
0.80058
0.778186
0.022394
Given a symmetric matrix \( A \) of size \( n \times n \) with eigenvalues \( \lambda_1, \lambda_2, \ldots, \lambda_n \), what conditions must be satisfied for \( A \) to be positive definite, and how is the characteristic polynomial \( p(\lambda) = \det(A - \lambda I) \) related to these conditions? Specifically, if \...
automath
[ 0.0210874080657959, 0.019390206784009933, -0.04318172484636307, -0.03880589082837105, 0.03369125351309776, -0.02395496517419815, -0.01834561862051487, 0.05840524658560753, 0.029075760394334793, -0.009213468991219997, -0.007623852696269751, 0.024021202698349953, -0.03544257581233978, -0.022...
0.815312
0.79698
0.018332
Given a probability space $(\Omega, \mathscr{F}, \mathbb{P})$, let $\mathcal{G}$ be a countably generated $\sigma$-algebra such that for any event $A \in \mathcal{G}$, $\mathbb{P}(A) = 0$ or $\mathbb{P}(A) = 1$. Is it possible to construct a sequence of independent events $B_1, B_2, \ldots$ such that the tail $\sigma$-...
automath
[ 0.00671457638964057, 0.022255226969718933, -0.028075402602553368, -0.03715989366173744, 0.033255044370889664, -0.007328025996685028, -0.02307302877306938, 0.09026973694562912, 0.025048313662409782, -0.02176462858915329, 0.008721337653696537, 0.018576093018054962, -0.038184717297554016, -0....
0.827374
0.797369
0.030005
Let \( P(n) \) be a statement about natural numbers such that for every natural number \( n \), \( P(n) \) is either true or false. Define a set of axioms \( A \) that encompasses the axioms of Peano arithmetic. Determine whether it is possible to find a specific statement \( S \) such that \( S \) is true in the sta...
automath
[ 0.04675659164786339, 0.017194829881191254, -0.024099983274936676, -0.03749345988035202, 0.01957731880247593, -0.026117609813809395, -0.011170106939971447, 0.07016579806804657, 0.010715928860008717, -0.008054187521338463, 0.015997793525457382, 0.03004137985408306, -0.0382254496216774, -0.01...
0.833283
0.79988
0.033403
Given a positive integer \( n \), let \( \omega(n) \) denote the number of distinct prime divisors of \( n \). Based on Erdős’ conjecture, what is the probability that a randomly chosen positive integer \( n \) has at least two distinct divisors \( d \) and \( d' \) such that \( d < d' \leq 2d \)? Provide a justificati...
automath
[ 0.033207036554813385, 0.011744827963411808, -0.03398023173213005, -0.015292040072381496, 0.023887842893600464, -0.012547302059829235, -0.021552810445427895, 0.030849656090140343, 0.03424205258488655, 0.00630537373945117, -0.00887549202889204, 0.015033570118248463, -0.03721848130226135, -0....
0.83742
0.811508
0.025912
Given a symmetric, positive definite matrix \(\boldsymbol{\Sigma} \in \mathbb{R}^{d \times d}\) and a vector \(\boldsymbol{c} \in \mathbb{R}^d\), how many unique tuples \((\boldsymbol{w}, y)\) satisfy the constraints \[ y + \boldsymbol{c}^\top \boldsymbol{w} = 1 \] and \[ \|\boldsymbol{Q} \boldsymbol{w}\|_2^2 \leq...
automath
[ 0.010310397483408451, 0.0285309050232172, -0.05923052504658699, -0.03256227448582649, 0.03873133286833763, -0.00985697191208601, -0.02368946373462677, 0.06957895308732986, 0.038809679448604584, -0.012002472765743732, -0.01822318509221077, 0.028179271146655083, -0.031225455924868584, -0.016...
0.830903
0.809938
0.020965
Given a graph with \( N = 2^n \) vertices, where each vertex can be connected by an edge from \( i \) to \( i \oplus x \) for \( x \notin A \), can you determine an efficient algorithm to construct a spanning tree with \( N - 1 \) edges? Specifically, if \( n = 3 \) and \( A = \{1, 2\} \), how many edges can be created...
automath
[ 0.02037058398127556, 0.026109090074896812, -0.03060389868915081, -0.02131560631096363, 0.016983788460493088, -0.03707565739750862, -0.0150127112865448, 0.05917897820472717, 0.01805812492966652, -0.006674856413155794, 0.02285563386976719, 0.021228298544883728, -0.03745701536536217, -0.00595...
0.806513
0.786184
0.020329
Given non-negative coefficients \( c_i \) and \( \beta_i \) for \( i = 1, 2, \ldots, n \), consider the quadratic program \[ \min \sum_{i=1}^n c_i x_i + \sum_{i=1}^n \beta_i x_i^2 \] subject to \[ \sum_{i=1}^n x_i = 1 \] and \[ x_i \geq 0 \quad \forall i. \] If both \( c_i \) and \( \beta_i \) are strictly positi...
automath
[ -0.0022656768560409546, 0.020047644153237343, -0.07171283662319183, -0.025085367262363434, 0.03952727094292641, 0.0008811732404865324, -0.019745400175452232, 0.0702841505408287, 0.03162262216210365, -0.018317516893148422, -0.003999344538897276, 0.011414263397455215, -0.03442949801683426, -...
0.827613
0.801937
0.025676
Given a finitely presented group \( G = \langle a, b, c \mid \rangle \) and an endomorphism \( f \colon G \to G \) defined by \( f(a) = a^2 \), \( f(b) = a \), and \( f(c) = b \), can you determine whether \( f \) has any non-trivial fixed points within this group? If so, explain your reasoning.
automath
[ 0.026399750262498856, 0.027306439355015755, -0.023189958184957504, -0.05404682829976082, 0.02399151585996151, -0.051923468708992004, 0.013744058087468147, 0.06327225267887115, 0.022080423310399055, -0.008381321094930172, 0.010436722077429295, 0.01887843944132328, -0.03627799451351166, -0.0...
0.835972
0.814367
0.021605
Consider the sequence defined by \( x_1 = \cos(x) \) and \( x_{n+1} = \cos(x_n) \) for \( n \geq 1 \), where \( x > 0 \). Determine the following properties of the sequence \( (x_n) \): 1. Is the sequence bounded? 2. Is the sequence monotonic? 3. Does the sequence converge? 4. Is the sequence Cauchy? Provide a clear ...
automath
[ 0.022733978927135468, 0.04088133946061134, -0.03288856893777847, -0.02249392867088318, 0.02746068499982357, -0.013825849629938602, 0.0024180759210139513, 0.082791768014431, 0.03011734038591385, 0.006025874521583319, 0.01559436321258545, -0.00214967830106616, -0.033257078379392624, -0.00129...
0.816937
0.794566
0.022371
Let \( f \) be a real-valued function defined for all real numbers \( x \) such that the equation \[ f(x + 1) = \frac{1}{2} + \sqrt{f(x) - (f(x))^2} \] holds for all \( x \). Determine the period of the function \( f \) and find the smallest positive number \( b \) such that \( f(x + b) = f(x) \) for all \( x \). Pr...
automath
[ 0.024230601266026497, 0.03313680738210678, -0.050175800919532776, -0.045075029134750366, 0.04496407508850098, -0.03514205664396286, -0.009816153906285763, 0.07777528464794159, 0.03534811735153198, 0.0071241059340536594, 0.004902905784547329, 0.03835243731737137, -0.020468736067414284, -0.0...
0.838561
0.82156
0.017001
Given three circles \( C_1, C_2, C_3 \) in 3D space, defined by their centers \( P_1, P_2, P_3 \), radii \( r_1, r_2, r_3 \), and unit normal vectors \( N_1, N_2, N_3 \) to their respective planes, how many distinct planes can be found that are simultaneously tangent to all three circles, assuming the circles are in ge...
automath
[ 0.0011492125922814012, 0.041616424918174744, -0.04917636513710022, -0.02325448952615261, 0.04234372451901436, 0.012517592869699001, -0.03672385215759277, 0.027336200699210167, 0.022861270233988762, 0.00022760471620131284, -0.0016354601830244064, 0.019787710160017014, -0.04318771883845329, ...
0.836723
0.819926
0.016797
Consider the function \( f(x, y) = \frac{1}{(1 + x^2)(1 + y^2)} \) defined on \( \Omega = \mathbb{R} \times \mathbb{R} \) with the product measure \( \mu = \mu_1 \times \mu_2 \), where \( \mu_1 \) and \( \mu_2 \) are the Lebesgue measures on \( \mathbb{R} \). Using Fubini-Tonelli's theorem, compute the value of the i...
automath
[ 0.021970080211758614, 0.05529366806149483, -0.041181452572345734, -0.020456155762076378, 0.03524553030729294, 0.0004075800534337759, -0.0270350594073534, 0.0655689388513565, 0.039011333137750626, 0.0012566560180857778, 0.003256777534261346, 0.028971048071980476, -0.01780862733721733, -0.02...
0.817376
0.793069
0.024307